%0 Journal Article
%T Event Space Partition-based Routing Algorithm of Publish Subscribe System<br>基于事件空间划分的高效发布订阅路由算法
%A LU Peng
%A LIU Xu-dong
%A LIN Xue-lian
%A WANG Bin
%A <br>逯鹏
%A 刘旭东
%A 林学练
%A 王斌
%J 计算机应用研究
%D 2007
%I 
%X Publish/subscribe routing technology was the key technology of the publish/subscribe system.The routing efficiency of the traditional method which was reverse path forwarding was O(N).The method which based on event space partition improve the efficiency to O(N1/d).This paper used a data structure named ancestor queue in building up neighborhood relations among different routing areas in the virtual overlay network,and recording these realations in the ancestor queue.This ancestor queue could aid to implement the Spanhop routing between the delegates of the routing areas.The routing performance analysis shows that the Spanhop method impoves routing efficiency to O(ln N).It also eliminate the effect of the event space dimensions to routing efficiency.Spanhop is an efficient routing method in the publish/subscribe system which oriente wide area network with a few more storage cost.
%K distributed system
%K routing
%K publish/subscribe
%K binary tree<br>分布式系统
%K 路由
%K 发布订阅
%K 二叉树
%K 基于事件
%K 空间划分
%K 发布订阅
%K 路由算法
%K System
%K Publish
%K Routing
%K Algorithm
%K Space
%K 订阅系统
%K 广域网
%K 大规模
%K 存储
%K 方法
%K 影响
%K 空间维度
%K 平均路径
%K 使用
%K 分析表
%K 通过性能
%K 分级
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C793235A4E87B8F6AF1CE5DEE3970F1D&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=DF92D298D3FF1E6E&sid=9CA95D22FC1D537C&eid=6A73B36E85DB0CE9&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11