Probabilistic quorum systems

We initiate the study of probabilistic quorum systems, a technique for providing consistency of replicated data with high levels of assurance despite the failure of data servers. We show that this technique offers effective load reduction on servers and high availability. We explore probabilistic quorum systems both for services tolerant of benign server failures and for services tolerant of arbitrary (Byzantine) ones. We also prove bounds on the server load that can be achieved with these techniques. C � 2001 Academic Press

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[4]  David C. Walden,et al.  The ARPA Network Design Decisions , 1977, Comput. Networks.

[5]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[6]  Vasek Chvátal,et al.  The tail of the hypergeometric distribution , 1979, Discret. Math..

[7]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[8]  Butler W. Lampson,et al.  An open operating system for a single-user machine , 1979, SOSP '79.

[9]  7th symposium on operating systems principles , 1980 .

[10]  Hints for computer system design , 1983, SOSP '83.

[11]  Butler W. Lampson,et al.  Hints for Computer System Design , 1983, IEEE Software.

[12]  Hector Garcia-Molina,et al.  How to assign votes in a distributed system , 1985, JACM.

[13]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[14]  M. Herlihy.  A quorum-consensus replication method for abstract data types , 1986, TOCS.

[15]  Hector Garcia-Molina,et al.  The vulnerability of vote assignments , 1986, TOCS.

[16]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[17]  Hector Garcia-Molina,et al.  The Reliability of Voting Mechanisms , 1987, IEEE Transactions on Computers.

[18]  Amr El Abbadi,et al.  Maintaining availability in partitioned replicated databases , 1987, ACM Trans. Database Syst..

[19]  Mostafa H. Ammar,et al.  The grid protocol: a high performance scheme for maintaining replicated data , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[20]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[21]  Divyakant Agrawal,et al.  An efficient and fault-tolerant solution for distributed mutual exclusion , 1991, TOCS.

[22]  Calton Pu,et al.  Replica control in distributed systems: as asynchronous approach , 1991, SIGMOD '91.

[23]  C. Pu,et al.  Replica Control in Distributed Systems: An Asynchronous Approach , 1991, SIGMOD Conference.

[24]  Krishna V. Palem,et al.  Efficient program transformations for resilient parallel computation via randomization (preliminary version) , 1992, STOC '92.

[25]  Amos Israeli,et al.  Optimal multi-writer multi-reader atomic register , 1992, PODC '92.

[26]  Divyakant Agrawal,et al.  Tolerating bounded inconsistency for increasing concurrency in database systems , 1992, PODS '92.

[27]  Mostafa H. Ammar,et al.  The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data , 1992, IEEE Trans. Knowl. Data Eng..

[28]  Y. Aumann,et al.  Clock construction in fully asynchronous parallel systems and PRAM simulation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[29]  Aravind Srinivasan,et al.  Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.

[30]  Yonatan Aumann,et al.  Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation , 1994, Theor. Comput. Sci..

[31]  Arthur J. Bernstein,et al.  Bounded ignorance: a technique for increasing concurrency in a replicated system , 1994, TODS.

[32]  D. Peleg,et al.  Crumbling Walls: A Class of High Availability Quorum Systems , 1994, PODC 1994.

[33]  Kenneth P. Birman,et al.  Achieving Critical Reliability With Unreliable Components andUnreliable Glue , 1995 .

[34]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[35]  David Peleg,et al.  The Availability of Quorum Systems , 1995, Inf. Comput..

[36]  David Peleg,et al.  Crumbling walls: a class of practical and efficient quorum systems , 1995, PODC '95.

[37]  Ramón Cáceres,et al.  Fast and scalable handoffs for wireless internetworks , 1996, MobiCom '96.

[38]  Rida A. Bazzi,et al.  Planar quorums , 1996, Theor. Comput. Sci..

[39]  David Peleg,et al.  How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract) , 1996, PODC '96.

[40]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[41]  Avishai Wool,et al.  The load and availability of Byzantine quorum systems , 1997, PODC '97.

[42]  Rida A. Bazzi.  Synchronous Byzantine quorum systems , 1997, PODC '97.

[43]  James E. Smith,et al.  A study of branch prediction strategies , 1981, ISCA '98.

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

[45]  Michael K. Reiter,et al.  Secure and scalable replication in Phalanx , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

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

[47]  Secure Multicast in a WAN , 1999, ArXiv.

[48]  Yishay Mansour,et al.  On Propagating Updates in a Byzantine Environment , 1999, ArXiv.

[49]  Rida A. Bazzi.  Non-blocking Asynchronous Byzantine Quorum Systems , 1999, DISC.

[50]  Zygmunt J. Haas,et al.  Ad Hoc mobility management with uniform quorum systems , 1999, TNET.