Planar quorums

DOI10.1007/3-540-61769-8_17MaRDI QIDQ6570922zbMATH OpenFDO

Authors Rida A. Bazzi

Publication date 11 July 2024

zbMATH Keywords

distributed systemsfault tolerancepercolationplanar graphsquorum systemscost of failures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• Planar quorums
• The Load, Capacity, and Availability of Quorum Systems
• The availability of quorum systems
• Quorum systems constructed from combinatorial designs
• Optimal availability quorum systems: theory and practice

Cites work

• scientific article; zbMATH DE number 3826957 (Why is no real title available?)
• scientific article; zbMATH DE number 3503283 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• scientific article; zbMATH DE number 3326356 (Why is no real title available?)
• Crumbling walls
• Distributed match-making
• How to assign votes in a distributed system
• The availability of quorum systems

This page was built for publication: Planar quorums

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