A Content-Based Routing Algorithm in WInternet Pipe Communication Protocol

摘要

In this paper, we propose a content-based routing algorithm for WInternet Pipe Communication Protocol. A filter model based on a multilevel index structure is established to judge the covering relation between two subscription criteria. Furthermore, our routing algorithm takes advantage of covering relations and link status among nodes to build a virtual message distribution tree for each OutGate. Meanwhile, it supports nodes join and leave dynamically without impacting the routing accuracy. Analysis result shows it can reduce the message matching costs, keep the load balance among nodes and improve the transmission performance of WInternet to some extent.