Research and Improvement Based on Chord Protocol

Distributed hash tables resource locating arithmetic in peer to peer network will lead the overlay topology is not congruent with the physical topology to a large extent. In this paper, an improved method taking advantage of structured node ID is promoted based on the serious research of Chord protocol. The experiments show the improved method can make the neighbouring nodes in physical topology approach as far as possible.

[1]  Tim Moors,et al.  Survey of research towards robust peer-to-peer networks: Search methods , 2006, Comput. Networks.

[2]  Edith Cohen,et al.  Associative search in peer to peer networks: harnessing latent semantics , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Lakshmish Ramaswamy,et al.  A distributed approach to node clustering in decentralized peer-to-peer networks , 2005, IEEE Transactions on Parallel and Distributed Systems.

[4]  Edith Cohen,et al.  Associative search in peer to peer networks: Harnessing latent semantics , 2007, Comput. Networks.

[5]  James Zijun Wang,et al.  Design and Implementation of a P2P Cooperative Proxy Cache System , 2007, J. Interconnect. Networks.

[6]  Yu Jiong,et al.  DR-Chord-FAn Efficient Double-Ring Chord Protocol , 2007, Sixth International Conference on Grid and Cooperative Computing (GCC 2007).

[7]  Jing Wang,et al.  A Bidirectional Query Chord System Based on Latency-Sensitivity , 2006, 2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06).

[8]  Minglu Li,et al.  PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity , 2006, IEICE Trans. Inf. Syst..

[9]  Chung-Ming Huang,et al.  Network-aware P2P file sharing over the wireless mobile networks , 2007, IEEE Journal on Selected Areas in Communications.