Making distributed applications robust

Chi Ho*, Danny Dolev, Robbert Van Renesse

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

We present a novel translation of systems that are tolerant of crash failures to systems that are tolerant of Byzantine failures in an asynchronous environment, making weaker assumptions than previous approaches. In particular, we assume little about how the application is coded. The translation exploits an extension of the Srikanth-Toueg protocol, supporting ordering in addition to authentication and persistent delivery. We illustrate the approach by synthesizing a version of the Castro and Liskov Practical Byzantine Replication protocol from the Oki and Liskov Viewstamped Replication protocol.

Original languageEnglish
Title of host publicationPrinciples of Distributed Systems - 11th International Conference, OPODIS 2007, Proceedings
PublisherSpringer Verlag
Pages232-246
Number of pages15
ISBN (Print)9783540770954
DOIs
StatePublished - 2007
Event11th International Conference on Principles of Distributed Systems, OPODIS 2007 - Guadeloupe, France
Duration: 17 Dec 200720 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4878 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Principles of Distributed Systems, OPODIS 2007
Country/TerritoryFrance
CityGuadeloupe
Period17/12/0720/12/07

Keywords

  • Byzantine fault tolerance
  • Ordered broadcast

Fingerprint

Dive into the research topics of 'Making distributed applications robust'. Together they form a unique fingerprint.

Cite this