English
Related papers

Related papers: Recipe: Hardware-Accelerated Replication Protocols

200 papers

Despite years of intensive research, Byzantine fault-tolerant (BFT) systems have not yet been adopted in practice. This is due to additional cost of BFT in terms of resources, protocol complexity and performance, compared with crash…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-09 Shengyun Liu , Paolo Viotti , Christian Cachin , Vivien Quéma , Marko Vukolić

Mission critical systems deployed in data centers today are facing more sophisticated failures. Byzantine fault tolerant (BFT) protocols are capable of masking these types of failures, but are rarely deployed due to their performance cost…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-25 Guangda Sun , Xin Zhe Khooi , Yunfan Li , Mingliang Jiang , Jialin Li

The surging interest in blockchain technology has revitalized the search for effective Byzantine consensus schemes. In particular, the blockchain community has been looking for ways to effectively integrate traditional Byzantine…

Cryptography and Security · Computer Science 2018-11-15 Jian Liu , Wenting Li , Ghassan O. Karame , N. Asokan

Byzantine Fault-Tolerant (BFT) protocols have recently been extensively used by decentralized data management systems with non-trustworthy infrastructures, e.g., permissioned blockchains. BFT protocols cover a broad spectrum of design…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-08-05 Mohammad Javad Amiri , Chenyuan Wu , Divyakant Agrawal , Amr El Abbadi , Boon Thau Loo , Mohammad Sadoghi

The rapid evolution of Internet of Things (IoT) environments has created an urgent need for secure and trustworthy distributed computing systems, particularly when dealing with heterogeneous devices and applications where centralized trust…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-02 Murtaza Rangwala , Rajkumar Buyya

Docker container virtualization technology is being widely adopted in cloud computing environments because of its lightweight and effiency. However, it requires adequate control and management via an orchestrator. As a result, cloud…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-14 Gor Mack Diouf , Halima Elbiaze , Wael Jaafar

Several research projects have shown that Byzantine fault tolerance (BFT) is practical today in terms of performance. Deficiencies in other aspects might still be an obstacle to a more wide-spread deployment in real-world applications. One…

Cryptography and Security · Computer Science 2012-04-12 Benedikt Höfling , Hans P. Reiser

Distributed Software Defined Networking (SDN) controllers aim to solve the issue of single-point-of-failure and improve the scalability of the control plane. Byzantine and faulty controllers, however, may enforce incorrect configurations…

Networking and Internet Architecture · Computer Science 2019-02-25 Ermin Sakic , Wolfgang Kellerer

Permissioned blockchains employ Byzantine fault-tolerant (BFT) state machine replication (SMR) to reach agreement on an ever-growing, linearly ordered log of transactions. A new paradigm, combined with decades of research in BFT SMR and…

Cryptography and Security · Computer Science 2021-03-02 Fangyu Gai , Ali Farahbakhsh , Jianyu Niu , Chen Feng , Ivan Beschastnikh , Hao Duan

With the advancement of blockchain technology, chained Byzantine Fault Tolerant (BFT) protocols have been increasingly adopted in practical systems, making their performance a crucial aspect of the study. In this paper, we introduce a…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-01-08 Yining Tang , Qihang Luo , Runchao Han , Jianyu Niu , Chen Feng , Yinqian Zhang

Byzantine consensus is a critical component in many permissioned Blockchains and distributed ledgers. We propose a new paradigm for designing BFT protocols called DQBFT that addresses three major performance and scalability challenges that…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-01 Balaji Arun , Binoy Ravindran

State-of-the-art asynchronous Byzantine fault-tolerant (BFT) protocols, such as HoneyBadgerBFT, BEAT, and Dumbo, have shown a performance comparable to partially synchronous BFT protocols. This paper studies two practical directions in…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-24 Chao Liu , Sisi Duan , Haibin Zhang

Crash fault tolerant (CFT) consensus algorithms are commonly used in scenarios where system components are trusted -- e.g., enterprise settings and government infrastructure. However, CFT consensus can be broken by even a single corrupt…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-04 Weizhao Tang , Peiyao Sheng , Ronghao Ni , Pronoy Roy , Xuechao Wang , Giulia Fanti , Pramod Viswanath

Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and is replaced after a timeout. Recently, we witnessed a surge…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-07 Afonso Oliveira , Henrique Moniz , Rodrigo Rodrigues

We present ezBFT, a novel leaderless, distributed consensus protocol capable of tolerating byzantine faults. ezBFT's main goal is to minimize the client-side latency in WAN deployments. It achieves this by (i) having no designated primary…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-15 Balaji Arun , Sebastiano Peluso , Binoy Ravindran

Byzantine fault tolerance (BFT) has been extensively studied in distributed trustless systems to guarantee system's functioning when up to 1/3 Byzantine processes exist. Despite a plethora of previous work in BFT systems, they are mainly…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-11 Quan Nguyen , Andre Cronje

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates $f$ Byzantine faults in an asynchronous…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-09-14 Ittai Abraham , Srinivas Devadas , Danny Dolev , Kartik Nayak , Ling Ren

The popularization of blockchains leads to a resurgence of interest in Byzantine Fault-Tolerant (BFT) state machine replication protocols. However, much of the work on this topic focuses on the underlying consensus protocols, with emphasis…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-01 Alysson Bessani , Eduardo Alchieri , João Sousa , André Oliveira , Fernando Pedone

Practical Byzantine Fault Tolerance (PBFT) is a seminal state machine replication protocol that achieves a performance comparable to non-replicated systems in realistic environments. A reason for such high performance is the set of…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-26 Christian Berger , Hans P. Reiser , Alysson Bessani

In this paper, we present a Byzantine fault tolerant distributed commit protocol for transactions running over untrusted networks. The traditional two-phase commit protocol is enhanced by replicating the coordinator and by running a…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-17 Wenbing Zhao