Issue No.11 - November (2006 vol.17)
Sachin Agarwal , IEEE
Ari Trachtenberg , IEEE
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.148
<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.
Sachin Agarwal, Vikas Chauhan, Ari Trachtenberg, "Bandwidth Efficient String Reconciliation Using Puzzles", IEEE Transactions on Parallel & Distributed Systems, vol.17, no. 11, pp. 1217-1225, November 2006, doi:10.1109/TPDS.2006.148