P2P streaming capacity: Survey and recent results

Minghua Chen, Mung Chiang, Phil Chou, Jin Li, Shao Liu, Sudipta Sengupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations

Abstract

Peer-to-peer (P2P) systems provide a scalable way to stream content to multiple receivers over the Internet and has become a major type of application traffic. The maximum rate achievable by all receivers is the capacity of a P2P streaming session. We provide a taxonomy of the problem formulations. In each formulation, computing P2P streaming capacity requires the computation of an optimal set of multicast trees, generally with an exponential complexity. We survey the family of constructive, polynomial-time algorithms that can compute P2P streaming capacity and the associated multicast trees, arbitrarily accurately for some of the formulations, and to some approximation factors in other formulations. Performance evaluation using large-scale Internet trace is provided before open problems in this research area are discussed.

Original languageEnglish (US)
Title of host publication2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Pages378-387
Number of pages10
DOIs
StatePublished - 2009
Event2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 - Monticello, IL, United States
Duration: Sep 30 2009Oct 2 2009

Publication series

Name2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Other

Other2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Country/TerritoryUnited States
CityMonticello, IL
Period9/30/0910/2/09

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Control and Systems Engineering
  • Communication

Fingerprint

Dive into the research topics of 'P2P streaming capacity: Survey and recent results'. Together they form a unique fingerprint.

Cite this