PChord: improvement on chord to achieve better routing efficiency by exploiting proximity

Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, chord has often been criticized on its careless of routing locality. A peer-to-peer overlay, called PChord is illustrated in this paper which focuses on achieving better routing efficiency. PChord is constructed on the basis of chord which exploits proximity of the underly Internet by combining proximity routing into its routing scheme. The simulation shows that PChord has achieved lower RDP per message routing.

[1]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[2]  Topology-Aware Overlay Construction in Dynamic Networks , 2003 .

[3]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[4]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[5]  Peter Druschel,et al.  Topology-aware routing in structured peer-to-peer overlay networks , 2003 .

[6]  Song Jiang,et al.  SAT-Match: a self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[7]  Ben Y. Zhao,et al.  Distributed Object Location in a Dynamic Network , 2004, Theory of Computing Systems.

[8]  Kirsten Hildrum,et al.  Optimizations for Locality-Aware Structured Peer-to-Peer Overlays , 2003 .

[9]  Peter Druschel,et al.  Exploiting network proximity in peer-to-peer overlay networks , 2002 .

[10]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[11]  Scott Shenker,et al.  Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.

[12]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[13]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.