Consistency-driven probabilistic quorum system construction for improving operation availability

Authors:
Kinga Kiss Iakab;Christian Storm;Oliver Theel
Affiliations:
Carl von Ossietzky University of Oldenburg, Department of Computer Science, Oldenburg, Germany and Transilvania University of Braşov, Romania;Carl von Ossietzky University of Oldenburg, Department of Computer Science, Oldenburg, Germany;Carl von Ossietzky University of Oldenburg, Department of Computer Science, Oldenburg, Germany
Venue:
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Year:
2010

Citing 11
Cited 1

Probabilistic quorum systems

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems

SIAM Journal on Discrete Mathematics
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data

IEEE Transactions on Knowledge and Data Engineering
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Optimal Replica Control Protocols Exhibit Symmetric Operation Availabilities

FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Signed quorum systems

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Communication-Efficient Probabilistic Quorum Systems for Sensor Networks

PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs

IEEE Transactions on Computers
Availability of Globally Distributed Nodes: An Empirical Evaluation

SRDS '08 Proceedings of the 2008 Symposium on Reliable Distributed Systems
Timed quorum systems for large-scale and dynamic environments

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems

Dynamic hybrid replication effectively combining tree and grid topology

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pessimistic quorum-based data replication strategies generally strive for maximizing operation availabilities while adhering to a strict consistency notion. Unfortunately, their operation availabilities are strictly upper-bounded. Probabilistically relaxing the consistency notion permits to overcome this bound, introducing probabilistic data replication strategies that allow for a data consistency vs. operation availabilities trade-off.We present two construction algorithms transforming strict quorum systems into probabilistic ones and compare them in terms of operation availabilities and degree of data consistency.