A routing scheme for content based networking
Forwarding in a content-based network
publish/subscribe, nodes subscribe : 2 layers: traditional broadcast plus content based filtering. Nodes advertise their interest with the form of predicate: disjunction of conjunctions of constraints (set of attribute/value pairs). These advertisements are organized in the routing table. When nodes publish services, they broadcast the service with the broadcast tree, but not to all nodes, use the filter routing table to route to interested nodes. Routing info update, when router receive update predicate, if its current predicate already cover the new predicate, the router will not propagate the update to other routers. ( I can use the same principle, when the updated bit vector is included in the previous ones, need not propagate).
Efficient Event Routing in content-based publish subscribe service networks.
Two routing strategies for content based publish/subscribe systems: filter based which performs content-based filtering on intermediate routing servers to dynamically guide routing decisions. And multicast based approach, which delivers events through a few high-quality multicast groups that are pre-constructed to approximately match user interests.
