Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Adaptive web caching: towards a new global caching architecture
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Distributed Source Coding Using Syndromes (DISCUS): Design and Construction
DCC '99 Proceedings of the Conference on Data Compression
Exact distribution of individual displacements in linear probing hashing
ACM Transactions on Algorithms (TALG)
Rate-adaptive codes for distributed source coding
Signal Processing - Special section: Distributed source coding
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Bloom filter based routing for content-based publish/subscribe
Proceedings of the second international conference on Distributed event-based systems
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Arguments for an information-centric internetworking architecture
ACM SIGCOMM Computer Communication Review
What's the difference?: efficient set reconciliation without prior context
Proceedings of the ACM SIGCOMM 2011 conference
Noiseless coding of correlated information sources
IEEE Transactions on Information Theory
Set reconciliation with nearly optimal communication complexity
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Distributed systems such as a mobile device and its cloud storage have a strongly similar state: they are periodically synchronized, but evolve independently in between the synchronization events, sometimes in a disconnected manner that makes keeping the state consistent at both end difficult. This scenario appears in a wide range of situations, between a mobile device application and its server, in database situations. Another context is that of two routers which see similar traffic to populate their route tables and want to exchange these route tables. In all these cases, we need to periodically synchronize a local state and a remote state at the minimum possible cost in terms of bandwidth in between the two synchronization points. We consider a simple distributed source coding approach to the problem of efficient set reconciliation to support the exchange of this highly correlated caching information between a local and a remote system. We show theoretically that we can keep the amount of exchanged data proportional to the size of the cache difference; and we show by simulation that our method is practical to implement.