How to assign votes in a distributed system
Journal of the ACM (JACM)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
The availability of quorum systems
Information and Computation
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Load Balancing in Quorum Systems
SIAM Journal on Discrete Mathematics
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Theoretical Computer Science
Average probe complexity in quorum systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
The costs and limits of availability for replicated services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Information and Computation
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Probabilistic opaque quorum systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
With n servers that independently fail with probability of p 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 Intemet, 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.