L-Chord: Routing Model for Chord Based on Layer-Dividing

Authors:
Biqing Wang;Peng He
Affiliations:
-;-
Venue:
CIS '07 Proceedings of the 2007 International Conference on Computational Intelligence and Security
Year:
2007

Citing 0
Cited 3

A sector-based routing model over structured peer-to-peer networks

Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
An improved P2P lookup protocol model

Cluster Computing
An adaptive sector-based routing model over structured peer-to-peer networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.