Content availability and bundling in swarming systems

  • Authors:
  • Daniel S. Menasche;Antonio A. De A. Rocha;Bin Li;Don Towsley;Arun Venkataramani

  • Affiliations:
  • Computer Science Department, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil;Computer Science Department, Fluminense Federal University, Niterói, Brazil;Automation Department, Tsinghua University, Beijing, China;Computer Science Department, University of Massachusetts Amherst, Amherst, MA;Computer Science Department, University of Massachusetts Amherst, Amherst, MA

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

BitTorrent, the immensely popular file swarming system, suffers a fundamental problem: content unavailability. Although swarming scales well to tolerate flash crowds for popular content, it is less useful for unpopular content as peers arriving after the initial rush find it unavailable. In this paper, we present a model to quantify content availability in swarming systems. We use the model to analyze the availability and the performance implications of bundling, a strategy commonly adopted by many BitTorrent publishers today. We find that even a limited amount of bundling exponentially reduces content unavailability. For swarms with highly unavailable publishers, the availability gain of bundling can result in a net decrease in average download time. We empirically confirm the model's conclusions through experiments on PlanetLab using the Mainline BitTorrent client.