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

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 IEEE.

Cite

CITATION STYLE

APA

Huang, N. F., Chang, H. Y., Lin, Y. W., Hsu, K. S., & Liu, H. C. (2009). On the complexity of the bandwidth management problem for scalable coding video streaming on a public-shared network. IEEE Communications Letters, 13(1), 61–63. https://doi.org/10.1109/LCOMM.2009.081596

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free