Skip to main content

An Adaptive Routing Mechanism for Efficient Resource Discovery in Unstructured P2P Networks

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3482))

Included in the following conference series:

Abstract

The widespread adoption of large-scale decentralized peer-to-peer (P2P) systems imposes huge challenges on distributed search and routing. Decentralized and unstructured P2P networks are very attractive because they require neither centralized directories, nor precise control over network topology or data placement. However their search mechanisms are extremely unscalable, generating large loads on the network participants. In this paper, to address this major limitation, we propose and evaluate the adoption of an innovative algorithm for routing user queries. The proposed approach aims at dynamically adapting the network topology to peer interests, on the basis of query interactions among users. Preliminaries evaluations show that the approach is able to dynamically group peer nodes in clusters containing peers with shared interests and organized into a small world topology.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Lv, Q., Caoa, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured Peer-to-Peer networks. In: Proc. ACM ICS (2002)

    Google Scholar 

  2. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F.: Chord: A scalable Peer-to-Peer lookup service for internet applications. In: Proc. ACM SIGCOMM 2001, pp. 149–160 (2001)

    Google Scholar 

  3. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale Peer-to-Peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM 2001, pp. 161–172 (2001)

    Google Scholar 

  5. Limewire: The Gnutella protocol specification (ver. 0.4), http://www.limewire.com/developer/gnutella_protocol_0.4.pdf

  6. Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the Gnutella network: Properties of large scale Peer-to-Peer systems and implications for system design. IEEE Journal on Internet Computing, Special Issue on Peer-to-peer Networking (2002)

    Google Scholar 

  7. Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power law networks. Phys. Rev. E64, 46135–46143 (2001)

    Google Scholar 

  8. Liu, Y., Liu, X., Xiao, L., Ni, L.M., Zhang, X.: Location-aware topology matching in P2P systems. In: Proc. IEEE INFOCOM (2004)

    Google Scholar 

  9. Yang, B., Garcia-Molina, H.: Effcient search in Peer-to-Peer networks. In: Proc. IEEE ICDCS (2002)

    Google Scholar 

  10. Crespo, A., Garcia-Molina, H.: Routing indices for Peer-to-Peer systems. In: Proc. IEEE ICDCS (2002)

    Google Scholar 

  11. Milgram, S.: The small world problem. Psychology Today 2, 60–67 (1967)

    Google Scholar 

  12. Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve Freenet performance. In: Proc. IEEE INFOCOM (2002)

    Google Scholar 

  13. Iamnitchi, A., Ripeanu, M., Foster, I.: Small-world file-sharing communities. In: Proc. IEEE INFOCOM (2004)

    Google Scholar 

  14. Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: Proc. of USENIX Symposium on Internet Technologies and Systems (2003)

    Google Scholar 

  15. Comellas, F., Mitjana, M.: Broadcasting in small-world communication networks. In: Proc. 9th Int. Coll. on Structural Information and Communication Complexity, pp. 73–85 (2002)

    Google Scholar 

  16. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13, 422–426 (1970)

    Article  MATH  Google Scholar 

  17. Saroiu, S., Gummadi, K., Gribble, S.: A measurement study of Peer-to-Peer file sharing systems. In: Proc. ACM Multimedia Conferencing and Networking (2002)

    Google Scholar 

  18. Sen, S., Wang, J.: Analyzing Peer-to-Peer traffic across large networks. IEEE/ACM Transactions on Networking 12, 212–232 (2004)

    Article  Google Scholar 

  19. Watts, D., Strogatz, S.: Collective dynamics of ”small-world” networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gatani, L., Re, G.L., Gaglio, S. (2005). An Adaptive Routing Mechanism for Efficient Resource Discovery in Unstructured P2P Networks. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_5

Download citation

  • DOI: https://doi.org/10.1007/11424857_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25862-9

  • Online ISBN: 978-3-540-32045-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics