skip to main content
research-article

Modeling BitTorrent-like systems with many classes of users

Published:10 May 2013Publication History
Skip Abstract Section

Abstract

BitTorrent is one of the most successful peer-to-peer systems. Researchers have studied a number of aspects of the system, including its scalability, performance, efficiency and fairness. However, the complexity of the system has forced most prior analytical work to make a number of simplifying assumptions, for example, user homogeneity, or even ignore some central aspects of the protocol altogether, for example, the rate-based Tit-for-Tat (TFT) unchoking scheme, in order to keep the analysis tractable.

Motivated by this, in this article we propose two analytical models that accurately predict the performance of the system while considering the central details of the BitTorrent protocol. Our first model is a steady-state one, in the sense that it is valid during periods of time where the number of users remains fixed. Freed by the complications of user time-dynamics, we account for many of the central details of the BitTorrent protocol and accurately predict a number of performance metrics. Our second model combines prior work on fluid models with our first model to capture the transient behavior as new users join or old users leave, while modelling many major aspects of BitTorrent. To the best of our knowledge, this is the first model that attempts to capture the transient behavior of many classes of heterogeneous users. Finally, we use our analytical methodology to introduce and study the performance of a flexible token-based scheme for BitTorrent, show how this scheme can be used to block freeriders and tradeoff between higher-bandwidth and lower-bandwidth users performance, and evaluate the scheme's parameters that achieve a target operational point.

Skip Supplemental Material Section

Supplemental Material

