BeauForT: Robust Byzantine Fault Tolerance for Client-Centric Mobile Web Applications

Jannes, Kristof; Beni, Emad Heydari; Lagaisse, Bert; Joosen, Wouter

doi:10.1109/tpds.2023.3241963

Cited by 5 publications

(3 citation statements)

References 62 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Not relying on a leader means that a lot of the cost of leader election and change can be saved. BeauForT uses an aggregated signature scheme called BLS [115] to reduce storage and bandwidth requirements while also reducing computational costs [106]. The algorithm is robust to smaller-scale networks, where it can cope well with the effects of short-term outages and outages caused by mobility.…”

Section: Other Consensus Algorithmsmentioning

confidence: 99%

Byzantine Fault-Tolerant Consensus Algorithms: A Survey

Zhong,

Yang,

Liang

et al. 2023

Electronics

View full text Add to dashboard Cite

The emergence of numerous consensus algorithms for distributed systems has resulted from the swift advancement of blockchain and its related technologies. Consensus algorithms play a key role in decentralized distributed systems, because all nodes in the system need to reach a consensus on requests or commands through consensus algorithms. In a distributed system where nodes work together to reach consensus, there may be Byzantine nodes present. The emergence of Byzantine nodes will affect the consensus of nodes in the distributed system. Therefore, tolerating Byzantine nodes in a distributed system and then reaching a consensus is an essential function of a consensus algorithm. So far, many Byzantine fault-tolerant (BFT) consensus algorithms have emerged, and there are correspondingly many methods to improve the performance of these algorithms. In order to allow researchers to have a clearer understanding of the existing methods, this paper systematically investigated and studied the research progress of the current Byzantine fault-tolerant consensus algorithm. The scope of the research ranged from the classic Byzantine consensus algorithm to some of the latest Byzantine consensus algorithms. The articles were classified according to the methods used to improve the Byzantine consensus algorithm. Through classification and centralized analysis and discussion, we achieved a clearer understanding of the development of Byzantine consensus algorithms and, at the same time, clarified the advantages and disadvantages of this type of method and the latest research progress using this method. At the end of this article, an in-depth discussion and analysis is also presented. By analyzing the impact of the use of these methods on the performance of the BFT consensus algorithm, it is proposed that future research can be improved.

show abstract

Section: Other Consensus Algorithmsmentioning

confidence: 99%

Byzantine Fault-Tolerant Consensus Algorithms: A Survey

Zhong,

Yang,

Liang

et al. 2023

Electronics

View full text Add to dashboard Cite

show abstract

“…The rationale for this is that signaling is assumed to be left up to the developer, giving application providers the freedom to design their protocol based on a new use case or one of the established protocols (such as Socket.io, Session Initiation Protocol (SIP). to design their protocol; or for an innovative application [7]. Most importantly, to minimize incompatibility with legacy technology and prevent duplication.…”

Section: Introductionmentioning

confidence: 99%

Applying Software Engineering Based on Peer to Peer ‎‎Communication

Salim

2024

TURCOMAT

View full text Add to dashboard Cite

The JavaScript programming language was selected to create software creation that facilitates the creation of a video connection between users because it enables the creation of cross-platform apps relatively quickly. For example, “Web Real-Time Communication (WebRTC)” standards do not specify exactly how two browsers initiate and manage communication with one another. The reason for this is that WebRTC does not specify the signaling technique or protocol. This paper's main goal is to design and construct a WebRTC simultaneous video conference between peers utilizing Google Chrome and the Socket.io signaling technology. A Local Area Network was used in this experiment (LAN). Furthermore, an assessment was conducted on the quality of experience (QoE), the Socket.io signaling method, and resources, including bandwidth consumption. This paper describes the simultaneous execution of peer-to-peer video calls with user identification (user-id).

show abstract

“…Despite the known vulnerabilities, prevailing coordinator election algorithms largely presuppose the reliability of entities, which leads to notable challenges [12,13]. Faults and failures within the election algorithm can significantly impact both communication and computation costs [14,15].…”

Section: Introductionmentioning

confidence: 99%

A Robust, Preference-Based Coordinator Election Algorithm for Distributed Systems

Supase,

Pansare

2023

ISI

View full text Add to dashboard Cite

In peer-to-peer distributed systems, the selection of a reliable coordinator is a pivotal process, often vulnerable to node failure and communication link failure. Herein, we present an innovative Fault-Tolerant Coordinator Election Algorithm (FTCEA) designed to address these issues, specifically crafted to withstand node failures in peer-to-peer distributed systems. Our algorithm distinguishes itself by capitalizing on a unique preference-based method, which incorporates significant nodal attributes into the election process. This integration of nodal attributes contributes to the election of a durable and reliable coordinator, significantly enhancing the robustness of the system. A comprehensive analysis was conducted to measure FTCEA's communication complexity, execution time, and space complexity using a peer-to-peer distributed application. The results demonstrated that FTCEA successfully identifies a coordinator node with a communication cost of O(n) messages and a space complexity linear to the number of attributes, represented as O(n.m). Remarkably, FTCEA demonstrated an approximately 50.10% improvement in communication cost compared to the enhanced Bully algorithm, a widely utilized method in this domain. Moreover, FTCEA can maintain a linear storage cost of O(n), thereby significantly improving the computation cost. In summary, FTCEA offers a scalable and efficient solution for coordinator election in distributed systems, showing promising potential for practical applications in the field. The algorithm's unique design, robustness, and efficiency make it a valuable contribution to the advancement of peer-to-peer distributed systems.

show abstract

BeauForT: Robust Byzantine Fault Tolerance for Client-Centric Mobile Web Applications

Cited by 5 publications

References 62 publications

Byzantine Fault-Tolerant Consensus Algorithms: A Survey

Byzantine Fault-Tolerant Consensus Algorithms: A Survey

Applying Software Engineering Based on Peer to Peer ‎‎Communication

A Robust, Preference-Based Coordinator Election Algorithm for Distributed Systems

Contact Info

Product

Resources

About