Scaling Byzantine fault-tolerant replication to wide area networks

被引：25

作者：

Amir, Yair ^{[1
]}

Danilov, Claudiu ^{[1
]}

Dolev, Danny ^{[2
]}

Kirsch, Jonathan ^{[1
]}

Lane, John ^{[1
]}

Nita-Rotaru, Cristina ^{[3
]}

Olsen, Josh ^{[3
]}

Zage, David ^{[3
]}

机构：

[1] Johns Hopkins Univ, Baltimore, MD 21218 USA

[2] Hebrew Univ Jerusalem, Jerusalem, Israel

[3] Purdue Univ, W Lafayette, IN 47907 USA

来源：

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

基金：

美国国家科学基金会;

关键词：

D O I：

10.1109/DSN.2006.63

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide area sites. The architecture confines the effects of any malicious replica to its local site, reduces message complexity of wide area communication, and allows read-only queries to be performed locally within a site for the price of additional hardware. A prototype implementation is evaluated over several network topologies and is compared with a flat Byzantine fault-tolerant approach.

引用

页码：105 / 114

页数：10

共 30 条

[1]

AMIR Y, 2005, CNDS20053 J HOPKINS

[2]

AMIR Y, 2003, 20033 CNDS

[3]

[Anonymous], ACM COMPUT SURV

[4] THE N-VERSION APPROACH TO FAULT-TOLERANT SOFTWARE [J].

AVIZIENIS, A .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1985, 11 (12) :1491-1501

[5] Practical byzantine fault tolerance and proactive recovery [J].

Castro, M ;

Liskov, B .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04) :398-461

[6]

CORREIA M, 2002, P 21 S REL DISTR SYS

[7]

CUKIER M, 2002, SUPPLEMENT 2002 INT

[8]

Desmedt Y.G., 1989, CRYPTO 89 P ADV CRYP, P307

[9] AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT [J].

DOLEV, D ;

STRONG, HR .

SIAM JOURNAL ON COMPUTING, 1983, 12 (04) :656-666

[10] NOTIONS OF CONSISTENCY AND PREDICATE LOCKS IN A DATABASE SYSTEM [J].

ESWARAN, KP ;

GRAY, JN ;

LORIE, RA ;

TRAIGER, IL .

COMMUNICATIONS OF THE ACM, 1976, 19 (11) :624-633

← 1 2 3 →