节点文献
JXTA P2P分布式事件路由改进算法研究
An Improved Algorithm for Distributed Event Routing Based on JXTA P2P
【摘要】 在分布式信息资源网络环境中,信息资源路由转发机制是分布式计算核心功能之一,P2P网络作为分布式计算采用最广泛的应用逻辑覆盖网络.将网络的小世界特性引入到JXTA P2P网络中,对其资源路由算法进行研究,从动态选取聚集节点、自适应选择种子聚集节点、设定对等体组等3方面进行改进.最后,通过模拟实验,表明改进算法的合理性和可行性.改进算法对分布式环境下自适应路由提供了一种可借鉴事件路由策略.
【Abstract】 In a distributed network environment, information resources routing forwarding mechanism is one of the core functions of distributed computing, P2P networks as the most widely used distributed computing application overlay network. Small-world properties of the network introduced to the JXTA P2P network, routing algorithm to study its resources, gathered from the selected rendezvous dynamic, adaptive setting seeding rendezvous, set peer group and other improvements. Finally, through simulation experiments show that the improved algorithm is reasonable and feasible. The improved algorithm for adaptive routing in distributed environment provides an event routing strategy reference.
【Key words】 distributed computing; event routing; P2P; small-world’ networks properties;
- 【文献出处】 计算机研究与发展 ,Journal of Computer Research and Development , 编辑部邮箱 ,2012年S1期
- 【分类号】TP393.02
- 【下载频次】92