ezBFT: Decentralizing Byzantine Fault-Tolerant State Machine Replication

04/12/2019
by   Balaji Arun, et al.
0

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 replica, and instead, enabling every replica to order the requests that it receives from clients; (ii) using only three communication steps to order requests in the common case; and (iii) involving clients actively in the consensus process. In addition, ezBFT minimizes the potentially negative effect of a byzantine replica on the overall system performance. We developed ezBFT's formal specification in TLA+, show that it provides the classic properties of BFT protocols including consistency, stability, and liveness, and developed an implementation. Our experimental evaluation reveals that ezBFT improves client-side latency by as much as 40 byzantine fault-tolerant protocols including PBFT, FaB, and Zyzzyva.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/14/2021

Egalitarian Byzantine Fault Tolerance

Minimizing end-to-end latency in geo-replicated systems usually makes it...
research
05/16/2023

Raft-Forensics: High Performance CFT Consensus with Accountability for Byzantine Faults

Crash fault tolerant (CFT) consensus algorithms are commonly used in sce...
research
02/16/2021

Brief Note: Fast Authenticated Byzantine Consensus

Byzantine fault-tolerant (BFT) state machine replication (SMR) has been ...
research
01/12/2021

Towards a Performance Model for Byzantine Fault Tolerant (Storage) Services

Byzantine fault-tolerant systems have been researched for more than four...
research
09/29/2021

Byz-GentleRain: An Efficient Byzantine-tolerant Causal Consistency Protocol

Causal consistency is a widely used weak consistency model that allows h...
research
02/14/2022

Liveness and Latency of Byzantine State-Machine Replication

Byzantine state-machine replication (SMR) ensures the consistency of rep...
research
07/23/2021

Making Reads in BFT State Machine Replication Fast, Linearizable, and Live

Practical Byzantine Fault Tolerance (PBFT) is a seminal state machine re...

Please sign up or login with your details

Forgot password? Click here to reset