TY - GEN
T1 - Online VBR video traffic smoothing
AU - Cao, Guohong
AU - Feng, Wuchi
AU - Singhal, Wukesh
N1 - Publisher Copyright:
© 1999 IEEE.
PY - 1999
Y1 - 1999
N2 - The efficient transmission of constant quality compressed video streams is complicated by the burstiness (both short term and long term) that video compression standards such as MPEG introduce. Most of the techniques in the literature are concentrated on stored video traffic smoothing or real-time video traffic smoothing. However there is a growing number of live video applications, such as videocasts of courses or television news, where many clients may be willing to tolerate a playback delay of several seconds or minutes in exchange for a smaller throughput requirement. Bandwidth smoothing for these live video applications is referred to as online smoothing. In order to measure the effectiveness of online video smoothing methods, in this paper, we first propose a benchmark algorithm which provides the upper bound on some of the smoothness parameters in the smoothing results. Based on this algorithm, we found that significant discrepancy exists between the results produced by the existing online smoothing methods and the upper bound. With this observation, we then focus on devising algorithms which improve the smoothing results.
AB - The efficient transmission of constant quality compressed video streams is complicated by the burstiness (both short term and long term) that video compression standards such as MPEG introduce. Most of the techniques in the literature are concentrated on stored video traffic smoothing or real-time video traffic smoothing. However there is a growing number of live video applications, such as videocasts of courses or television news, where many clients may be willing to tolerate a playback delay of several seconds or minutes in exchange for a smaller throughput requirement. Bandwidth smoothing for these live video applications is referred to as online smoothing. In order to measure the effectiveness of online video smoothing methods, in this paper, we first propose a benchmark algorithm which provides the upper bound on some of the smoothness parameters in the smoothing results. Based on this algorithm, we found that significant discrepancy exists between the results produced by the existing online smoothing methods and the upper bound. With this observation, we then focus on devising algorithms which improve the smoothing results.
UR - http://www.scopus.com/inward/record.url?scp=78651587325&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651587325&partnerID=8YFLogxK
U2 - 10.1109/ICCCN.1999.805565
DO - 10.1109/ICCCN.1999.805565
M3 - Conference contribution
AN - SCOPUS:78651587325
SN - 0780357949
SN - 9780780357945
T3 - Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999
SP - 502
EP - 507
BT - Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999
A2 - Somani, Arun
A2 - Park, EK
A2 - Dixit, Sudhir
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 8th International Conference on Computer Communications and Networks, ICCCN 1999
Y2 - 11 October 1999 through 13 October 1999
ER -