Fast learning of optimal connections in a peer-to-peer network

Peer-to-Peer (P2P) protocol design is widely undertaken with the assumptions that peers and network connections are homogeneous resources. In practice this assumption is untrue. Furthermore, while there are some P2P networks that provide asymptotic cost optimal topology, or routing, very few existing protocols combine topology optimization and resource optimization, the resulting performance is resource oblivious. We propose a class of traffic based learning protocols, called FLOC protocols, that learn new connections between neighbors of neighbors. For an average routing table size of d and n peers, our protocol is seen to quickly converge from an inefficient network to an asymptotic cost optimal diameter of O(logd n), and simultaneously reduce network delay by approximately 50% in highly heterogeneous networks. We provide extensive simulation results to show FLOC's behavior.

[1]  Krishna P. Gummadi,et al.  A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems , 2002, CCRV.

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

[3]  Ramesh Govindan,et al.  Incrementally improving lookup latency in distributed hash table systems , 2003, SIGMETRICS '03.

[4]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[5]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

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

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

[8]  José D. P. Rolim,et al.  Bisecting De Bruijn and Kautz Graphs , 1998, Discret. Appl. Math..

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

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

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

[12]  Pierre Fraigniaud,et al.  Brief announcement: an overview of the content-addressable network D2B , 2003, PODC '03.

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

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

[15]  Moni Naor,et al.  Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.

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

[17]  Jaroslav Opatrny,et al.  Broadcasting and Spanning Trees in de Bruijn and Kautz Networks , 1992, Discret. Appl. Math..

[18]  Flavio D'Alessandro.  A combinatorial problem on Trapezoidal words , 2002, Theor. Comput. Sci..

[19]  J. A.,et al.  On Moore Graphs with Diameters 2 and 3 , 2022 .

[20]  Vana Kalogeraki,et al.  Finding good peers in peer-to-peer networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[21]  Gurmeet Singh Manku,et al.  Routing networks for distributed hash tables , 2003, PODC '03.

[22]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[23]  Nathaniel Good,et al.  Usability and privacy: a study of Kazaa P2P file-sharing , 2003, CHI '03.

[24]  David Clark,et al.  Face-to-Face with Peer-to-Peer Networking , 2001 .

[25]  Aaron Harwood,et al.  HIGH PERFORMANCE INTERCONNECTION NETWORKS , 2002 .