This Article 
 Bibliographic References 
 Add to: 
The Maximum Factor Queue Length Batching Scheme for Video-on-Demand Systems
February 2001 (vol. 50 no. 2)
pp. 97-110

Abstract—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 factored queue length and propose a batching policy that schedules the video with the maximum factored queue length. We refer to this as the MFQL 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.

[1] D.P. Anderson,"Metascheduling for Continuous Media," ACM Trans. Computer Systems, vol. 11, no. 3, Aug. 1993, pp. 226-252.
[2] M. Avriel, Nonlinear Programming Analysis and Methods. Englewood Cliffs, N.J.: Prentice Hall, 1976.
[3] M-S. Chen, D.D. Kandlur, and P.S. Yu, “Storage and Retrieval Methods to Support Fully Interactive Playout in a Disk-Array-Based Video Server,” Multimedia Systems, pp. 126-135, 1995.
[4] A. Dan, D. Sitaram, and P. Shahabuddin, Scheduling Policies for an On-Demand Video Server with Batching Proc. Second ACM Int'l Conf. Multimedia, pp. 15-23, 1994.
[5] J.K. Dey-Sircar, J.D. Salehi, J.F. Kurose, and D. Towsley, Providing Vcr Capabilities in Large-Scale Video Servers Proc. Second ACM Int'l Conf. Multimedia, pp. 25-32, 1994.
[6] A. Gelman and S. Halfin, “Analysis of Resource Sharing in Information Providing Services,” IEEE Global Telecommunications Conf. and Exhibition, vol. 1, 1990.
[7] L. Golubchik, J.C.S. Lui, and R. Muntz, “Reducing I/O Demand in Video-On-Demand Storage Servers,” Proc. 1995 ACM SIGMETRICS Joint Int'l Conf. Measurement and Modeling of Computer Systems, pp. 25-36, May 1995.
[8] L. Goluchik, J.C.S. Lui, and R.R. Muntz, Adaptive Piggybacking: A Novel Techniques for Data Sharing in Video-on-Demand Storage Servers ACM Multimedia Systems J., vol. 4, no. 3, pp. 140-155, 1996.
[9] T. Ibaraki and N. Katoh,Resource Allocation Problems: Algorithmic Approaches. Cambridge, MA: M.I.T., 1988.
[10] M. Kamath, K. Ramamritham, and D. Towsley, “Continuous Media Sharing in Multimedia Database Systems,” Technical Report 94-11, Dept. of Computer Science, Univ. of Massachusets, Amherst, 1994.
[11] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
[12] J.C. Pasquale, G.C. Polyzos, E.W. Anderson, and V.P. Kompella, “The Multimedia Multicast Channel,” Proc. Third Int'l Workshop Network and Operating Systems, pp. 197-208, 1992.
[13] B. Ozden, A. Biliris, R. Rastogi, and A. Silberschatz, “A Low-Cost Storage Server for Movie on Demand Databases,” Proc. 20th Int'l Conf. Very Large Data Bases, Sept. 1994.
[14] P.V. Rangan, H.M. Vin, and S. Ramanathan, “Designing an On-Demand Multimedia Service,” Comm. Magazine, vol. 30, no. 7, Jul. 1992.
[15] H. Shachnai and P. Yu, “Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling,” ACM Multimedia Systems, vol. 6, no. 6, pp. 382-394, 1998.
[16] F.A. Tobagi, J. Pang, R. Baird, and M. Gang, “Streaming RAID—A Disk Array Management System For Video Files,” Proc. ACM Multimedia Conf., pp. 393–399, 1993.
[17] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.
[18] J.L. Wolf, D.M. Dias, and P.S. Yu, "A Parallel Sort Merge Join Algorithm for Managing Data Skew," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 1, pp. 70-86, Jan. 1993.
[19] J.L. Wolf, P.S. Yu, and H. Shachnai, Disk Load Balancing for Video-on-Demand Systems ACM Multimedia Systems J., vol. 5, no. 6, pp. 358-370, 1997.
[20] P. Yu, M.-S. Chen, and D. Kandlur, “Grouped Sweeping Scheduling for DASD-Based Multimedia Storage Management,” Multimedia Systems, vol. 1, no. 3, pp. 99-109, 1993.
[21] P.S. Yu, J.L. Wolf, and H. Shachnai, "Design and Analysis of a Look-Ahead Scheduling Scheme to Support Pause-Resume for Video-on-Demand Application," ACM/Springer Multimedia Systems, Vol. 3, No. 4, 1995, pp. 137-150.
[22] G. Zipf, Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949.

Index Terms:
Video-on-demand, scheduling algorithms, batching schemes, optimization.
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu, "The Maximum Factor Queue Length Batching Scheme for Video-on-Demand Systems," IEEE Transactions on Computers, vol. 50, no. 2, pp. 97-110, Feb. 2001, doi:10.1109/12.908987
Usage of this product signifies your acceptance of the Terms of Use.