Research And Improvement On Chord Protocol For Structured P2P Network

As an overlay network, Peer-to-Peer (P2P) network is based on computer network and works on peer mode. P2P network changes the traditional C/S mode to peer mode where each node in the same position, any two persons using the network can share files and transfer news. Therefore, various P2P network protocols have been proposed. Chord protocol is a relatively good protocol in the structured distributed query protocol based on distributed hash table.But, in the finger table of Chord protocol there exist redundancy messengers and during the routing process occurs large delay nodes, which affect the efficiency of locating resources. Aiming at these shortcomings, this paper proposes corresponding improvement measures.Firstly, aiming at the redundancy information in the finger table of Chord protocol, the thesis removes the redundant route and at the same time adds an equal amount of processor nodes information. Query according to rules laid down selects the optimal routing path between both directions to rout, thereby significantly reduce the routing hops.Secondly, aiming at the problem of the routing diameter is too long, the thesis increases RTT in the finger table to avoiding large delay nodes in the routing process. When the node finds the delay to the next hop node in its finger table is too large, the node according to the rules laid down rout the information to a node which in the finger table and is nearest, thereby significantly reduce the routing delay.This paper uses p2psim simulation software to do the simulation and takes a comparative analysis with Chord at the two areas of the average routing hops and the average routing delay. The simulation results show that F-Chord significantly reduce the average routing hops and the average routing delay, and no significant increase the redundant information.