Generalized Paxos made Byzantine (and less complex)

DOI10.3390/a11090141zbMath1461.68038arXiv1708.07575OpenAlexW2746579076MaRDI QIDQ2633262

Yanyan Li

Publication date: 8 May 2019

Published in: Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

consensusByzantine fault tolerancePaxos

Mathematics Subject Classification ID

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

Related Items (1)

Consensus on demand

Uses Software

• Dynamo

Cites Work

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

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