Skip to main content
Article thumbnail
Location of Repository

A novel optimization algorithm for video placement and routing

By T. Bektas, O. Oguz and I. Ouveysi

Abstract

In this paper, we propose a novel optimization algorithm for the solution of the video placement and routing problem based on Lagrangean relaxation,and decomposition. The main contribution can be stated as the use of integer programming models to obtain feasible solutions to the problem within the algorithm. Computational experimentation reveals that the use of such integer models help greatly in obtaining good quality solutions in a small amount of solution tim

Topics: HD28
Year: 2006
OAI identifier: oai:eprints.soton.ac.uk:47687
Provided by: e-Prints Soton

Suggested articles

Citations

  1. (1997). A tabu search approach for designing a non-hierarchical video-on-demand network architecture,” doi
  2. (2001). Operation and cost optimization of a distributed servers architecture for on-demand video services,” doi
  3. (1994). Prospects for interactive video-ondemand,” doi
  4. (2003). Server cost minimization in a distributed servers architecture for on-demand video services,” doi
  5. (2002). The video placement and routing problem,” in doi
  6. (1999). UVoD: an unified architecture for Video-on-Demand services,” doi
  7. (1974). Validation of subgradient optimization,” doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.