Byzantine fault tolerance can be fast

Download: pdf.

“Byzantine fault tolerance can be fast” by Miguel Castro and Barbara Liskov. In International Conference on Dependable Systems and Networks (DSN), (Goteborg, Sweden), July 2001, pp. 513-518.

Abstract

Byzantine Fault Tolerance is important because it can be used to implement highly-available systems that tolerate arbitrary behavior from faulty components. This paper presents a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asynchronous systems. Our results contradict the common belief that Byzantine fault tolerance is too slow to be used in practice-BFT performs well so that it can be used to implement real systems. We implemented a replicated NFS file system using BFT that performs 2% faster to 24% slower than production implementations of the NFS protocols that are not fault-tolerant

Download: pdf.

BibTeX entry:

@inproceedings{castro01byzantine,
   author = {Miguel Castro and Barbara Liskov},
   title = {Byzantine fault tolerance can be fast},
   booktitle = {International Conference on Dependable Systems and
	Networks (DSN)},
   pages = {513--518},
   address = {Goteborg, Sweden},
   month = jul,
   year = {2001}
}