P2P streaming capacity: survey and recent results

Authors:
Minghua Chen;Mung Chiang;Phil Chou;Jin Li;Shao Liu;Sudipta Sengupta
Affiliations:
The Chinese University of Hong Kong;Princeton University;Microsoft;Microsoft;Microsoft;Microsoft
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 15
Cited 0

A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Approximation algorithms for directed Steiner problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Distributing streaming media content using cooperative networking

NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
The Case for Cooperative Networking

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
SplitStream: high-bandwidth multicast in cooperative environments

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Can internet video-on-demand be profitable?

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Utility maximization in peer-to-peer systems

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance bounds for peer-assisted live streaming

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Measurement Study of a Large-Scale P2P IPTV System

IEEE Transactions on Multimedia
Efficient Multimedia Distribution in Source Constraint Networks

IEEE Transactions on Multimedia
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.