L-Chord: Routing Model for Chord Based on Layer-Dividing
Biqing Wang, Peng He · 2007
Chord is a kind of structured P2P networkbut 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 layer-dividing(L-Chord) is proposed. Simulation experiments show that L-Chord compress- es the routing table length of most nodes into only one so as to eliminate repetitious entries and reduce the average lookup path length.L-Chord coordinates loo- kup efficiency and routing table length well.