Dynamic management of highly replicated data

An efficient replication control protocol, called the dynamic group protocol, for managing replicated data objects that have more than five replicas is presented. Like the grid protocol, the dynamic group protocol requires only O( square root n) messages per access to enforce mutual consistency among n replicas. Unlike other protocols aimed at providing fast access, this protocol adapts itself to changes in site availability and network connectivity, which allows it to tolerate n-2 successive replica failures. The availability of a replicated object consisting of n replicas managed by the dynamic group protocol when the n replicas are on the same LAN segment, is evaluated under standard Markovian assumptions and found to equal that of an object with the same number of replicas, managed by the dynamic-linear voting protocol.<<ETX>>

[1]  A EllisClarence Consistency and correctness of duplicate database systems , 1977 .

[2]  Akhil Kumar,et al.  A High Availability \sqrt{N} Hierarchical Grid Algorithm for Replicated Data , 1991, Inf. Process. Lett..

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

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

[5]  Darrell D. E. Long,et al.  A realistic evaluation of optimistic dynamic voting , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.

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

[7]  Divyakant Agrawal,et al.  The generalized tree quorum protocol: an efficient approach for managing replicated data , 1992, TODS.

[8]  Peter Triantafillou,et al.  A new paradigm for high availability and efficiency in replicated distributed databases , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

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

[10]  Calton Pu,et al.  Regeneration of replicated objects: A technique and its Eden implementation , 1986, 1986 IEEE Second International Conference on Data Engineering.

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

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

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

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

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

[16]  Akhil Kumar,et al.  Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data , 1991, IEEE Trans. Computers.

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