Scalable and dynamic quorum systems

Abstract.We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algorithmic complexity of finding a quorum in case of random failures. We show a tradeoff between the load of a quorum system and its probe complexity for non adaptive algorithms. We analyze the algorithmic probe complexity of the Paths quorum system suggested by Naor and Wool in [29], and present two optimal algorithms. The first is a non adaptive algorithm that matches our lower bound. The second is an adaptive algorithm with a probe complexity that is linear in the cardinality of the smallest quorum set. We supply a constant degree network in which these algorithms could be executed efficiently. Thus the Paths quorum system is shown to have good balance between many measures of quality. Our second contribution is presenting Dynamic Paths - a suggestion for a dynamic and scalable quorum system, which can operate in an environment where elements join and leave the system. The quorum system could be viewed as a dynamic adaptation of the Paths system, and therefore has low load high availability and good probe complexity. We show that it scales gracefully as the number of elements grows.

[1]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[2]  Sushil Jajodia,et al.  Dynamic voting algorithms for maintaining the consistency of a replicated database , 1990, TODS.

[3]  Mark Bearden,et al.  A fault-tolerant algorithm for decentralized on-line quorum adaptation , 1998, Digest of Papers. Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing (Cat. No.98CB36224).

[4]  Flaviu Cristian,et al.  An efficient, fault-tolerant protocol for replicated data management , 1985, Fault-Tolerant Distributed Computing.

[5]  Idit Keidar,et al.  Dynamic voting for consistent primary components , 1997, PODC '97.

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

[7]  Ittai Abraham,et al.  Probabilistic quorums for dynamic systems , 2003, Distributed Computing.

[8]  Moni Naor,et al.  Access Control and Signatures via Quorum Secret Sharing , 1998, IEEE Trans. Parallel Distributed Syst..

[9]  Moni Naor,et al.  Novel architectures for P2P applications: the continuous-discrete approach , 2003, SPAA '03.

[10]  Maurice Herlihy,et al.  Dynamic quorum adjustment for partitioned data , 1987, TODS.

[11]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[12]  Ömer Egecioglu,et al.  Billiard Quorums on the Grid , 1997, Inf. Process. Lett..

[13]  Oded Goldreich.  Randomized Methods in Computation-Lecture Notes , 2001 .

[14]  Ravi Prakash,et al.  Information dissemination in partitionable mobile ad hoc networks , 1999, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems.

[15]  Ittai Abraham,et al.  Probabilistic Quorums for Dynamic Systems , 2003, DISC.

[16]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[17]  R. Schonmann,et al.  Domination by product measures , 1997 .

[18]  J. Chayes,et al.  On a sharp transition from area law to perimeter law in a system of random surfaces , 1983 .

[19]  Moni Naor,et al.  A Simple Fault Tolerant Distributed Hash Table , 2003, IPTPS.

[20]  David Peleg,et al.  How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems , 2002, SIAM J. Discret. Math..

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

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

[23]  Nancy A. Lynch,et al.  RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks , 2002, DISC.

[24]  Nancy A. Lynch,et al.  Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts , 1997, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing.

[25]  Moni Naor,et al.  The load, capacity and availability of quorum systems , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

[27]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[28]  Yossi Azar,et al.  A generic scheme for building overlay networks in adversarial scenarios , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[29]  Journal of the Association for Computing Machinery , 1961, Nature.

[30]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

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

[32]  Richard M. Karp,et al.  A stochastic process on the hypercube with applications to peer-to-peer networks , 2003, STOC '03.

[33]  Nancy A. Lynch,et al.  A dynamic view-oriented group communication service , 1998, PODC '98.

[34]  Flaviu Cristian,et al.  An efficient, fault-tolerant protocol for replicated data management , 1985, PODS '85.

[35]  Ivan Stojmenovic,et al.  A scalable quorum based location update scheme for routing in ad hoc wireless networks , 1999 .

[36]  Moni Naor,et al.  Fault-Tolerant Storage in a Dynamic Environment , 2004, DISC.