Abstract
A quorum system is a set of sets such that every two sets in the quorum system intersect. Quorum systems may be used as a building block for performing updates and global queries on a distributed, shared information base. An ε-intersecting quorum system is a distribution on sets such that every two sets from the distribution intersect with probability 1-ε. This relaxation of consistency results in a dramatic improvement of the load balancing and resilience of quorum systems, making the approach especially attractive for scalable and dynamic settings.
In this paper we assume a dynamic model where nodes constantly join and leave the system. A quorum chosen at time s must evolve and transform as the system grows/shrinks in order to remain viable. For such a dynamic model, we introduce dynamic ε-intersecting quorum systems. A dynamic ε-intersecting quorum system ensures that in spite of arbitrary changes in the system population, any two evolved quorums intersect with probability 1-ε.
Full version appears as Leibnitz Center TR 2003-32, The Hebrew University [3].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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: International Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France (April 2003)
Abraham, I., Dolev, D.: Asynchronous Resource Discovery. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003) (June 2003)
Abraham, I., Malkhi, D.: Probabilistic Quorums for Dynamic Systems. Leibnitz Center TR 2003-32, School of Computer Science and Engineering, The Hebrew University (June 2003), http://leibniz.cs.huji.ac.il/tr/acc/2003/HUJI-CSE-LTR-2003-32_dpqll.ps
Adler, M., Halperin, E., Karp, R., Vazirani, V.: A stochastic process on the hypercube with applications to peer to peer networks. In: The 35th Annual ACM Symposium on Theory of Computing, STOC (2003)
de Bruijn, N.G.: A combinatorial problem, Konink. Nederl. Akad. Wetersh. Verh. Afd. Natuurk. Eerste Reelss, A49, pp. 758–764 (1946)
Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol. 1. John Wiley & Sons, New York (1967)
Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (2002)
Fraigniaud, P., Gauron, P.: The Content-Addressable Network D2B. Technical Report 1349, LRI, Univ. Paris-Sud, France (January 2003)
Haas, Z.J., Liang, B.: Ad hoc mobility management with randomized database groups. In: Proceedings of the IEEE Internation Conference on Communications (June 1999)
Harchol-Balter, M., Leighton, T., Lewin, D.: Resource Discovery in Distributed Networks. In: Proc. 15th ACM Symp. on Principles of Distributed Computing, May 1999, pp. 229–237 (1999)
Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13–30 (1963)
Kaashoek, F., Karger, D.R.: Koorde: A Simple Degree-optimal Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Lee, H., Welch, J.L.: Applications of Probabilistic Quorums to Iterative Algorithms. In: Proceedings of 21st International Conference on Distributed Computing Systems (ICDCS-21), pp. 21–28 (2001)
Lee, H., Welch, J.L.: Randomized Shared Queues. In: Brief announcement in Twentieth ACM Symposium on Principles of Distributed Computing, PODC 2001 (2001)
Malkhi, D., Reiter, M.: Secure and Scalable Replication in Phalanx. In: Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems (SRDS 1998), Purdue University, West Lafayette, Indiana, October 1998, pp. 51–60 (1998)
Malkhi, D., Reiter, M.: An Architecture for Survivable Coordination in Large Distributed Systems. IEEE Transactions on Knowledge and Data Engineering 12(2), 187–202 (2000)
Malkhi, D., Reiter, M., Wool, A., Wright, R.: Probabilistic quorum systems. The Information and Computation Journal 170(2), 184–206 (2001)
Naor, M., Weider, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Proceedings pf Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2003) (June 2003)
Naor, M., Wieder, U.: Scalable and Dynamic Quorum Systems. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003) (June 2003)
Naor, M., Wool, A.: The load, capacity and availability of quorum systems. SIAM Journal of Computing 27(2), 423–447 (1998)
Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter p2p networks. In: Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science, FOCS (2001)
Rataczjak, D.: Decentralized Dynamic Networks. M. Eng. Thesis Proposal, MIT (May 2000)
Saia, J., Fiat, A., Gribble, S., Karlin, A., Saroiu, S.: Dynamically Fault-Tolerant Content Addressable Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 270. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abraham, I., Malkhi, D. (2003). Probabilistic Quorums for Dynamic Systems. In: Fich, F.E. (eds) Distributed Computing. DISC 2003. Lecture Notes in Computer Science, vol 2848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39989-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-39989-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20184-7
Online ISBN: 978-3-540-39989-6
eBook Packages: Springer Book Archive