Abstract
An important problem that confronts P2P network is to efficiently search the node that stores a particular data. Chord is a distributed lookup protocol that addresses the problem. However, the chord protocol has not yet efficiently resolved the problem. In this paper an improved Chord algorithm is presented, which considers the node's actual ability, the physical location relationship, the routing pointer redundancy, the node load balancing and so on. Results from theoretical analysis, simulations, and experiments show that improved Chord algorithm is superior to the old Chord algorithm at the key performance indexes such as latency stretch, jump number and average inquires delay.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
