TY - GEN
T1 - Models and algorithms for bandwidth allocation of CBR video streams in a VoD system
AU - Hadar, O.
AU - Segal, M.
N1 - Publisher Copyright:
© 2001 IEEE.
PY - 2001/1/1
Y1 - 2001/1/1
N2 - Discusses the problem of bandwidth allocation of constant bit rate (CBR) video streams to compressed video streams in a video-on-demand (VoD) system. We consider the instance of a VoD system where compressed digital video is transmitted with a CBR over a network with limited capacity. This paper has two main purposes: the first is to develop an efficient algorithm for determining the optimal bandwidth under the constraint of minimal buffer size, and the second is to make a comparison between different approaches for bandwidth allocation under the constraint of maximum bandwidth utilization. Together with his request for a specific video stream, each client in the system sends his buffer size and the maximum waiting time for his allowable delay. According to this information, the video server determines a range of transmission rates that can be used by the client without violating the client-buffer constraints (i.e. overflow or underflow). The main contribution of this paper is to suggest a method for allocating a variable network bandwidth on stream initiation in order to service as many users as possible while providing each user with the highest quality service.
AB - Discusses the problem of bandwidth allocation of constant bit rate (CBR) video streams to compressed video streams in a video-on-demand (VoD) system. We consider the instance of a VoD system where compressed digital video is transmitted with a CBR over a network with limited capacity. This paper has two main purposes: the first is to develop an efficient algorithm for determining the optimal bandwidth under the constraint of minimal buffer size, and the second is to make a comparison between different approaches for bandwidth allocation under the constraint of maximum bandwidth utilization. Together with his request for a specific video stream, each client in the system sends his buffer size and the maximum waiting time for his allowable delay. According to this information, the video server determines a range of transmission rates that can be used by the client without violating the client-buffer constraints (i.e. overflow or underflow). The main contribution of this paper is to suggest a method for allocating a variable network bandwidth on stream initiation in order to service as many users as possible while providing each user with the highest quality service.
KW - Bandwidth allocation
KW - Computational geometry
KW - Constant bit rate transmission
KW - Video on Demand (VoD)
KW - Video rate smoothing
UR - http://www.scopus.com/inward/record.url?scp=84961859292&partnerID=8YFLogxK
U2 - 10.1109/ITCC.2001.918781
DO - 10.1109/ITCC.2001.918781
M3 - Conference contribution
AN - SCOPUS:84961859292
T3 - Proceedings - International Conference on Information Technology: Coding and Computing, ITCC 2001
SP - 148
EP - 152
BT - Proceedings - International Conference on Information Technology
PB - Institute of Electrical and Electronics Engineers
T2 - International Conference on Information Technology: Coding and Computing, ITCC 2001
Y2 - 2 April 2001 through 4 April 2001
ER -