Research of Routing Algorithm in Hierarchy-Adaptive P2P Systems
Research of Routing Algorithm in Hierarchy-Adaptive P2P Systems
复制标题
层次自适应P2P系统路由算法研究
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Zhoujun Li
中科院分区：
文献类型：
--
作者：
Xiaoming Zhang;Yijie Wang;Zhoujun Li
近年来，超级节点的引入提高了P2P系统的性能。超级对等点是P2P系统中作为一组客户端的服务器运行的节点。通过利用异构性，超级对等体范例允许P2P系统更有效地运行。本文提出了一种层次自适应的P2P拓扑结构DAHP2P和层次路由算法Hroute。节点按邻近度分组，超级节点组成上层覆盖层，层次数根据系统节点数自适应变化，设计了一种分层路由算法以减少路由跳数。仿真结果表明，Hroute能显著降低消息路由的期望跳数和延迟，且各层节点的负载相对均衡。
Recently superpeers are introduced to improve the performance of P2P systems. A superpeer is a node in a P2P system that operates as a server for a set of clients. By exploiting heterogeneity, the superpeer paradigm allows P2P systems to run more efficiently. This paper proposes a hierarchy-adaptive P2P topology DAHP2P and a hierarchical routing algorithm Hroute. Peers are grouped into clusters according to proximity and super peers form the upperlevel overlay, the number of hierarchy is self-adaptively changed according to the number of nodes in the system, a hierarchical routing algorithm is designed to reduce the routing hops. Simulation results show that Hroute can significantly reduce the expected number of hops and latency of message routing, and loads of peers at different layers are relatively balanceable.