A Scalable Protocol for Content-Based Routing in Overlay Networks

  • Authors:
  • R. Chand;P. A. Felber

  • Affiliations:
  • -;-

  • Venue:
  • NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In content networks, messages are routed on the basis oftheir content and the interests (subscriptions) of the message consumers. This form of routing offers an interestingalternative 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 thathave registered a matching subscription) and optimizes theusage of the network bandwidth. Furthermore, our protocoltakes advantage of subscription aggregation to dramaticallyreduce the size of the routing tables, and it fully supportsdynamic subscription registrations and cancellations withoutimpacting the routing accuracy. We have implemented thisprotocol in the application-level routers of an overlay networkto build a scalable XML-based data dissemination system. Experimental evaluation shows that the size of the routing tablesremains small, even with very large populations of consumers.