How to assign votes in a distributed system
Journal of the ACM (JACM)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres
IEEE Transactions on Software Engineering
Social choice theory and distributed decision making
COCS '88 Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems
Stochastic Petri Net Analysis of a Replicated File System
IEEE Transactions on Software Engineering
Performance Characterization of Quorum-Consensus Algorithms for Replicated Data
IEEE Transactions on Software Engineering
Probabilistic language analysis of weighted voting algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Vote Assignments in Weighted Voting Mechanisms
IEEE Transactions on Computers
A tight upper bound on the benefits of replication and consistency control protocols
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Cost and availability tradeoffs in replicated data concurrency control
ACM Transactions on Database Systems (TODS)
Coding-Based Replication Schemes for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The load and availability of Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Recognizing Nondominated Coteries and wr-Coteries by Availability
IEEE Transactions on Parallel and Distributed Systems
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks
IEEE Transactions on Computers
Efficient generation of all regular non-dominated coteries
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Coterie Join Operation and Tree Structured k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Information and Computation
IEEE Transactions on Computers
Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data
IEEE Transactions on Knowledge and Data Engineering
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Nondominated Coteries on Graphs
IEEE Transactions on Parallel and Distributed Systems
Obtaining Coteries That Optimize the Availability of Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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)
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
Pilot: Probabilistic Lightweight Group Communication System for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Optimal coteries for rings and related networks
Distributed Computing
The costs and limits of availability for replicated services
ACM Transactions on Computer Systems (TOCS)
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Distributed Computing - Special issue: PODC 04
Counting and enumerating aggregate classifiers
Discrete Applied Mathematics
Global consistency management methods based on escrow approaches in mobile ad hoc networks
Mobile Information Systems - Mobile and Wireless Networks
Research of replication mechanism in P2P network
WSEAS Transactions on Computers
A token-based distributed algorithm for the generalized resource allocation problem
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
The virtue of dependent failures in multi-site systems
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
| Hi-index | 14.99 |
In a faulty distributed system, voting is commonly used to achieve mutual exclusion among groups of isolated nodes. Each node is assigned a number of votes, and any group with a majority of votes can perform the critical operations. Vote assignments can have a significant impact on system reliability. In this paper we address the problem of selecting vote assignments in order to maximize the probability that the critical operations can be performed at a given time by some group of nodes. We suggest simple heuristics to assign votes, and show that they give good results in most cases. We also study three particular homogeneous topologies (fully connected, Ethernet, and ring networks), and derive analytical expressions for system reliability. These expressions provide useful insights into the reliability provided by voting mechanisms.