摘要
为解决P2P网络中Chord算法众多节点性能不一、节点频繁离开和加入制约系统性能的问题,提出了基于信息相关度的分组改进算法。该算法通过引入节点信息相关度的概念,对原Chord进行信息相关度的一个分组调整。从每个组选出两个超级节点组成超级组,同时为每个节点增加了逆时针路由,在两个超级节点顺逆两个方向上选择出最短路径进行查找。实验表明,改进后的算法使得系统的性能和适应性都得到了加强,提高了Chord在对等网中的查找效率。
In P2P network, performances of many nodes in Chord algorithm are inconsonant. The problem that nodes leave and join frequently will restrict the performance of system seriously. Therefore, this paper presented grouping improved algo- rithm based on related degree of information. It introduced the concept of the node information relevant degree in the algorithm, in which the original Chord was adjusted by group on the related degree of information. Then the super group was connected through the super nodes. It selected two super nodes from each group and constitute a super group. In the meantime, every node was increased a counter-clockwise route. Then they could choose the shortest path to find two super nodes in both elockwise and counterclockwise direction. The experiments show that performance and adaptability of system are strengthened by the improved algorithm. The search efficiency of Chord in P2P network is improved.
出处
《计算机应用研究》
CSCD
北大核心
2014年第2期518-521,共4页
Application Research of Computers
基金
国家自然科学基金面上项目(11172342)
国家教育部新世纪优秀人才支持计划资助项目(NCET-11-0674)
陕西省自然科学基金资助项目(2012JM8043)
关键词
对等网络
CHORD
分组
信息相关度
双向两侧
拓扑结构
LP2P（peer-to-peer）
Chord
grouping
information related degree
two-way on both sides
overlay topology
