How to assign votes in a distributed system
Journal of the ACM (JACM)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Graphs and Hypergraphs
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks
IEEE Transactions on Computers
Byzantine quorum systems with maximum availabililty
Information Processing Letters
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Nondominated Coteries on Graphs
IEEE Transactions on Parallel and Distributed Systems
Delay Optimizations in Quorum Consensus
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Evaluating quorum systems over the Internet
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
| Hi-index | 0.01 |
Let a distributed system be represented by a graph G = (V, E), where V is the set of nodes and E is the set of communication links. A coterie is defined as a family, C, of subsets of V such that any pair of subsets in C has at least one node in common and no subset in C contains any other subset in C. Assuming that each node vi ∈ V (resp. link ej ∈ E) is operational with probability Pi (resp. rj), the availability of a coterie is defined as the probability that the operational nodes and links of G connect all nodes in at least one subset in the coterie. Although it is computationally intractable to find an optimal coterie that maximizes availability for general graph G, we show in this paper that, if G is a ring, either a singleton coterie or a 3-majority coterie is optimal. Therefore, for any ring, an optimal coterie can be computed in polynomial time. This result is extended to the more general graphs, in which each biconnected component is either an edge or a ring.