A novel optimization algorithm for video placement and routing

A novel optimization algorithm for video placement and routing

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 a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2006-02, Vol.10 (2), p.114-116
Hauptverfasser: Bekats, T., Oguz, O., Ouveysi, I.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Computation
Costs
Decomposition
Exact sciences and technology
Experimentation
Fellows
Industrial engineering
Integer linear programming
Integer programming
Lagrangian functions
Linear programming
Load management
Mathematical models
Optimization
Placement
Resource management
Routing
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Valuation and optimization of characteristics. Simulation
Video on demand
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 time
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2006.02007