Hybrid-Chord: A Peer-to-Peer System Based on Chord

In this paper, we present a new model for a peer-to-peer system based on Chord, called Hybrid-Chord, to improve the routing performance and data availability of Chord Our main focus is on reducing the number of hops that is needed to locate a data item Through simulations, we demonstrate the improvement of the routing performance and fault tolerance capabilities of the proposed system and compare that with the original Chord system The hybrid system can reduce the number of lookup hops significantly by up to 50% compared to Chord, is robust and handles node failures better than Chord, can always find the desired data with high probability and has better data availability than Chord Above all, the hybrid system has same complexity as Chord.

[1]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[2]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

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

[4]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[5]  Ion Stoica,et al.  Peer-to-Peer Systems II , 2003, Lecture Notes in Computer Science.

[6]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[7]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[8]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[9]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[10]  Seif Haridi,et al.  DKS(N, k, f): a family of low communication, scalable and fault-tolerant infrastructures for P2P applications , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

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

[12]  Ian T. Foster,et al.  Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems , 2002, IPTPS.

[13]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[14]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.