Stable and scalable universal swarms

  • Authors:
  • Ji Zhu;Stratis Ioannidis;Nidhi Hegde;Laurent Massoulie

  • Affiliations:
  • UIUC, Urbana, IL, USA;Technicolor, Palo Alto, USA;Technicolor, Paris, France;MSR-Inria Joint Centre, Paris, France

  • Venue:
  • Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hajek and Zhu recently showed that the BitTorrent protocol can become unstable when peers depart immediately after downloading all pieces of a file. In light of this result, Zhou et al. propose bundling swarms together, allowing peers to exchange pieces across different swarms, and claim that such "universal swarms" can increase BitTorrent's stability region. In this work, we formally characterize the stability region of universal swarms and show that they indeed exhibit excellent stability properties. In particular, bundling allows a single seed with limited upload capacity to serve an arbitrary number of disjoint swarms if the arrival rate of peers in each swarm is lower than the seed upload capacity. Our result also shows that the stability region is insensitive to peers' upload capacity, piece selection policies and number of swarms.