By Topic

Optimal detection of a corrupted page in a replicated file

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)
Abdel-Ghaffar, K.A.S. ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA ; El Abbadi, A.

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

Published in:

Distributed Computing Systems, 1994., Proceedings of the 14th International Conference on

Date of Conference:

21-24 Jun 1994