Publish-Subscribe Systems via Gossip: a Study based on Complex Networks

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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. In particular, upon reception (or generation) of a novel event, a node sends it to those neighbours whose subscriptions match that event. Moreover, the node gossips the event to its "non-interested" neighbours, so that the event can be spread through the overlay. A mathematical analysis is provided to estimate the number of nodes receiving the event, based on the network topology, the amount of subscribers and the gossip probability. 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. Hence, the use of unstructured networks. coupled with simple dissemination protocols, represents a viable approach to build peer-to-peer publish-subscribe applications.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Publish-Subscribe Systems via Gossip: a Study based on Complex Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Publish-Subscribe Systems via Gossip: a Study based on Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Publish-Subscribe Systems via Gossip: a Study based on Complex Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-139983

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.