By Topic

Regeneration with virtual copies for replicated databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Adam, N.R. ; Graduate Sch. of Manage., Rutgers Univ., Newark, NJ, USA ; Tewari, R.

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

Published in:

Distributed Computing Systems, 1991., 11th International Conference on

Date of Conference:

20-24 May 1991