TY - GEN
T1 - Dynamic byzantine quorum systems
AU - Alvisi, Lorenzo
AU - Malkhi, Dahlia
AU - Pierce, Evelyn
AU - Reiter, Michael K.
AU - Wright, Rebecca N.
PY - 2000
Y1 - 2000
N2 - Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of Byzantine quorum systems is their dependence on a static threshold limit on the number of server faults. The correctness of the system is only guaranteed if the actual number of faults is lower than the threshold at all times. However, a threshold chosen for the worst case 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 quorum-based 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 low-threshold 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.
AB - Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of Byzantine quorum systems is their dependence on a static threshold limit on the number of server faults. The correctness of the system is only guaranteed if the actual number of faults is lower than the threshold at all times. However, a threshold chosen for the worst case 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 quorum-based 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 low-threshold 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.
UR - http://www.scopus.com/inward/record.url?scp=0034590169&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034590169&partnerID=8YFLogxK
U2 - 10.1109/ICDSN.2000.857551
DO - 10.1109/ICDSN.2000.857551
M3 - Conference contribution
AN - SCOPUS:0034590169
SN - 0769507085
SN - 9780769507088
T3 - Proceedings of the 2002 International Conference on Dependable Systems and Networks
SP - 283
EP - 292
BT - Proceedings of the 2002 International Conference on Dependable Systems and Networks
T2 - Proceedings of the International Conference on Dependable Systems and Networks
Y2 - 1 July 2001 through 4 July 2001
ER -