OHChord: Improvement of Chord routing algorithm based on optimized routing table and hot point

It is a hot issue to study on how to locate the resource efficiently in P2P networks and grid computing. Chord is a structured P2P routing protocol based on DHT, with the features of fully distributed, load balancing and availability and so on. But it has a poor performance because of redundant information in the finger table. In this Paper, OHChord was proposed. It reduce redundancy and improve query stability by two methods. Firstly, an improved finger structure is presented for removing redundancy. Secondly, adding a hot routing table for each node. Compared with the original Chord and partition-based Chord, OHChord can improve the resource retrieving efficiently.