Congestion Avoidance with Incremental Filter Aggregation in Content-Based Routing Networks

Mingwen Chen, Songlin Hu, Vinod Muthusamy, Hans Arno Jacobsen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE 35th International Conference on Distributed Computing Systems, ICDCS 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages557-568
Number of pages12
ISBN (Electronic)9781467372145
DOIs
StatePublished - 22 Jul 2015
Externally publishedYes
Event35th IEEE International Conference on Distributed Computing Systems, ICDCS 2015 - Columbus, United States
Duration: 29 Jun 20152 Jul 2015

Publication series

NameProceedings - International Conference on Distributed Computing Systems
Volume2015-July

Conference

Conference35th IEEE International Conference on Distributed Computing Systems, ICDCS 2015
Country/TerritoryUnited States
CityColumbus
Period29/06/152/07/15

Fingerprint

Dive into the research topics of 'Congestion Avoidance with Incremental Filter Aggregation in Content-Based Routing Networks'. Together they form a unique fingerprint.

Cite this