Staggered striping in multimedia information systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Providing VCR capabilities in large-scale video servers
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Schemes for implementing buffer sharing in continuous-media systems
Information Systems - Special issue: multimedia information systems
BubbleUp: low latency fast-scan for media servers
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Disk load balancing for video-on-demand systems
Multimedia Systems
Dynamic buffer allocation in video-on-demand systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
DyBASe: a buffer allocation scheme for reducing average initial latency in video-on-demand systems
Information Sciences: an International Journal
Effective Memory Use in a Media Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Cost-Based Media Server Design
RIDE '98 Proceedings of the Workshop on Research Issues in Database Engineering
Pinned demand paging based on the access frequency of video files in video servers
Journal of Systems and Software
Resource consumption-aware QoS in cluster-based VOD servers
Journal of Systems Architecture: the EUROMICRO Journal
Implementation of a new cache and schedule scheme for distributed VOD servers
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
UML based statistical testing acceleration of distributed safety-critical software
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |
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 {\frac{1}{29.4}} \sim {\frac{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 \sim 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.