An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Algorithms for mutual exclusion
Algorithms for mutual exclusion
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
The performance of available copy protocols for the management of replicated data
Performance Evaluation
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Analysis and Modeling of Correlated Failures in Multicomputer Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Optimal coteries and voting schemes
Information Processing Letters
On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols
IEEE Transactions on Software Engineering
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A tight upper bound on the benefits of replica control protocols
Journal of Computer and System Sciences
The availability of quorum systems
Information and Computation
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Distributed selective dissemination of information
PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
A recovery algorithm for a distributed database system
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data
IEEE Transactions on Parallel and Distributed Systems
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
Proceedings of the Sixth International Conference on Data Engineering
Load Balancing in Quorum Systems (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Membership Algorithms for Multicast Communication Groups
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
REPLICATION METHODS FOR ABSTRACT DATA TYPES
REPLICATION METHODS FOR ABSTRACT DATA TYPES
Optimal Availability Quorum Systems: Theory and Practice
Optimal Availability Quorum Systems: Theory and Practice
Optimal coteries for rings and related networks
Distributed Computing
The load, capacity and availability of quorum systems
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Dynamic voting for consistent primary components
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Decentralized replicated-object protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Consistency management in Deno
Mobile Networks and Applications
A scalable approach for broadcasting data in a wireless network
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
The costs and limits of availability for replicated services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Light-Weight Currency Management Mechanisms in Mobile and Weakly-Connected Environments
Distributed and Parallel Databases
Evaluating the running time of a communication round over the internet
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Availability Study of Dynamic Voting Algorithms
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)
Decentralized weighted voting for P2P data management
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
The costs and limits of availability for replicated services
ACM Transactions on Computer Systems (TOCS)
Characterizing resource availability in enterprise desktop grids
Future Generation Computer Systems
Glacier: highly durable, decentralized storage despite massive correlated failures
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
The obscure nature of epidemic quorum systems
Proceedings of the 9th workshop on Mobile computing systems and applications
Meaningful metrics for evaluating eventual consistency
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
The virtue of dependent failures in multi-site systems
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
DISC'05 Proceedings of the 19th international conference on Distributed Computing
D-tunes: self tuning datastores for geo-distributed interactive applications
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
| Hi-index | 0.00 |
Quorum systems serve as a basic tool providing a uniform and reliable way to achieve coordination in a distributed system. They are useful for distributed and replicated databases, name servers, mutual exclusion, and distributed access control and signatures. Traditionally, two basic methods have been used to evaluate quorum systems: the analytical approach, and simulation. We propose a third, empirical approach. We collected 6 months' worth of connectivity and operability data of a system consisting of 14 real computers using a wide area group communication protocol. The system spanned two geographic sites and three different Internet segments. We developed a mechanism that merges the local views into a unified history of the events that took place, ordered according to an imaginary global clock. We then developed a tool called the Generic Quorum-system Evaluator (GQE), which evaluates the behavior of any given quorum system over the unified, real-life history. We compared fourteen dynamic and static quorum systems. We discovered that as predicted, dynamic quorum systems behave better than static systems. However we found that many assumptions taken by the traditional approaches are unjustified: crashes are strongly correlated, network partitions do occur even within a single Internet segment, and we even detected a brief simultaneous crash of all the participating computers.