A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem

Bektas, T., Oguz, O. and Ouveysi, I. (2007) A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem. European Journal of Operational Research, 182 (1), 455-465. (doi:10.1016/j.ejor.2006.07.031).

Record type: Article

Abstract

Video on demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, which is further characterized by optimally placing videos to a number of predefined servers and routing the user program requests to available resources. In this paper, an exact solution algorithm is described to solve the video placement and routing problem. The algorithm is based on Lagrangean relaxation and decomposition. The novelty of the approach can be described as the use of integer programs to obtain feasible solutions in the algorithm. Computational experimentation reveals that for randomly generated problems with up to 100 nodes and 250 videos, the use of such integer programs help greatly in obtaining good quality solutions (typically within 5% of the optimal solution), even in the very early iterations of the algorithm.

This record has no associated files available for download.