Dynamic swarm management for improved BitTorrent performance

  • Authors:
  • György Dán;Niklas Carlsson

  • Affiliations:
  • ACCESS Linnaeus Centre, KTH, Royal Institute of Technology, Stockholm, Sweden;University of Calgary, Calgary, Canada

  • Venue:
  • IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

BitTorrent is a very scalable file sharing protocol that utilizes the upload bandwidth of peers to offload the original content source. With BitTorrent, each file is split into many small pieces, each of which may be downloaded from different peers. While BitTorrent allows peers to effectively share pieces in systems with sufficient participating peers, the performance can degrade if participation decreases. Using measurements of over 700 trackers, which collectively maintain state information of a combined total of 2.8 million unique torrents, we identify many torrents for which the system performance can be significantly improved by re-allocating peers among the trackers. We propose a light-weight distributed swarm management algorithm that manages the peer torrents while ensuring load fairness among the trackers. The algorithm achieves much of its performance improvements by identifying and merging small swarms, for which the performance is more sensitive to fluctuations in the peer participation, and allows load sharing for large torrents.