loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Conference on Dependable Systems and Networks (DSN'04)
High Throughput Byzantine Fault Tolerance
Florence, Italy
June 28-July 01
ISBN: 0-7695-2052-9
Ramakrishna Kotla, The University of Texas at Austin
Mike Dahlin, The University of Texas at Austin
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.
Citation:
Ramakrishna Kotla, Mike Dahlin, "High Throughput Byzantine Fault Tolerance," dsn, pp.575, 2004 International Conference on Dependable Systems and Networks (DSN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.