An Optimal Strategy for Comparing File Copies

Authors:
K. A. S. Abdel-Ghaffar;A. El Abbadi
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 2
Cited 12

Efficient Replicated Remote File Comparison

IEEE Transactions on Computers
A Class of Randomized Strategies for Low-Cost Comparison of File Copies

IEEE Transactions on Parallel and Distributed Systems

Efficient detection of corrupted pages in a replicated file

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Deterministic Voting in Distributed Systems Using Error-Correcting Codes

IEEE Transactions on Parallel and Distributed Systems
Locating Corruptions in a Replicated File in a Distributed Environment

The Journal of Supercomputing
Communication complexity of document exchange

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Location of Discrepancies in Multiple Replicated Large Files

IEEE Transactions on Parallel and Distributed Systems
Detecting Corrupted Pages in M Replicated Large Files

IEEE Transactions on Parallel and Distributed Systems
Efficient PDA Synchronization

IEEE Transactions on Mobile Computing
Locating more corruptions in a replicated file

SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient detection of discrepancies in multiple file copies

Distributed Computing
Increasing software reliability using a signature method

Information Sciences: an International Journal
Lower bounds on the deterministic and quantum communication complexities of hamming-distance problems

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.