A routing scheme for content-based networking

This work proposes a routing scheme for content-based networking. A content-based network is a communication network that features a new advanced communication model where messages are not given explicit destination addresses, and where the destinations of a message are determined by matching the content of the message against selection predicates declared by nodes. Routing in a content-based network amounts to propagating predicates and the necessary topological information in order to maintain loop-free and possibly minimal forwarding paths for messages. The routing scheme we propose uses a combination of a traditional broadcast protocol and a content-based routing protocol. We present the combined scheme and its requirements over the broadcast protocol. We then detail the content-based routing protocol, highlighting a set of optimization heuristics. We also present the results of our evaluation, showing that this routing scheme is effective and scalable.

I. Introduction

Content-based communication is a communication service whereby the flow of messages from senders to receivers: is driven by the content of the messages, rather than by explicit addresses assigned by senders and attached to the messages [4]. Using a content-based communication service, receivers declare their interests by means of selection predicates, while senders simply publish' messages. The service consists of delivering to any and all receivers each message that matches the selection predicates declared by those receivers.