Skip to main content

Efficient Search in Gnutella-Like “Small-World” Peer-to-Peer Systems

  • Conference paper
Grid and Cooperative Computing (GCC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3032))

Included in the following conference series:

  • 376 Accesses

Abstract

Gnutella-like peer-to-peer file-sharing systems have been widely deployed on the Internet. However, current search techniques used in existing Gnutella-like peer-to-peer systems are often inefficient. We demonstrated the strong “small-world” property of Gnutella systems and proposed an efficient search approach CSTM to utilize the property. In CSTM, each peer maintains a local state table, which contains keyword information of data on all neighbors within T hops to guide query. A new data structure based on Bloom Filter is introduced to represent the state table compactly to reduce storage and bandwidth cost. Query cache is also adopted to utilize query locality and build shortcut connections to lately accessed peers. Simulations show that CSTM can reduce message cost remarkably while maintaining short search path length compared with flooding or random forwarding algorithm.

This work was supported by the National Natural Science Foundation of China under the grant No. 69933030 and 60203016, the National 863 High Technology Plan of China under the grant No. 2002AA131010 and 2003AA1Z2060, and the Excellent PHD Dissertation Foundation of China under the grant No. 200141.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clark, D.: Face-to-face with peer-to-peer networking. IEEE Computer 34(1), 18–21 (2001)

    Google Scholar 

  2. Schoder, D., Fischbach, K.: peer-to-peer prospects. Communications of the ACM 46(2), 27–29 (2003)

    Article  Google Scholar 

  3. Li, D., Fang, X., Wang, Y., Lu, X., et al.: A scalable peer-to-peer network with constant degree. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds.) APPT 2003. LNCS, vol. 2834, pp. 414–424. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Clark, I., Sandberg, O., Wiley, B., Hong, T.: Freenet: a distributed anonymous information storage and retrieval system. In: Proc. of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, pp. 311–320 (2000)

    Google Scholar 

  5. Joseph, S.R.H.: NeuroGrid: semantically routing queries in peer-to-peer networks. In: Proc. of International Workshop on Peer-to-Peer Computing, Pisa, Italy (2002)

    Google Scholar 

  6. Evangelos, P.: Markatos: Tracing a large-scale peer-to-peer system: an hour in the life of Gnutella. In: Proc. of CCGrid 2002, Berlin, Germany (2002)

    Google Scholar 

  7. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of the 16th annual ACM International Conference on Supercomputing, ICS, New York (2002)

    Google Scholar 

  8. Edith, C., Scott, S.: Replication strategies in unstructured peer-to-peer networks. In: Proc. of ACM Sigcomm 2002, ACM Press, Pittsburgh (2002)

    Google Scholar 

  9. Yang, B., Garcia-Molina, H.: Efficient search in peer-to-peer networks. In: Proc of the 22nd IEEE ICDCS, Vienna, Austria (2002)

    Google Scholar 

  10. Adamic, L.A., Humberman, B., Lukose, R., Puniyani, A.: Search in power law networks. Phys. Rev. E 64(4), 46135–46143 (2001)

    Article  Google Scholar 

  11. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc of the 22nd IEEE ICDCS, Vienna, Austria (2002)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Fan, L., Cao, P., Almeida, J., Broder, A.: Summary cache: a scalable wide-area web cache sharing protocol. In: Proc. of ACM SIGCOMM 1998, pp. 254–265. ACM Press, New York (1998)

    Google Scholar 

  14. Sean, C.R., Kubiatowicz, J.: Probabilistic location and routing. In: Proc. Of IEEE Infocom 2002, IEEE Computer Soc. press, New York (2002)

    Google Scholar 

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

    Article  Google Scholar 

  16. Clip2 Company, http://www.clip2.com/

  17. Li, D., et al.: Efficient Search in Gnutella-like “Small-World” Peer-to-Peer Systems. Tech Rept. PDL-2002-11-2, National University of Defense Technology, Changsha City, China (2002)

    Google Scholar 

  18. Adar, E., Huberman, B.A.: Free riding on Gnutella. First Monday 5(10) (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, D., Lu, X., Wang, Y., Xiao, N. (2004). Efficient Search in Gnutella-Like “Small-World” Peer-to-Peer Systems. In: Li, M., Sun, XH., Deng, Qn., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24679-4_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24679-4_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21988-0

  • Online ISBN: 978-3-540-24679-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics