Thumbnail

On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part I

Diarrassouba, Ibrahima; Hadhbi, Youssouf; Mahjoub, Ali Ridha (2021), On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part I. https://basepub.dauphine.psl.eu/handle/123456789/22208

Voir/Ouvrir
Type
Document de travail / Working paper
Date
2021
Titre de la collection
Preprint Lamsade
Ville d’édition
Paris
Métadonnées
Afficher la notice complète
Auteur(s)
Diarrassouba, Ibrahima
Hadhbi, Youssouf
Mahjoub, Ali Ridha
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Résumé (EN)
The constrained-routing and spectrum assignment (C-RSA) problem is a key issue when dimensioning and designing an optical network. Given an optical network G and a multiset of traffic demand K, it aims at determining for each traffic demand k ∈ K a path and an interval of contiguous slots while satisfying technological constraints and optimizing some linear objective function(s). In this paper, we first introduce an integer linear programming formulation for the C-RSA problem. We further investigate the facial structure of the associated polytope.
Mots-clés
constrained-routing; Optical networks; spectrum assignment; integer linear programming; polyhedron; dimension; valid inequality; facet