Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
