Capacity management of seed servers in peer-to-peer streaming systems with scalable video streams

Kianoosh Mokhtarian, Mohamed Hefeeda

Research output: Contribution to journalArticle

13 Citations (Scopus)


To improve rendered video quality and serve more receivers, peer-to-peer (P2P) video-on-demand streaming systems usually deploy seed servers. These servers complement the limited upload capacity offered by peers. In this paper, we are interested in optimally managing the capacity of seed servers, especially when scalable video streams are served to peers. Scalable video streams are encoded in multiple layers to support heterogeneous receivers. We show that the problem of optimally allocating the seeding capacity to serve scalable streams to peers is NP-complete. We then propose an approximation algorithm to solve it. Using the proposed allocation algorithm, we develop an analytical model to study the performance of P2P video-on-demand streaming systems and to manage their resources. The analysis also provides an upper bound on the maximum number of peers that can be admitted to the system in flash crowd scenarios. We validate our analysis by comparing its results to those obtained from simulations. Our analytical model can be used by administrators of P2P streaming systems to estimate the performance and video quality rendered to users under various network, peer, and video characteristics.

Original languageEnglish
Article number6331532
Pages (from-to)181-194
Number of pages14
JournalIEEE Transactions on Multimedia
Issue number1
Publication statusPublished - 1 Jan 2013


  • Analytical models
  • peer-to-peer streaming
  • resource allocation
  • scalable video streaming

ASJC Scopus subject areas

  • Signal Processing
  • Media Technology
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Capacity management of seed servers in peer-to-peer streaming systems with scalable video streams'. Together they form a unique fingerprint.

  • Cite this