Optimization Letters

, Volume 7, Issue 5, pp 923–932

On swarm-level resource allocation in BitTorrent communities

  • Tamás Vinkó
  • Flávio Santos
  • Nazareno Andrade
  • Mihai Capotă
Open Access
Original Paper

Abstract

BitTorrent is a peer-to-peer computer network protocol for sharing content in an efficient and scalable way. Modeling and analysis of the popular private BitTorrent communities has become an active area of research. In these communities users are strongly incentivized to contribute their resources, i.e., to share their files. In BitTorrent terminology, users who have finished downloading files and stay online to share these files with others in the network are called seeders. The combination of seeders and downloaders of a file is called a swarm. In this paper we examine and evaluate the efficiency of the resource allocation of seeders in multiple swarms. This is formulated as an integer linear fractional programming problem. The evaluation is done on traces representing two existing BitTorrent communities. We find that in communities, particularly with low users-to-files ratio (which is typically the case), there is room for improvement.

Keywords

BitTorrent File sharing system Resource allocation Integer optimization 

References

  1. 1.
    Andrade N., Santos-Neto E., Brasileiro F., Ripeanu M.: Resource demand and supply in bittorrent content-sharing communities. Comput Netw 53(4), 515–527 (2009)MATHCrossRefGoogle Scholar
  2. 2.
    Cohen, B.: Incentives build robustness in bittorrent. In: Proceedings of Workshop on Economics of Peer-to-Peer Systems, vol. 6, pp. 68–72 (2003)Google Scholar
  3. 3.
    Dunn, R.J., Gribble, S.D., Levy, H.M.: The importance of history in a media delivery system. In: Proceedings of the Sixth International Workshop on Peer-to-Peer Systems (2007)Google Scholar
  4. 4.
    Ford L.R., Fulkerson D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Goldberg A.V., Tarjan R.E.: A new approach to the maximum-flowproblem. J. ACM 35, 921–940 (1988)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Meulpolder, M., Pouwelse, J.A., Epema, D.H.J., Sips, H.J.: Bartercast: A practical approach to prevent lazy freeriding in p2p networks. In: Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (2009)Google Scholar
  7. 7.
    Peterson, R.S., Sirer, E.G.: Antfarm: Efficient content distribution with managed swarms. In: Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, pp. 107–122 (2009)Google Scholar
  8. 8.
    Piatek, M., Isdal, T., Krishnamurthy, A., Anderson, T.: One hop reputations for peer to peer file sharing workloads. In: Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation, pp. 1–14 (2008)Google Scholar
  9. 9.
    Wu, D., Liang, C., Liu, Y., Ross, K.: View-upload decoupling: a redesign of multi-channel p2p video systems. In: Proceedings of IEEE INFOCOM, Rio de Janeiro, Brazil, pp. 1–6 (2009)Google Scholar
  10. 10.
    Yang, Y., Chow, A.L.H., Golubchik, L.: Multi-torrent: a performance study. In: Proceedings of IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems, pp. 1–8 (2008)Google Scholar

Copyright information

© The Author(s) 2012

Authors and Affiliations

  • Tamás Vinkó
    • 1
  • Flávio Santos
    • 2
  • Nazareno Andrade
    • 3
  • Mihai Capotă
    • 1
  1. 1.Delft University of TechnologyDelftThe Netherlands
  2. 2.Universidade Federal de Rio Grande do SulPorto AlegreBrazil
  3. 3.Universidade Federal de Campina GrandeCampina GrandeBrazil

Personalised recommendations