Improvement of Chord search algorithm research in P2P network
Le Cao · Jisuanji yingyong yanjiu · 2014
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 algorithm 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 clockwise 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.