Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks
GIROIRE, Frédéric
Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis [I3S]
COMUE Université Côte d'Azur (2015-2019) [COMUE UCA]
Combinatorics, Optimization and Algorithms for Telecommunications [COATI]
Voir plus >
Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis [I3S]
COMUE Université Côte d'Azur (2015-2019) [COMUE UCA]
Combinatorics, Optimization and Algorithms for Telecommunications [COATI]
GIROIRE, Frédéric
Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis [I3S]
COMUE Université Côte d'Azur (2015-2019) [COMUE UCA]
Combinatorics, Optimization and Algorithms for Telecommunications [COATI]
Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis [I3S]
COMUE Université Côte d'Azur (2015-2019) [COMUE UCA]
Combinatorics, Optimization and Algorithms for Telecommunications [COATI]
VANDERBECK, François
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
< Réduire
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Langue
en
Communication dans un congrès
Ce document a été publié dans
CloudNet 2019 - 8th IEEE International Conference on Cloud Networking, 2019-11-04, Coimbra.
Résumé en anglais
With the emergence of Network Function Virtual-ization (NFV) and Software Defined Networking (SDN) efficient network algorithms considered too hard to be put in practice in the past now have a second chance to be considered ...Lire la suite >
With the emergence of Network Function Virtual-ization (NFV) and Software Defined Networking (SDN) efficient network algorithms considered too hard to be put in practice in the past now have a second chance to be considered again. In this context, we rethink the network dimensioning problem with protection against Shared Risk Link Group (SLRG) failures. In this paper, we consider a path-based protection scheme with a global rerouting strategy, in which, for each failure situation, there may be a new routing of all the demands. Our optimization task is to minimize the needed amount of bandwidth. After discussing the hardness of the problem, we develop a scalable mathematical model that we handle using the Column Generation technique. Through extensive simulations on real-world IP network topologies and on random generated instances, we show the effectiveness of our method. Finally, our implementation in OpenDaylight demonstrates the feasibility of the approach and its evaluation with Mininet shows that technical implementation choices may have a dramatic impact on the time needed to reestablish the flows after a failure takes place.< Réduire
Project ANR
UCA Systèmes Numériques pour l'Homme - ANR-17-EURE-0004
Idex UCA JEDI - ANR-15-IDEX-0001
Idex UCA JEDI - ANR-15-IDEX-0001
Origine
Importé de halUnités de recherche