Dynamic Byzantine quorum systems

被引：21

作者：

Alvisi, L ^{[1
]}

Malkhi, D ^{[1
]}

Pierce, E ^{[1
]}

Reiter, MK ^{[1
]}

Wright, RN ^{[1
]}

机构：

[1] Univ Texas, Dept Comp Sci, Austin, TX 78712 USA

来源：

DSN 2000: INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS | 2000年

关键词：

D O I：

10.1109/ICDSN.2000.857551

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Byzantine quorum systems [IS] 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 made with relatively small quorums in the absence of faults, increasing and decreasing the quorum size land thus the tolerance) as faults appear and are dealt with, respectively.

引用

页码：283 / 292

页数：10

共 16 条

[1]

ALVISI L, 1999, P 7 IFIP INT WORK C, P357

[2] SHIFTING GEARS - CHANGING ALGORITHMS ON THE FLY TO EXPEDITE BYZANTINE AGREEMENT [J].

BARNOY, A ;

DOLEV, D ;

DWORK, C ;

STRONG, HR .

INFORMATION AND COMPUTATION, 1992, 97 (02) :205-233

[3]

Bazzi R. A., 1997, Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, P259, DOI 10.1145/259380.259454

[4] A fault-tolerant algorithm for decentralized on-line quorum adaptation [J].

Bearden, M ;

Bianchini, RP .

TWENTY-EIGHTH ANNUAL INTERNATIONAL SYMPOSIUM ON FAULT-TOLERANT COMPUTING, DIGEST PAPERS, 1998, :262-271

[5]

Bernstein P.A., 1987, Concurrency Control and Recovery in Database Systems

[6]

Gifford D. K., 1979, Proceedings of the Seventh Symposium on Operating Systems Principles, P150, DOI 10.1145/800215.806583

[7] DYNAMIC QUORUM ADJUSTMENT FOR PARTITIONED DATA [J].

HERLIHY, M .

ACM TRANSACTIONS ON DATABASE SYSTEMS, 1987, 12 (02) :170-194

[8] ON INTERPROCESS COMMUNICATION .2. ALGORITHMS [J].

LAMPORT, L .

DISTRIBUTED COMPUTING, 1986, 1 (02) :86-101

[9]

LOTEM E, 1997, P 16 ACM S PRINC DIS

[10]

LYNCH N, 1997, P 20 ANN INT S FAULT

← 1 2 →