Improvement Of Chord Resource Location Algorithm In P2P Networks

Due to the single point of failure, performance bottlenecks and other problems, thetraditional C/S (Client/Server) modal has been unable to satisfy the demand of networkresource rapid sharing for people. P2P(Peer-to-Peer) network model gets rid from theserver’s control to the whole system,makes full use of the free resources of the largenumber of clients, and effectively resolves the problem of C/S network model. The searchand location of sharing resource in P2P network has been the focus of current research.Chord protocol is the classic resource search and location algorithm in structuredP2P network, but it has the following defects:(1) As the interval of FingerTable structure formula grows by the exponential of two,it grows slowly at first, but the real nodes in the Chord network is sparse，so the beforepart of FingerTable redundancy is much.(2) Chord only searches resource from the clock direction, and the FingerTable onlycovers half information of the Chord ring mostly. If the distance of target and current nodeexceeds half ring, the routing hops are many.Response to the problems of the classic Chord protocol, a modify resolution withreducing the redundant information of the original FingerTable and adding a reverseFingerTabe. It selects a proper direction to selectivity routing automatically after judgingthe distance between the target and current node. The simulation results show that,comparing with the classic Chord algorithm, the modify resolution has improved in aspectof resource search and location.