Making distributed applications robust

Authors:
Chi Ho;Danny Dolev;Robbert Van Renesse
Affiliations:
Dept. of Computer Science, Cornell University, Ithaca, NY;School of Engineering and Computer Science, The Hebrew University of Jerusalem, Israel;Dept. of Computer Science, Cornell University, Ithaca, NY
Venue:
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Year:
2007

Citing 9
Cited 2

Asynchronous byzantine agreement protocols

Information and Computation
A Compiler that Increases the Fault Tolerance of Asynchronous Protocols

IEEE Transactions on Computers
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Automatically increasing the fault-tolerance of distributed systems

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Automatically increasing fault tolerance in distributed systems

Automatically increasing fault tolerance in distributed systems
Practical Byzantine fault tolerance

OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Simplifying fault-tolerance: providing the abstraction of crash failures

Journal of the ACM (JACM)
Uniform consensus is harder than consensus

Journal of Algorithms

Nysiad: practical protocol transformation to tolerate Byzantine failures

NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
On the (limited) power of non-equivocation

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

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.