Abstract
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze the algorithmic probe complexity of the And-Or quorum system, and present two optimal algorithms. The first is a non-adaptive algorithm with \(O(\sqrt{n}log n)\) probe complexity, which matches a known lower bound. The second is an adaptive algorithm with a probe complexity that is linear in the cardinality of a quorum set (\(O(\sqrt{n})\)), and requires at most O(loglogn) rounds. To the best of our knowledge, all other adaptive algorithms with same parameters (load and probe complexity) require \(\theta(\sqrt{n})\) rounds.
Our second contribution is presenting the ‘dynamic And-Or’ quorum system – an adaptation of the above quorum system to a dynamic environment, where processors join and leave the network. It is based on a dynamic overlay network that emulates the De-Bruijn network and maintains the good properties of the quorum system(e.g.,load and availability). The algorithms suggested for the maintenance of these dynamic data structures are strongly coupled with the dynamic overlay network. This fact enables the use of gossip protocols which saves in message complexity and keeps the protocols simple and local. All these qualities make the ‘dynamic And-Or’ an excellent candidate for an implementation of dynamic quorums.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A generic scheme for building overlay networks in adversarial scenarios. In: IPDPS (2003)
Abraham, I., Malkhi, D.: Probabilistic quorums for dynamic systmes. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 60–74. Springer, Heidelberg (2003)
Bazzi, R.: Planar quorums. In: Babaoğlu, Ö., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151. Springer, Heidelberg (1996)
Fraigniaud, P., Gauron, P.: An overview of the content-addressable network d2b. In: PODC (2003)
Hassin, Y., Peleg, D.: Average probe complexity in quorum systems. In: PODC (2001)
Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Karger, D., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: SPAA (2004)
Liggett, T., Schonmann, R., Stacey, A.: Domination by product measures. The Annals of Probability 25(1) (1997)
Lynch, N., Malkhi, D., Ratajczak, D.: Atomic data access in distributed hash tables. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 295. Springer, Heidelberg (2002)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: PODC (2002)
Malkhi, D., Reiter, M., Wright, R.: Probabilistic quorum systems. In: PODC (1997)
Manku, G.S.: Balanced binary trees for ID management and load balance in distributed hash tables. In: PODC (2004)
Nadav, U., Naor, M.: Fault-tolerant storage in a dynamic environment. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 390–404. Springer, Heidelberg (2004)
Naor, M., Wieder, U.: Novel architectures for p2p applications: the continuous-discrete approach. In: SPAA (2003)
Naor, M., Wieder, U.: Scalable and dynamic quorum systems. In: PODC (2003)
Naor, M., Wool, A.: The load, capacity, and availability of quorum systems. SIAM Journal on Computing 27(2) (1998)
Peleg, D., Wool, A.: The availability of quorum systems. Inf. Comput. 123(2) (1995)
Peleg, D., Wool, A.: How to be an efficient snoop, or the probe complexity of quorum systems. SIAM Journal on Discrete Mathematics 15(3) (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. ACM SIGCOMM (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: ACM SIGCOMM Conference (2001)
Zhao, B.Y., Kubiatowicz, J.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB CSD 01-1141, University of California at Berkeley (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nadav, U., Naor, M. (2005). The Dynamic And-Or Quorum System. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_34
Download citation
DOI: https://doi.org/10.1007/11561927_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29163-3
Online ISBN: 978-3-540-32075-3
eBook Packages: Computer ScienceComputer Science (R0)