Afficher la notice abrégée

hal.structure.identifierCombinatorics, Optimization and Algorithms for Telecommunications [COATI]
dc.contributor.authorTOMASSILLI, Andrea
hal.structure.identifierOrange Labs [Lannion]
dc.contributor.authorDI LENA, Giuseppe
hal.structure.identifierLaboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis [I3S]
hal.structure.identifierCOMUE Université Côte d'Azur (2015-2019) [COMUE UCA]
hal.structure.identifierCombinatorics, Optimization and Algorithms for Telecommunications [COATI]
dc.contributor.authorGIROIRE, Frédéric
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorTAHIRI, Issam
hal.structure.identifierDesign, Implementation and Analysis of Networking Architectures [DIANA]
dc.contributor.authorSAUCEZ, Damien
hal.structure.identifierCombinatorics, Optimization and Algorithms for Telecommunications [COATI]
dc.contributor.authorPÉRENNES, Stéphane
hal.structure.identifierDesign, Implementation and Analysis of Networking Architectures [DIANA]
dc.contributor.authorTURLETTI, Thierry
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorSADYKOV, Ruslan
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorVANDERBECK, François
hal.structure.identifierOrange Labs [Lannion]
dc.contributor.authorLAC, Chidung
dc.date.accessioned2024-04-04T02:59:51Z
dc.date.available2024-04-04T02:59:51Z
dc.date.conference2019-11-04
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/192777
dc.description.abstractEnWith 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.
dc.description.sponsorshipUCA Systèmes Numériques pour l'Homme - ANR-17-EURE-0004
dc.description.sponsorshipIdex UCA JEDI - ANR-15-IDEX-0001
dc.language.isoen
dc.title.enBandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Réseaux et télécommunications [cs.NI]
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
dc.subject.halInformatique [cs]/Algorithme et structure de données [cs.DS]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleCloudNet 2019 - 8th IEEE International Conference on Cloud Networking
bordeaux.countryPT
bordeaux.conference.cityCoimbra
bordeaux.peerReviewedoui
hal.identifierhal-02292971
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2019-11-06
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-02292971v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=TOMASSILLI,%20Andrea&DI%20LENA,%20Giuseppe&GIROIRE,%20Fr%C3%A9d%C3%A9ric&TAHIRI,%20Issam&SAUCEZ,%20Damien&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée