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

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

针对现有内容发布/订阅系统事件路由算法不支持有环图下订阅覆盖的问题,采用目的地动态更新与划分、逆向最短路径转发等策略,提出一种有环图下支持订阅覆盖的路由算法。分析表明,该算法完全满足有环图拓扑应用的需求,可确保订阅者收到匹配订阅的事件,避免事件转发形成环路。

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.