Optimal detection of a corrupted page in a replicated file
Khaled Abdel-Ghaffar, Amr El Abbadi · 2002
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.>