Skip to main content
SpringerLink
Log in

Signed quorum systems

  • Special Issue Podc 04
  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum systems. However, even this optimal construction requires (n+1)/2 functioning servers out of n. Furthermore, the number of probes needed to acquire a quorum is also lower bounded by (n+1)/2.

Motivated by the need for a highly available and low probe complexity quorum system in the Internet, this paper proposes signed quorum systems (SQS) that can be available as long as any O(1) servers are available, and simultaneously have O(1) probe complexity. SQS provides probabilistic intersection guarantees and exploits the property of independent mismatches in today’s Internet. Such key property has been validated previously under multiple Internet measurement traces. This paper then extensively studies the availability, probe complexity, and load of SQS, derives lower bounds for all three metrics, and constructs matching upper bounds. We show that in addition to the qualitatively superior availability and probe complexity, SQS also decouples availability from load and probe complexity, so that optimal availability can be achieved under most probe complexity and load values.

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. Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. In: Proceedings of the 18th Symposium on Operating Systems Principles, (October 2001)

  2. Barbara, D., Garcia-Molina, H.: The reliability of voting mechanisms. IEEE Transactions on Computers 36(10), 1197–1208 (1987)

    MathSciNet  Google Scholar 

  3. Bazzi, R.: Planar quorums. Theoretical Computer Science 243(1–2), 243–268 (2000)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th Symposium on Operating Systems Principles, (December 1979)

  6. Hassin, Y., Peleg, D.: Average probe complexity in quorum systems. In: Proceedings of the ACM Symposium of Principles of Distributed Computing, (August 2001)

  7. Holzman, R., Marcus, Y., Peleg, D.: Load balancing in quorum systems. SIAM Journal on Discrete Mathematics 10(2), 223–245 (1997)

    Article  MathSciNet  Google Scholar 

  8. Malkhi, D., Reiter, M.: Byzantine quorum systems. In: Proceedings of the 29th ACM Symposium on Theory of Computing, (May 1997)

  9. Malkhi, D., Reiter, M., Wool, A., Wright, R.: Probabilistic Quorum Systems. The Information and Computation Journal 170(2), 184–206 (2001)

    Article  MathSciNet  Google Scholar 

  10. Naor, M., Wieder, U.: Scalable and dynamic quorum systems. In: Proceedings of the ACM Symposium of Principles of Distributed Computing, (July 2003)

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

    Article  MathSciNet  Google Scholar 

  12. Peleg, D., Wool, A.: The availability of quorum systems. Information and Computation 123(2), 210–223 (1995)

    Article  MathSciNet  Google Scholar 

  13. Peleg, D., Wool, A.: How to be an efficient snoop, or the probe complexity of quorum systems. In: Proceedings of the ACM Symposium of Principles of Distributed Computing, (May 1996)

  14. Savage, S., Anderson, T., Aggarwal, A., Becker, D., Cardwell, N., Collins, A., Hoffman, E., Snell, J., Vahdat, A., Voelker, G., Zahorjan, J.: Detour: A Case for Informed Internet Routing and Transport. IEEE Micro 19(1), 50–59 (1999)

    Article  Google Scholar 

  15. 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 

  16. Yao, A.: Probabilistic computations: Towards a unified measure of complexity. In: Proceedings of the 17th Annual Symposium on Foundations of Computer Science, (October–November 1977)

  17. Yu, H.: Overcoming the majority barrier in large-scale systems. In: Proceedings of the 17th International Symposium on Distributed Computing, (October 2003)

  18. Yu, H., Vahdat, A.: The costs and limits of availability for replicated services. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles, (October 2001)

Download references

Author information

Authors and Affiliations

  1. Intel Research Pittsburgh and Carnegie Mellon University, Pittsburgh

    Haifeng Yu

Authors
  1. Haifeng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haifeng Yu.

Additional information

Haifeng Yu is currently a Researcher at Intel Research Pittsburgh. He is also an Adjunct Assistant Professor at the Department of Computer Science, Carnegie Mellon University. His research interests cover the general area of distributed systems, as well as related fields such as operating systems, database systems, fault-tolerance and large-scale peer-to-peer systems. Haifeng receives his Ph.D. and M.S. from Duke University, and his B.E. from Shanghai Jiaotong University, China. More information about his research is available at http://www.cs.cmu.edu/yhf.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, H. Signed quorum systems. Distrib. Comput. 18, 307–323 (2006). https://doi.org/10.1007/s00446-005-0133-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-005-0133-8

Keywords

Search

Navigation