Distributed consensus

PDF Publication Title:

Distributed consensus ( distributed-consensus )

Previous Page View | Next Page View | Return to Search List

Text from PDF Page: 019

CHAPTER 1. INTRODUCTION 19 1.5.1 Publications Parts of the research described in this thesis have been published in the following peer- reviewed conference and journal papers: Heidi Howard, Dahlia Malkhi, and Alexander Spiegelman. Flexible Paxos: Quorum inter- section revisited. In Proceedings of the 20th International Conference on Principles of Distributed Systems (OPODIS), 2016 The following publications are outside scope for inclusion: Heidi Howard, Malte Schwarzkopf, Anil Madhavapeddy, and Jon Crowcroft. Raft Refloated: Do we have consensus? SIGOPS Operating Systems Review, 49(1):1221, January 2015 Amir Chaudhry, Jon Crowcroft, Heidi Howard, Anil Madhavapeddy, Richard Mortier, Hamed Haddadi, and Derek McAuley. Personal data: Thinking inside the box. In Pro- ceedings of The Fifth Decennial Aarhus Conference on Critical Alternatives, AA 15, pages 2932. Aarhus University Press, 2015 1.5.2 Follow up research This research in this thesis is by no means the final word on distributed consensus. In fact, it leaves many more doors open then it closes. Paxos revision A, which we will describe in §4.1, was published under the name Flexible Paxos and at the time of writing, follow up research and systems development by the community has already begun: 1. Formal specification of Flexible Paxos in Pluscal [Dem] and mechanised formal verification of Flexible Paxos using decidable logic [PLSS17]. 2. Consensus protocols for graphically distributed systems using Flexible Paxos’s weak- ened quorum intersection requirements such as WPaxos [ACDK17] and DPaxos [NAEA18] 3. Various implementation including Trex [Tre], a Flexible Paxos prototype for JVM and the adaption of Apache Zookeeper to use Flexible Paxos [Mel17]. 1.6 Scope & limitations Our approach has the following limitations: Byzantine fault tolerance – We assume that algorithms are implemented and executed correctly. Participants and the network between them cannot act arbitrarily or maliciously. Consensus algorithms which do not assume this are known as byzantine fault tolerant. PBFT [CL99] is an example of such an algorithm.

PDF Image | Distributed consensus

PDF Search Title:

Distributed consensus

Original File Name Searched:

UCAM-CL-TR-935.pdf

DIY PDF Search: Google It | Yahoo | Bing

Cruise Ship Reviews | Luxury Resort | Jet | Yacht | and Travel Tech More Info

Cruising Review Topics and Articles More Info

Software based on Filemaker for the travel industry More Info

The Burgenstock Resort: Reviews on CruisingReview website... More Info

Resort Reviews: World Class resorts... More Info

The Riffelalp Resort: Reviews on CruisingReview website... More Info

CONTACT TEL: 608-238-6001 Email: greg@cruisingreview.com (Standard Web Page)