Adaptive Content-Based Routing in General Overlay Topologies
Adaptive Content-Based Routing in General Overlay Topologies
复制标题
DOI：
10.1007/978-3-540-89856-6_1
复制
发表时间：
2008-12
期刊：
影响因子：
--
通讯作者：
Guoli Li;Vinod Muthusamy;H. Jacobsen
中科院分区：
文献类型：
--
作者：
Guoli Li;Vinod Muthusamy;H. Jacobsen
本文开发了基于内容的发布/订阅算法，以支持一般的覆盖拓扑，而不是传统的非循环或基于树的拓扑。除了其他好处外，发布路由可以通过在备选路由路径中进行选择来适应动态条件，并且可以在网络中的最佳点处检测复合事件。算法在Padres发布/订阅系统中实现，并在受控的本地环境和广域PlanetLab部署中进行评估。在连接良好的网络中，原子订阅通知传递时间缩短20%，处理复合订阅的网络流量减少80%，传递通知的端到端延迟减少约一半。
This paper develops content-based publish/subscribe algorithms to support general overlay topologies, as opposed to traditional acyclic or tree-based topologies. Among other benefits, publication routes can adapt to dynamic conditions by choosing among alternate routing paths, and composite events can be detected at optimal points in the network. The algorithms are implemented in the PADRES publish/ subscribe system and evaluated in a controlled local environment and a wide-area PlanetLab deployment. Atomic subscription notification delivery time improves by 20% in a well connected network, and composite subscriptions can be processed with 80% less network traffic and notifications delivered with about half the end to end delay.