Access cost for asynchronous Byzantine quorum systems

DOI10.1007/PL00008925MaRDI QIDQ5138348zbMATH OpenOpenAlexFDO

Authors Rida A. Bazzi

Publication date 3 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00008925

zbMATH Keywords

distributed systemsfault toleranceasynchronousquorumByzantine failuresaccess cost

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• scientific article; zbMATH DE number 1559572 (Why is no real title available?)
• Byzantine quorum systems
• How to assign votes in a distributed system
• How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
• Planar quorums
• Synchronous Byzantine quorum systems
• The Load, Capacity, and Availability of Quorum Systems
• The availability of quorum systems

Cited in

(1)

• Synchronous Byzantine quorum systems

This page was built for publication: Access cost for asynchronous Byzantine quorum systems

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