Bootstrapping locality-aware P2P networks

Bootstrapping is a vital core functionality required by every peer-to-peer (P2P) overlay network. Nodes intending to participate in such an overlay network initially have to find at least one node that is already part of this network. While structured P2P networks (e.g. distributed hash tables, DHTs) define rules about how to proceed after this point, unstructured P2P networks continue using bootstrapping techniques until they are sufficiently connected. In this paper, we compare solutions applicable to the bootstrapping problem. Measurements of an existing system, the Gnutella web caches, highlight the inefficiency of this particular approach. Improved bootstrapping mechanisms could also incorporate locality-awareness into the process. We propose an advanced mechanism by which the overlay topology is - to some extent - matched with the underlying topology. Thereby, the performance of the overall system can be vastly improved.

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

[2]  Guillaume Urvoy-Keller,et al.  Topology-Centric Look-Up Service , 2003, Networked Group Communication.

[3]  Andy Oram,et al.  Peer-to-Peer: Harnessing the Power of Disruptive Technologies , 2001 .

[4]  Bryce Wilcox-O'Hearn,et al.  Experiences Deploying a Large-Scale Emergent Network , 2002, IPTPS.

[5]  Bryce Wilcox-O ' Hearn Experiences Deploying a Large-Scale Emergent Network , 2002 .

[6]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[7]  Ben Y. Zhao,et al.  Distributed Object Location in a Dynamic Network , 2002, SPAA '02.

[8]  Bruce M. Maggs,et al.  Globally Distributed Content Delivery , 2002, IEEE Internet Comput..

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

[10]  Ian Clarke,et al.  Protecting Free Expression Online with Freenet , 2002, IEEE Internet Comput..

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

[12]  Qian Zhang,et al.  A construction of locality-aware overlay network: mOverlay and its performance , 2004, IEEE Journal on Selected Areas in Communications.

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

[14]  Erik Guttman,et al.  Service Location Protocol: Automatic Discovery of IP Network Services , 1999, IEEE Internet Comput..

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

[16]  Stephen E. Deering,et al.  IP Version 6 Addressing Architecture , 1995, RFC.

[17]  Krishna P. Gummadi,et al.  Measuring and analyzing the characteristics of Napster and Gnutella hosts , 2003, Multimedia Systems.

[18]  Ellen W. Zegura,et al.  Bootstrapping in Gnutella: A Measurement Study , 2004, PAM.

[19]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

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