This Article 
 Bibliographic References 
 Add to: 
A Note on Regeneration with Virtual Copies
January 1997 (vol. 23 no. 1)
pp. 56-59

Abstract—Regeneration with Virtual Copies is a voting-based consistency control algorithm for replicated data objects in a distributed computing system. Proposed by Adam and Tewari, it utilizes selective regeneration and recovery mechanisms for maintaining the availability and consistency of copies. This paper describes some problems with the original paper and proposes solutions.

[1] N.R. Adam and R. Tewari, "Regeneration with Virtual Copies for Distributed Computing Systems," IEEE Trans. Software Eng., vol. 19, no. 6, pp. 594-602, June 1993.
[2] "Distributed File Allocation with Consistency Constraints," Proc. 12th IEEE Int'l Conf. Distributed Computing Systems, pp. 408-415, June 1992.
[3] R.J. Hilderman and H.J. Hamilton, "Performance Analysis of a Regeneration-Based Dynamic Voting Algorithm," Proc. 14th Symp. Reliable Distributed Systems, pp. 196-205, Sept. 1995.

Index Terms:
Availability, distributed computing systems, dynamic voting, mutual consistency, network partitioning, recovery, regeneration, reliability, replicated data, virtual copies.
Robert J. Hilderman, Howard J. Hamilton, "A Note on Regeneration with Virtual Copies," IEEE Transactions on Software Engineering, vol. 23, no. 1, pp. 56-59, Jan. 1997, doi:10.1109/32.581329
Usage of this product signifies your acceptance of the Terms of Use.