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