DMCA
A Scalable Protocol for Content-Based Routing in Overlay Networks (2003)
| Citations: | 82 - 4 self |
BibTeX
@MISC{Chand03ascalable,
author = {R. Chand and P.A. Felber},
title = {A Scalable Protocol for Content-Based Routing in Overlay Networks},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alternative to unicast or multicast communication in loosely coupled distributed systems with large number of consumers, with diverse interests, wide geographical dispersion, and heterogeneous resources (e.g., CPU, bandwidth). In this paper, we propose a novel protocol for content-based routing in overlay networks. This protocol guarantees perfect routing (i.e., a message is received by all, and only those, consumers that have registered a matching subscription) and optimizes the usage of the network bandwidth. Furthermore, our protocol takes advantage of subscription aggregation to dramatically reduce the size of the routing tables, and it fully supports dynamic subscription registrations and cancellations without impacting the routing accuracy. We have implemented this protocol in the application-level routers of an overlay network to build a scalable XML-based data dissemination system. Experimental evaluation shows that the size of the routing tables remains small, even with very large populations of consumers.
Keyphrases
overlay network content-based routing scalable protocol routing table network bandwidth matching subscription message consumer novel protocol content network large population interesting alternative wide geographical dispersion diverse interest scalable xml-based data dissemination system large number subscription aggregation dynamic subscription registration heterogeneous resource application-level router experimental evaluation show
