Minimum Variable Bandwidth Allocation over Group of Pictures for MPEG Video Transmission


KIPS Transactions on Computer and Communication Systems, Vol. 9, No. 5, pp. 679-686, Oct. 2002
10.3745/KIPSTC.2002.9.5.679,   PDF Download:

Abstract

The transmission of prerecorded and compressed video data without degradation of picture quality requires video servers to cope with large fluctuations in bandwidth requirement. Bandwidth smoothing techniques can reduce the burst of a variable-bit rate stream by prefetching data at a series of fixed rates and simplifying the allocation of resources in the video servers and the network. In this paper, the proposed smoothing algorithm results in the optimal transmission plans for (1) the smallest bandwidth requirements, (2) the minimum number of changes in transmission rate, and (3) the minimum amount of the server process overhead. The advantages of the proposed smoothing algorithm have been verified through the comparison with the existing smoothing algorithms in diverse environments.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. W. Kwak, M. J. Lee, H. Y. Song and D. S. Park, "Minimum Variable Bandwidth Allocation over Group of Pictures for MPEG Video Transmission," KIPS Journal C (2001 ~ 2012) , vol. 9, no. 5, pp. 679-686, 2002. DOI: 10.3745/KIPSTC.2002.9.5.679.

[ACM Style]
Joon Won Kwak, Myoun Jae Lee, Ha Yoon Song, and Do Soon Park. 2002. Minimum Variable Bandwidth Allocation over Group of Pictures for MPEG Video Transmission. KIPS Journal C (2001 ~ 2012) , 9, 5, (2002), 679-686. DOI: 10.3745/KIPSTC.2002.9.5.679.