Synchronous Byzantine quorum systems

DOI10.1145/259380.259454MaRDI QIDQ5361489zbMATH OpenOpenAlexFDO

Authors Rida A. Bazzi

Publication date 29 September 2017

Published in Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/259380.259454

zbMATH Keywords

Byzantine failuresdistributed systemsfault toleranceloadquorum systems

Mathematics Subject Classification ID

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

Cited in

(4)

• Probabilistic quorum systems
• A fault detection mechanism in Erasure-code Byzantine Fault-tolerance Quorum
• Synchronous Byzantine quorum systems
• Access cost for asynchronous Byzantine quorum systems

This page was built for publication: Synchronous Byzantine quorum systems

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