The Load, Capacity, and Availability of Quorum Systems
From MaRDI portal
Publication:4388880
DOI10.1137/S0097539795281232zbMath0911.60080MaRDI QIDQ4388880
Publication date: 10 May 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Linear programming (90C05) Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Voting theory (91B12) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Reliability and life testing (62N05) Distributed algorithms (68W15)
Related Items (19)
Optimal availability quorum systems: theory and practice ⋮ Signed quorum systems ⋮ On quorum systems for group resources allocation ⋮ Load balancing in quorum systems ⋮ Randomized registers and iterative algorithms ⋮ Probabilistic quorums for dynamic systems ⋮ Crumbling walls: a class of practical and efficient quorum systems ⋮ Secure reliable multicast protocols in a WAN ⋮ Synchronous Byzantine quorum systems ⋮ Access cost for asynchronous Byzantine quorum systems ⋮ \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks ⋮ Relative blocking in posets ⋮ The availability of crumbling wall quorum systems ⋮ Refined quorum systems ⋮ Scalable and dynamic quorum systems ⋮ Average probe complexity in quorum systems ⋮ Planar quorums ⋮ Quorum systems constructed from combinatorial designs ⋮ Probabilistic quorum systems
This page was built for publication: The Load, Capacity, and Availability of Quorum Systems
