Voting with regenerable volatile witnesses

Voting protocols ensure the consistency of replicated objects by requiring all read and write requests to collect an appropriate quorum of replicas. It is proposed to replace some of these replicas with volatile witnesses that have no data and require no stable storage, and to regenerate them instead of waiting for recovery. The small size of volatile witnesses allows them to be regenerated much easier than full replicas. Regeneration attempts are also much more likely to succeed since volatile witnesses can be stored on diskless sites. It is shown that under standard Markovian assumptions two full replicas and one regenerable volatile witness managed by a two-tier dynamic voting protocol provide a higher data availability than three full replicas managed by majority consensus voting or optimistic dynamic voting provided site failures can be detected significantly faster than they can be repaired.<<ETX>>

[1]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[2]  Gianfranco Ciardo,et al.  Stochastic Petri Net Analysis of a Replicated File System , 1989, IEEE Trans. Software Eng..

[3]  Philip A. Bernstein,et al.  An algorithm for concurrency control and recovery in replicated distributed databases , 1984, TODS.

[4]  Darrell D. E. Long,et al.  Regeneration protocols for replicated objects , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[5]  Walter A. Burkhard,et al.  Consistency and recovery control for replicated files , 1985, SOSP 1985.

[6]  Jehan-François Pâris,et al.  Voting with Witnesses: A Constistency Scheme for Replicated Files , 1986, ICDCS.

[7]  Sushil Jajodia,et al.  Enhancements to the Voting Algorithm , 1987, VLDB.

[8]  Clarence A. Ellis,et al.  Consistency and correctness of duplicate database systems , 1977, SOSP '77.

[9]  Divyakant Agrawal,et al.  Reducing Storage for Quorum Consensus Algorithms , 1988, VLDB.

[10]  Jehan-François Pâris Efficient Voting Protocols with Witnesses , 1990, ICDT.

[11]  Calton Pu,et al.  Regeneration of Replicated Objects: A Technique and Its Eden Implementation , 1986, ICDE.

[12]  DavčevDančo,et al.  Consistency and recovery control for replicated files , 1985 .

[13]  Mostafa H. Ammar,et al.  Performance Characterization of Quorum-Consensus Algorithms for Replicated Data , 1989, IEEE Trans. Software Eng..

[14]  Darrell D. E. Long,et al.  The Performance of Available Copy Protocols for the Management of Replicated Data , 1990, Perform. Evaluation.

[15]  Hector Garcia-Molina,et al.  Increasing availability under mutual exclusion constraints with dynamic vote reassignment , 1989, TOCS.

[16]  Robbert van Renesse,et al.  Voting with ghosts , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[17]  Walter A. Burkhard,et al.  Consistency and recovery control for replicated files , 1985, SOSP '85.

[18]  Darrell D. E. Long,et al.  Estimating the Reliability of Regeneration-Based Replica Control Protocols , 1989, IEEE Trans. Computers.

[19]  Jehan-François Pâris Voting with bystanders , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.