A Topology Self-adaptation Mechanism for Efficient Resource Location

  • Luis Rodero-Merino
  • Luis López
  • Antonio Fernández
  • Vicent Cholvi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4330)


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.


Optimal Topology Resource Location Native Connection Random Topology Virtual Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chawathe, Y., Ratnasamy, S., Lanham, N., Shenker, S.: Making nutella-like P2P systems scalable. In: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM 2003), Karlsruhe, Germany, pp. 407–418 (2003)Google Scholar
  2. 2.
    Lv, Q., Ratnasamy, S., Shenker, S.: Can heterogeneity make Gnutella scalable? In: Revised Papers from the First International Workshop on Peer-to-Peer Systems, Cambridge, United States, pp. 94–103 (2002)Google Scholar
  3. 3.
    The napster website, http://www.napster.com
  4. 4.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM 2001), San Diego, CA, United States, pp. 149–160 (2001)Google Scholar
  5. 5.
    Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. ACM Computing Surveys 36, 335–371 (2004)CrossRefGoogle Scholar
  6. 6.
    Ritter, J.: Why gnutella can’t scale. no, really (Technical report) Electronic format in, http://www.darkridge.com/~jpr5/doc/gnutella.html
  7. 7.
    The edonkey and overnet website, http://www.edonkey2000.com
  8. 8.
    Fletcher, G.H.L., Sheth, H.A., Borner, K.: Unstructured peer-to-peer networks: Topological properties and search performance. In: Proceedings of the Third International Workshop on Agents and Peer-to-Peer Computing, New York, United States, Springer, Heidelberg (2004) (to be published)Google Scholar
  9. 9.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th international conference on Supercomputing, New York, United States, pp. 84–95 (2005)Google Scholar
  10. 10.
    Cholvi, V., Laderas, V., López, L., Fernández, A.: Self-adapting network topologies in congested scenarios. Physical Review E 71, 351–403 (2005)CrossRefGoogle Scholar
  11. 11.
    Adamic, L.A., Huberman, B.A., Lukose, R.M., Puniyani, A.R.: Search in power law networks. Physical Review E 64, 46135–46143 (2001)CrossRefGoogle Scholar
  12. 12.
    Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of the Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2004, Hong Kong, vol. 1, pp. 120–130 (2004)Google Scholar
  13. 13.
    Guimerà, R., Díaz-Guilera, A., Vega-Redondo, F., Cabrales, A., Arenas, A.: Optimal network topologies for local search with congestion. Physical Review Letters 89 (2002)Google Scholar
  14. 14.
    Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of SPIE (Proceedings of Multimedia Computing and Networking 2002, MMCN 2002), vol. 4673, pp. 156–170 (2002)Google Scholar
  15. 15.
    Rodero-Merino, L., López, L., Fernández, A., Cholvi, V.: Dante: A self-adapting peer-to-peer system. In: Proceedings of AP2PC 2006. LNCS. Springer, Heidelberg (2006) (to appear)Google Scholar
  16. 16.
    Jelasity, M., Guerraoui, R., Kermarrec, A.M., van Steen, M.: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79–98. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  17. 17.
    Newman, M.E.J.: A measure of betweenness centrality based on random walks. Social Networks 27, 39–54 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Luis Rodero-Merino
    • 1
  • Luis López
    • 1
  • Antonio Fernández
    • 1
  • Vicent Cholvi
    • 2
  1. 1.LADyRUniversidad Rey Juan CarlosMóstolesSpain
  2. 2.Universitat Jaume ICastellónSpain

Personalised recommendations