Streaming RAID: a disk array management system for video files
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
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
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
Dynamic Buffer Allocation in Video-on-Demand Systems
IEEE Transactions on Knowledge and Data Engineering
Dynamic buffer management with extensible replacement policies
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 2nd ACM international workshop on Wireless multimedia networking and performance modeling
Can VoD streaming service co-exist with other services on a VM-based virtualized computing platform?
CHINA HPC '07 Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing
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, the size 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.