References

  1. Al-Hamra, A., Liogkas, N., Legout, A., and Barakat, C. 2009. Swarming overlay construction strategies. In Proceedings of International Conference on Computer Communications and Networks. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bharambe, A., Herley, C., and Padmanabhan, V. 2006. Analyzing and improving bittorrent performance. In Proceedings of IEEE INFOCOM.Google ScholarGoogle Scholar
  3. BigChampagne. 2006. BigChampagne media measurement. http://www.bigchampagne.com.Google ScholarGoogle Scholar
  4. Bin, F., Chiu, D.-M., and Lui, J. C. 2006. The delicate tradeoffs in bittorrent-like file sharing protocol design. In Proceedings of International Conference on Network Protocols (ICNP). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. BitTornado. 2012. http://www.bittornado.com/.Google ScholarGoogle Scholar
  6. BitTorrent. 2008. BitTorrent protocol specification. http://www.bittorrent.org/beps/bep_0003.html.Google ScholarGoogle Scholar
  7. BitTorrent Simulator. 2005. Microsoft Research simulator for the BitTorrent protocol. http://research. microsoft.com/en-us/downloads/20d68689-9a8d-44c0-80cd-66dfa4b0504b/.Google ScholarGoogle Scholar
  8. Chow, A. L., Golubchik, L., and Misra, V. 2009. Bittorrent: An extensible heterogeneous model. In Proceedings of IEEE INFOCOM.Google ScholarGoogle Scholar
  9. Clevenot, F., Nain, P., and Ross, K. 2005. Multiclass p2p networks: Static resource allocation for service differentiation and bandwidth diversity. In Proceedings of IFIP WG 7.3 PERFORMANCE.Google ScholarGoogle Scholar
  10. Cohen, B. 2003. Incentives build robustness in bittorrent. In Proceedings of the Workshop on Economics of Peer-to-Peer Systems.Google ScholarGoogle Scholar
  11. Fan, B., Chiu, D.-M., and Lui, J. 2006. Stochastic differential equation approach to model bittorrent-like file sharing systems. In Proceedings of 14th IEEE International Workshop on Quality of Service.Google ScholarGoogle Scholar
  12. Fan, B., Lui, J. C. S., and Chiu, D.-M. 2009. The design trade-offs of bittorrent-like file sharing protocols. IEEE/ACM Trans. Netw. 17, 2, 365--376. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Gaeta, R., Gribaudo, M., Manini, D., and Sereno, M. 2006. Analysis of resource transfers in peer-to-peer file sharing applications using fluid models. Perf. Eval. 63, 3, 149--174. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., and Zhang, X. 2005. Measurements, analysis, and modeling of bittorrent-like systems. In Proceedings of the Internet Measurement Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., and Zhang, X. 2007. A performance study of bittorrent-like peer-to-peer systems. IEEE J. Select. Areas Comm. 25, 1, 155--169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Hales, D. and Patarin, S. 2005. How to cheat bittorrent and why nobody does. Tech. rep. UBLCS-2005-12, University of Bologna, Italy.Google ScholarGoogle Scholar
  17. Izal, M., Keller, G., Biersack, E., Felber, P., Hamra, A., and Erice, L. 2004. Dissecting bittorrent: Five months in a torrent's lifetime. In Proceedings of Passive and Active Measurements.Google ScholarGoogle Scholar
  18. Legout, A., Liogkas, N., Kohler, E., and Zhang, L. 2007. Clustering and sharing incentives in bittorrent systems. In Proceedings of ACM SIGMETRICS. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Liao, W.-C., Papadopoulos, F., and Psounis, K. 2006a. An efficient algorithm for resource sharing in peer-to-peer networks. In Proceedings of IFIP-TC6 NETWORKING. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Liao, W.-C., Papadopoulos, F., and Psounis, K. 2006b. A peer-to-peer cooperation enhancement scheme and its performance analysis. J. Comm. 1, 7, 24--35.Google ScholarGoogle ScholarCross RefCross Ref
  21. Liao, W.-C., Papadopoulos, F., and Psounis, K. 2007a. Performance analysis of bittorrent-like systems in heterogeneous networks. Tech. rep. CENG-2007-2, University of Southern California.Google ScholarGoogle Scholar
  22. Liao, W.-C., Papadopoulos, F., and Psounis, K. 2007b. Performance analysis of bittorrent-like systems with heterogeneous users. In Proceedings of IFIP WG 7.3 PERFORMANCE.Google ScholarGoogle Scholar
  23. Liogkas, N., Nelson, R., Kohler, E., and Zhang, L. 2006. Exploiting bittorrent for fun (but not profit). In Proceedings of IPTPS.Google ScholarGoogle Scholar
  24. Lo Piccolo, F. and Neglia, G. 2004. The effect of heterogeneous link capacities in bittorrent-like file sharing systems. In Proceedings of Hot-P2P. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Nephelae. 2012. Nephelae cloud computing cluster. http://grid.ucy.ac.cy/Nephelae/.Google ScholarGoogle Scholar
  26. Parker, A. 2004. The true picture of peer-to-peer filesharing. http://www.cachelogic.com/.Google ScholarGoogle Scholar
  27. Piatek, M., Isdal, T., Anderson, T., Krishnamurthy, A., and Venkataramani, A. 2007. Do incentives build robustness in Bittorrent? In Proceedings of NSDI. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Pouwelse, J., Garbacki, P., Epema, D., and Sips, H. 2005. The bittorrent P2P file-sharing system: Measurements and analysis. In Proceedings of IPTPS. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Qiu, D. and Srikant, R. 2004. Modeling and performance analysis of bittorrent-like peer-to-peer networks. In Proceedings of ACM SIGCOMM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Rao, A., Legout, A., and Dabbous., W. 2010. Can realistic bittorrent experiments be performed on clusters? In Proceedings of the IEEE International Conference on Peer-to-Peer Computing (P2P).Google ScholarGoogle Scholar
  31. Ren, S., Tan, E., Luo, T., Chen, S., Guo, L., and Zhang, X. 2010. TopBT: A topology-aware and infrastructure-independent bittorrent client. In Proceedings of IEEE INFOCOM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Saroiu, S., Gummadi, K. P., Dunn, R. J., Gribble, S., and Levy, H. M. 2002. An analysis of internet content delivery systems. In Proceedings of OSDI. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Sherman, A., Nieh, J., and Stein, C. 2009. Fairtorrent: Bringing fairness to peer-to-peer systems. In Proceedings of CoNEXT. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Sirivianos, M., Park, J. H., Chen, R., and Yang, X. 2007. Free-riding in bittorrent networks with the large view exploit. In Proceedings of IPTPS.Google ScholarGoogle Scholar
  35. Thommes, R. and Coates, M. 2005. Bittorrent fairness: Analysis and improvements. In Proceedings of the Workshop of Internet, Telecommunications and Signal Processing.Google ScholarGoogle Scholar
  36. Tian, Y., Wu, D., and Ng, K. 2006. Modeling, analysis and improvement for bittorrent-like file sharing networks. In Proceedings of IEEE INFOCOM.Google ScholarGoogle Scholar
  37. TorrentFreak. 2009. BitTorrent still king of P2P traffic. http://torrentfreak.com/bittorrent-still-king-of-p2p-traffic-090218/.Google ScholarGoogle Scholar
  38. Wang, J., Yeo, C., Prabhakaran, V., and Ramchandran, K. 2007. On the role of helpers in peer-to-peer file download systems: Design, analysis, and simulation. In Proceedings of IPTPS.Google ScholarGoogle Scholar
  39. Wolfram Mathematica. http://www.wolfram.com/.Google ScholarGoogle Scholar
  40. Yang, X. and Veciana, G. D. 2004. Service capacity of peer to peer networks. In Proceedings of IEEE INFOCOM.Google ScholarGoogle Scholar

