Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Grapevine: an exercise in distributed computing
Communications of the ACM
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
A Gossip-Based Reliable Multicast for Large-Scale High-Throughput Applications
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scalable and Secure Resource Location
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 4 - Volume 4
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Evaluation of gossip to build scalable and reliable multicast protocols
Performance Evaluation - Special issue: Distributed systems performance
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Drinking from the firehose: multicast USENET news
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Faster coupon collecting via replication with applications in gossiping
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneously deliver all chunks to all nodes. Here we explore the inter-operation between the gossip of multiple, simultaneous message-chunks. In this setting, interacting nodes must select which chunk, among many, to exchange in every communication round. We provide an efficient solution that possesses the inherent robustness and scalability of gossip. Our approach maintains the simplicity of gossip, and has low message, connections and computation overhead. Because our approach differs from solutions proposed by network coding, we are able to provide insight into the tradeoffs and analysis of the problem of collaborative content distribution. We formally analyze the performance of the algorithm, demonstrating its efficiency with high probability.