The Community for Technology Leaders
Green Image
<p>We study the problem of identifying corrupted pages between two remotely locatedcopies of a file in a distributed system. An efficient deterministic algorithm is presented to identify up to any given number of differing pages. The algorithm requires a singleexchange of messages and is based on the structure of the Reed-Solomon code. In orderto identify up to f corrupted pages, 2f signatures are transmitted. The algorithm requiresless communication costs than previously proposed solutions. In fact, we prove that ouralgorithm is optimal, in the sense that no other algorithm is guaranteed to identify withprobability 1 the corrupted pages by exchanging less information.</p>
Index Termsdata integrity; Reed-Solomon codes; distributed databases; fault tolerant computing;optimal strategy; comparing file copies; corrupted pages; distributed system;deterministic algorithm; Reed-Solomon code

K. Abdel-Ghaffar and A. El Abbadi, "An Optimal Strategy for Comparing File Copies," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 87-93, 1994.
90 ms
(Ver 3.3 (11022016))