Afficher la notice abrégée

Design of Robust Programmable Networks with Bandwidth-optimal Failure Recovery Scheme

hal.structure.identifierCombinatorics, Optimization and Algorithms for Telecommunications [COATI]
dc.contributor.authorTOMASSILLI, Andrea
hal.structure.identifierOrange Labs [Meylan]
hal.structure.identifierDesign, Implementation and Analysis of Networking Architectures [DIANA]
hal.structure.identifierCombinatorics, Optimization and Algorithms for Telecommunications [COATI]
dc.contributor.authorDI LENA, Giuseppe
hal.structure.identifierCombinatorics, Optimization and Algorithms for Telecommunications [COATI]
dc.contributor.authorGIROIRE, Frédéric
hal.structure.identifierUniversité de Bordeaux [UB]
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.identifierUniversité de Bordeaux [UB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorSADYKOV, Ruslan
hal.structure.identifierUniversité de Bordeaux [UB]
dc.contributor.authorVANDERBECK, François
hal.structure.identifierOrange Labs [Meylan]
dc.contributor.authorLAC, Chidung
dc.date.accessioned2024-04-04T02:43:57Z
dc.date.available2024-04-04T02:43:57Z
dc.date.issued2021-06
dc.identifier.issn1389-1286
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191369
dc.description.abstractEnMore than ever, data networks have demonstrated their central role in the world economy, but also in the well-being of humanity that needs fast and reliable networks. In parallel, with the emergence of Network Function Virtualization (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, as new networks will be deployed and current ones get significant upgrades, it is thus time to rethink the network dimensioning problem with protection against failures. In this paper, we consider a path-based protection scheme with the 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 two scalable mathematical models that we handle using both Column Generation and Benders Decomposition techniques. Through extensive simulations on real-world IP network topologies and on randomly generated instances, we show the effectiveness of our methods: they lead to savings of 40 to 48% of the bandwidth to be installed in a network to protect against failures compared to traditional schemes. Finally, our implementation in OpenDaylight demonstrates the feasibility of the approach. Its evaluation with Mininet shows that our solution provides sub-second recovery times, but the way it is implemented may greatly impact the amount of signaling traffic exchanged. In our evaluations, the recovery phase requires only a few tens of milliseconds for the fastest implementation, compared to a few hundreds of milliseconds for the slowest one.
dc.description.sponsorshipIdex UCA JEDI - ANR-15-IDEX-0001
dc.description.sponsorshipUCA Systèmes Numériques pour l'Homme - ANR-17-EURE-0004
dc.language.isoen
dc.publisherElsevier
dc.title.enDesign of Robust Programmable Networks with Bandwidth-optimal Failure Recovery Scheme
dc.typeArticle de revue
dc.identifier.doi10.1016/j.comnet.2021.108043
dc.subject.halInformatique [cs]/Réseaux et télécommunications [cs.NI]
bordeaux.journalComputer Networks
bordeaux.volume192
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.issue108043
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-03441630
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-03441630v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Computer%20Networks&rft.date=2021-06&rft.volume=192&rft.issue=108043&rft.eissn=1389-1286&rft.issn=1389-1286&rft.au=TOMASSILLI,%20Andrea&DI%20LENA,%20Giuseppe&GIROIRE,%20Fr%C3%A9d%C3%A9ric&TAHIRI,%20Issam&SAUCEZ,%20Damien&rft.genre=article


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