This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Byzantine Fault-Tolerance
Jan. 2013 (vol. 62 no. 1)
pp. 16-30
Giuliana Santos Veronese, Stefanini IT Solutions, Mexico
Miguel Correia, INESC-ID and Univ. Lisboa Faculty of Sciences, Lisboa
Alysson Neves Bessani, University of Lisboa, Lisboa
Lau Cheuk Lung, Univ. Federal de Santa Catarina
Paulo Verissimo, University of Lisboa, Lisboa
We present two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous algorithms in terms of several metrics. First, they require only 2f+1 replicas, instead of the usual 3f+1. Second, the trusted service in which this reduction of replicas is based is quite simple, making a verified implementation straightforward (and even feasible using commercial trusted hardware). Third, in nice executions the two algorithms run in the minimum number of communication steps for nonspeculative and speculative algorithms, respectively, four and three steps. Besides the obvious benefits in terms of cost, resilience and management complexity—fewer replicas to tolerate a certain number of faults—our algorithms are simpler than previous ones, being closer to crash fault-tolerant replication algorithms. The performance evaluation shows that, even with the trusted component access overhead, they can have better throughput than Castro and Liskov's PBFT, and better latency in networks with nonnegligible communication delays.
Index Terms:
Servers,Radiation detectors,Fault tolerance,Fault tolerant systems,Delay,Hardware,trusted components,Byzantine fault-tolerance,intrusion tolerance,state machine replication,distributed systems
Citation:
Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung, Paulo Verissimo, "Efficient Byzantine Fault-Tolerance," IEEE Transactions on Computers, vol. 62, no. 1, pp. 16-30, Jan. 2013, doi:10.1109/TC.2011.221
Usage of this product signifies your acceptance of the Terms of Use.