The University of Southampton
University of Southampton Institutional Repository

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

A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
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.
integer programming, video on demand, placement, routing, lagrangean relaxation, ecomposition
0377-2217
455-465
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Oguz, O.
7a6b6f2e-59fc-4b28-aa31-465a44468523
Ouveysi, I.
776da949-6f7d-484c-a613-58c3bbfeee58
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Oguz, O.
7a6b6f2e-59fc-4b28-aa31-465a44468523
Ouveysi, I.
776da949-6f7d-484c-a613-58c3bbfeee58

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.

Full text not available from this repository.

More information

Published date: October 2007
Keywords: integer programming, video on demand, placement, routing, lagrangean relaxation, ecomposition

Identifiers

Local EPrints ID: 48285
URI: https://eprints.soton.ac.uk/id/eprint/48285
ISSN: 0377-2217
PURE UUID: 1ab66bd3-dd75-4ac7-b750-694c2eaf61dc
ORCID for T. Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 11 Sep 2007
Last modified: 20 Jul 2019 00:51

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×