Zeno: eventually consistent Byzantine-fault tolerance

作者: Petros Maniatis , Pedro Fonseca , Rodrigo Rodrigues , Petr Kuznetsov , Atul Singh

DOI:

关键词:

摘要: Many distributed services are hosted at large, shared, geographically diverse data centers, and they use replication to achieve high availability despite the unreachability of an entire center. Recent events show that non-crash faults occur in these may lead long outages. While Byzantine-Fault Tolerance (BFT) could be used withstand faults, current BFT protocols can become unavailable if a small fraction their replicas unreachable. This is because existing favor strong safety guarantees (consistency) over liveness (availability). This paper presents novel state machine protocol called Zeno trades consistency for higher availability. In particular, replaces (linearizability) with weaker guarantee (eventual consistency): clients temporarily miss each other's updates but when network stable states from individual partitions merged by having agree on total order all requests. We have built prototype our evaluation using micro-benchmarks shows provides better than traditional protocols.

参考文章(29)
David Maziéres, Jinyuan Li, Beyond one-third faulty replicas in byzantine fault tolerant systems networked systems design and implementation. pp. 10- 10 ,(2007)
Jim Gray, Andreas Reuter, Transaction Processing: Concepts and Techniques ,(1992)
Alan Fekete, David Gupta, Victor Luchangco, Nancy Lynch, Alex Shvartsman, Eventually-serializable data services Theoretical Computer Science. ,vol. 220, pp. 113- 156 ,(1999) , 10.1016/S0304-3975(98)00239-4
Rodrigo Rodrigues, Miguel Castro, Barbara Liskov, BASE: using abstraction to improve fault tolerance symposium on operating systems principles. ,vol. 35, pp. 15- 28 ,(2001) , 10.1145/502034.502037
Mike J. Spreitzer, Marvin M. Theimer, Karin Petersen, Alan J. Demers, Douglas B. Terry, Dealing with server corruption in weakly consistent replicated data systems Wireless Networks. ,vol. 5, pp. 357- 371 ,(1999) , 10.1023/A:1019175717085
Dahlia Malkhi, Michael Reiter, Byzantine quorum systems symposium on the theory of computing. pp. 569- 578 ,(1997) , 10.1145/258533.258650
Eric A. Brewer, Towards robust distributed systems (abstract) principles of distributed computing. pp. 7- ,(2000) , 10.1145/343477.343502
Maurice P. Herlihy, Jeannette M. Wing, Linearizability: a correctness condition for concurrent objects ACM Transactions on Programming Languages and Systems. ,vol. 12, pp. 463- 492 ,(1990) , 10.1145/78969.78972
Jinyuan Li, Maxwell Krohn, David Mazieres, Dennis Shasha, Secure untrusted data repository (SUNDR) operating systems design and implementation. pp. 9- 9 ,(2004) , 10.21236/ADA445862
Haifeng Yu, Amin Vahdat, Design and evaluation of a conit-based continuous consistency model for replicated services ACM Transactions on Computer Systems. ,vol. 20, pp. 239- 282 ,(2002) , 10.1145/566340.566342