• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Scalable and Dynamic Quorum Systems (2003)

Cached

  • Download as a PDF

Download Links

  • [www.wisdom.weizmann.ac.il]
  • [www.wisdom.weizmann.ac.il]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [www.wisdom.weizmann.ac.il]
  • [www.wisdom.weizmann.ac.il]
  • [www.wisdom.weizmann.ac.il]
  • [www.wisdom.weizmann.ac.il]
  • [www.wisdom.weizmann.ac.il]
  • [research.microsoft.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Moni Naor , Udi Wieder
Citations:32 - 2 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Naor03scalableand,
    author = {Moni Naor and Udi Wieder},
    title = {Scalable and Dynamic Quorum Systems},
    year = {2003}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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 [18], 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 minimum between the size of the smallest quorum set and the load of the system. 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.

Keyphrases

dynamic quorum system    quorum system    probe complexity    non adaptive algorithm    path quorum system    optimal algorithm    adaptive algorithm    good balance    quorum set    dynamic path    high availability    algorithmic complexity    good probe complexity    scalable quorum system    dynamic environment    many measure    constant degree network    random failure    algorithmic probe complexity    second contribution    dynamic adaptation    element grows    path system   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University