The Load and Availability of Byzantine Quorum Systems

DOI10.1137/S0097539797325235MaRDI QIDQ4507330zbMATH OpenOpenAlexFDO

Authors Dahlia Malkhi, Michael K. Reiter, Avishai Wool

Publication date 18 October 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539797325235

zbMATH Keywords

availabilityByzantine failuresdistributed computingloadquorum systemsreplication

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Database theory (68P15) Combinatorics in computer science (68R05) Voting theory (91B12)

Recommendations

• Byzantine quorum systems
• scientific article; zbMATH DE number 1559572
• Synchronous Byzantine quorum systems
• Probabilistic quorum systems
• The Load, Capacity, and Availability of Quorum Systems

Cited in

(9)

• Byzantine quorum systems with maximum availability.
• Probabilistic quorum systems
• On quorum systems for group resources allocation
• Probabilistic Opaque Quorum Systems
• scientific article; zbMATH DE number 1950673 (Why is no real title available?)
• scientific article; zbMATH DE number 1559572 (Why is no real title available?)
• Byzantine quorum systems
• Synchronous Byzantine quorum systems
• Access cost for asynchronous Byzantine quorum systems

This page was built for publication: The Load and Availability of Byzantine Quorum Systems

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