Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
IEEE/ACM Transactions on Networking (TON)
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Informed content delivery across adaptive overlay networks
IEEE/ACM Transactions on Networking (TON)
Information Processing Letters
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
High-bandwidth data dissemination for large-scale distributed systems
ACM Transactions on Computer Systems (TOCS)
Less hashing, same performance: Building a better Bloom filter
Random Structures & Algorithms
Cassandra: a decentralized structured storage system
ACM SIGOPS Operating Systems Review
Real-world performance of current proactive multi-hop mesh protocols
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Set reconciliation with nearly optimal communication complexity
IEEE Transactions on Information Theory
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
In many distributed protocols efficient synchronization of data elements is a determining factor for both bandwidth usage and computational requirements. Earlier works have shown that by using error correcting codes and probabilistic membership tests, sets can be reconciled with near optimal bandwidth complexity. In this paper, we propose an alternative method with low computational requirements. Although the bandwidth requirements are not optimal, we show that our mechanism performs well when the number of differences between the sets are unknown. As the mechanism requires very little state information to be transferred, any node may reply to synchronization requests after receiving a single message. This enables fast synchronization in dynamic networks, as well as simultaneous synchronization of multiple nodes within radio broadcast range. We expect these properties to be desirable for many applications in mobile environments.