Generalized Paxos made Byzantine (and less complex)

DOI10.3390/A11090141MaRDI QIDQ2633262zbMATHOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 8 May 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1708.07575

zbMATH Keywords

consensusByzantine fault tolerancePaxos

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Abstract: One of the most recent members of the Paxos family of protocols is Generalized Paxos. This variant of Paxos has the characteristic that it departs from the original specification of consensus, allowing for a weaker safety condition where different processes can have a different views on a sequence being agreed upon. However, much like the original Paxos counterpart, Generalized Paxos does not have a simple implementation. Furthermore, with the recent practical adoption of Byzantine fault tolerant protocols, it is timely and important to understand how Generalized Paxos can be implemented in the Byzantine model. In this paper, we make two main contributions. First, we provide a description of Generalized Paxos that is easier to understand, based on a simpler specification and the pseudocode for a solution that can be readily implemented. Second, we extend the protocol to the Byzantine fault model.

Recommendations

• Generalized Paxos made Byzantine (and less complex)
• Paxos consensus, deconstructed and abstracted
• A simple Byzantine generals protocol
• Brief announcement: A family of leaderless generalized-consensus algorithms
• Byzantizing Paxos by refinement

Cites work

• A technique for constructing highly available services
• Byzantizing Paxos by refinement
• Causal memory: definitions, implementation, and programming
• Fast Paxos
• Generalized Paxos made Byzantine (and less complex)
• Impossibility of distributed consensus with one faulty process
• Introduction to Reliable and Secure Distributed Programming
• On the minimal synchronism needed for distributed consensus
• Revisiting the PAXOS algorithm
• The Byzantine Generals Problem
• The part-time parliament

Cited in

(7)

• Consensus on demand
• Brief announcement: A family of leaderless generalized-consensus algorithms
• Stellar consensus by instantiation
• piChain: when a blockchain meets Paxos
• On the correctness of Egalitarian Paxos
• Generalized Paxos made Byzantine (and less complex)
• Byzantizing Paxos by refinement

Describes a project that uses

Uses Software

• Dynamo

This page was built for publication: Generalized Paxos made Byzantine (and less complex)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633262)