English
Related papers

Related papers: Automatic Integration of BFT State-Machine Replica…

200 papers

Traditionally, Byzantine fault tolerance (BFT) in geo-replicated systems is achieved by executing complex agreement protocols over large-distance communication links, and therefore typically incurs high response times. In this paper we…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-07-12 Michael Eischer , Tobias Distler

Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for over 30 years. Recently it has received more attention due to its application in permissioned blockchain systems. A sequence of research efforts focuses on…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-03 Ittai Abraham , Kartik Nayak , Ling Ren , Zhuolun Xiang

Byzantine fault-tolerant agreement (BFT) in a partially synchronous system usually requires 3f + 1 nodes to tolerate f faulty replicas. Due to their high throughput and finality property BFT algorithms build the core of recent permissioned…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-26 Ines Messadi , Markus Horst Becker , Kai Bleeke , Leander Jehl , Sonia Ben Mokhtar , Rüdiger Kapitza

This paper presents BFTBrain, a reinforcement learning (RL) based Byzantine fault-tolerant (BFT) system that provides significant operational benefits: a plug-and-play system suitable for a broad set of hardware and network configurations,…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-14 Chenyuan Wu , Haoyun Qin , Mohammad Javad Amiri , Boon Thau Loo , Dahlia Malkhi , Ryan Marcus

Byzantine Fault Tolerance (BFT) is one of the most challenging problems in Distributed Machine Learning (DML), defined as the resilience of a fault-tolerant system in the presence of malicious components. Byzantine failures are still…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-12-06 Djamila Bouhata , Hamouma Moumen , Jocelyn Ahmed Mazari , Ahcène Bounceur

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

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

Byzantine Fault-Tolerant (BFT) protocols have been proposed to tolerate malicious behaviors in state machine replications. With classic BFT protocols, the total number of replicas is known and fixed a priori. The resilience of BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-06-12 Jiangshan Yu

Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. BFT systems provide safety and liveness guarantees with reasonable…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-10-24 Nikos Chondros , Konstantinos Kokordelis , Mema Roussopoulos

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

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

In this paper, we present Raptr--a Byzantine fault-tolerant state machine replication (BFT SMR) protocol that combines strong robustness with high throughput, while attaining near-optimal theoretical latency. Raptr delivers exceptionally…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-30 Andrei Tonkikh , Balaji Arun , Zhuolun Xiang , Zekun Li , Alexander Spiegelman

We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed applications…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-04 Romaric Duvignau , Michel Raynal , Elad Michael Schiller

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

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness guarantees for distributed systems that must operate in the presence of arbitrary failures. Recently, numerous new BFT algorithms have been…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-06 Gengrui Zhang , Fei Pan , Yunhao Mao , Sofia Tijanic , Michael Dang'ana , Shashank Motepalli , Shiquan Zhang , Hans-Arno Jacobsen

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

Current approaches to tackle the single point of failure in SDN entail a distributed operation of SDN controller instances. Their state synchronization process is reliant on the assumption of a correct decision-making in the controllers.…

Networking and Internet Architecture · Computer Science 2019-02-08 Ermin Sakic , Nemanja Ðerić , Wolfgang Kellerer

We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-machine replication protocol for the partially synchronous model with theoretical performance bounds during synchrony. By allowing all replicas to act as leaders and…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-11 Zeta Avarikioti , Lioba Heimbach , Roland Schmid , Laurent Vanbever , Roger Wattenhofer , Patrick Wintermeyer

SBFT is a state of the art Byzantine fault tolerant permissioned blockchain system that addresses the challenges of scalability, decentralization and world-scale geo-replication. SBFTis optimized for decentralization and can easily handle…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-01-03 Guy Golan Gueta , Ittai Abraham , Shelly Grossman , Dahlia Malkhi , Benny Pinkas , Michael K. Reiter , Dragos-Adrian Seredinschi , Orr Tamir , Alin Tomescu