A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mutual exclusion, data replication and dissemination of information Given a strategy to pick quorums, the load L(S) is the minimal access probability of the busiest element, minimizing over the strategies. The capacity Cap(S) is the highest quorum accesses rate that S can handle. We show that for any quorum system, Cap(S) = 1=L(S). The availability of a quorum system S is the probability that at least one quorum survives, assuming that each element fails independently with probability p. A tradeoff between L(S) and the availability of S is shown. None of the existing constructions of quorum systems achieves simultaneously good availability and low load. We present four novel constructions of quorum system, all featuring optimal or near optimal load, and high availability. The best construction, based on paths in a grid, has a load of O(1= p
|
1338
|
The probabilistic method
– Alon, Spencer
- 2000
|
|
1049
|
How to share a secret
– Shamir
- 1979
|
|
1003
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
640
|
A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks
– Goldwasser, MiCali, et al.
- 1988
|
|
578
|
Kerberos: An Authentication Service for Open Network Systems
– Steiner, Neuman, et al.
- 1988
|
|
506
|
How to construct random functions
– Goldreich, Micali, et al.
- 1986
|
|
470
|
Weighted Voting for Replicated Data
– Gifford
- 1979
|
|
452
|
A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations
– Chernoff
- 1952
|
|
297
|
Byzantine quorum systems
– Malkhi, Reiter
- 1997
|
|
283
|
A majority consensus approach to concurrency control for multiple copy databases
– Thomas
- 1979
|
|
265
|
A polynomial algorithm in linear programming
– Khachiyan
- 1979
|
|
256
|
Safeguarding cryptographic keys
– Blakley
- 1979
|
|
254
|
Universal One-way Hash Functions and their Cryptographic Applications. 21st STOC
– Naor, Yung
- 1989
|
|
252
|
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
– Raghavan, Thompson
- 1987
|
|
235
|
The ellipsoid method and its consequences in combina- torial optimization. Combinatorica I:169
– Grötschel, Lovász, et al.
- 1981
|
|
181
|
A √ n algorithm for mutual exclusion in decentralized systems
– Maekawa
- 1985
|
|
170
|
Foundation of Cryptography - Fragments of a Book
– Goldreich
- 1995
|
|
168
|
How to assign votes in a distributed system
– Garcia-Molina, Barbara
- 1985
|
|
166
|
Consistency in partitioned networks
– Davidson, Garcia-Molina, et al.
- 1985
|
|
156
|
One-way functions are necessary and sufficient for secure signatures
– Rompel
|
|
139
|
Problems and results on 3-chromatic hypergraphs and some related questions
– Erdos, Lov'asz
- 1975
|
|
136
|
Pseudorandomness and its Cryptographic Applications
– Luby
- 1996
|
|
130
|
A quorum-consensus replication method for abstract data types
– HERLIHY
- 1986
|
|
127
|
Dynamic voting algorithms for maintaining the consistency of a replicated database
– Jajodia, Mutchler
- 1990
|
|
117
|
Introduction to Percolation Theory
– Stauffer, Aharony
- 1992
|
|
115
|
Generalized secret sharing and monotone functions
– Benaloh, Leichter
- 1990
|
|
110
|
On span programs
– Karchmer, Wigderson
- 1993
|
|
110
|
Dynamic Fault-Tolerant Clock Synchronization
– Dolev, Halpern, et al.
- 1995
|
|
100
|
The grid protocol: A high performance scheme for maintaining replicated data
– Cheung, Ammar, et al.
- 1990
|
|
93
|
Algorithms for Mutual Exclusion
– Raynal
- 1986
|
|
90
|
On the classification of ideal secret sharing schemes
– Brickell, Davenport
- 1991
|
|
86
|
Secret sharing schemes realizing general access structure
– Ito, Saito, et al.
- 1987
|
|
84
|
Shared generation of authenticators and signatures
– Desmedt, Frankel
- 1991
|
|
81
|
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
– Kumar
- 1991
|
|
80
|
Fast algorithms for shortest paths in planar graphs, with applications
– Frederickson
- 1987
|
|
79
|
Kerberos authentication and authorization system
– Miller, Neumann, et al.
- 1987
|
|
79
|
Fail-stop protocols: An approach to designing secure protocols, Dependable Computing for Critical Applications 5
– Gong, Syverson
- 1998
|
|
76
|
An Algorithmic Theory of Numbers, Graphs and Convexity
– Lovasz
- 1986
|
|
75
|
Correlation inequalities on some partially ordered sets
– Fortuin, Kasteleyn, et al.
- 1971
|
|
69
|
An introduction to shared secret and/or shared control and their application
– Simmons
- 1992
|
|
67
|
How to share a function securely
– Santis, Desmedt, et al.
- 1994
|
|
67
|
Short monotone formulae for the majority function
– Valiant
- 1984
|
|
64
|
The load, capacity, and availability of quorum systems
– Naor, Wool
- 1998
|
|
61
|
An Efficient and FaultTolerant Solution for Distributed Mutual Exclusion
– Agrawal, Abbadi
- 1991
|
|
55
|
The Critical Probability of Bond Percolation on the Square Lattice Equals 1
– Kesten
- 1980
|
|
54
|
Coverings and Colorings of Hypergraphs
– Lovasz
- 1973
|
|
52
|
The reliability of voting mechanisms
– Barbara, Garcia-Molina
- 1987
|
|
49
|
Increasing availability and security of an authentication service
– Gong
- 1993
|
|
46
|
How to make replicated data secure
– Herlihy, Tygar
- 1987
|
|
40
|
An efficient existentially unforgeable signature scheme and its applications
– Dwork, Naor
- 1994
|
|
