The Community for Technology Leaders
Green Image
Issue No. 11 - November (2006 vol. 17)
ISSN: 1045-9219
pp: 1217-1225
<p><b>Abstract</b>—Of considerable interest in recent years has been the problem of exchanging correlated data with minimum communication. We thus consider the problem of exchanging two similar strings held by different hosts. Our approach involves transforming a string into a multiset of substrings that are reconciled efficiently using known multiset reconciliation algorithms, and then put back together on a remote host using tools from graph theory. We present analyses, experiments, and results to show that the communication complexity of our approach for high-entropy data compares favorably to existing algorithms including <it>rsync</it>, a widely-used string reconciliation engine. We also quantify the trade-off between communication and the computation complexity of our approach.</p>
Efficient file synchronization, string reconstruction, rsync.

V. Chauhan, S. Agarwal and A. Trachtenberg, "Bandwidth Efficient String Reconciliation Using Puzzles," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 1217-1225, 2006.
95 ms
(Ver 3.3 (11022016))