Dissecting the Performance of Chained-BFT
Authors:
- 1 July 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 595-606
Abstract
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 blockchain (namely chained-BFT, or cBFT), has emerged for directly constructing blockchain protocols. Chained-BFT protocols have a unifying propose-vote scheme instead of multiple different voting phases with a set of voting and commit rules to guarantee safety and liveness. However, distinct voting and commit rules impose varying impacts on performance under different workloads, network conditions, and Byzantine attacks. Therefore, a fair comparison of the proposed protocols poses a challenge that has not yet been addressed by existing work. We fill this gap by studying a family of cBFT protocols with a two-pronged systematic approach. First, we present an evaluation and benchmarking framework, called Bamboo, for quick prototyping of cBFT protocols. To validate Bamboo, we introduce an analytic model using queuing theory which also offers a back-of-the-envelope guide for dissecting these protocols. We build multiple cBFT protocols using Bamboo and we are the first to fairly compare three cBFT representatives (i.e., HotStuff, two-chain HotStuff, and Streamlet). We evaluated these protocols under various parameters and scenarios, including two Byzantine attacks that have not been widely discussed in the literature. Our findings reveal interesting trade-offs (e.g., responsiveness vs. forking-resilience) between different cBFT protocols and their design choices, which provide developers and researchers with insights into the design and implementation of this protocol family.Keywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada (NSERC) (528125–2019)
This publication has 8 references indexed in Scilit:
- Dissecting the Performance of Strongly-Consistent Replication Protocols2019
- Performance Benchmarking and Optimizing Hyperledger Fabric Blockchain Platform2018
- BLOCKBENCH2017
- Prime: Byzantine Replication under AttackIEEE Transactions on Dependable and Secure Computing, 2010
- Benchmarking cloud serving systems with YCSB2010
- Byzantine Fault Detectors for Solving ConsensusThe Computer Journal, 2003
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Tables of Expected Values of Order Statistics and Products of Order Statistics for Samples of Size Twenty and Less from the Normal DistributionThe Annals of Mathematical Statistics, 1956