High Throughput Byzantine Fault Tolerance

  • Authors:
  • Ramakrishna Kotla;Mike Dahlin

  • Affiliations:
  • The University of Texas at Austin;The University of Texas at Austin

  • Venue:
  • DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper argues for a simple change to Byzantine FaultTolerant (BFT) state machine replication libraries. TraditionalBFT state machine replication techniques providehigh availability and security but fail to provide highthroughput. This limitation stems from the fundamentalassumption of generalized state machine replicationtechniques that all replicas execute requests sequentiallyin the same total order to ensure consistency acrossreplicas. We propose a high throughput Byzantine fault tolerantarchitecture that uses application-specific informationto identify and concurrently execute independentrequests. Our architecture thus provides a generalway to exploit application parallelism in order toprovide high throughput without compromising correctness.Although this approach is extremely simple, it yieldsdramatic practical benefits. When sufficient applicationconcurrency and hardware resources exist, CBASE,our system prototype, provides orders of magnitude improvementsin throughput over BASE, a traditional BFTarchitecture. CBASE-FS, a Byzantine fault tolerant file systemthat uses CBASE, achieves twice the throughput ofBASE-FS for the IOZone micro-benchmarks even in a configurationwith modest available hardware parallelism.