Skip to main content
SpringerLink
Log in

Probabilistic quorums for dynamic systems

  • Spec Issue DISC 03
  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

A quorum system is a set of sets such that every two sets in the quorum system intersect. Quorum systems are well known building blocks for maintaining information in a distributed system while providing high availability and good load balance. Probabilistic Quorum Systems (PQS) are variants of quorum systems that relax the strict intersection requirement. They are particularly attractive for large scale systems due to their simplicity and highly efficient availability—load balance tradeoff. We introduce scalable techniques that maintain a PQS in a highly decentralized and highly dynamic setting. We address two challenges. First we show how PQS can be realized efficiently even when each process maintains knowledge of only a constant number of other members. Second, we provide algorithms that adaptively evolve the quorums to adjust to the changes in the system caused by processes leaving and joining the system over time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A generic scheme for building overlay networks in adversarial scenarios. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2003) (2003)

  2. Abraham, I., Dolev, D.: Asynchronous resource discovery. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003) (2003)

  3. Abraham, I., Malkhi, D.: Probabilistic quorums for dynamic systems. In: Proceedings of the 17th International Symposium on DIStributed Computing (DISC 2003) (2003)

  4. Sangeeta, B.: Randomized location service in mobile ad hoc networks. In: MSWIM '03: Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems. pp 66--73. ACM Press (2003)

  5. Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41–88 (1999)

    Article  Google Scholar 

  6. Castro, M., Druschel, P., Kermarrec, A-M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: High-bandwidth multicast in a cooperative environment. In: SOSP'03 (2003)

  7. Chockler, G., Malkhi, D., Merimovich, B., Rabinowitz, D.: Aquarius: A data-centric approach to corba fault-tolerance. In The workshop on Reliable and Secure Middleware, in Proceedings of the 2003 International Conference on Distributed Objects and Applications (DOA) (2003)

  8. de~Bruijn, N.G.: A combinatorial problem. Konink. Nederl. Akad. Wetersh. Verh. Afd. Natuurk. Eerste Reelss. (A49), 758–764 (1946)

  9. Dolev, S., Gilbert, S., Lynch, N., Shvartsman, A., Welch, J.: Geoquorums: Implementing atomic memory in mobile ad hoc networks. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC 2003)

  10. Feller, W.: An Introduction to Probability Theory and Its Applications, vol~1. John Wiley & Sons, 3rd edition (1967)

  11. Fraigniaud, P., Gauron, P.: The content-addressable network D2B. Technical Report 1349, LRI, Univ. Paris-Sud, France (2003)

  12. Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. J. ACM. 32(4), 841–860 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th ACM Symposium on Operating Systems Principles pp 150–162 (1979)

  14. Welch, J.L., Lee, H., Vaidya, N.H.: Location tracking with quorums in mobile ad hoc networks. Ad Hoc Networks. 1(4), 371–381 (2003)

    Google Scholar 

  15. Haas, Z.J., Liang, B.: Ad hoc mobility management with randomized database groups. In: Proceedings of the IEEE Internation Conference on Communications (1999)

  16. Haas, Z.J., Liang, B.: Ad hoc mobility management with uniform quorum systems. IEEE/ACM Transactions on Networking. 7(2), 228–240 (1999)

    Article  Google Scholar 

  17. Harchol-Balter, M., Leighton, T., Lewin, D.: Resource discovery in distributed networks. In: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing. pp 229–237 (1999)

  18. Harren, M., Hellerstein, J., Huebsch, R., Loo, B. Shenker, S., Stoica, I.: Complex queries in DHT-based peer-to-peer networks. In: Proceedings of 1st International Workshop on Peer-to-Peer Systems (IPTPS'02) (2002)

  19. Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. American Statistical Association. 58(301), 13–30 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kaashoek, F., Karger, D.R.: Koorde: A simple degree-optimal hash table. In: 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03) (2003)

  21. Kermarrec, A.-M., Massouli, L., Ganesh, A.J.: Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems. 14(3) (2003)

  22. 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)

  23. Lee, H., Welch, J.L.: Randomized shared queues. In: Brief announcement in Twentieth ACM Symposium on Principles of Distributed Computing (PODC 2001) (2001)

  24. Kermarrec, A.-M., Castro, M., Druschel, P., Rowstron, A.: Scribe: A large-scale and decentralised application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC) (Special issue on Network Support for Multicast Communications) (2002)

  25. Maekawa, M.: A √n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2), 145–159 (1985)

    Article  Google Scholar 

  26. Malkhi, D.: Quorum systems, 1999. Invited chapter in the Encyclopedia of Distributed Computing, Joseph Urban and Partha Dasgupta, editors, Kluwer Academic Publishers, available from http://research.microsoft.com/~dalia/pubs/quorums.ps

  27. Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed Computing. 11(4), 203–213 (1998)

    Article  Google Scholar 

  28. 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)

    Article  Google Scholar 

  29. Malkhi, D., Reiter, M., Wool, A., Wright, R.: Probabilistic quorum systems. Information and Computation 170(2), 184–206 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  30. Naor, M., Wieder, U.: Novel architectures for p2p applications: the continuous-discrete approach. In: The Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '03) (2003)

  31. Naor, M., Wieder, U.: Scalable and dynamic quorum systems. In: proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003) (2003)

  32. Naor, M., Wool, A.: The load, capacity and availability of quorum systems. SIAM J. Computing. 27(2), 423–447 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  33. Ratajczak, D.: Decentralized dynamic networks. Technical Report M. Eng. Thesis Proposal, MIT. (2000)

  34. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). pp. 329–350 (2001)

  35. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the SIGCOMM 2001 (2001)

  36. Stojmenovic, I.: A scalable quorum based location update scheme for routing in ad hoc wireless networks. Technical Report TR-99-09, SITE, University of Ottawa (1999)

  37. Tchakarov, J., Vaidya, N.: Efficient content location in wireless ad hoc networks. In: IEEE International Conference on Mobile Data Management (MDM) (2004)

  38. Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems. 4(2), 180–209 (1979)

    Article  Google Scholar 

  39. Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications (2003)

  40. Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R.H., Kubiatowicz, J.: Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In: Proceedings of the Eleventh International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV 2001) (2001)

Download references

Author information

Authors and Affiliations

  1. The Hebrew University of Jerusalem, Israel

    Ittai Abraham & Dahlia Malkhi

Authors
  1. Ittai Abraham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dahlia Malkhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ittai Abraham.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abraham, I., Malkhi, D. Probabilistic quorums for dynamic systems. Distrib. Comput. 18, 113–124 (2005). https://doi.org/10.1007/s00446-005-0139-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-005-0139-2

Keywords

Search

Navigation