Optimal early stopping uniform consensus in synchronous systems with process omission failures

Parvédy, Philippe Raïpin; Raynal, Michel

doi:10.1145/1007912.1007963

Cited by 29 publications

(18 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Perry and Toueg [23] focused on marching the number of rounds in weaker fault models. This approach was later followed by Parvedy and Raynal [21] as well.…”

Section: Related Workmentioning

confidence: 99%

“…Hence, in particular all lower bounds for crash faults apply. Parvedy and Raynal [21] give an algorithm for uniform consensus that matches the decision and stopping time lower bounds of min{f + 2, t + 1}. The algorithm has message complexity O(n 2 f ), but its optimality is not immediate since our lower bound for crash faults requires decision in f + 1 rounds.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Early-deciding consensus is expensive

Dolev

Lenzen

2013

Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

In consensus, the n nodes of a distributed system seek to take a consistent decision on some output, despite up to t of them crashing or even failing maliciously, i.e., behaving "Byzantine". It is known that it is impossible to guarantee that synchronous, deterministic algorithms consistently decide on an output in fewer than f + 1 rounds in executions in which the actual number of faults is f ≤ t. This even holds if faults are crash-only, and in this case the bound can be matched precisely. However, the question of whether this can be done efficiently, i.e., with little communication, so far has not been addressed.In this work, we show that algorithms tolerating Byzantine faults and deciding within f + 2 rounds must send Ω(nt + t 2 f ) messages; as a byproduct, our analysis shows that decision within f +1 rounds is impossible in this setting (unless f = t). Moreover, we prove that any crash-resilient algorithm deciding in f + 1 rounds has worst-case message complexity Ω(n 2 f ). Interestingly, this changes drastically if we restrict the fault model further. If crashes are orderly, i.e., in each round, each node picks an order in which its messages are sent, and crashing nodes successfully transmit a prefix of their sequence, deciding in f + 1 rounds can be guaranteed with O(nt) messages. Categories and Subject Descriptors General TermsAlgorithms, Reliability, Theory Keywords lower bounds; cubic message complexity; Byzantine faults; crash faults; early-stopping Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit

show abstract

“…Perry and Toueg [23] focused on marching the number of rounds in weaker fault models. This approach was later followed by Parvedy and Raynal [21] as well.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Early-deciding consensus is expensive

Dolev

Lenzen

2013

Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Thambidurai and Park [24], and independently Garay and Perry [14], introduced the concept of hybrid failure model which allows a mix of different degrees of failures. Our second assumption can be viewed as assuming a mix of omission [21,20] and Byzantine failures, which is a more general assumption than the previous ones considered in the literature.…”

Section: Discussion Of Our Model and Related Workmentioning

confidence: 99%

Secure Computation with Partial Message Loss

Koo

2006

Theory of Cryptography

View full text Add to dashboard Cite

Abstract. Existing communication models for multiparty computation (MPC) either assume that all messages are delivered eventually or any message can be lost. Under the former assumption, MPC protocols guaranteeing output delivery are known. However, this assumption may not hold in some network settings like the Internet where messages can be lost due to denial of service attack or heavy network congestion. On the other hand, the latter assumption may be too conservative. Known MPC protocols developed under this assumption have an undesirable feature: output delivery is not guaranteed even only one party suffers message loss.In this work, we propose a communication model which makes an intermediate assumption on message delivery. In our model, there is a common global clock and three types of parties: (i) Corrupted parties (ii) Honest parties with connection problems (where message delivery is never guaranteed) (iii) Honest parties that can normally communicate but may lose a small fraction of messages at each round due to transient network problems. We define secure MPC under this model. Output delivery is guaranteed to type (ii) parties that do not abort and type (iii) parties.Let n be the total number of parties, e f and ec be upper bounds on the number of corrupted parties and type (ii) parties respectively. We construct a secure MPC protocol for n > 4e f + 3ec. Protocols for broadcast and verifiable secret sharing are constructed along the way.

show abstract

“…It has been shown that fault-tolerant consensus cannot be achieved in ≤ t + 1 rounds using deterministic algorithms in synchronous systems [89]. That is, the lower bound of round complexity is min{t + 2, f + 1} for crash faults [75], omission fault [106], and Byzantine faults [55]. In [55], Dolev and Lenzen proposed a new property, namely early-deciding, which requires fault-free nodes to decide early but the decided nodes may continue to send messages in to help other undecided nodes.…”

Section: Enriched Propertiesmentioning

confidence: 99%

Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Tseng

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Fault-tolerant consensus has been studied extensively in the literature, because it is one of the most important distributed primitives and has wide applications in practice. This paper surveys important results on fault-tolerant consensus in message-passing networks, and the focus is on results from the past decade. Particularly, we categorize the results into two groups: new problem formulations and practical applications. In the first part, we discuss new ways to define the consensus problem, which includes larger input domains, link fault models, different network models . . . etc, and briefly discuss the important techniques. In the second part, we focus on Crash Fault-Tolerant (CFT) systems that use Paxos or Raft, and Byzantine Fault-Tolerant (BFT) systems. We also discuss Bitcoin, which can be related to solving Byzantine consensus in anonymous systems, and compare Bitcoin with BFT systems and Byzantine consensus.

show abstract

Optimal early stopping uniform consensus in synchronous systems with process omission failures

Cited by 29 publications

References 15 publications

Early-deciding consensus is expensive

Early-deciding consensus is expensive

Secure Computation with Partial Message Loss

Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Contact Info

Product

Resources

About