Dispel: Byzantine SMR with Distributed Pipelining

12/22/2019
by   Gauthier Voron, et al.
0

Byzantine State Machine Replication (SMR) is a long studied topic that received increasing attention recently with the advent of blockchains as companies are trying to scale them to hundreds of nodes. Byzantine SMRs try to increase throughput by either reducing the latency of consensus instances that they run sequentially or by reducing the number of replicas that send messages to others in order to reduce the network usage. Unfortunately, the former approach makes use of resources in burst whereas the latter requires CPU-intensive authentication mechanisms. In this paper, we propose a new Byzantine SMR called Dispel (Distributed Pipeline) that allows any node to distributively start new consensus instances whenever they detect sufficient resources locally. We evaluate the performance of Dispel within a single datacenter and across up to 380 machines over 3 continents by comparing it against four other SMRs. On 128 nodes, Dispel speeds up HotStuff, the Byzantine fault tolerant SMR being integrated within Facebook's blockchain, by more than 12 times. In addition, we also test Dispel under isolated and correlated failures and show that the Dispel distributed design is more robust than HotStuff. Finally, we evaluate Dispel in a cryptocurrency application with Bitcoin transactions and show that this SMR is not the bottleneck.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2018

Evaluating the Red Belly Blockchain

In this paper, we present the most extensive evaluation of blockchain sy...
research
02/16/2021

Brief Note: Fast Authenticated Byzantine Consensus

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

On the Performance of Pipelined HotStuff

HotStuff is a state-of-the-art Byzantine fault-tolerant consensus protoc...
research
06/19/2020

Stateless Distributed Ledgers

In public distributed ledger technologies (DLTs), such as Blockchains, n...
research
04/07/2022

Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of p...
research
07/21/2020

Blockchain Is Dead, Long Live Blockchain! Accountable State Machine Replication for Longlasting Blockchain

The long-standing impossibility of reaching agreement restricts the life...
research
03/25/2020

FastPay: High-Performance Byzantine Fault Tolerant Settlement

FastPay allows a set of distributed authorities, some of which are Byzan...

Please sign up or login with your details

Forgot password? Click here to reset