Optimization Letters

, Volume 7, Issue 5, pp 923–932

On swarm-level resource allocation in BitTorrent communities

Authors

    • Delft University of Technology
  • Flávio Santos
    • Universidade Federal de Rio Grande do Sul
  • Nazareno Andrade
    • Universidade Federal de Campina Grande
  • Mihai Capotă
    • Delft University of Technology

DOI: 10.1007/s11590-012-0477-5

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

Acknowledgments

The authorswould like to thank the anonymous reviewers for their valuable comments and suggestions to improve the quality of the paper. This work was partially supported by the by the Grant TÁMOP-4.2.2/08/1/2008-0008, and by the Future and Emerging Technologies programme FP7-COSI-ICT of the European Commission through project QLectives (grant no.: 231200).

Open Access

This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.

Copyright information

© The Author(s) 2012