Small Byzantine Quorum Systems

Small Byzantine Quorum Systems (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jean-Philippe Martin , Lorenzo Alvisi , Michael Dahlin

Venue:	DISTRIBUTED COMPUTING
Citations:	366 - 48 self

BibTeX

@ARTICLE{Martin01smallbyzantine,
    author = {Jean-Philippe Martin and Lorenzo Alvisi and Michael Dahlin},
    title = {Small Byzantine Quorum Systems},
    journal = {DISTRIBUTED COMPUTING},
    year = {2001},
    volume = {11},
    pages = {569--578}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels---one for self-verifying data and the other for any data. Our protocols tolerate Byzantine failures with fewer servers than existing solutions by eliminating nonessential work in the write protocol and by using read and write quorums of different sizes. Since engineering a reliable network layer on an unreliable network is difficult, two other possibilities must be explored. The first is to strengthen the model by allowing synchronous networks that use time-outs to identify failed links or machines. We consider running synchronous and asynchronous Byzantine Quorum protocols over synchronous networks and conclude that, surprisingly, "self-timing" asynchronous Byzantine protocols may offer significant advantages for many synchronous networks when network time-outs are long. We show how to extend an existing Byzantine Quorum protocol to eliminate its dependency on reliable networking and to handle message loss and retransmission explicitly.

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
1439	Concurrency Control and Recovery in Database Systems - Bernstein, Hadzilacos, et al. - 1987
1404	How to share a secret - Shamir - 1979
1236	Transaction Processing: Concepts and Techniques - Gray, Reuter - 1993
1234	System architecture directions for networked sensors - Hill, Szewczyk, et al. - 2000
1069	The byzantine generals problem - Lamport, Shostak, et al. - 1982
852	Myrinet: A Gigabit-per-Second Local Area Network - Boden, Cohen, et al. - 1995
716	Implementing fault-tolerant services using the state machine approach: a tutorial - Schneider - 1990
678	Transmission control protocol - Postel - 1981
496	Weighted voting for replicated data - Gifford - 1979
476	Practical Byzantine fault tolerance - Castro, Liskov - 1999
414	Efficient dispersal of information for security, load balancing, and fault tolerance - Rabin
403	Authentication in distributed systems: Theory and practice - Lampson, Abadi, et al. - 1992
322	A digital fountain approach to reliable distribution of bulk data - Byers, Luby, et al. - 1998
289	A majority consensus approach to concurrency control for multiple copy databases - Thomas - 1979
201	A √ n algorithm for mutual exclusion in decentralized systems - Maekawa - 1985
183	The Bayou architecture: Support for data sharing among mobile users - Demers, Petersen, et al. - 1994
176	Rover: A toolkit for mobile information access - Joseph, deLespinasse, et al. - 1995
167	How to assign votes in a distributed system - Garcia-Molina, Barbara - 1985
162	Secure agreement protocols: Reliable and atomic group multicast in Rampart - Reiter - 1994
148	Atomic snapshots of shared memory - AFEK, ATTIYA, et al. - 1993
139	A quorum-consensus replication method for abstract data types - Herlihy - 1986
137	Autonet: A high-speed, self-configuring local area network using point-to-point links. IEEETrans - Schroeder, Burrows, et al. - 1991
135	The Rampart Toolkit for building high-integrity services - Reiter - 1995
132	Asynchronous consensus and broadcast protocols - Bracha, Toueg - 1985
129	On Interprocess Communication - Lamport - 1986
120	Proactive recovery in a Byzantinefault-tolerant system - Castro, Liskov - 2000
115	Measuring the Capacity of a Web Server - Banga, Druschel - 1997
108	The grid protocol: A high performance scheme for maintaining replicated data - Cheung, Ammar, et al. - 1992
101	Sharing memory robustly in message-passing systems - Attiya, Bar-Noy, et al. - 1995
96	End-to-end WAN service availability - Dahlin, Chandra, et al. - 2003
95	Composite registers - ANDERSON - 1993
91	Availability in Partitioned Replicated Databases - Abbadi, Toueg - 1986
89	Hierarchical Quorum Consensus: a new algorithm for managing replicated data - Kumar - 1991
86	The load, capacity and availability of quorum systems - Naor, Wool - 1994
83	Secure and scalable replication in phalanx - MALKHI, K - 1998
82	using abstraction to improve fault tolerance - Base
69	An efficient and fault tolerant solution for distributed mutual exclusion - Agrawal, Abbadi - 1991
68	Dynamic quorum adjustment for partitioned data - Herlihy - 1987
60	SPX : Global authentication using public key certificates - J, ALAGAPPAN - 1991
59	Internet privacy enhanced mail - Kent - 1993
59	Tolerating failures of continuous-valued sensors - Marzullo - 1990
58	The Case for Packet Level FEC - Huitema - 1997
55	On interprocess communication – part II: Algorithms - LAMPORT - 1986
55	Garcia-Molina H: The reliability of vote mechanisms - Barbara - 1987
54	Coverings and colorings of hypergraphs - Lovasz - 1973
46	Randomized Byzantine agreements - Toueg - 1984
44	The load and availability of Byzantine quorum systems - Malkhi, Reiter, et al.
43	Bounded concurrent time-stamp systems are constructible - Dolev, Shavit - 1989