Quorum tree abstractions of consensus protocols

DOI10.1007/978-3-031-30044-8_13zbMATH Open1541.6803MaRDI QIDQ6535243FDOQ6535243

Authors: Berk Çirisci, Constantin Enea, Suha Orhun Mutluergil 

Publication date: 24 November 2023

Recommendations

• On the complexity of basic abstractions to implement consensus
• Optimizing the costs of hierarchical quorum consensus
• Paxos consensus, deconstructed and abstracted
• Message complexity of hierarchical quorum consensus algorithm
• Consensus Algorithms and the Decomposition-Separation Theorem
• A fully distributed quorum consensus method with high fault-tolerance and low communication overhead

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Dafny: an automatic program verifier for functional correctness
• Unreliable failure detectors for reliable distributed systems
• Decomposition of distributed programs into communication-closed layers
• Fast Paxos
• Linearizable implementations do not suffice for randomized distributed computation
• The Building Blocks of Consensus
• \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
• HotStuff
• Making Byzantine consensus live
• Paxos consensus, deconstructed and abstracted
• Formal verification of Multi-Paxos for distributed consensus
• Byzantizing Paxos by refinement
• Title not available (Why is that?)

Cited In (1)

• Consensus with an abstract MAC layer

This page was built for publication: Quorum tree abstractions of consensus protocols

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