H-Chord:routing model and algorithm implementation for Chord based on hierarchical dividing

Chord is a kind of structured P2P network,but the routing table in Chord suffers serious information redundancy and it is not very efficient.Therefore,a routing model and algorithm implementation for Chord based on hierarchical dividing(H-Chord)is proposed.Simulation experiments show that H-Chord compresses the routing table length of most nodes into only one so as to eliminate repetitious entries and depress information redundancy.Simulation experiments also show that H-Chord reduces the average lookup path length and gets higher efficiency.H-Chord coordinates lookup efficiency and routing table length well.