Middleware Systems Research Group

University of Toronto, Canada

Congestion Avoidance with Selective Filter Aggregation in Content-based Routing Networks

Abstract

The subscription covering optimization, whereby a general subscription quenches the forwarding of more specific ones, is a common technique to reduce network traffic and routing state in content-based routing networks. Such optimizations, however, leave the system vulnerable to unsubscriptions that trigger the immediate forwarding of all the subscriptions they had previously quenched. These subscription bursts can severely congest the network, and destabilize the system. This paper presents techniques to retain much of the benefits of subscription covering while avoiding bursty subscription traffic. Heuristics are used to estimate the similarity among subscriptions, and a distributed algorithm determines the portions of a subscription propagation tree that should be preserved. Evaluations show that these mechanisms avoid subscription bursts while maintaining relatively compact routing tables.

Download

Tags: content-based publish/subscribe, content-based routing, padres

Readers who enjoyed the above work, may also like the following: Congestion Avoidance with Incremental Filter Aggregation in Content-based Routing Networks. Mingwen Chen, Songlin Hu, Vinod Muthusamy, and Hans-Arno Jacobsen. Middleware Systems Research Group, June 2011. Pages 1-16. Tags: content-based publish/subscribe, content-based routing, padres Community Clustering for Distributed Publish/Subscribe Systems. Wei Li, Songlin Hu, Jintao Li, and Hans-Arno Jacobsen. In IEEE Cluster, September 2012. IEEE, Tags: content-based publish/subscribe, content-based routing, event processing, padres, publish/subscribe, publisher relocation, publisher migration, publisher repositioning, subscriber relocation, subscriber migration

| Contact Webmaster |