High throughput Byzantine fault tolerance
- 1 January 2004
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in International Conference on Dependable Systems and Networks, 2004
- p. 575-584
- https://doi.org/10.1109/dsn.2004.1311928
Abstract
This paper argues for a simple change to Byzantine fault tolerant (BFT) state machine replication libraries. Traditional BFT state machine replication techniques provide high availability and security but fail to provide high throughput. This limitation stems from the fundamental assumption of generalized state machine replication techniques that all replicas execute requests sequentially in the same total order to ensure consistency across replicas. We propose a high throughput Byzantine fault tolerant architecture that uses application-specific information to identify and concurrently execute independent requests. Our architecture thus provides a general way to exploit application parallelism in order to provide high throughput without compromising correctness. Although this approach is extremely simple, it yields dramatic practical benefits. When sufficient application concurrency and hardware resources exist, CBASE, our system prototype, provides orders of magnitude improvements in throughput over BASE, a traditional BFT architecture. CBASE-FS, a Byzantine fault tolerant file system that uses CBASE, achieves twice the throughput of BASE-FS for the IOZone micro-benchmarks even in a configuration with modest available hardware parallelism.Keywords
This publication has 9 references indexed in Scilit:
- Separating agreement from execution for byzantine fault tolerant servicesPublished by Association for Computing Machinery (ACM) ,2003
- FarsitePublished by Association for Computing Machinery (ACM) ,2002
- SEDAPublished by Association for Computing Machinery (ACM) ,2001
- BASEPublished by Association for Computing Machinery (ACM) ,2001
- The part-time parliamentACM Transactions on Computer Systems, 1998
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 RoundsSIAM Journal on Computing, 1998
- Replication in the harp file systemPublished by Association for Computing Machinery (ACM) ,1991
- Implementing fault-tolerant services using the state machine approach: a tutorialACM Computing Surveys, 1990
- Scale and performance in a distributed file systemACM Transactions on Computer Systems, 1988