Regeneration with virtual copies for distributed computing systems

Author

Adam, Nabil R. ; Tewari, Rajiv

Author_Institution

MS/CIS Dept., Rutgers Univ., Newark, NJ, USA

Volume

19

Issue

6

fYear

1993

fDate

6/1/1993 12:00:00 AM

Firstpage

594

Lastpage

602

Abstract

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

Keywords

distributed databases; query processing; consistency constraints; consistency control problem; data object copies; distributed computing system; distributed databases; dynamic voting algorithms; network partitioning; node failures; regeneration mechanisms; replicated data; stochastic availability analysis; user queries; virtual copies; voting-based algorithms; wide area networks; Algorithm design and analysis; Availability; Control systems; Distributed computing; Distributed control; Heuristic algorithms; Partitioning algorithms; Stochastic processes; Voting; Wide area networks;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.232024

Filename

232024