有环图下基于内容发布/订阅系统路由算法改进  

Improvement on the Routing Algorithm for Content-Based Publish/Subscribe Systems Based on Cyclic Topology

作　　者：陈勤[1] 刘昊[1] 张旻[1] 

机构地区：[1]杭州电子科技大学智能与软件技术研究所,浙江杭州310018

出　　处：《计算机工程与科学》2009年第4期1-3,48,共4页Computer Engineering & Science

基　　金：现代通信国家重点实验室基金资助项目(9140c110206070c11);杭州电子科技大学校科学研究基金资助项目(KYF071506005)

摘　　要：针对最小路径权值路由算法在有环拓扑结构下不能适用于大规模发布/订阅系统的问题,本文提出了颜色属性的概念。通过对代理设置颜色属性,对原有算法进行了改进,不仅确保订阅者收到匹配事件、避免转发环路的形成,并且降低了消息处理代价。该算法可以适用于大规模发布/订阅系统。Because the least path value routing algorithm which supports subscription covering on cyclic topology can not support complex publish/subscribe systems,a color attribute concept is proposed. By setting up the color attribute of the agents, the original algorithm is improved, which ensures that the subscriber can receive the matched events, avoid loop formation, and reduce message processing cost. The algorithm is also suitable for large-scale publish/subscribe systems.

关 键 词：发布/订阅 订阅覆盖 有环图 路由算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]