On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Distributed agreement in the presence of processor and communication faults
IEEE Transactions on Software Engineering
Automatically increasing the fault-tolerance of distributed algorithms
Journal of Algorithms
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sequential consistency versus linearizability
ACM Transactions on Computer Systems (TOCS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Distributed Algorithms
A Layered Analysis of Consensus
SIAM Journal on Computing
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Consensus in Synchronous Systems: A Concise Guided Tour
PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Majority and unanimity in synchronous networks with ubiquitous dynamic faults
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Revisiting failure detection and consensus in omission failure environments
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Optimal randomized fair exchange with secret shared coins
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Hi-index | 0.00 |
This paper newly proposes a novel round-based synchronous system suffering crash and probabilistic omission failures. In this model, a novel class of adversaries, called p-probabilistic omission adversary (p- POA) is introduced. In addition to the ability of complete control of the crash-failure behavior, p-POA can select any subset of all transmitted messages as omission candidates. Then, each message in the omission candidates is lost with probability p. This paper investigates the feasiblity and complexity of the consensus problem under p-POA. We first show two impossibility results that (1) for any p 0, there exists no uniform consensus algorithm tolerating more than or equal to n/2 crash failures, and that (2) for any p 0, any uniform consensus algorithm cannot halt. We also show two consensus algorithms CPO and F-CPO. Both algorithms work under (1/2)-POA and respectively have distinct advantages. The algorithm CPO can tolerate at most n/2 - 1 crash failures and achieves O(f) expected round complexity, where f is the actual number of crash failures. This implies that CPO has maximum crashfailure resiliency. While the second algorithm F-CPO assumes the maximum number of crash failures less than n/3, it achieves f + O(1) round compexity in expectation. Since it is known that the lower bound for crash-tolerant consensus is f + 1, this result implies that only a constant number of extra rounds is nessesary to tolerate a drastic number of message omissions.