Average probe complexity of non-dominated coteries (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Average probe complexity in quorum systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Access cost for asynchronous Byzantine quorum systems
Distributed Computing
Average probe complexity in quorum systems
Journal of Computer and System Sciences
| Hi-index | 0.00 |
A quorum system is a collection of non-empty sets called quorums. Any two quorums in a quorum system must have at least one element in common. Quorum systems can be used for many different applications in a distributed system. A quorum system is available, if all elements in at least one quorum are operational. Elements can be probed to determine if they are operational. A probe strategy is used to determine the order in which the elements should be probed.This paper studies the average case probe complexity, which is the expected number of probes required to determine if a given quorum system is available. Then, two new probe strategies are presented and analyzed. The first strategy is a generalization of the alternating color strategy, and the second strategy is based on a measure of the relative importance of each element in the system.