Logo image
On the complexity of the bandwidth management problem for scalable coding video streaming on a public-shared network
Journal article   Peer reviewed

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

Nen-Fu Huang, Hong-Yi Chang, Yuan-Wei Lin, Kuo-Shiang Hsu and Han-Chi Liu
IEEE Communications Letters, Vol.13(1), pp.61-63
2009

Abstract

Approximation algorithm FON NP-hardness Public-shared network Scalable video coding Video streaming
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. © 2009 IEEE.

Metrics

1 Record Views

Details

Logo image