How to assign votes in a distributed system
Journal of the ACM (JACM)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Computer Systems (TOCS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Information and Computation
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Applications of Probabilistic Quorums to Iterative Algorithms
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Randomized location service in mobile ad hoc networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Distributed Computing
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing - Special issue: DISC 03
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
SQUARE: scalable quorum-based atomic memory with local reconfiguration
Proceedings of the 2007 ACM symposium on Applied computing
SybilGuard: defending against sybil attacks via social networks
IEEE/ACM Transactions on Networking (TON)
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Fault-Tolerant Aggregation by Flow Updating
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Timed quorum systems for large-scale and dynamic environments
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Accessing probabilistic quorums in dynamic networks
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Core persistence in peer-to-peer systems: relating size to lifetime
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Ramos: Concurrent writing and reconfiguration for collaborative systems
Journal of Parallel and Distributed Computing
Probabilistically bounded staleness for practical partial quorums
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
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.