Abstract
A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall network load should be balanced among the available servers. We consider a problem formulation based on an estimation of the expected number of requests per movie during the period of highest user interest. Apart from load balancing our formulation also deals with the minimization of reorganization costs associated with a newly obtained solution. We present two approaches to solve this problem: an exact formulation as a mixed-integer linear program (MIP) and a metaheuristic hybrid based on variable neighborhood search (VNS). Among others the VNS features two special large neighborhood structures searched using the MIP approach and by efficiently calculating cyclic exchanges, respectively. While the MIP approach alone is only able to obtain good solutions for instances involving few servers, the hybrid VNS performs well especially also on larger instances.
This work is supported by the Austrian Science Fund (FWF) under contract number P20342-N133.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ghose, D., Kim, H.: Scheduling Video Streams in Video-on-Demand Systems: A Survey. Multimedia Tools and Applications 11(2), 167–195 (2000)
Dan, A., Sitaram, D., Shahabuddin, P.: Scheduling policies for an on-demand video server with batching. In: Proceedings of the second ACM international conference on Multimedia, pp. 15–23. ACM, New York (1994)
Venkatasubramanian, N., Ramanathan, S.: Load management in distributed video servers. In: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS 1997), Washington, DC, USA, p. 528. IEEE Computer Society, Los Alamitos (1997)
Wolf, J., Yu, P., Shachnai, H.: Disk load balancing for video-on-demand systems. Multimedia Systems 5(6), 358–370 (1997)
Zhou, X., Xu, C.: Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers. In: Proceedings of the International Conference on Parallel Processing, Washington, DC, USA, pp. 547–555. IEEE Computer Society Press, Los Alamitos (2002)
Walla, J.: Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing. Master’s thesis, Vienna University of Technology, Vienna, Austria (2009)
Yu, H., Zheng, D., Zhao, B.Y., Zheng, W.: Understanding user behavior in large-scale video-on-demand systems. In: Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 (EuroSys 2006), pp. 333–344. ACM, New York (2006)
Cherkasova, L., Gupta, M.: Analysis of enterprise media server workloads: access patterns, locality, content evolution, and rates of change. IEEE/ACM Transactions on Networking 12(5), 781–794 (2004)
Griwodz, C., Bär, M., Wolf, L.: Long-term movie popularity models in video-on-demand systems: or the life of an on-demand movie. In: Proceedings of the fifth ACM international conference on Multimedia, pp. 349–357. ACM, New York (1997)
Chen, K., Chen, H.-C., Borie, R., Liu, J.C.L.: File replication in video on demand services. In: Proceedings of the 43rd annual ACM Southeast Regional Conference (ACM-SE 43), pp. 162–167. ACM, New York (2005)
Wang, Y., Liu, J., Du, D., Hsieh, J.: Efficient video file allocation schemes for video-on-demand services. Multimedia Systems 5(5), 283–296 (1997)
Aggarwal, G., Motwani, R., Zhu, A.: The load rebalancing problem. In: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pp. 258–265. ACM, New York (2003)
Allahverdi, A., Ng, C., Cheng, T., Kovalyov, M.: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187(3), 985–1032 (2008)
Hansen, P., Mladenović, N.: Variable Neighbourhood Search. In: Glover, Kochenberger (eds.) Handbook of Metaheuristics, pp. 145–184. Kluwer Academic Publisher, New York (2003)
Thompson, P., Orlin, J.: The theory of cyclic transfers. Operations Research Center Working Papers. Massachusetts Institute of Technology (1989)
Ahuja, R., Orlin, J., Sharma, D.: New Neighborhood Search Structures for the Capacitated Minimum Spanning Tree Problem. Sloan School of Management, Massachusetts Institute of Technology (1998)
Bertsekas, D.P.: A simple and fast label correcting algorithm for shortest paths. Networks 23(7), 703–709 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walla, J., Ruthmair, M., Raidl, G.R. (2009). Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds) Hybrid Metaheuristics. HM 2009. Lecture Notes in Computer Science, vol 5818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04918-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-04918-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04917-0
Online ISBN: 978-3-642-04918-7
eBook Packages: Computer ScienceComputer Science (R0)