Defining weakly consistent Byzantine fault-tolerant services

Authors:
Atul Singh;Pedro Fonseca;Petr Kuznetsov;Rodrigo Rodrigues;Petros Maniatis
Affiliations:
MPI-SWS and Rice University;MPI-SWS;MPI-SWS and TU Berlin/DT Labs;MPI-SWS;Intel Research Berkeley
Venue:
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Year:
2008

Citing 10
Cited 1

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Managing update conflicts in Bayou, a weakly connected replicated storage system

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Eventually-serializable data services

Theoretical Computer Science
Distributed Algorithms

Distributed Algorithms
The Google file system

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
Bigtable: a distributed storage system for structured data

OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Dynamo: amazon's highly available key-value store

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Zeno: eventually consistent Byzantine-fault tolerance

NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation

Toward a cloud computing research agenda

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a specification for weak consistency in the context of a replicated service that tolerates Byzantine faults. We define different levels of consistency for the replies that can be obtained from such a service---we use a real world application that can currently only tolerate crash faults to exemplify the need for such consistency guarantees.