DMCA
Scheduling Policies for an On-Demand Video Server with Batching (1994)
| Venue: | in Proc. of ACM Multimedia |
| Citations: | 330 - 8 self |
BibTeX
@INPROCEEDINGS{Dan94schedulingpolicies,
author = {Asit Dan and Dinkar Sitaram and Perwez Shahabuddin},
title = {Scheduling Policies for an On-Demand Video Server with Batching},
booktitle = {in Proc. of ACM Multimedia},
year = {1994},
pages = {15--23}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In an on-demand video server environment, clients make requests for movies to a centralized video server. Due to the stringent response time requirements, continuous delivery of a video stream to the client has to be guaranteed by reserving sufficient resources required to deliver a stream. Hence there is a hard limit on the number of streams that can be simultaneously delivered by a server. The server can satisfy multiple requests for the same movie using a single disk I/O stream by sending the same data pages to multiple clients (using the multicast facility if present in the system). This can be achieved by batching requests for the same movie that arrive within a short duration of time. In this paper, we consider various policies for selecting the movie to be multicast. The choice of a policy depends very much on the customer waiting time tolerance before reneging. We show that an FCFS policy that schedules the movie with the longest outstanding request can perform better than the ...
Keyphrases
on-demand video server time tolerance fcfs policy hard limit single disk sufficient resource short duration multiple client video stream data page continuous delivery stringent response time requirement centralized video server on-demand video server environment various policy outstanding request multiple request
