Message complexity of hierarchical quorum consensus algorithm

DOI10.1016/0020-0190(94)00012-3MaRDI QIDQ1322113zbMATH OpenOpenAlexFDO

Authors Her-Kun Chang, S. M. Yuan

Publication date 5 May 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)00012-3

zbMATH Keywords

asymptotic analysisdistributed systemhierarchical quorum consensusmessage complexityquorum sizereplicated data

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Distributed algorithms (68W15)

Recommendations

• Optimizing the costs of hierarchical quorum consensus
• A fully distributed quorum consensus method with high fault-tolerance and low communication overhead
• scientific article; zbMATH DE number 1445804
• Delay optimization in quorum consensus
• Principles of Distributed Systems

Cited in

(4)

• Optimizing the costs of hierarchical quorum consensus
• Message and time efficient consensus protocols for synchronous distributed systems
• scientific article; zbMATH DE number 1953183 (Why is no real title available?)
• Quorum tree abstractions of consensus protocols

This page was built for publication: Message complexity of hierarchical quorum consensus algorithm

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