基于兴趣划分的内容发布订阅系统关键算法

Key algorithm in content-based publish/subscribe system based on subscription partitioning

在基于内容发布订阅系统中,将订阅兴趣在多个代理之间划分是代理负载均衡的重要方法.提出了基于事件空间的K-D树划分方法.通过将事件空间划分成负载相同的区域,优化了系统负载均衡的性能.基于逻辑空间最短距离的概念提出了与划分相关的事件和兴趣路由算法以及单播和多播混和的通知路由方法.两种路由算法减少了事件匹配操作,提高了路由的效率.利用事件空间的区域合并和分裂实现了系统的自组织.实验和与相关工作比较表明,划分方法及其相关算法的引入提高了系统的可伸缩、容错和负载均衡性能.

Partitioning subscriptions interest among muhi-brokers acts as an important way to resolve load balancing problem in content-based publish/subscribe system. A new method of event space-based subscription partition with K-D tree was proposed. With this method, the event space was partitioned into zones with equal load and so the system performance of load balancing was improved. Based on the minimum distance of logical event space, new routing algorithms were proposed for event and subscription routing and another hybrid of unicast and multicast routing policy for notification routing. All these algorithms and policy significantly reduced the event matching cost and promoted the routing efficiency in content-based publish/subscribe system. At the same time, the method of splitting and merging zones of event space was used to realize the selforganizing of the publish/subscribe system. The experiment and related works show that the introduction of partitioning methods and related algorithms can improve the scalability, fault tolerant and load balancing performance of content-based publish/subscribe system.