Brief announcement: tolerating permanent and transient value faults

Authors:
Zarko Milosevic;Martin Hutle;André Schiper
Affiliations:
EPFL, Lausanne, Switzerland;Fraunhofer AISEC, Garching, Germany;EPFL, Lausanne, Switzerland
Venue:
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Year:
2012

Citing 10
Cited 0

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Automatically increasing the fault-tolerance of distributed algorithms

Journal of Algorithms
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Practical byzantine fault tolerance and proactive recovery

ACM Transactions on Computer Systems (TOCS)
Time is Not a Healer

STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Formally Verified Byzantine Agreement in Presence of Link Faults

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Tolerating corrupted communication

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Impossibility Results and Lower Bounds for Consensus under Link Failures

SIAM Journal on Computing
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transmission faults allow us to reason about permanent and transient value faults in a uniform way. However, all existing solutions to consensus in this model are either in the synchronous system, or require strong conditions for termination, that exclude the case where all messages of a process can be corrupted. We introduce eventual consistency in order to overcome this limitation. Eventual consistency denotes the existence of rounds in which processes receive the same set of messages. Eventually consistent rounds can be simulated from eventually synchronous rounds, and eventual consistent rounds can be used to solve consensus. Depending on the nature and number of permanent and transient transmission faults, we obtain different conditions on n, the number of processes, in order to solve consensus in our weak model.