Informed content delivery across adaptive overlay networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Bandwidth Efficient String Reconciliation Using Puzzles
IEEE Transactions on Parallel and Distributed Systems
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Efficient reconciliation and flow control for anti-entropy protocols
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Consistency-aware evaluation of OLAP queries in replicated data warehouses
Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
Feasibility of content dissemination between devices in moving vehicles
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Balancing gossip exchanges in networks with firewalls
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
Low complexity set reconciliation using Bloom filters
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
What's the difference?: efficient set reconciliation without prior context
Proceedings of the ACM SIGCOMM 2011 conference
Optimal verification of operations on dynamic sets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Synchronizing state with strong similarity between local and remote systems
Proceedings of the third ACM workshop on Mobile cloud computing and services
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 754.84 |
We consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity, which we call the set reconciliation problem. We describe an approach to set reconciliation based on a polynomial encoding of sets. The resulting protocols exhibit tractable computational complexity and nearly optimal communication complexity when the sets being reconciled are sparse. Also, these protocols can be adapted to work over a broadcast channel, allowing many clients to reconcile with one host based on a single broadcast, even if each client is missing a different subset.