Regeneration protocols for replicated objects

Author

Long, Darrell D E ; Päris, Jehan-Franwis

Author_Institution

Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA

fYear

1989

fDate

6-10 Feb 1989

Firstpage

538

Lastpage

545

Abstract

The read and write availabilities of replicated data managed by the regeneration algorithm, a replica control protocol based on file regeneration, are evaluated, and two regeneration protocols are presented that overcome some of its limitations. The first protocol combines regeneration and the available copy approach to improve availability of replicated data. The second combines regeneration and the dynamic voting approach to guarantee data consistency in the presence of network partitions while maintaining a high availability. Expressions for the availabilities of replicated data managed by both protocols are derived and found to improve significantly on the availability achieved using extant consistency protocols

Keywords

database theory; distributed databases; protocols; storage management; data consistency; dynamic voting; file regeneration; network partitions; regeneration algorithm; replica control protocol; replicated data; replicated objects; Access protocols; Availability; Computer network management; Computer science; Data engineering; Fault tolerant systems; Local area networks; Partitioning algorithms; Reliability engineering; Voting;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering, 1989. Proceedings. Fifth International Conference on

Conference_Location

Los Angeles, CA

Print_ISBN

0-8186-1915-5

Type

conf

DOI

10.1109/ICDE.1989.47260

Filename

47260