A routing scheme for content-based networking

TLDR

Content‑based networks route messages by matching message content to node‑declared predicates, requiring propagation of predicates and topology to maintain loop‑free, minimal paths. This work proposes a routing scheme for content‑based networking. The scheme combines a traditional broadcast protocol with a content‑based routing protocol, detailing the combined architecture, broadcast requirements, and optimization heuristics for predicate handling. Evaluation demonstrates that the scheme is effective and scales with network size.

Abstract

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.