The next 700 BFT protocols

作者: Rachid Guerraoui , Nikola Knežević , Vivien Quéma , Marko Vukolić

DOI: 10.1145/1755913.1755950

关键词:

摘要: Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20,000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test prove. We present a new abstraction simplify these tasks. treat BFT protocol as composition instances our abstraction. Each instance is developed analyzed independently.To illustrate approach, we first show how can be used obtain the benefits state-of-the-art with much less pain. Namely, develop AZyzzyva, that mimics behavior Zyzzyva in best-case situations (for which was optimized) using than 24% actual Zyzzyva. To cover worst-case situations, enables use AZyzzyva any existing protocol, typically, classical one like PBFT has been tested proved correct.We then Aliph, outperforms previous both terms latency (by up 30%) throughput 360%). The development Aliph required two contains 25% needed protocols.

参考文章(44)
Francisco Brasileiro, Fabíola Greve, Achour Mostefaoui, Michel Raynal, Consensus in One Communication Step parallel computing technologies. pp. 42- 50 ,(2001) , 10.1007/3-540-44743-1_4
Fred B. Schneider, Robbert van Renesse, Chain replication for supporting high throughput and availability operating systems design and implementation. pp. 7- 7 ,(2004)
Leslie Lamport, Lower bounds for asynchronous consensus Lecture Notes in Computer Science. pp. 22- 23 ,(2003) , 10.1007/3-540-37795-6_4
Adam Wierman, Bianca Schroeder, Mor Harchol-Balter, Open versus closed: a cautionary tale networked systems design and implementation. pp. 18- 18 ,(2006) , 10.1184/R1/6608078.V1
Mike Dahlin, Edmund Wong, Allen Clement, Mirco Marchetti, Lorenzo Alvisi, Making Byzantine fault tolerant systems tolerate Byzantine faults networked systems design and implementation. pp. 153- 168 ,(2009)
Klaus Kursawe, Victor Shoup, Optimistic asynchronous atomic broadcast international colloquium on automata languages and programming. ,vol. 3580, pp. 204- 215 ,(2005) , 10.1007/11523468_17
Sam Toueg, Randomized Byzantine Agreements principles of distributed computing. pp. 163- 178 ,(1984) , 10.1145/800222.806744