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)
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
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
The price of validity in dynamic networks
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Robust Aggregation Protocols for Large-Scale Overlay Networks
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
A Robust Protocol for Building Superpeer Overlay Topologies
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
RaWMS -: random walk based lightweight membership service for wireless ad hoc network
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Twins: A Dual Addressing Space Representation for Self-Organizing Networks
IEEE Transactions on Parallel and Distributed Systems
RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks
SRDS '07 Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems
Epidemic-Style management of semantic overlays for content-based searching
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Modelling data dissemination in opportunistic networks
Proceedings of the third ACM workshop on Challenged networks
Proceedings of the 6th workshop on Middleware for network eccentric and mobile applications
Exploiting Synergies between Coexisting Overlays
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Machine learning in disruption-tolerant MANETs
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Facilitating gossip programming with the GossipKit framework
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Energy efficient and low latency biased walk techniques for search in wireless sensor networks
Journal of Parallel and Distributed Computing
ChurnDetect: a gossip-based churn estimator for large-scale dynamic networks
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
easy-City: a route search system for public transport users
Proceedings of the Third International Workshop on Middleware for Pervasive Mobile and Embedded Computing
A survey of context data distribution for mobile ubiquitous systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Gossip protocols have emerged as a powerful technique for implementing highly scalable and robust services, such as information dissemination and aggregation. The fact that gossip protocols require very little or no structure to operate makes them particularly appealing to apply in dynamic systems, where topology changes are common (for instance, due to frequent faults or high churn rates). Therefore, gossip protocols seem particularly well fit to operate in wireless self-organizing networks. Unfortunately, these networks have a number of characteristics that impede the deployment of gossip protocols designed for wired networks. In this work we identify the inherent differences in communication between wired and wireless networks and their impact on the design and implementation of gossip protocols. In particular, our comparison includes drawing a distinction between the gossiping primitives suitable for each of these environments. In the context of this analysis, we conclude by presenting a list of open research questions.