TOMASSILLI, Andrea; DI LENA, Giuseppe; GIROIRE, Frédéric; TAHIRI, Issam; PÉRENNES, Stéphane; SAUCEZ, Damien; TURLETTI, Thierry; SADYKOV, Ruslan; VANDERBECK, François; LAC, Chidung

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

TOMASSILLI, Andrea
Combinatorics, Optimization and Algorithms for Telecommunications [COATI]

DI LENA, Giuseppe
Orange Labs [Lannion]

GIROIRE, Frédéric
Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis [I3S]

Langue

Autre communication scientifique (congrès sans actes - poster - séminaire...)

Ce document a été publié dans

NETWORKING 2019 - IFIP Networking conference, 2019-05-20, Warsaw.

Résumé en anglais

ISP networks are taking a leap forward thanks to emerging technologies such as Software Defined Networking (SDN) and Network Function Virtualization (NFV). Efficient algorithms considered too hard to be put in practice on legacy networks now have a second chance to be considered again. In this context, we rethink the ISP network dimensioning problem with protection against Shared Risk Link Group (SLRG) failures. We consider a path-based protection scheme with a global rerouting strategy in which, for each failure situation, we may have a new routing of all the demands. Our optimization task is to minimize the needed amount of bandwidth. We develop a scalable mathematical model that we handle using the Column Generation technique. We show the effectiveness of our methods and demonstrate the feasibility of our approach using Mininet.< Réduire

URI

https://oskar-bordeaux.fr/handle/20.500.12278/192717

Project ANR

Idex UCA JEDI - ANR-15-IDEX-0001
UCA Systèmes Numériques pour l'Homme

Origine

Importé de hal

Unités de recherche

Institut de Mathématiques de Bordeaux (IMB) - UMR 5251