A Topology Self-adaptation Mechanism for Efficient Resource Location

This paper introduces a novel unstructured P2P system able to adapt its overlay network topology to the load conditions. The adaptation is performed by means of a mechanism which is run by the nodes in the network in an autonomous manner using only local information, so no global coordinator is needed. The aim of this adaptation is to build an efficient topology for the resource discovery mechanism performed via random walks. We present the basis of the adaptation mechanism, along with some simulation results obtained under different conditions. These results show that this system is efficient and robust, even in front of directed attacks.

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

[2]  J. Ritter.  Why Gnutella Can't Scale. No, Really , 2001 .

[3]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

[7]  Scott Shenker,et al.  Can Heterogeneity Make Gnutella Scalable? , 2002, IPTPS.

[8]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[9]  Alexandre Arenas,et al.  Optimal network topologies for local search with congestion , 2002, Physical review letters.

[10]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[11]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[12]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[13]  George H. L. Fletcher,et al.  Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance , 2004, AP2PC.

[14]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.

[15]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[16]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[17]  Antonio Fernández,et al.  Self-adapting network topologies in congested scenarios. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Antonio Fernández,et al.  DANTE: A Self-adapting Peer-to-Peer System , 2006, AP2PC.