Show simple item record

hal.structure.identifierCOMUE Université Côte d'Azur (2015-2019) [COMUE UCA]
hal.structure.identifierCombinatorics, Optimization and Algorithms for Telecommunications [COATI]
dc.contributor.authorTOMASSILLI, Andrea
hal.structure.identifierOrange Labs [Lannion]
hal.structure.identifierDesign, Implementation and Analysis of Networking Architectures [DIANA]
dc.contributor.authorDI LENA, Giuseppe
hal.structure.identifierCOMUE Université Côte d'Azur (2015-2019) [COMUE UCA]
hal.structure.identifierCentre National de la Recherche Scientifique [CNRS]
hal.structure.identifierCombinatorics, Optimization and Algorithms for Telecommunications [COATI]
dc.contributor.authorGIROIRE, Frédéric
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierDesign, Implementation and Analysis of Networking Architectures [DIANA]
dc.contributor.authorTAHIRI, Issam
hal.structure.identifierDesign, Implementation and Analysis of Networking Architectures [DIANA]
dc.contributor.authorSAUCEZ, Damien
hal.structure.identifierCOMUE Université Côte d'Azur (2015-2019) [COMUE UCA]
hal.structure.identifierCentre National de la Recherche Scientifique [CNRS]
dc.contributor.authorPERENNES, 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.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-04T03:01:16Z
dc.date.available2024-04-04T03:01:16Z
dc.date.issued2019-04-25
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/192886
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.In this paper, 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. 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.language.isoen
dc.subject.enSoftware Defined Networking
dc.subject.enNetwork Function Virtualization
dc.subject.ennetwork resilience strategies
dc.title.enBandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks
dc.typeRapport
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.type.institutionINRIA Sophia Antipolis - I3S
bordeaux.type.reportrr
hal.identifierhal-02112282
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-02112282v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2019-04-25&rft.au=TOMASSILLI,%20Andrea&DI%20LENA,%20Giuseppe&GIROIRE,%20Fr%C3%A9d%C3%A9ric&TAHIRI,%20Issam&SAUCEZ,%20Damien&rft.genre=unknown


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record