K-Chord: A Flexible Peer-to-Peer Resource Location Protocol

An important and fundamental issue in designing structured P2P systems is the tradeoff between the number of logical links and the number of hops. This paper presents K-Chord (KC), a flexible protocol based on Chord and the idea of proportional search. We conduct an in-depth study on KC. Let D denote any given number, in order to guarantee that each query can be resolved in 0(D) hops, it is necessary and sufficient to maintain Omega(D(n1/D - 1)) links on each node in KC, where n is the number of nodes in the system. The performances of KC have been evaluated using both theoretical analysis and simulation.

[1]  Sam Toueg,et al.  On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.

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

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

[4]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

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

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

[7]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

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

[9]  Wen-Jing Hsu,et al.  ABC: A Cluster-Based Protocol for Resource Location in Peer-to-Peer Systems , 2004, IPDPS.

[10]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[11]  Abhishek Kumar,et al.  Ulysses: a robust, low-diameter, low-latency peer-to-peer network , 2004, Eur. Trans. Telecommun..

[12]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[13]  Moni Naor,et al.  Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds , 2004, IPTPS.