Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. X, NO. X, MONTH-MONTH 200X. 1 Steward: Scaling Byzantine Fault-Tolerant
 

Summary: IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. X, NO. X, MONTH-MONTH 200X. 1
Steward: Scaling Byzantine Fault-Tolerant
Replication to Wide Area Networks
Yair Amir, Member, IEEE, Claudiu Danilov, Danny Dolev, Senior Member, IEEE
Jonathan Kirsch, Member, IEEE, John Lane, Member, IEEE, Cristina Nita-Rotaru, Member, IEEE,
Josh Olsen, and David Zage, Member, IEEE
Abstract--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 standard
hardware. We present proofs that our algorithm provides safety and liveness properties. A prototype implementation is evaluated over
several network topologies and is compared with a flat Byzantine fault-tolerant approach. The experimental results show considerable
improvement over flat Byzantine replication algorithms, bringing the performance of Byzantine replication closer to existing benign
fault-tolerant replication techniques over wide area networks.
Index Terms--Fault tolerance, scalability, wide area networks
3
1 INTRODUCTION
DURING the last few years, there has been consid-
erable progress in the design of Byzantine fault-
tolerant replication systems. Current state of the art
protocols perform very well on small-scale systems that

  

Source: Amir, Yair - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences