DocumentCode
2254167
Title
Dynamic byzantine quorum systems
Author
Alvisi, Lorenzo ; Malkhi, Dahlia ; Pierce, Evelyn ; Reiter, Michael K. ; Wright, Rebecca N.
Author_Institution
Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
fYear
2000
fDate
2000
Firstpage
283
Lastpage
292
Abstract
Byzantine quorum systems 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 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
Keywords
distributed shared memory systems; fault tolerant computing; dynamic byzantine quorum systems; efficient low-threshold mode; fault-tolerant replicated services; protocols; quorum-based Byzantine fault-tolerant data service; resilience threshold; server failures; server faults; static threshold limit; Ash; Availability; Computer science; Contracts; Costs; Data security; Engineering profession; File servers; Power system modeling; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Systems and Networks, 2000. DSN 2000. Proceedings International Conference on
Conference_Location
New York, NY
Print_ISBN
0-7695-0707-7
Type
conf
DOI
10.1109/ICDSN.2000.857551
Filename
857551
Link To Document