
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K.A.S. AbdelGhaffar, A. El Abbadi, "An Optimal Strategy for Comparing File Copies," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 1, pp. 8793, January, 1994.  
BibTex  x  
@article{ 10.1109/71.262591, author = {K.A.S. AbdelGhaffar and A. El Abbadi}, title = {An Optimal Strategy for Comparing File Copies}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {1}, issn = {10459219}, year = {1994}, pages = {8793}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.262591}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  An Optimal Strategy for Comparing File Copies IS  1 SN  10459219 SP87 EP93 EPD  8793 A1  K.A.S. AbdelGhaffar, A1  A. El Abbadi, PY  1994 KW  Index Termsdata integrity; ReedSolomon codes; distributed databases; fault tolerant computing;optimal strategy; comparing file copies; corrupted pages; distributed system;deterministic algorithm; ReedSolomon code VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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 ReedSolomon 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. GarciaMolina, and B. Feijoo, "Exploiting symmetries for lowcost 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 lowcost comparison of file copies,"IEEE Trans. Parallel Distributed Syst., vol. 2, pp. 160170, 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: AddisonWesley, 1984.
[5] K. M. Cheung, "More on the decoder error probability for ReedSolomon codes,"IEEE Trans. Inform. Theory, vol. 35, pp. 895900, July 1989.
[6] W. Fuchs, K. L. Wu, and J. A. Abraham, "Lowcost comparison and diagnosis of large remotely located files," inProc. Symp. Reliability Distributed Software and Database Syst., Los Angeles, CA, 1986, pp. 6773.
[7] R. J. McEliece and L. Swanson, "On the decoder error probability for ReedSolomon codes,"IEEE Trans. Inform. Theory, vol. IT32, no. 5, pp. 701703, Sept. 1986.
[8] J. J. Metzner, "A parity structure for large remotely located replicated data files,"IEEE Trans. Comput., vol. C32, no. 8, pp. 727730, 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. 17621767.
[10] J. J. Metzner, "Efficient replicated remote file comparison,"IEEE Trans. Comput., vol. 40, pp. 651660, 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. 911917, 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. 196202.