Issue No. 02 - February (2001 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.908987
<p><b>Abstract</b>—In a video-on-demand environment, batching of video requests is often used to reduce I/O demand and improve throughput. Since viewers may defect if they experience long waits, a good video scheduling policy needs to consider not only the batch size but also the viewer defection probabilities and wait times. Two conventional scheduling policies for batching are the first-come-first-served (FCFS) policy, which schedules the video with the longest waiting request, and the maximum queue length (MQL) policy, which selects the video with the maximum number of waiting requests. Neither of these policies leads to entirely satisfactory results. MQL tends to be too aggressive in scheduling popular videos by considering only the queue length to maximize batch size, while FCFS has the opposite effect by completely ignoring the queue length and focusing on arrival time to reduce defections. In this paper, we introduce the notion of <it>factored queue length</it> and propose a batching policy that schedules the video with the <it>maximum factored queue length</it>. We refer to this as the <it>MFQL</it> policy. The factored queue length is obtained by weighting each video queue length with a factor which is biased against the more popular videos. An optimization problem is formulated to solve for the best weighting factors for the various videos. We also consider MFQL implementation issues. A simulation is developed to compare the proposed MFQL variants with FCFS and MQL. Our study shows that MFQL yields excellent empirical results in terms of standard performance measures such as average latency time, defection rates, and fairness.</p>
Video-on-demand, scheduling algorithms, batching schemes, optimization.
C. C. Aggarwal, P. S. Yu and J. L. Wolf, "The Maximum Factor Queue Length Batching Scheme for Video-on-Demand Systems," in IEEE Transactions on Computers, vol. 50, no. , pp. 97-110, 2001.