Principles of delay-sensitive multimedia data storage retrieval
ACM Transactions on Information Systems (TOIS)
A file system for continuous media
ACM Transactions on Computer Systems (TOCS)
Disk scheduling in a multimedia I/O system
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
I/O issues in a multimedia system
Computer
Multimedia network file servers: multichannel delay-sensitive data retrieval
Multimedia Systems
Operating system support for a video-on-demand file service
Multimedia Systems
Analysis and Optimization of Disk Storage Devices for Time-Sharing Systems
Journal of the ACM (JACM)
A comparative analysis of disk scheduling policies
Communications of the ACM
A Time-Scale Dependent Disk Scheduling Scheme for Multimedia-on-Demand Servers
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Dynamic buffer allocation in video-on-demand systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Prioritized Admission Strategies to Improve User-Perceived Performance in Interactive VOD Servers
Multimedia Tools and Applications
A Scalable QoS Adaptation Scheme for Media Servers
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Dynamic Buffer Allocation in Video-on-Demand Systems
IEEE Transactions on Knowledge and Data Engineering
Building MEMS-based storage systems for streaming media
ACM Transactions on Storage (TOS)
Hi-index | 0.00 |
In this paper, we propose and study a dynamic approach to schedule real-time requests in a video-on-demand (VOD) server. Providing quality of service in such servers requires uninterrupted and on-time retrieval of motion video data. VOD services and multimedia applications further require access to the storage devices to be shared among multiple concurrent streams. Most of the previous VOD scheduling approaches use limited run-time, 0 information and thus cannot exploit the potential capacity of the system fully. Our approach improves throughput by making use of run-time information to relax admission control. It maintains excellent quality of service under varying playout rates by observing deadlines and by reallocating resources to guarantee continuous service. It also reduces start-up latency by beginning service as soon as it is detected that deadlines of all real-time requests will be met. We establish safe conditions for greedy admission, dynamic control of disk read sizes, fast initial service, and sporadic services. We conduct thorough simulations over a wide range of buffer capacities, load settings, and over varying playout rates to demonstrate the significant improvements in quality of service, throughput and start-up latency of our approach relative to a static approach.