Publish-subscribe systems via gossip: a study based on complex networks

Authors:
Stefano Ferretti
Affiliations:
University of Bologna, Bologna, Italy
Venue:
Proceedings of the Fourth Annual Workshop on Simplifying Complex Networks for Practitioners
Year:
2012

Citing 5
Cited 3

The many faces of publish/subscribe

ACM Computing Surveys (CSUR)
Embracing the giant component

Random Structures & Algorithms
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Simulation of scale-free networks

Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Load Balancing Content-Based Publish/Subscribe Systems

ACM Transactions on Computer Systems (TOCS)

Gossiping for resource discovering: An analysis based on complex network theory

Future Generation Computer Systems
Resilience of dynamic overlays through local interactions

Proceedings of the 22nd international conference on World Wide Web companion
On the performance improvement of gossip protocols for content-based publish-subscribe through caching

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper analyzes the adoption of unstructured P2P overlay networks to build publish-subscribe systems. We consider a very simple distributed communication protocol, based on gossip and on the local knowledge each node has about subscriptions made by its neighbours. A mathematical analysis is provided to estimate the number of nodes receiving the event. These outcomes are compared to those obtained via simulation. Results show even when the amount of subscribers represents a very small (yet non-negligible) portion of network nodes, by tuning the gossip probability the event can percolate through the overlay.