Efficient Routing Technique for Publish/Subscribe System Based on Information Partitioning
基于信息空间划分的高效发布订阅路由技术

Routing efficiency is key to design a large scale content-based publish/subscribe system.The K-D tree partition method is used to realize content-based publish/subscribe system which is based on partitioning information space.On this basis,a hierarchical application-level routing algorithm which oriented flat network with the K-D trees index mechanism was implemented.This algorithm reduced the application-level routing hops and got routing efficiency to O(lnN).Furthermore,in view of the inconsistencies of neighboring relations between application-level and the network-level in the routing algorithm,the method of constructing mapping relation between two Cartesian spaces which was GNP(Global Network Position)and ESPN(Event Space Partition Network)and maintaining coordinates of GNP in broker network was used to support brokers in application-level search and select next hop based on the neighboring relation of network-level nodes.This method reduced the real message forwarding path length and routing latency and got high routing efficiency with low maintaining cost.Performance analysis shows that these algorithms addressed efficient routing problems in content-based publish/subscribe system based on information space partitioning.