基于有环图的内容发布订阅路由算法  

Routing Algorithm for Content-based Publish/Subscribe Based on Cyclic Topology

作　　者：陈勤[1] 蒋永彬[1] 张旻[1] 

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

出　　处：《计算机工程》2008年第16期122-124,共3页Computer Engineering

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

摘　　要：针对现有内容发布/订阅系统事件路由算法不支持有环图下订阅覆盖的问题,采用目的地动态更新与划分、逆向最短路径转发等策略,提出一种有环图下支持订阅覆盖的路由算法。分析表明,该算法完全满足有环图拓扑应用的需求,可确保订阅者收到匹配订阅的事件,避免事件转发形成环路。For the exist content-based Publish/Subscribe（P/S） systems, general peer-to-peer topology can not support subscription covering, on the base of absorbing their design ideas, with reverse path forwarding technique and dynamic receiver update and partition strategy, a new route algorithm for content-based P/S system which supports general cyclic topology and subscription covering is proposed. Analysis shows that the algorithm can completely meet the requirement of P/S system of cyclic topology, the new route algorithm also guarantees that all the subscribers have subscription matched the event will receive the event without routing loops.

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

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