Coda: A Highly Available File System for a Distributed Workstation Environment
IEEE Transactions on Computers
Interactive communication: balanced distributions, correlated files, and average-case complexity
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A probabilistic algorithm for updating files over a communication link
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Communication complexity of document exchange
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Thinking in C++, Vol. 2
Set reconciliation with nearly optimal communication complexity
IEEE Transactions on Information Theory
On the scalability of data synchronization protocols for PDAs and mobile devices
IEEE Network: The Magazine of Global Internetworking
BodySec: synchronized key distribution using biometric slots for wireless body sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Deciding unique decodability of bigram counts via finite automata
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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 rsync, a widely-used string reconciliation engine. We also quantify the trade-off between communication and the computation complexity of our approach.