The Next 700 BFT Protocols

被引:89
作者
Aublin, Pierre-Louis [1 ]
Guerraoui, Rachid [2 ]
Knezevic, Nikola [3 ]
Quema, Vivien [4 ]
Vukolic, Marko [5 ]
机构
[1] INSA Lyon, F-69621 Villeurbanne, France
[2] Ecole Polytech Fed Lausanne, LPD, Stn 14, CH-1015 Lausanne, Switzerland
[3] IBM Res Zurich, CH-8803 Ruschlikon, Switzerland
[4] Grenoble INP, ENSIMAG, F-38400 St Martin Dheres, France
[5] Eurecom, Biot, France
来源
ACM TRANSACTIONS ON COMPUTER SYSTEMS | 2015年 / 32卷 / 04期
关键词
Abstract; Byzantine fault tolerance; composability; optimization robustness; FAULT-TOLERANCE;
D O I
10.1145/2658994
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike traditional state machines, allowed to abort executing a client's request if "something goes wrong." Abstract can be used to considerably simplify the incremental development of efficient Byzantine faulttolerant state machine replication (BFT) protocols that are notorious for being difficult to develop. In short, we treat a BFT protocol as a composition of Abstract instances. Each instance is developed and analyzed independently and optimized for specific system conditions. We illustrate the power of Abstract through several interesting examples. We first show how Abstract can yield benefits of a state-of-the-art BFT protocol in a less painful and errorprone manner. Namely, we develop AZyzzyva, a new protocol that mimics the celebrated best-case behavior of Zyzzyva using less than 35% of the Zyzzyva code. To cover worst-case situations, our abstraction enables one to use in AZyzzyva any existing BFT protocol. We then present Aliph, a new BFT protocol that outperforms previous BFT protocols in terms of both latency (by up to 360%) and throughput (by up to 30%). Finally, we present R-Aliph, an implementation of Aliph that is robust, that is, whose performance degrades gracefully in the presence of Byzantine replicas and Byzantine clients.
引用
收藏
页数:45
相关论文
共 37 条
[1]  
Abd-El-Malek Michael, 2005, P S OP SYST PRINC SO
[2]  
Aguilera Marcos K., 2007, P ACM S PRINC DISTR
[3]   Prime: Byzantine Replication under Attack [J].
Amir, Yair ;
Coan, Brian ;
Kirsch, Jonathan ;
Lane, John .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2011, 8 (04) :564-577
[4]  
Attiya Hagit, 2005, P INT C DISTR COMP D
[5]  
Birman K., 2010, MSRTR2010151
[6]  
Boichat R., 2003, SIGACT News, V34, P47, DOI 10.1145/637437.637447
[7]  
Brasileiro Francisco V., 2001, P INT C PAR COMP TEC
[8]   BASE: Using abstraction to improve fault tolerance [J].
Castro, M ;
Rodrigues, R ;
Liskov, B .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2003, 21 (03) :236-269
[9]   Practical byzantine fault tolerance and proactive recovery [J].
Castro, M ;
Liskov, B .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04) :398-461
[10]  
Chandra T., 2007, P ACM S PRINC DISTR