Access cost for asynchronous Byzantine quorum systems

DOI10.1007/PL00008925zbMath1448.68071OpenAlexW2093581714MaRDI QIDQ5138348

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 tolerancequorumasynchronousByzantine failuresaccess cost

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar quorums
• The availability of quorum systems
• How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
• How to assign votes in a distributed system
• The Load, Capacity, and Availability of Quorum Systems
• Synchronous Byzantine quorum systems

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