This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Regeneration with Virtual Copies for Distributed Computing Systems
June 1993 (vol. 19 no. 6)
pp. 594-602

The authors consider the consistency control problem for replicated data in a distributed computing system (DCS) and propose a new algorithm to dynamically regenerate copies of data objects in response to node failures and network partitioning in the system. The DCS is assumed to have strict consistency constraints for data object copies. The algorithm combines the advantages of voting-based algorithms and regeneration mechanisms to maintain mutual consistency of replicated data objects in the case of node failures and network partitioning. The algorithm extends the feasibility of regeneration to DCS on wide area networks and is able to satisfy user queries as long as there is one current partition in the system. A stochastic availability analysis of the algorithm shows that it provides improved availability as compared to previously proposed dynamic voting algorithms.

[1] N. R. Adam and R. Tewari, "Regeneration with virtual copies for replicated databases," inProc. 11th IEEE Int. Conf. Distributed Comput. Syst., May 1991, pp. 429-436.
[2] P. A. Bernstein and N. Goodman, "An algorithm for concurrency control and recovery in replicated distributed databases,"ACM Trans. Database Syst., vol. 9, no. 4, pp. 596-615, Dec. 1984.
[3] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[4] B. Bhargava and Z. Ruan, "Site recovery in replicated distributed database systems," inProc. 6th IEEE Conf. Distributed Comput. Syst., May 1986, pp. 621-627.
[5] R. G. Casey, "Allocation of copies of a file in an information network," inAFIPS Conf. Proc., 1972, pp. 617-625.
[6] D. Davcev and W. Burkhard, "Consistency and recovery control for replicated files," inProc. 10th Symp. Operating System Principles, Orcas Island, WA, Dec. 1985, pp. 87-96.
[7] B. Gavish and H. Pirkul, "Computer and database location in distributed computer systems,"IEEE Trans. Comput., vol. C-35, no. 7, pp. 583-590, July 1986.
[8] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[9] C. L. Huang and V. O. K. Li, "Regeneration-based multiversion dynamic voting scheme for replicated database systems," inProc. 6th IEEE Conf. Data Eng., 1990, pp. 370-377.
[10] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227-238.
[11] S. Jajodia and D. Mutchler, "Integrating static and dynamic voting protocols to enhance file availability," inProc. 4th IEEE Int. Conf. Data Eng., 1988, pp. 144-153.
[12] S. Jajodia and D. Mutchler, "A pessimistic consistency control algorithm for replicated files which achieves high availability,"IEEE Trans. Software Eng., vol. 15, no. 1, pp. 39-46, Jan. 1989.
[13] S. Jajodia and D. Mutchler, "Dynamic voting algorithms for maintaining consistency of a replicated database,"ACM Trans. Database Syst., vol. 15, no. 2, June 1990.
[14] D. E. Long and J. L. Carroll, "Regeneration protocols for replicated objects," inProc. 5th IEEE Conf. Data Eng., 1989, pp. 538-454.
[15] D. E. Long and J. L. Carroll, "The reliability of regeneration-based replica control protocols," inProc. 9th IEEE Conf. Distributed Comput. Syst., 1989, pp. 465-473.
[16] S. Mahmoud and J. S. Riordan, "Optimal allocation of resources in distributed information networks,"ACM Trans. Database Syst., vol. 1, no. 1, pp. 66-78, Mar. 1976.
[17] H. L. Morgan and K. D. Levin, "Optimal program and data locations in computer networks,"Commun. ACM, vol. 20, no. 5, pp. 315-322, May 1977.
[18] J. F. Paris, "Voting with witnesses: A consistency scheme for replicated files," inProc. 6th IEEE Conf. Distributed Comput. Syst., 1986, pp. 606-612.
[19] C. Pu, J. D. Noe, and A. Proudfoot, "Regeneration of replicated objects: A technique and its Eden implementation,"IEEE Trans. Software Eng., vol. 14, no. 7, pp. 936-945, July 1988.
[20] R. V. Renesse and A. S. Tanenbaum, "Voting with ghosts," inProc. 8th IEEE Conf. Distributed Comput. Syst., 1988, pp. 456-462.
[21] R. Tewari, "Robustness in replicated databases," Ph.D. dissertation, Rutgers Univ., 1990.
[22] R. Tewari and N. R. Adam, "Distributed file allocation with consistency constraints," inProc. 12th IEEE Int. Conf. Distributed Comput. Syst., June 1992.
[23] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.
[24] J. D. Ullman,Database and Knowledge-base Systems. Rockville, MD: Computer Science Press, 1988.

Index Terms:
distributed databases; virtual copies; consistency control problem; replicated data; distributed computing system; node failures; network partitioning; consistency constraints; data object copies; voting-based algorithms; regeneration mechanisms; wide area networks; user queries; stochastic availability analysis; dynamic voting algorithms; distributed databases; query processing
Citation:
N.R. Adam, R. Tewari, "Regeneration with Virtual Copies for Distributed Computing Systems," IEEE Transactions on Software Engineering, vol. 19, no. 6, pp. 594-602, June 1993, doi:10.1109/32.232024
Usage of this product signifies your acceptance of the Terms of Use.