检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]空军工程大学信息与导航学院,西安710071
出 处:《计算机科学》2014年第9期137-140,145,共5页Computer Science
基 金:全军军事学博士研究生课题(2012JY003-583)资助
摘 要:在结构化P2P网络基础上构建语义发布/订阅系统是近年来的研究热点。提出一种基于Chord的语义事件路由算法,算法采用基于集结点的路由策略,首先使用保留语义的哈希函数将订阅映射至事件代理集结点;其次根据订阅与事件之间的语义信息,仅发布事件至可能匹配的订阅集结点,采用Chord路由协议构建的订阅生成树分发通知消息;最后过载的集结点通过订阅迁移实现系统负载均衡。仿真实验表明,算法在一定程度上减少了资源消耗,提高了路由效率,达到了负载均衡。Constructing semantic publish/subscribe system based on structured P2P network is research focus in recent years. The paper proposed a new semantic event routing algorithm based on Chord, which uses routing strategy based on rendezvous node. Firstly, the mapping from subscriptions to event broker rendezvous nodes is achieved using hash function with semantic reserved. Secondly, the algorithm just publishes events to the subscription rendezvous nodes which may be matched based on semantic information between subscriptions and events, and delivers notifications using the subscription spanning tree based on Chord routing protocol. At last, load balancing is realized through transferring subscriptions between overload rendezvous nodes. Simulation shows that to some extent, the algorithm reduces resource consumption, improves efficiency, and reaches load balance.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.54.80