Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Efficient Blacklisting and Pollution-Level Estimation in P2P File-Sharing Systems

  • Conference paper
Technologies for Advanced Heterogeneous Networks (AINTEC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3837))

Included in the following conference series:

Abstract

P2P file-sharing systems are susceptible to pollution attacks, whereby corrupted copies of content are aggressively introduced into the system. Recent research indicates that pollution is extensive in several file sharing systems. In this paper we propose an efficient measurement methodology for identifying the sources of pollution and estimating the levels of polluted content. The methodology can be used to efficiently blacklist polluters, evaluate the success of a pollution campaign, to reduce wasted bandwidth due to the transmission of polluted content, and to remove the noise from content measurement data. The proposed methodology is efficient in that it does not involve the downloading and analysis of binary content, which would be expensive in bandwidth and in computation/human resources. The methodology is based on harvesting metadata from the file sharing system and then processing off-line the harvested meta-data. We apply the technique to the FastTrack/Kazaa file-sharing network. Analyzing the false positives and false negatives, we conclude that the methodology is efficient and accurate.

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. CacheLogic Research: The True Picture of P2P File Sharing, http://www.cachelogic.com/research/

  2. Liang, J., Kumar, R., Xi, Y., Ross, K.: Pollution in P2P File Sharing Systems. In: IEEE Infocom 2005, Miami, FL (2005)

    Google Scholar 

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

    Google Scholar 

  4. Stutzbach, D., Rejaie, R.: Characterizating Today’s Gnutella Topology (submitted)

    Google Scholar 

  5. Schemers, R.: fping utility, http://www.fping.com/

  6. Apple iTunes Top 100, http://www.apple.com/itunes/

  7. Top 100 songs from 1970 to (1979), http://top40.about.com/cs/70shits/

  8. Blockbuster’s Top 100 Online Rentals, http://www.blockbuster.com/

  9. Mao, Z.M., Rexford, J., Wang, J., Katz, R.: Towards an Accurate AS-Level Traceroute Tool. In: Proceedings of ACM SIGCOMM, August 2003, Karlsruhe, Germany (2003)

    Google Scholar 

  10. CIDR Report, http://www.cidr-report.org

  11. Sen, S., Wang, J.: Analyzing Peer-to-Peer Traffic Across Large Networks. ACM/IEEE Transactions on Networking 12(2) (April 2004)

    Google Scholar 

  12. Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Multimedia Computing and Networking (MMC 2002), San Jose (January 2002)

    Google Scholar 

  13. Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP-19) (October 2003)

    Google Scholar 

  14. Aggarwal, V., Bender, S., Feldmann, A., Wichmann, A.: Methodology for Estimating Network Distances of Gnutella Neighbors. In: Proceedings of the Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications at Informatik (2004)

    Google Scholar 

  15. Le Fessant, F., Handurukande, S., Kermarrec, A.-M., Massouli, L.: Clustering in Peer-to-Peer File Sharing Workloads. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 217–226. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Katabi, D., Krishanmurthy, B.: Unwanted Traffic: Attacks, Detection, and Potential Solutions. In: ACM SIGCOMM 2004 Tutorial (2004)

    Google Scholar 

  17. Biddle, P., England, P., Peinado, M., Willman, B.: The Darknet and the Future of Content Distribution. In: Feigenbaum, J. (ed.) DRM 2002. LNCS, vol. 2696, pp. 155–176. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Feldman, M., Papadimitriou, C., Chuang, J., Stoica, I.: Free-Riding and Whitewashing in Peer-to-Peer Systems. In: ACM SIGCOMM 2004 Workshop on Practice and Theory of Incentives in Networked Systems (PINS) (August 2004)

    Google Scholar 

  19. Dropsho, S.: Denial of Service Resilience in Peer to Peer File Sharing Systems.EPFL Tech Report

    Google Scholar 

  20. http://www.bullguard.com

  21. Sandra, G., Dykes, K.A., Robbins, C.L.: An Empirical Evaluation of Client-side Server Selection Algorithms. In: Infocom 2000 (2000)

    Google Scholar 

  22. Ng, T.S.E., Chu, Y., Rao, S.G., Sripanidkulchai, K., Zhang, H.: Measurement-Based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems. In: IEEE INFOCOM 2003 (2003)

    Google Scholar 

  23. Bluetack Internet Security Solutions, http://www.bluetack.co.uk/

  24. The FFmpeg project, http://ffmpeg.sourceforge.net/index.php

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

Liang, J., Naoumov, N., Ross, K.W. (2005). Efficient Blacklisting and Pollution-Level Estimation in P2P File-Sharing Systems. In: Cho, K., Jacquet, P. (eds) Technologies for Advanced Heterogeneous Networks. AINTEC 2005. Lecture Notes in Computer Science, vol 3837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599593_1

Download citation

  • DOI: https://doi.org/10.1007/11599593_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30884-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics