Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers

Guanfeng Liang, Benjamin Sommer, Nitin Vaidya
2012 2012 Proceedings IEEE INFOCOM  
In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solution from Pease, Shostak, and Lamport [1]; (2) Digest: A simplified version of the seminal practical BFT protocol PBFT by Castro and Liskov [2]; and (3) NCBA: a network coding based BFT protocol that we propose in this paper. Unlike existing practical BFT protocols such as PBFT, which utilize collision-resistant hash functions
more » ... reduce traffic load for BFT, NCBA uses a computationally efficient error-detection network coding scheme. Since NCBA does not rely on any hash function, it is always correct rather than correct only with high probability as PBFT. Moreover, even though NCBA introduces 50% more communication cost than PBFT does, it is compensated by reducing the computational cost of hashing. Through extensive experiments, we verified that NCBA performs at least as well as Digest, without relying on any cryptographic assumption on the hardness of breaking the hash function. To the best of our knowledge, this is the first implementation of BFT with network coding.
doi:10.1109/infcom.2012.6195507 dblp:conf/infocom/LiangSV12 fatcat:d6vqqogidbbo7dk7ybvgbaygj4