A Cache Routing Algorithm Based on Chord

It exists some high degree node in actual P2P system from the study of small-world.Traditional Chord algorithm suppose that the searching requests distribute randomly and not consider the ″shortcut″ effect among nodes.This paper puts forword a kind of routing algorithm which can find ″shortcut″ in P2P system to a certain extent based on Chord.It sorts the routing table according to hit rate dynamicaly.Simlation experiment indicate that the algorithm can accelerate the searching procedure and improve the performance of routing table.The main innovation of this paper is find an improvement Chord routing algorithm according to the searching requests feature in actual P2P system.This algorithm can improve the searching performance effectively in P2P system.