The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2008 vol.20)
pp: 836-850
ABSTRACT
We present a genetic algorithm to tackle a file assignment problem for a large scale video-on-demand system. The file assignment problem is to find the optimal replication and allocation of movie files to disks, so that the request blocking probability is minimized subject to capacity constraints. We adopt a divide-and-conquer strategy, where the entire solution space of file assignments is divided into subspaces. Each subspace is an exclusive set of solutions sharing a common file replication instance. This allows us to utilize a greedy file allocation method to find a sufficiently good quality heuristic solution within each subspace. Two performance indices are further designed to measure the quality of the heuristic solution on 1) its assignment of multi-copy movies and 2) its assignment of single-copy movies. We demonstrate that these techniques together with ad hoc population handling methods enable genetic algorithms to operate in a significantly reduced search space, and achieve good quality file assignments in a computationally efficient way.
INDEX TERMS
File assignment, video-on-demand, genetic algorithm
CITATION
Jun Guo, Yi Wang, Kit-Sang Tang, Sammy Chan, Eric W.M. Wong, Peter Taylor, Moshe Zukerman, "Evolutionary Optimization of File Assignment for a Large-Scale Video-on-Demand System", IEEE Transactions on Knowledge & Data Engineering, vol.20, no. 6, pp. 836-850, June 2008, doi:10.1109/TKDE.2007.190742
REFERENCES
[1] W.D. Sincoskie, “System Architecture for a Large-Scale Video-on-Demand Service,” Computer Networks and ISDN Systems, vol. 22, no. 2, pp. 155-162, 1991.
[2] T.D.C. Little and D. Venkatesh, “Popularity-Based Assignment of Movies to Storage Devices in a Video-on-Demand System,” Multimedia Systems, vol. 2, pp. 280-287, Jan. 1995.
[3] A.N. Mourad, “Issues in the Design of a Storage Server for Video-on-Demand,” Multimedia Systems, vol. 4, pp. 70-86, 1996.
[4] D.N. Serpanos, L. Georgiadis, and T. Bouloutas, “MMPacking: A Load and Storage Balancing Algorithm for Distributed Multimedia Servers,” IEEE Trans. Circuits and Systems for Video Technology, vol. 8, no. 1, pp. 13-17, Feb. 1998.
[5] K.S. Tang, K.T. Ko, S. Chan, and E. Wong, “Optimal File Placement in VOD System Using Genetic Algorithm,” IEEE Trans. Industrial Electronics, vol. 48, no. 5, pp. 891-897, Oct. 2001.
[6] Y.W. Leung and R.Y.T. Hou, “Assignment of Movies to Heterogeneous Video Servers,” IEEE Trans. Systems, Man, and Cybernetics A, vol. 35, no. 5, pp. 665-681, Sept. 2005.
[7] J.L. Wolf, P.S. Yu, and H. Shachnai, “Disk Load Balancing for Video-on-Demand Systems,” Multimedia Systems, vol. 5, no. 6, pp.358-370, Nov. 1997.
[8] S.L. Tsao, M.C. Chen, M.T. Ko, J.M. Ho, and Y.M. Huang, “Data Allocation and Dynamic Load Balancing for Distributed Video Storage Server,” J. Visual Comm. and Image Representation, vol. 10, no. 2, pp. 197-218, 1999.
[9] Y. Zhao and C.C.J. Kuo, “Video-on-Demand Server System Design with Random Early Migration,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '03), vol. 2, pp. 640-643, May 2003.
[10] J. Guo, E.W.M. Wong, S. Chan, P. Taylor, M. Zukerman, and K.S. Tang, “Performance Analysis of Resource Selection Schemes for a Large-Scale Video-on-Demand System,” IEEE Trans. Multimedia, vol. 10, pp. 153-159, 2008.
[11] J. Guo, E.W.M. Wong, S. Chan, P. Taylor, M. Zukerman, and K.S. Tang, “Combination Load Balancing for Video-on-Demand Systems,” to be published in IEEE Trans. Circuits and Systems for Video Technology.
[12] D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
[13] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[14] T. Ibaraki and N. Katoh, Resource Allocation Problems: Algorithmic Approaches. MIT Press, 1988.
[15] D. Sitaram and A. Dan, Multimedia Servers: Applications, Environments and Design. Morgan Kaufmann, 2000.
[16] R. Zimmermann and S. Ghandeharizadeh, “Highly Available and Heterogeneous Continuous Media Storage Systems,” IEEE Trans. Multimedia, vol. 6, no. 6, pp. 886-896, Dec. 2004.
[17] S.C. Liew and D.C.-Y. Tse, “A Control-Theoretic Approach to Adapting VBR Compressed Video for Transport over a CBR Communications Channel,” IEEE/ACM Trans. Networking, vol. 6, no. 1, pp. 42-55, Feb. 1998.
[18] M. Krunz, R. Sass, and H. Hughes, “Statistical Characteristics and Multiplexing of MPEG Streams,” Proc. IEEE INFOCOM '95, vol. 2, pp. 455-462, Apr. 1995.
[19] C.P. Costa, I.S. Cunha, A. Borges, C.V. Ramos, M.M. Rocha, J.M. Almeida, and B. Ribeiro-Neto, “Analyzing Client Interactivity in Streaming Media,” Proc. 13th Int'l Conf. World Wide Web (WWW '04), pp. 534-543, 2004.
[20] A. Dan, D. Sitaram, and P. Shahabuddin, “Scheduling Policies for an On-Demand Video Server with Batching,” Proc. Second ACM Int'l Conf. Multimedia (Multimedia '94), pp. 15-23, 1994.
[21] G.K. Zipf, Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology. Addison-Wesley, 1949.
[22] P. Branch, G. Egan, and B. Tonkin, “Modeling Interactive Behavior of a Video-Based Multimedia System,” Proc. IEEE Int'l Conf. Comm. (ICC '99), vol. 2, pp. 978-982, June 1999.
[23] K. Deb, “An Efficient Constraint Handling Method for Genetic Algorithms,” Computer Methods in Applied Mechanics and Eng., vol. 186, no. 2-4, pp. 311-338, June 2000.
[24] J.H. Holland, Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, 1975.
[25] C.R. Reeves, “Using Genetic Algorithms with Small Populations,” Proc. Fifth Int'l Conf. Genetic Algorithms (ICGA '93), pp. 92-99, 1993.
[26] Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables, M. Abramowitz and I.A. Stegun, eds. Dover, 1972.
[27] D.E. Goldberg and K. Deb, “A Comparative Analysis of Selection Schemes Used in Genetic Algorithms,” Proc. First Workshop Foundations of Genetic Algorithms (FOGA '91), vol. 1, pp. 69-93, 1991.
[28] K. Deb, Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, 2001.
[29] C.A.C. Coello, D.A.V. Veldhuizen, and G.B. Lamont, Evolutionary Algorithms for Solving Multiobjective Problems. Kluwer Academic Publishers/Plenum, 2002.
[30] E. Zitzler, K. Deb, and L. Thiele, “Comparison of Multiobjective Evolutionary Algorithms: Empirical Results,” Evolutionary Computation, vol. 8, no. 2, pp. 173-195, 2000.
[31] K. Deb, A. Pratap, S. Agrawal, and T. Meyarivan, “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II,” IEEE Trans. Evolutionary Computation, vol. 6, no. 2, pp. 182-197, Apr. 2002.
[32] K. Deb and T. Goel, “Controlled Elitist Non-Dominated Sorting Genetic Algorithms for Better Convergence,” Proc. First Int'l Conf. Evolutionary Multi-Criterion Optimization (EMO '01), pp. 67-81, Mar. 2001.
[33] J. Guo, “Two Problems in Stochastic Service Systems,” PhD dissertation, The Univ. of Melbourne, 2006.
[34] S.K. Bose, An Introduction to Queueing Systems. Kluwer Academic Publishers/Plenum, 2002.
[35] H. Akimaru and K. Kawashima, Teletraffic: Theory and Applications, second ed. Springer-Verlag, 1999.
[36] W.J. Stewart, Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press, 1994.
14 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool