Selected Results from the Latest Decade of Quorum Systems Research

Over the past decade, work on quorum systems in non-traditional scenarios has facilitated a number of advances in the field of distributed systems. This chapter surveys a selection of these results including: Byzantine quorum systems that are suitable for use when parts of the system cannot be trusted; algorithms for the deployment of quorum systems on wide area networks so as to allow for efficient access and to retain load dispersion properties; and probabilistic quorum systems that yield benefits for protocols and applications that can tolerate a small possibility of inconsistency. We also present a framework grounded in Byzantine quorum systems that can be used to explain, compare, and contrast several recent Byzantine fault-tolerant state-machine and storage protocols. The framework provides a path to understanding the number of servers required, the number of faults that can be tolerated, and the number of rounds of communication employed by each protocol.

[1]  Arun Venkataramani,et al.  Separating agreement from execution for byzantine fault tolerant services , 2003, SOSP '03.

[2]  Rodrigo Rodrigues,et al.  Tolerating Byzantine Faulty Clients in a Quorum System , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[3]  Ada Wai-Chee Fu.  Delay-Optimal Quorum Consensus for Distributed Systems , 1997, IEEE Trans. Parallel Distributed Syst..

[4]  Bruce M. Maggs,et al.  Quorum placement in networks: minimizing network congestion , 2006, PODC '06.

[5]  Robbert van Renesse,et al.  The Building Blocks of Consensus , 2008, ICDCN.

[6]  Marko Vukolic,et al.  Refined quorum systems , 2007, PODC '07.

[7]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

[8]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[9]  Ramakrishna Kotla,et al.  Zyzzyva: speculative byzantine fault tolerance , 2007, TOCS.

[10]  Christian Cachin,et al.  Secure INtrusion-Tolerant Replication on the Internet , 2002, Proceedings International Conference on Dependable Systems and Networks.

[11]  Miguel Castro,et al.  BASE: Using abstraction to improve fault tolerance , 2003, TOCS.

[12]  Miguel Castro,et al.  Using abstraction to improve fault tolerance , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[13]  Grzegorz Malewicz,et al.  The Quorum Deployment Problem , 2004, OPODIS.

[14]  Michael K. Reiter,et al.  Secure agreement protocols: reliable and atomic group multicast in rampart , 1994, CCS '94.

[15]  Michael K. Reiter,et al.  Probabilistic Opaque Quorum Systems , 2007, DISC.

[16]  Mahesh K. Marina,et al.  Performance of route caching strategies in Dynamic Source Routing , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[17]  Tatsuhiro Tsuchiya,et al.  Minimizing the mean delay of quorum-based mutual exclusion schemes , 2001, J. Syst. Softw..

[18]  Moni Naor,et al.  The Load, Capacity, and Availability of Quorum Systems , 1998, SIAM J. Comput..

[19]  Michael K. Reiter,et al.  Minimizing Response Time for Quorum-System Protocols over Wide-Area Networks , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[20]  Bruce M. Maggs,et al.  Quorum placement in networks to minimize access delays , 2005, PODC '05.

[21]  Michael K. Reiter,et al.  Efficient Byzantine-tolerant erasure-coded storage , 2004, International Conference on Dependable Systems and Networks, 2004.

[22]  Tatsuhiro Tsuchiya,et al.  Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes , 1999, IEEE Trans. Parallel Distributed Syst..

[23]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[24]  Xuemin Lin,et al.  Delay Optimizations in Quorum Consensus , 2001, ISAAC.

[25]  Michael K. Reiter,et al.  Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.

[26]  Ramakrishna Kotla,et al.  High throughput Byzantine fault tolerance , 2004, International Conference on Dependable Systems and Networks, 2004.

[27]  Michael K. Reiter,et al.  Write Markers for Probabilistic Quorum Systems , 2008, OPODIS.

[28]  Michael K. Reiter,et al.  Probabilistic quorum systems , 1997, PODC '97.

[29]  Michael K. Reiter,et al.  Byzantine quorum systems , 1997, STOC '97.

[30]  Florian Oprea,et al.  Quorum placement on wide-area networks , 2008 .

[31]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[32]  Jean-Philippe Martin,et al.  Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.