An optimized algorithm of P2P network routing base on geographic position

Current P2P algorithms almost use the random method to choose the neighbor peers, which will cause many problems such as the low efficiency routing and the high network delay. We propose an improved Chord algorithm base on standard Chord algorithm. The new algorithm introduces the delay and the bandwidth factors to the logic location course of new peer joining Chord ring. It also utilize the global network position to calculate the geographic distance among peers, which make the logic position of every peer accord to its geographic position, and make every peer always select the nearest peers as its neighbor, so as to decrease the network delay and promote the routing efficiency. The experiment results show that our algorithm indeed decreases network delay, promote routing efficiency and even accelerate downloading of resources.