Index Terms

  1. Modeling BitTorrent-like systems with many classes of users

        Recommendations

        Reviews

        Amos O Olagunju

        Large-scale distributions of digital content over the Internet require effective algorithms and systems. The traditional BitTorrent model has been successful in the distribution of files on peer-to-peer (P2P) systems for homogeneous users [1,2]. But in the real world, how should voluminous content be effectively distributed to heterogeneous users on diverse connections such as dial-up, digital subscriber line (DSL)/cable, and local area networks (LANs)__?__ Bram Cohen created the first BitTorrent client protocol in July 2001. However, the debate has continued for years over the best way to efficiently stream voluminous content over networks. In this paper, Liao et al. present two models for ascertaining the performance of BitTorrent-like systems. The first is a steady-state analytical model for predicting the performance of a system with a fixed number of users in a time period. The second is a fluid model that incorporates the transitory behaviors of several classes of users who vacate and connect to a system, to forecast the performance of BitTorrent-like systems. The authors succinctly critique the deficiencies of the existing algorithms available for coping with BitTorrent traffic systems. They derive algorithms for minimizing download rates and delays for low-bandwidth, medium-bandwidth, and high-bandwidth users. They perform event-driven BitTorrent simulation experiments to gauge the performances of the algorithms in forecasting file download rates and delays. The results reveal that the proposed steady-state analytical and fluid models are reasonably accurate in predicting file download rates and, consequently, delays for categories of users. Clearly, the fluid model is the first of its kind to consider the time-related aspects of any number of user categories when estimating the download and delay rates in heterogeneous settings. Other than the failure to incorporate the variance in the number of neighbors that clients connect to, the fluid model supports effective file sharing and "eliminates the problem of freeriders [that] exploit optimistic unchoking in the original BitTorrent, since such users cannot accumulate any tokens." Online Computing Reviews Service

        Access critical reviews of Computing literature here

        Become a reviewer for Computing Reviews.

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Modeling and Computer Simulation
          ACM Transactions on Modeling and Computer Simulation  Volume 23, Issue 2
          May 2013
          92 pages
          ISSN:1049-3301
          EISSN:1558-1195
          DOI:10.1145/2457459
          Issue’s Table of Contents

          Copyright © 2013 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 10 May 2013
          • Accepted: 1 September 2012
          • Revised: 1 June 2012
          • Received: 1 November 2011
          Published in tomacs Volume 23, Issue 2

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader