DocumentCode :
1941693
Title :
Optimal detection of a corrupted page in a replicated file
Author :
Abdel-Ghaffar, Khaled A S ; El Abbadi, Amr
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA
fYear :
1994
fDate :
21-24 Jun 1994
Firstpage :
544
Lastpage :
551
Abstract :
The problem of detecting a corrupted page in a file with multiple copies is addressed. A lower bound is derived on the communication overhead and a protocol is developed that requires exactly the amount of communication specified by the lower bound. The lower bound and the protocol are the first optimality results for the detection of a corrupted page in a file with more than two copies
Keywords :
data integrity; distributed databases; fault tolerant computing; protocols; storage management; communication overhead; corrupted page; distributed systems; fault-tolerance; lower bound; multiple copies; protocol; replicated file; replication; Availability; Computer science; Fault detection; Fault tolerant systems; Geographic Information Systems; H infinity control; Protocols;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 1994., Proceedings of the 14th International Conference on
Conference_Location :
Pozman
Print_ISBN :
0-8186-5840-1
Type :
conf
DOI :
10.1109/ICDCS.1994.302467
Filename :
302467
Link To Document :
بازگشت