Publishers and subscribers are unaware of each other; messages are dynamically routed by the event service based on message content, as well as on the pattern.

Loosely coupled applications can take advantage of the publish/subscribe communication paradigm. In this latter, subscribers declare which events, ...

Instead of attempting to statically optimize the DR-tree, we give an on-line algorithm, the work function algorithm, which continually changes the DR-tree in ...

Instead of attempting to statically optimize the DR-tree, we give an on-line algorithm, the work function algorithm, which continually changes the DR-tree in ...

In the optimization phase, Corona nodes apply the optimiza- tion algorithm on fine-grained tradeoff data for locally polled channels and coarse-grained tradeoff ...

An optimization for reducing subscription dissemination traffic is to exploit “covering” relationship between a pair of subscriptions. In this case, if a new ...

In this paper, we propose SELECTinCN (Select in Community Networks), which enhances the overlay creation for pub/sub systems over peer-to-peer (P2P) networks.

Conclusions. In this paper, we study a new optimization problem (Low-TCO) that constructs a practical and scalable overlay network for publish/subscribe ...

Optimization process happens mainly on constructed overlay, in which nodes are randomly connected. Thus, it may take a long time before the overlay stabilizes.

PSIRP aims to implement publish/subscribe networking without relying on existing networking protocols such as IP. Preliminary results suggest that a clean slate.