Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation, however, is their dependence on a static threshold limit on the number of server faults. The correctness of the system is only guaranteed if at all times the threshold is higher than the actual number of faults, yet a conservatively chosen (high) threshold wastes expensive replication in the common situation where the number of faults averages well below the worst case. In this paper we present protocols for dynamically raising and lowering the resilience threshold of a quorumbased Byzantine fault-tolerant data service in response to current information on the number of server failures. Using such protocols, a system can operate in an efficient lowthreshold mode with relatively small quorums in the absence of faults, increasing and decreasing the quorum size (and thus the tolerance) as faults appear and are dealt with, respectively. 1
|
5824
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
1976
|
A method for obtaining digital signatures and public-key cryptosystems
– Rivest, Shamir, et al.
- 1978
|
|
1319
|
Concurrency Control and Recovery in Database Systems
– Bernstein, Hadzilacos, et al.
- 1987
|
|
1258
|
Randomized Algorithms
– Motwani, Raghavan
- 1997
|
|
1137
|
Transaction Processing: Concepts and Techniques
– Gray, Reuter
- 1993
|
|
1001
|
How to Share a Secret
– Shamir
- 1979
|
|
879
|
System Architecture Directions for Networked Sensors
– Hill, Szewczyk, et al.
- 2000
|
|
806
|
The Byzantine generals problem
– Lamport, Shostack, et al.
- 1982
|
|
784
|
Myrinet: A Gigabit-per-second Local Area Network
– Boden, Cohen, et al.
- 1995
|
|
715
|
Probability inequalities for sums of bounded random variables
– Hoeffding
- 1963
|
|
649
|
An Introduction to Probability Theory and Its
– Feller
- 1968
|
|
590
|
Transmission control protocol
– Postel
- 1981
|
|
572
|
Implementing fault-tolerant services using the state machine approach: A tutorial
– Schneider
- 1990
|
|
459
|
Weighted voting for replicated data
– Gifford
- 1979
|
|
416
|
Epidemic algorithms for replicated database maintenance
– Demers, Greene, et al.
- 1987
|
|
365
|
A Study of Branch Prediction Strategies
– Smith
- 1981
|
|
362
|
Efficient dispersal of information for security, load balancing, and fault tolerance
– Rabin
- 1989
|
|
353
|
Practical Byzantine Fault Tolerance
– Castro, Liskov
- 1999
|
|
344
|
Authentication in Distributed Systems: Theory and Practice
– Lampson, Abadi, et al.
- 1991
|
|
278
|
A majority consensus approach to concurrency control for multiple copy databases
– Thomas
- 1979
|
|
259
|
Digital Fountain Approach to Reliable Distribution of Bulk Data
– Byers, Luby, et al.
- 1998
|
|
183
|
Rover: A toolkit for mobile information access
– Joseph, deLespinasse, et al.
- 1995
|
|
178
|
A √ N Algorithm for Mutual Exclusion in Decentralized Systems
– Maekawa
- 1985
|
|
166
|
How to Assign Votes in a Distributed System
– Molina, Barbara, et al.
- 1985
|
|
160
|
Hints for Computer System Design
– Lampson
- 1983
|
|
155
|
The Bayou architecture: Support for data sharing among mobile users
– Demers, Petersen, et al.
- 1994
|
|
154
|
Secure agreement protocols: Reliable and atomic group multicast in rampart
– Reiter
- 1994
|
|
148
|
Replica control in distributed system: An asynchronous approach
– Pu, Leff
- 1991
|
|
128
|
A quorum-consensus replication method for abstract data types
– Herlihy
- 1986
|
|
128
|
Asynchronous consensus and broadcast protocols
– Bracha, Toueg
- 1985
|
|
127
|
Route Optimization
– Perkins
|
|
118
|
Atomic Snapshots of Shared Memory
– Afek, Attiya, et al.
|
|
114
|
Measuring the Capacity of a Web Server
– Banga, Druschel
- 1997
|
|
113
|
The rampart toolkit for building high-integrity services
– Reiter
- 1995
|
|
112
|
On Interprocess Communication
– Lamport
- 1986
|
|
111
|
Autonet: A high-speed, self-configuring local area network using point-to-point links
– Schroeder, Birrell, et al.
- 1991
|
|
103
|
Proactive Recovery in a Byzantine-Fault-Tolerant system
– Castro, Liskov
- 2000
|
|
96
|
The Grid Protocol: A high performance scheme for maintaining replicated data
– Cheung, Ammar, et al.
- 1992
|
|
93
|
Composite Registers
– Anderson
- 1990
|
|
91
|
Availability in partitioned, replicated databases
– ABBADI, TOUEG
|
|
80
|
Hierarchical quorum consensus: A new algorithm for managing replicated data
– Kumar
- 1991
|
|
74
|
Sharing memory robustly in message-passing systems
– Attiya, Bar-Noy, et al.
- 1995
|
|
73
|
Fast and scalable handoffs for wireless internetworks
– CACERES, PADMANABHAN
- 1996
|
|
71
|
Bounded time-stamps
– Israeli, Li
- 1993
|
|
70
|
End-to-end WAN service availability
– Chandra, Dahlin, et al.
- 2001
|
|
69
|
Epidemic algorithms in replicated databases
– Agrawal, Abbadi, et al.
- 1997
|
|
68
|
Secure and scalable replication in phalanx
– Malkhi, Reiter
- 1998
|
|
66
|
Internet privacy enhanced mail
– Kent
- 1993
|
|
66
|
Ad-hoc mobility management with uniform quorum systems
– Haas, Liang
- 1999
|
|
65
|
Chernoff-Hoeffding Bounds for Applications with Limited Independence
– Schmidt, Siegel, et al.
- 1995
|
|
