Dynamic voting

In a voting-based algorithm, a replicated file can be updated in a partition if it contains a majority of copies. In this paper, we propose an extension of this scheme which permits a file to be updated in a partition provided it contains a majority of up-to-date copies. Our scheme not only preserves mutual consistency of the replicated file, but provides improvement in its availability as well. We develop a stochastic model which gives insight into the improvements afforded by our scheme over the voting scheme.

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

[2]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[3]  Richard D. Schlichting,et al.  Fail-stop processors: an approach to designing fault-tolerant computing systems , 1981, TOCS.

[4]  H KohlerWalter.  A Survey of Techniques for Synchronization and Recovery in Decentralized Computer Systems , 1981 .

[5]  Derek L. Eager,et al.  Achieving robustness in distributed database systems , 1983, TODS.

[6]  Brian A. Coan,et al.  Limitations on database availability when networks partition , 1986, PODC '86.

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

[8]  Michael Stonebraker,et al.  A Formal Model of Crash Recovery in a Distributed System , 1983, IEEE Transactions on Software Engineering.

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

[10]  Amr El Abbadi,et al.  Availability in partitioned replicated databases , 1985, PODS.

[11]  Sushil Jajodia,et al.  Mutual consistency in decentralized distributed systems , 1987, 1987 IEEE Third International Conference on Data Engineering.

[12]  Toshimi Minoura,et al.  Resilient Extended True-Copy Token Scheme for a Distributed Database System , 1982, IEEE Transactions on Software Engineering.

[13]  David Dixon Wright,et al.  Managing Distributed Databases in Partitioned Networks , 1984 .

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

[15]  Alley Stoughton,et al.  Detection of Mutual Inconsistency in Distributed Systems , 1983, IEEE Transactions on Software Engineering.

[16]  Susan B. Davidson,et al.  Optimism and consistency in partitioned distributed database systems , 1984, TODS.

[17]  David D. Wright,et al.  On merging partitioned databases , 1983, SIGMOD '83.

[18]  J. D. Day,et al.  A principle for resilient sharing of distributed resources , 1976, ICSE '76.

[19]  Flaviu Cristian,et al.  An efficient, fault-tolerant protocol for replicated data management , 1985, Fault-Tolerant Distributed Computing.

[20]  Hector Garcia-Molina,et al.  Protocols for dynamic vote reassignment , 1986, PODC '86.

[21]  K. V. S. Ramarao,et al.  Detection of mutual inconsistency in Distributed Databases , 1987, 1987 IEEE Third International Conference on Data Engineering.

[22]  Sushil Jajodia.  Managing replicated files in partitioned distributed database systems , 1987, 1987 IEEE Third International Conference on Data Engineering.

[23]  Philip A. Bernstein,et al.  Concurrency Control in Distributed Database Systems , 1986, CSUR.

[24]  Michael J. Fischer,et al.  Sacrificing serializability to attain high availability of data in an unreliable network , 1982, PODS.

[25]  Amr El Abbadi,et al.  Maintaining availability in partitioned replicated databases , 1987, ACM Trans. Database Syst..

[26]  Dale Skeen,et al.  Increasing availability in partitioned database systems , 1984, Adv. Comput. Res..

[27]  Hector Garcia-Molina,et al.  Consistency in a partitioned network: a survey , 1985, CSUR.