A Statistical Study of Today’s Gnutella

  • Shicong Meng
  • Cong Shi
  • Dingyi Han
  • Xing Zhu
  • Yong Yu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3841)

Abstract

As a developing P2P system, Gnutella has upgraded its protocol to 0.6, which significantly changed the characteristics of its hosts. However, few previous work has given a wide-scale study to the new version of Gnutella. In addition, various kinds of P2P models are used to evaluate P2P systems or mechanisms, but the reliability of some hypotheses used in the models are not carefully studied or proved. In this paper, we try to remedy this situation by performing a large scaled measurement study on Gnutella with the help of some new crawling approaches. In particular, we characterize Gnutella by its queries, shared files and peer roles. Our measurements show that the assumption that query arrival follows Poisson distribution may not be true in Gnutella and most peers incline to share files of very limited types, even when MP3 files are excluded. We also find that many ultrapeers in Gnutella are not well selected. Statistical data provided in this paper can also be useful for P2P modeling and simulation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lui, S.M., Kwok, S.H.: Interoperability of peer-to-peer file sharing protocols. ACM SIGecom Exchanges 3, 25–33 (2002)CrossRefGoogle Scholar
  2. 2.
    RFC-Gnutella: Rfc-gnutella 0.6 (2003), http://rfc-gnutella.sourceforge.net/developer/
  3. 3.
    KaZaA: Kazaa web site (2001), http://www.kazaa.com/
  4. 4.
    Good, N., Krekelberg, A.: Usability and privacy: a study of kazaa p2p file-sharing. In: Cockton, G., Korhonen, P. (eds.) CHI, pp. 137–144. ACM, New York (2003)Google Scholar
  5. 5.
    Qiu, D., Srikant, R.: Modeling and performance analysis of bittorrent-like peer-to-peer networks. In: Yavatkar, R., Zegura, E.W., Rexford, J. (eds.) SIGCOMM, pp. 367–378. ACM, New York (2004)CrossRefGoogle Scholar
  6. 6.
    Bharambe, A.R., Herley, C., Padmanabhan, V.N.: Some observations on bittorrent performance. In: Eager, D.L., Williamson, C.L., Borst, S.C., Lui, J.C.S. (eds.) SIGMETRICS, pp. 398–399. ACM, New York (2005)Google Scholar
  7. 7.
    Sen, S., Wang, J.: Analyzing peer-to-peer traffic across large networks. IEEE/ACM Transactions on Networking (TON) 12, 219–232 (2004)CrossRefGoogle Scholar
  8. 8.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: SIGMETRICS, pp. 258–259. ACM, New York (2002)Google Scholar
  9. 9.
    Adar, E., Huberman, B.A.: Free riding on gnutella. First Monday 5 (2000)Google Scholar
  10. 10.
    Saroiu, S., Gummadi, P.K., et al.: Measuring and analyzing the characteristics of napster and gnutella hosts. Multimedia Syst. 9, 170–184 (2003)CrossRefGoogle Scholar
  11. 11.
    Markatos, E.P.: Tracing a large-scale peer to peer system: An hour in the life of gnutella. In: CCGRID, pp. 65–74. IEEE Computer Society, Los Alamitos (2002)Google Scholar
  12. 12.
    Klemm, A., Lindemann, C., Vernon, M.K., et al.: Characterizing the query behavior in peer-to-peer file sharing systems. In: Internet Measurement Conf., pp. 55–67 (2004)Google Scholar
  13. 13.
    Kwok, S.H., Yang, C.C.: Searching the peer-to-peer networks: the community and their queries. Journal of the American Society for Information Science and Technology 55, 783–793 (2004)CrossRefGoogle Scholar
  14. 14.
    Cisco: White paper - netflow services and applications, http://www.cisco.com/warp/public/cc/pd/iosw/ioft/neflct/tech/nappswp.htm
  15. 15.
    Napster: Napster web site (2000), http://www.napster.com/
  16. 16.
    Wikipedia: Opennap from wikipedia, the free encyclopedia (2005), http://en.wikipedia.org/wiki/OpenNap
  17. 17.
    Asvanund, A., Clay, K., Krishnan, R., Smith, M.D.: An empirical analysis of network externalities in peer-to-peer music-sharing networks. Info. Sys. Research 15, 155–174 (2004)CrossRefGoogle Scholar
  18. 18.
    Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Comm. of the ACM 13, 422–426 (1970)MATHCrossRefGoogle Scholar
  19. 19.
    Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter p2p networks. In: Proc. of the 42nd IEEE symposium on Foundations of Computer Science, p. 492 (2001)Google Scholar
  20. 20.
    Harter, S.: A probabilistic approach to automatic keyword indexing: Part i. on the distribution of specialty words in technical literature. Journal of the American Society for Information Science 26, 197–206 (1975)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Shicong Meng
    • 1
  • Cong Shi
    • 1
  • Dingyi Han
    • 1
  • Xing Zhu
    • 1
  • Yong Yu
    • 1
  1. 1.APEX Data and Knowledge Management Lab, Department of Computer Science and EngineeringShanghai Jiao Tong UniversityShanghaiP.R. China

Personalised recommendations