TR 05-029 - SCALING BYZANTINE FAULT-TOLERANT REPLICATION TO...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
SCALING BYZANTINE FAULT-TOLERANT REPLICATION TO WIDE AREA NETWORKS Yair Amir, Claudiu Danilov Danny Dolev, Jonathan Kirsch John Lane, Cristina Nita-Rotaru Josh Olsen, David Zage CSD TR #05-029 December 2005
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks Yair Amir, Claudiu Danilov, Danny Dolev, Jonathan Kirsch, John Lane, Cristina Nita-Rotaru, Josh Olsen, David Zage Abstract This paper presents the first hierarchical Byzantine 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 perfo~med 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 tolerant approach. Index Terms Byzantine Fault Tolerance, Scalability, Wide Area Networks. Contact Author Yair Amir Computer Science Department Johns Hopkins University 3400 N. Charles Street Baltimore, MD 2121 8, USA email: yairamir@cs.jhu.edu phone: 41 0-51 6-4803 Submission category: Regular Paper Word count: 10,300 This work was supported in part by grant FA8750-04-2-0232 from the Defense Advanced Research Projects Agency. Y. Amir, C. Danilov, J. Kirsch and J. Lane are with Johns Hopkins University, Baltimore, MD. tel: 410 516-5562, fax: 410 516-6134. {yairamir, claudiu, jak, johnlane) @cs.jhu.edu. D. Dolev is with The Hebrew University of Jerusalem, Jerusalem, Israel. tel: +972 2-658-41 16, fax: +972 2-5-70-90-40. dolev@cs.huji.ac.il. C. Nita-Rotaru, J. Olsen and D. Zage are with Purdue University, West Lafayette, IN. tel: 765 496-6757, fax: 765 496-3 181. {crisn, jolsen, zagedj)@cs.purdue.edu. This paper was cleared by the authors affiliations.
Background image of page 2
During the last few years, there has been considerable progress in the design of Byzantine tolerant replication systems. The current state of the art protocols perform very well on small-scale systems that are usually confined to local area networks. However, current solutions employ flat architectures that introduce several limitations: Message complexity limits their ability to scale, and strong connectivity requirements limit their availability on wide area networks that usually have lower bandwidth, higher latencies, and exhibit network partitions. This paper presents Steward, the first hierarchical Byzantine tolerant replication architecture suitable for systems that span multiple wide area sites, each consisting of several server replicas. Steward assumes no trusted component in the entire system, other than a valid mechanism to pre-distribute privatelpublic keys. Steward uses a Byzantine tolerant protocol within each site and a lightweight, benign fault tolerant protocol among wide area sites. Each site, consisting of several potentially malicious replicas, is converted into a single logical trusted participant in the wide area fault-tolerant protocol. Servers within a site run a Byzantine agreement
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/08/2011 for the course CS 525 taught by Professor Gupta during the Spring '08 term at University of Illinois, Urbana Champaign.

Page1 / 22

TR 05-029 - SCALING BYZANTINE FAULT-TOLERANT REPLICATION TO...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online