Forwarding in a Content-Based Network
Carzaniga and Wolf
content-based content-centric routing pub/sub query matching
@inproceedings{carzaniga:sigcomm-2003,
author={Antonio Carzaniga and Alexander L. Wolf},
title={Forwarding in a Content-Based Network},
booktitle={{ACM} {SIGCOMM} 2003},
pages={163--174},
year=2003,
address={Karlsruhe, Germany},
month={August}
}
[ Download PDF ]
Abstract:
This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks, where messages are given explicit destination addresses, the movement of messages through a content-based network is driven by predicates applied to the content of the messages. Forwarding in such a network amounts to evaluating the predicates stored in a router's forwarding table in order to decide to which neighbor routers the message should be sent. We are interested in finding a forwarding algorithm that can make this decision as quickly as possible in situations where there are numerous, complex predicates and high volumes of messages. We present such an algorithm and give the results of studies evaluating its performance.
Focuses on structures for efficient matching of message descriptions and pub/sub queries
Messages are typed attributed/value pairs, queries are disjunction of conjunctions of constraints over those values
Makes a big deal about separating topological information from queries
Still needs node identifiers
- E.g., to identify topology and associate queries with nodes
Broadcast across tree, pruning by content queries
Lengthy comparison to INS
- INS provides both name resolution and late binding
- INS conflates topology and naming in its forwarding structure
- INS propagates metadata to all resolvers
No relationship to content-addressable networking
Two different strategies in applying metadata to queries
- Iterate across attributes in queries and check in message
- Iterate across attributes of message and check in queries
Of note:
- A. Campailla, S. Chaki, E. Clarke, S. Jha, and H. Veith. Efficient filtering in publish-subscribe systems using binary decision diagrams.