DocumentCode :
827236
Title :
Dynamic buffer allocation in video-on-demand systems
Author :
Lee, Sang-Ho ; Whang, Kyu-Young ; Moon, Yang-Sae ; Han, Wook-Shin ; Song, II-Yeol
Author_Institution :
Dept. of Comput. Eng., Korea Polytech. Univ., Kyonggi-do, South Korea
Volume :
15
Issue :
6
fYear :
2003
Firstpage :
1535
Lastpage :
1551
Abstract :
In video-on-demand (VOD) systems, as the size of the buffer allocated to user requests increases, initial latency and memory requirements increase. Hence, the buffer size must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that the system is in the fully loaded state. Thus, when the system is in a partially loaded state, the scheme allocates a buffer larger than necessary to a user request. This paper proposes a dynamic buffer allocation scheme that allocates to user requests buffers of the minimum size in a partially loaded state, as well as in the fully loaded state. The inherent difficulty in determining the buffer size in the dynamic buffer allocation scheme is that the size of the buffer currently being allocated is dependent on the number of and the sizes of the buffers to be allocated in the next service period. We solve this problem by the predict-and-enforce strategy, where we predict the number and the sizes of future buffers based on inertia assumptions and enforce these assumptions at runtime. Any violation of these assumptions is resolved by deferring service to the violating new user request until the assumptions are satisfied. Since the size of the current buffer is dependent on the sizes of the future buffers, it is represented by a recurrence equation. We provide a solution to this equation, which can be computed at the system initialization time for runtime efficiency. We have performed extensive analysis and simulation. The results show that the dynamic buffer allocation scheme reduces initial latency (averaged over the number of user requests in service from one to the maximum capacity) to 1/29.4 ∼ 1/11.0 of that for the static one and, by reducing the memory requirement, increases the number of concurrent user requests to 2.36 ∼ 3.25 times that of the static one when averaged over the amount of system memory available. These results demonstrate that the dynamic buffer allocation scheme significantly improves the performance and capacity of VOD systems.
Keywords :
buffer storage; scheduling; storage allocation; video on demand; video servers; buffer size; concurrent user requests; dynamic buffer allocation; fully loaded state; inertia assumptions; initial latency; memory requirements; partially loaded state; predict-and-enforce strategy; recurrence equation; runtime efficiency; simulation; user requests; video-on-demand systems; Computational modeling; Computer Society; Delay; Difference equations; Memory management; Moon; Performance analysis; Runtime; Video compression; Video recording;
fLanguage :
English
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
1041-4347
Type :
jour
DOI :
10.1109/TKDE.2003.1245291
Filename :
1245291
Link To Document :
بازگشت