On the complexity of the bandwidth management problem for scalable coding video streaming on a public-shared network

Authors:
Nen-Fu Huang;Hong-Yi Chang;Yuan-Wei Lin;Kuo-Shiang Hsu;Han-Chi Liu
Affiliations:
Department of Computer Science, National Tsing Hua University, Taiwan;Department of Computer Science, National Tsing Hua University, Taiwan;Industrial Technology Research Institute, Hsinchu, Taiwan;Institute of Communications Engineering, NTHU, Taiwan;Institute of Communications Engineering, NTHU, Taiwan
Venue:
IEEE Communications Letters
Year:
2009

Citing 5
Cited 0

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A comparison of heterogeneous video multicast schemes: Layered encoding or stream replication

IEEE Transactions on Multimedia
Sender-adaptive and receiver-driven layered multicast for scalable video over the Internet

IEEE Transactions on Circuits and Systems for Video Technology
Overview of the Scalable Video Coding Extension of the H.264/AVC Standard

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a novel concept of using the sharable bandwidth of public-shared network, like FON network, to construct an efficient video delivery system. We show that the problem of constructing an architecture to serve the video streaming requests by using a minimum amount of sharable bandwidth is NP-Hard. A linear approximation algorithm is also proposed to manage the public-shared bandwidth so that all clients are served and the total amount of employed sharable bandwidth is no greater than twice of the optimal solution.