Boosting system performance with optimistic distributed protocols

Back, Maribeth; Gold, Richard H.; Balsamo, Anne; Chow, Mo-Yuen; Gorbet, Matt; Harrison, Steve; MacDonald, Don; Minnerman, S.

doi:10.1109/2.970581

Cited by 28 publications

(13 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several examples of speculative protocols, distinguishing an optimistic phase from a recovery one, were discussed in the survey of Pedone [2001]. These speculation ideas were used in the context of Byzantine state machine replication, for example, in HQ [Cowling et al 2006] and Zyzzyva [Kotla et al 2010].…”

Section: Related Workmentioning

confidence: 99%

The Next 700 BFT Protocols

Aublin

Guerraoui

Knezevic

et al. 2015

ACM Trans. Comput. Syst.

113

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

Section: Related Workmentioning

confidence: 99%

The Next 700 BFT Protocols

Aublin

Guerraoui

Knezevic

et al. 2015

ACM Trans. Comput. Syst.

113

108

View full text Add to dashboard Cite

show abstract

“…Use of optimistic atomic broadcast protocols for transaction commit were proposed in [12,21]. That technique does not explore commutativity and often has considerably longer response-times in the wide-area network because of the waittime for a second verify message before the commit is final.…”

Section: Related Workmentioning

confidence: 99%

MDCC

Kraska

Pang

Franklin

et al. 2013

Proceedings of the 8th ACM European Conference on Computer Systems

147

View full text Add to dashboard Cite

Replicating data across multiple data centers allows using data closer to the client, reducing latency for applications, and increases the availability in the event of a data center failure. MDCC (Multi-Data Center Consistency) is an optimistic commit protocol for geo-replicated transactions, that does not require a master or static partitioning, and is strongly consistent at a cost similar to eventually consistent protocols. MDCC takes advantage of Generalized Paxos for transaction processing and exploits commutative updates with value constraints in a quorum-based system. Our experiments show that MDCC outperforms existing synchronous transactional replication protocols, such as Megastore, by requiring only a single message round-trip in the normal operational case independent of the master-location and by scaling linearly with the number of machines as long as transaction conflict rates permit.

show abstract

“…Examples of such service are traditional email and File Transfer. [19] Paper analyses TRUMP-A FAST reliable transport protocol for distributed system by providing selective acknowledgment and retransmission, Variable acknowledgment rates, by having the receiver acknowledge a group of data fragments and other features to improvise QoS. TRUMP provides three qualities of service: unreliable burst communications, realtime communications and reliable communications.…”

Section: Non Real Time Service (Nrts)mentioning

confidence: 99%

Presenting a New Protocol for Probabilistic Quality of Service Analysis for Distributed Control System

Gawand¹,

Murali²,

Swaminathan³

2011

IJCA

View full text Add to dashboard Cite

There has been extensive research on design, implementation and analysis of new dedicated protocols like group protocol, feasible protocol, secure protocol etc to cater communication requirement of distributed system. However there is no predefined strategy that can be readily used for protocol selection. Performance is defined as the efficient use of resources while still meeting the applications' requirement, hence this paper provide probabilistic analysis of QoS in protocol selection. Ideal protocol features are listed in this paper. Model is design for selection criteria of protocol and creating customized QoS parameter for ease in probability analysis. General TermsProbabilistic Protocol, Probabilistic QoS Protocol.

show abstract

Boosting system performance with optimistic distributed protocols

Cited by 28 publications

References 6 publications

The Next 700 BFT Protocols

The Next 700 BFT Protocols

MDCC

Presenting a New Protocol for Probabilistic Quality of Service Analysis for Distributed Control System

Contact Info

Product

Resources

About