An Augmented Lagrangean Approach for the QoS Constrained Routing Problem - Archive ouverte HAL Accéder directement au contenu
Rapport Année : 2007

An Augmented Lagrangean Approach for the QoS Constrained Routing Problem

Résumé

Given a directed graph with capacities on each arc and given a set of commodities, the QoS constrained Routing Problem (QCRP) consists in routing each commodity while respecting a endtoend upper bound on the delay for each packet. This problem is NP-hard and we propose an augmented Lagrangean approach to solve it. A flow deviation algorithm as well as a projected gradient method are proposed to solve the inner problem in the augmented Lagrangean approach. The delay and the load functions are approximated either by an analytical function or by a neural network. Computational results are reported to show the effectiveness of the projected gradient method and the neural network approximation.
Fichier principal
Vignette du fichier
RR-07-15b.pdf (165.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00678369 , version 1 (12-03-2012)

Identifiants

  • HAL Id : hal-00678369 , version 1

Citer

Christophe Duhamel, Antoine Mahul. An Augmented Lagrangean Approach for the QoS Constrained Routing Problem. 2007. ⟨hal-00678369⟩
80 Consultations
67 Téléchargements

Partager

Gmail Facebook X LinkedIn More