English
Related papers

Related papers: Banyan: Fast Rotating Leader BFT

200 papers

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

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

Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the presence of malicious replicas and lies at the heart of the modern blockchain technology. Byzantine SMR protocols often guarantee safety under all…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-06 Manuel Bravo , Gregory Chockler , Alexey Gotsman

Byzantine fault-tolerant (BFT) web services provide critical integrity guarantees for distributed applications but face significant latency challenges that hinder interactive user experiences. We propose a novel two-layer architecture that…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-07-14 Ahmad Zaki Akmal , Azkario Rizky Pratama , Guntur Dharma Putra

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

At PODC 2014, A. Most\'efaoui, H. Moumen, and M. Raynal presented a new and simple randomized signature-free binary consensus algorithm (denoted here MMR) that copes with the net effect of asynchrony Byzantine behaviors. Assuming message…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-24 Chryssis Georgiou , Ioannis Marcoullis , Michel Raynal , Elad Michael Schiller

We propose a new protocol for the generalized consensus problem in asynchronous systems subject to Byzantine server failures. The protocol solves the consensus problem in a setting in which information about conflict between transactions is…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-05-29 Rida Bazzi , Maurice Herlihy

Byzantine Fault Tolerant (BFT) consensus protocols for dynamically available systems face a critical challenge: balancing latency and security in fluctuating node participation. Existing solutions often require multiple rounds of voting per…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-04 Pengkun Ren , Hai Dong , Zahir Tari , Pengcheng Zhang

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

Asynchronous Byzantine Fault Tolerant (BFT) consensus protocols have garnered significant attention with the rise of blockchain technology. A typical asynchronous protocol is designed by executing sequential instances of the Asynchronous…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-18 Xiaohai Dai , Chaozheng Ding , Wei Li , Jiang Xiao , Bolin Zhang , Chen Yu , Albert Y. Zomaya , Hai Jin

In this paper, we present BunchBFT Byzantine fault-tolerant state-machine replication for high performance and scalability. At the heart of BunchBFT is a novel design called the cluster-based approach that divides the replicas into clusters…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-24 Salem Alqahtani , Murat Demirbas

The private chain-based Internet of Things (IoT) system ensures the security of cross-organizational data sharing. As a widely used consensus model in private chains, the leader-based state-machine replication (SMR) model meets the…

Networking and Internet Architecture · Computer Science 2021-09-21 Dongjie Zhu , Haiwen Du , Yundong Sun , Zhaoshuo Tian

Recent Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols increasingly focus on scalability to meet the requirements of distributed ledger technology (DLT). Validating the performance of scalable BFT protocol…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-10-02 Christian Berger , Sadok Ben Toumia , Hans P. Reiser

Multi-Byzantine Fault Tolerant (Multi-BFT) consensus allows multiple consensus instances to run in parallel, resolving the leader bottleneck problem inherent in classic BFT consensus. However, the global ordering of Multi-BFT consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-04 Hanzheng Lyu , Shaokang Xie , Jianyu Niu , Ivan Beschastnikh , Yinqian Zhang , Mohammad Sadoghi , Chen Feng

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

The ability to perform repeated Byzantine agreement lies at the heart of important applications such as blockchain price oracles or replicated state machines. Any such protocol requires the following properties: (1) \textit{Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-06-17 Shlomi Dolev , Amit Hendin , Maurice Herlihy , Maria Potop Butucaru , Elad Michael Schiller

This paper presents LinSBFT, a Byzantine Fault Tolerance (BFT) protocol with the capacity of processing over 2000 smart contract transactions per second in production. LinSBFT applies to a permissionless, public blockchain system, in which…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-16 Xiaodong Qi , Yin Yang , Zhao Zhang , Cheqing Jin , Aoying Zhou

In this work, we propose Ocior, a practical asynchronous Byzantine fault-tolerant (BFT) consensus protocol that achieves the optimal performance in resilience, communication, computation, and round complexity. Unlike traditional BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-11 Jinyuan Chen

Byzantine fault tolerant protocols enable state replication in the presence of crashed, malfunctioning, or actively malicious processes. Designing such protocols without the assistance of verification tools, however, is remarkably…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-23 Joel Wanner , Laurent Chuat , Adrian Perrig