A New Policy Of Resource Searching In Chord

Resource searching is one of the core problems in the P2P system. Searching efficiency isthe key of the system's capability and also the bottleneck of the P2P development. In view ofthis, various efficient algorithms are put forward around the world, including the Gnutellasystem based on unstructured random topology network and other algorithms based onstructured DHC, such as Chord, Pastry, CAN and Tapestry.Based on investigations on the Chord algorithm, two concepts, "second successor" and"node cache", are introduced in Chord to improve its searching strategy. By using "secondsuccessor", one solid node can be pushed forward for each hop in one range's nodes on Chordcircle during source research, and one hop can be reduced in another range's node. And byusing "node cache", it can achieve the hot resource search in the system by only one hop. Thus,this searching strategy improves the searching efficiency.In order to verify the performance of the new Chord algorithm, a program is written basedon p2psim for simulation. The simulation result shows that the new algorithm does bring betterperformance than the original Chord.