Consistency-Driven Probabilistic Quorum System Construction for Improving Operation Availability

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.

[1]  Boaz Patt-Shamir,et al.  Communication-efficient probabilistic quorum systems for sensor networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[2]  Oliver E. Theel,et al.  Optimal replica control protocols exhibit symmetric operation availabilities , 1998, Digest of Papers. Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing (Cat. No.98CB36224).

[3]  Michel Raynal,et al.  Timed Quorum Systems for Large-Scale and Dynamic Environments , 2007, OPODIS.

[4]  Haifeng Yu.  Signed quorum systems , 2004, PODC '04.

[5]  Michael K. Reiter,et al.  Probabilistic quorum systems , 1997, PODC '97.

[6]  Michel Raynal,et al.  Timed Quorum System for Large-Scale Dynamic Environments , 2007 .

[7]  Wilhelm Hasselbring,et al.  Availability of Globally Distributed Nodes: An Empirical Evaluation , 2008, 2008 Symposium on Reliable Distributed Systems.

[8]  C. V. Ramamoorthy,et al.  Knowledge and Data Engineering , 1989, IEEE Trans. Knowl. Data Eng..

[9]  Oliver Theel,et al.  A quality -of-service approach for mobile users of replicated data in distributed systems , 1996 .

[10]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[11]  Mostafa H. Ammar,et al.  The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data , 1992, IEEE Trans. Knowl. Data Eng..

[12]  David Peleg,et al.  How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems , 2002, SIAM J. Discret. Math..

[13]  Divyakant Agrawal,et al.  The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data , 1990, VLDB.

[14]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.