DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks

10/08/2021
by   Lei Yang, et al.
0

The success of blockchains has sparked interest in large-scale deployments of Byzantine fault tolerant (BFT) consensus protocols over wide area networks. A central feature of such networks is variable communication bandwidth across nodes and across time. We present DispersedLedger, an asynchronous BFT protocol that provides near-optimal throughput in the presence of such variable network bandwidth. The core idea of DispersedLedger is to enable nodes to propose, order, and agree on blocks of transactions without having to download their full content. By enabling nodes to agree on an ordered log of blocks, with a guarantee that each block is available within the network and unmalleable, DispersedLedger decouples bandwidth-intensive block downloads at different nodes, allowing each to make progress at its own pace. We build a full system prototype and evaluate it on real-world and emulated networks. Our results on a geo-distributed wide-area deployment across the Internet shows that DispersedLedger achieves 2x better throughput and 74 compared to HoneyBadger, the state-of-the-art asynchronous protocol.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2021

BigBFT: A Multileader Byzantine Fault Tolerance Protocol for High Throughput

This paper describes BigBFT, a multi-leader Byzantine fault tolerance pr...
research
06/13/2019

Mir-BFT: High-Throughput BFT for Blockchains

This paper presents Mir-BFT (or, simply, Mir), a robust asynchronous Byz...
research
10/20/2022

Proof of Backhaul: Trustfree Measurement of Broadband Bandwidth

Recent years have seen the emergence of decentralized wireless networks ...
research
04/15/2020

Fair and Efficient Gossip in Hyperledger Fabric

Permissioned blockchains are supported by identified but individually un...
research
11/24/2021

Securing Proof-of-Stake Nakamoto Consensus Under Bandwidth Constraint

Satoshi Nakamoto's Proof-of-Work (PoW) longest chain (LC) protocol was a...
research
01/09/2019

On the Limits of Byzantine-tolerant Spanning Tree Construction in Route-Restricted Overlay Networks

Route-restricted overlays are peer-to-peer networks where each node can ...
research
06/21/2019

Scalable and Probabilistic Leaderless BFT Consensus through Metastability

This paper introduces a family of leaderless Byzantine fault tolerance p...

Please sign up or login with your details

Forgot password? Click here to reset