Regeneration with virtual copies for replicated databases

The consistency control problem for replicated data in a distributed computing system (DCS) is considered. An algorithm is proposed 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 (WANs), and is able to satisfy user queries as long as there is one current partition in the system