This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Optimal Strategy for Comparing File Copies
January 1994 (vol. 5 no. 1)
pp. 87-93

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.

[1] D. Barbara, H. Garcia-Molina, and B. Feijoo, "Exploiting symmetries for low-cost comparison of file copies," inProc. 8th Int. Conf. Distributed Comput. Syst., June 1988.
[2] D. Barbaráand R. J. Lipton, "A class of randomized strategies for low-cost comparison of file copies,"IEEE Trans. Parallel Distributed Syst., vol. 2, pp. 160-170, Apr. 1991.
[3] E. R. Berlekamp,Algebraic Coding Theory. Laguna Hills, CA: Aegean Park Press, 1984.
[4] R. E. Blahut,Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1984.
[5] K. M. Cheung, "More on the decoder error probability for Reed-Solomon codes,"IEEE Trans. Inform. Theory, vol. 35, pp. 895-900, July 1989.
[6] W. Fuchs, K. L. Wu, and J. A. Abraham, "Low-cost comparison and diagnosis of large remotely located files," inProc. Symp. Reliability Distributed Software and Database Syst., Los Angeles, CA, 1986, pp. 67-73.
[7] R. J. McEliece and L. Swanson, "On the decoder error probability for Reed-Solomon codes,"IEEE Trans. Inform. Theory, vol. IT-32, no. 5, pp. 701-703, Sept. 1986.
[8] J. J. Metzner, "A parity structure for large remotely located replicated data files,"IEEE Trans. Comput., vol. C-32, no. 8, pp. 727-730, Aug. 1983.
[9] J. J. Metzner, "Reliable and efficient broadcast of files to a group of locally interconnected stations," inProc. GLOBECOM '86, Houston, TX, 1986, pp. 1762-1767.
[10] J. J. Metzner, "Efficient replicated remote file comparison,"IEEE Trans. Comput., vol. 40, pp. 651-660, May 1991.
[11] J. J. Metzner and E. J. Kapturowski, "A general decoding technique applicable to replicated file disagreement location and concatenated code decoding,"IEEE Trans. Inform. Theory, vol. 36, pp. 911-917, July 1990.
[12] T. Schwarz, R. W. Bowdidge, and W. A. Burkhard, "Low cost comparisons of file copies," inProc. Int. Conf. Distributed Comput. Syst., Paris, France, 1990, pp. 196-202.

Index Terms:
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
Citation:
K.A.S. Abdel-Ghaffar, A. El Abbadi, "An Optimal Strategy for Comparing File Copies," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 1, pp. 87-93, Jan. 1994, doi:10.1109/71.262591
Usage of this product signifies your acceptance of the Terms of Use.