Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/signed-quorum-systems-PeHxPiz5DN
References (26)
-
A. Yao (1977)
Probabilistic computations: Toward a unified measure of complexity18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
-
R. Holzman, Y. Marcus, D. Peleg (1997)
Load Balancing in Quorum SystemsSIAM J. Discret. Math., 10
-
(1997)
Load balancing in quorum systems.SIAM -
Y. Hassin, D. Peleg (2001)
Average probe complexity in quorum systems -
H. Garcia-Molina, Daniel Barbará (1985)
How to assign votes in a distributed systemJ. ACM, 32
-
D. Andersen, H. Balakrishnan, M. Kaashoek, R. Morris (2002)
Resilient overlay networksComput. Commun. Rev., 32
-
(2004)
Signed Quorum Systems -
Haifeng Yu, Amin Vahdat (2001)
The costs and limits of availability for replicated servicesACM Trans. Comput. Syst., 24
-
D. Malkhi, M. Reiter (1997)
Byzantine quorum systemsDistributed Computing, 11
-
S. Savage, T. Anderson, Amit Aggarwal, David Becker, N. Cardwell, Andy Collins, Eric Hoffman, John Snell, Amin Vahdat, G. Voelker, J. Zahorjan (1999)
Detour: informed Internet routing and transportIEEE Micro, 19
-
M. Naor, A. Wool (1994)
The load, capacity and availability of quorum systemsProceedings 35th Annual Symposium on Foundations of Computer Science
-
D. Gifford (1979)
Weighted voting for replicated data -
Haifeng Yu (2003)
Overcoming the Majority Barrier in Large-Scale Systems -
D. Peleg, A. Wool (1995)
The Availability of Quorum SystemsInf. Comput., 123
-
D. Malkhi, M. Reiter, A. Wool, R. Wright (1997)
Probabilistic quorum systemsInf. Comput., 170
-
S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, J. Zahorjan (1999)
Detour: A Case for Informed Internet Routing and TransportIEEE Micro, 19
-
M. Naor, Udi Wieder (2003)
Scalable and dynamic quorum systemsDistributed Computing, 17
-
M. Naor, A. Wool (1998)
The load, capacity, and availability of quorum systemsSIAM Journal on Computing, 27
-
D. Peleg, A. Wool (2002)
How to Be an Efficient Snoop, or the Probe Complexity of Quorum SystemsSIAM J. Discret. Math., 15
-
(2001)
Probabilistic Quorum Systems.The Information and Computation -
(1995)
The Availability of Quorum Systems. Information and Computation -
A trivial alteration of the probe algorithm in [10] is needed to make the results hold under our new load definition -
D. Peleg, A. Wool (1996)
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract) -
R. Bazzi (1996)
Planar quorumsTheor. Comput. Sci., 243
-
Robert Thomas (1979)
A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems (TODS), 4
-
Daniel Barbará, H. Garcia-Molina (1987)
The Reliability of Voting MechanismsIEEE Transactions on Computers, C-36
- Publisher
- Springer Journals
- Copyright
- Copyright © 2006 by Springer-Verlag
- Subject
- Computer Science; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation; Computer Communication Networks
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s00446-005-0133-8
- Publisher site
- See Article on Publisher Site
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.
Journal
Distributed Computing – Springer Journals
Published: Jan 13, 2006