(Enter summary)
Abstract: Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers, and achieve consistency across accesses by requiring any two quorums to intersect. Recently, b-masking quorum systems, whose intersections contain at least 2b 1 servers, have been proposed to construct replicated services tolerant of b arbitrary (Byzantine) server failures. In this paper we consider a hybrid fault model allowing benign failures in addition to the Byzantine ones. ... (Update)
Cited by: More
Byzantine Fault-Tolerant Confidentiality - Jian Yin Arun (2002)
(Correct)
Fault-Scalable Byzantine Fault-Tolerant Services - Michael Abd-El-Malek Gregory
(Correct)
Quorum Placement in Networks to Minimize Access Delays - Gupta, Maggs, Oprea, Reiter (2005)
(Correct)
Active bibliography (related documents): More All
2.2: Optimal Byzantine Quorum Systems - Malkhi, Reiter, Wool (1997)
(Correct)
0.8: The Load, Capacity and Availability of Quorum Systems - Naor, Wool (1998)
(Correct)
0.8: The Availability of Quorum Systems - Peleg, Wool (1993)
(Correct)
Similar documents based on text: More All
0.8: Probabilistic Byzantine Quorum Systems - Malkhi, Reiter, Wool, Wright (1998)
(Correct)
0.7: Dynamic Byzantine Quorum Systems - Alvisi, Malkhi, Pierce, Reiter.. (2000)
(Correct)
0.7: Byzantine Quorum Systems - Malkhi, Reiter (1998)
(Correct)
Related documents from co-citation: More All
37: Byzantine quorum systems
- Malkhi, Reiter - 1997
21: Practical Byzantine fault tolerance
- Castro, Liskov - 1999
20: Synchronous Byzantine quorum systems (context) - Bazzi - 1997
BibTeX entry: (Update)
D. Malkhi, M. Reiter, and A. Wool. The load and availability of Byzantine quorum systems. In Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, pages 249--257, August 1997. http://citeseer.ist.psu.edu/malkhi97load.html More
@article{ mrw00,
author = {D. Malkhi and M. Reiter and A. Wool},
title = {The Load and Availability of {Byzantine} Quorum Systems},
year = 2000,
journal = "SIAM J. Computing",
volume = 29,
number = 6,
pages = {1889--1906},
url = {citeseer.ist.psu.edu/malkhi97load.html} }
Citations (may not include all citations):
291
Weighted voting for replicated data
- Gifford - 1979
189
A majority consensus approach to concurrency control for mul.. (context) - Thomas - 1979
141
Byzantine quorum systems
- Malkhi, Reiter - 1997
126
algorithm for mutual exclusion in decentralized systems (context) - Maekawa - 1985
111
How to assign votes in a distributed system (context) - Garcia-Molina, Barbara - 1985
98
Springer-Verlag (context) - Grimmett - 1989
97
Combinatorial Theory (context) - Hall - 1986
92
The grid protocol: A high performance scheme for maintaining..
- Cheung, Ammar et al. - 1992
85
Statistical Theory of Reliability and Life Testing (context) - Barlow, Proschan - 1975
79
A quorum-consensus replication method for abstract data type.. (context) - Herlihy - 1986
72
Hierarchical quorum consensus: A new algorithm for managing .. (context) - Kumar - 1991
58
Percolation Theory for Mathematicians (context) - Kesten - 1982
57
Maintaining availability in partitioned replicated databases (context) - El-Abbadi, Toueg - 1989
51
An efficient and fault-tolerant solution for distributed mut.. (context) - Agrawal, El-Abbadi - 1991
44
A formally verified algorithm for interactive consistency un..
- Lincoln, Rushby - 1993
40
The critical probability of bond percolation on the square l.. (context) - Kesten - 1980
39
How to securely replicate services (context) - Reiter, Birman - 1994
28
Information and Computation (context) - Peleg, Wool et al. - 1995
24
Coincidence of critical points in percolation problems (context) - Menshikov - 1986
21
Crumbling walls: A class of practical and efficient quorum s.. (context) - Peleg, Wool - 1997
21
a sharp transition from area law to perimeter law in a syste.. (context) - Aizenman, Chayes et al. - 1983
20
hierarchical grid algorithm for replicated data (context) - Kumar, Cheung et al. - 1991
19
A faulttolerant algorithm for replicated data management (context) - Rangarajan, Setia et al. - 1992
17
capacity and availability of quorum systems (context) - Naor, Wool - 1994
16
A performance study of general grid structures for replicate.. (context) - Kumar, Rabinovich et al. - 1993
16
The reliability of vote mechanisms (context) - Barbara, Garcia-Molina - 1987
15
Formal verification of an interactive consistency algorithm ..
- Lincoln, Rushby - 1994
11
The triangular lattice protocol: A highly fault tolerant pro.. (context) - Wu, Belford - 1992
8
a la probabilit (context) - Condorcet, l'application
7
Construction methods for quorum systems (context) - Marcus, Peleg - 1992
7
Quorum Systems for Distributed Control Protocols (context) - Wool - 1996
7
Quorum Structures in Distributed Systems
- Neilsen - 1992
7
Planar quorums (context) - Bazzi - 1996
4
The vulnerability of vote assignments (context) - Barbara, Garcia-Molina - 1986
4
The availability of crumbling wall quorum systems (context) - Peleg, Wool - 1997
4
Coterie join algorithm
- Neilsen, Mizuno - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.att.com/~dalia/): More
Uniform Actions in Asynchronous Distributed Systems.. - Malki, Birman.. (1994)
(Correct)
Secure Reliable Multicast Protocols in a WAN - Dahlia Malkhi (1997)
(Correct)
Uniform Actions in Asynchronous Distributed Systems - Malki, Birman, Ricciardi.. (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC