One-step Consensus with Zero-Degradation

Dobre, Dan; Suri, Neeraj

doi:10.1109/dsn.2006.55

Cited by 17 publications

(20 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previously such one-step asynchronous consensus algorithms have been proposed for crash failure assumptions [2,3,4,5,6,7]; Friedman et al proposed a common coin-based one-step consensus algorithm that tolerates Byzantine failures and terminates with probability 1 but requires that the network scheduler has no knowledge of the common coin oracle [8]. In this paper, we consider one-step algorithms for Byzantine asynchronous consensus in the presence of a strong network adversary.…”

Section: Introductionmentioning

confidence: 99%

Bosco: One-Step Byzantine Asynchronous Consensus

Song

Renesse

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Asynchronous Byzantine consensus algorithms are an important primitive for building Byzantine fault-tolerant systems. Algorithms for Byzantine consensus typically require at least two communication steps for decision; in many systems, this imposes a significant performance overhead. In this paper, we show that it is possible to design Byzantine fault-tolerant consensus algorithms that decide in one message latency under contention-free scenarios and still provide strong consistency guarantees when contention occurs. We define two variants of one-step asynchronous Byzantine consensus and show a lower bound on the number of processors needed for each. We present a Byzantine consensus algorithm, Bosco, for asynchronous networks that meets these bounds, even in the face of a strong network adversary.

show abstract

Section: Introductionmentioning

confidence: 99%

Bosco: One-Step Byzantine Asynchronous Consensus

Song

Renesse

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Aliph uses, besides the Backup instance used in AZyzzyva (to handle the cases with asynchrony/failures), two new instances: (i) Quorum, targeted for system conditions that do not involve asynchrony/failures/contention, and (ii) Chain, targeted for high-contention conditions without asynchrony/failures. Quorum has a very low latency (like, e.g., Brasileiro et al [2001], Abd-El-Malek et al [2005], and Dobre and Suri 2006]), and it makes Aliph the first BFT protocol to achieve a latency of only two message delays with as few as 3 f + 1 servers. Chain implements a pipeline message pattern and relies on a novel authentication technique.…”

Section: Introductionmentioning

confidence: 99%

The Next 700 BFT Protocols

Aublin

Guerraoui

Knezevic

et al. 2015

ACM Trans. Comput. Syst.

110

108

View full text Add to dashboard Cite

We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike traditional state machines, allowed to abort executing a client's request if "something goes wrong."Abstract can be used to considerably simplify the incremental development of efficient Byzantine faulttolerant state machine replication (BFT) protocols that are notorious for being difficult to develop. In short, we treat a BFT protocol as a composition of Abstract instances. Each instance is developed and analyzed independently and optimized for specific system conditions. We illustrate the power of Abstract through several interesting examples.We first show how Abstract can yield benefits of a state-of-the-art BFT protocol in a less painful and errorprone manner. Namely, we develop AZyzzyva, a new protocol that mimics the celebrated best-case behavior of Zyzzyva using less than 35% of the Zyzzyva code. To cover worst-case situations, our abstraction enables one to use in AZyzzyva any existing BFT protocol.We then present Aliph, a new BFT protocol that outperforms previous BFT protocols in terms of both latency (by up to 360%) and throughput (by up to 30%). Finally, we present R-Aliph, an implementation of Aliph that is robust, that is, whose performance degrades gracefully in the presence of Byzantine replicas and Byzantine clients.

show abstract

“…The mentioned protocols suffer from collisions (which results in degraded latency) when multiple commands are sent at about the same time. In our prior work [10] we have developed consensus protocols tackling this problem and degrading gracefully in the presence of collisions. Guerraoui and Raynal [14] have developed a gracefully degrading consensus protocol that quickly chooses a value accepted by a fixed quorum.…”

Section: Related Workmentioning

confidence: 99%

HP: Hybrid Paxos for WANs

Dobre

Majuntke

Serafini

et al. 2010

2010 European Dependable Computing Conference

View full text Add to dashboard Cite

Implementing a fault-tolerant state machine boils down to reaching consensus on a sequence of commands. In wide area networks (WANs), where network delays are typically large and unpredictable, choosing the best consensus protocol is difficult. During normal operation, Classic Paxos (CP) requires three message delays, whereas Fast Paxos (FP) requires only two. However, when collisions occur, due to interfering commands issued concurrently, FP requires four extra message delays. In addition, FP uses larger quorums than CP. Therefore, CP can outperform FP in many situations. We present Hybrid Paxos (HP), a consensus protocol that combines the features of FP and CP. HP implements generalized consensus, where collisions are caused only by interfering commands. In the absence of collisions HP requires two message delays, and only one extra message delay otherwise. Our evaluation shows that when collisions are rare, the latency of HP reaches the theoretical minimum. When collisions are frequent, HP behaves like CP.

show abstract

One-step Consensus with Zero-Degradation

Abstract: Abstract

Cited by 17 publications

References 20 publications

Bosco: One-Step Byzantine Asynchronous Consensus

Bosco: One-Step Byzantine Asynchronous Consensus

The Next 700 BFT Protocols

HP: Hybrid Paxos for WANs

Contact Info

Product

Resources

About