Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
An Efficient SuperGrid Protocol for High Availability and Load Balancing
IEEE Transactions on Computers
Average probe complexity in quorum systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Information and Computation
A Dynamic Primary Configuration Group Communication Service
Proceedings of the 13th International Symposium on Distributed Computing
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Revisiting Hierarchical Quorum Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Secure reliable multicast protocols in a WAN
Distributed Computing
Synchronous Byzantine quorum systems
Distributed Computing
Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Access cost for asynchronous Byzantine quorum systems
Distributed Computing
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Scalable and dynamic quorum systems
Distributed Computing
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Average probe complexity in quorum systems
Journal of Computer and System Sciences
Randomized registers and iterative algorithms
Distributed Computing
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
Distributed Computing - Special issue: PODC 04
Dynamic quorums for DHT-based enterprise infrastructures
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Harnessing the power of DHTs to build dynamic quorums in large-scale enterprise infrastructures
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
A General Approach to Analyzing Quorum-Based Heterogeneous Dynamic Data Replication Schemes
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
A quorum-based framework for establishing control channels in dynamic spectrum access networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Efficient Hierarchical Quorums in Unstructured Peer-to-Peer Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Timed quorum systems for large-scale and dynamic environments
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
The building blocks of consensus
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
An approach to reduce the energy cost of the arbitrary tree replication protocol
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
The virtue of dependent failures in multi-site systems
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
Quorum-based dynamic regular registers in systems with churn
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Byzantine and multi-writer k-quorums
DISC'06 Proceedings of the 20th international conference on Distributed Computing
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On the availability of non-strict quorum systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The dynamic and-or quorum system
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Replication techniques for availability
Replication
Probabilistically bounded staleness for practical partial quorums
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mutual exclusion, data replication, and dissemination of information.Given a strategy to pick quorums, the load LS is the minimal access probability of the busiest element, minimizing over the strategies. The capacity \capS\ is the highest quorum accesses rate that cS can handle, so $\capS=1/\LS$.The availability of a quorum system cS is the probability that at least one quorum survives, assuming that each element fails independently with probability p. A tradeoff between LS and the availability of cS is shown.We present four novel constructions of quorum systems, all featuring optimal or near optimal load, and high availability. The best construction, based on paths in a grid, has a load of $O(1/\sqn)$, and a failure probability of $\exp(-\Omega(\sqn))$ when the elements fail with probability $p