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]
dc.contributor.authorGIROIRE, Frédéric
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorTAHIRI, Issam
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.authorSAUCEZ, Damien
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]
dc.contributor.authorVANDERBECK, François
hal.structure.identifierOrange Labs [Lannion]
dc.contributor.authorLAC, Chidung
dc.date.accessioned2024-04-04T02:59:07Z
dc.date.available2024-04-04T02:59:07Z
dc.date.conference2019-05-20
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/192717
dc.description.abstractEnISP 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.
dc.description.sponsorshipIdex UCA JEDI - ANR-15-IDEX-0001
dc.description.sponsorshipUCA Systèmes Numériques pour l'Homme
dc.language.isoen
dc.title.enPoster: Design of Survivable SDN/NFV-enabled Networks with Bandwidth-optimal Failure Recovery
dc.typeAutre communication scientifique (congrès sans actes - poster - séminaire...)
dc.subject.halInformatique [cs]/Réseaux et télécommunications [cs.NI]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleNETWORKING 2019 - IFIP Networking conference
bordeaux.countryPL
bordeaux.conference.cityWarsaw
bordeaux.peerReviewedoui
hal.identifierhal-02364488
hal.version1
hal.invitednon
hal.proceedingsnon
hal.conference.end2019-05-22
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-02364488v1
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&P%C3%89RENNES,%20St%C3%A9phane&rft.genre=conference


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