Publicação
The design of transparent optical networks minimizing the impact of critical nodes
| Resumo: | For a given fiber network and a given set of client demands, the transparent optical network design problem is the task of assigning routing paths and wavelengths for a set of lightpaths able to groom all client demands. We address this design problem minimizing the impact of a given set of critical nodes. The problem is tackled in two steps: first, we minimize the demand that is disrupted by the simultaneous failure of all critical nodes; second, we minimize the network design cost guaranteeing that the minimum disrupted demand is met. We present MILP models for each step, together with valid inequalities strengthening both models. For the second step, an efficient hybrid heuristic is also proposed. |
|---|---|
| Autores principais: | Barbosa, Fábio |
| Outros Autores: | Sousa, Amaro de; Agra, Agostinho |
| Assunto: | Optical networks GRWA Mixed integer linear programming Valid inequalities Critical nodes |
| Ano: | 2018 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade de Aveiro |
| Idioma: | inglês |
| Origem: | RIA - Repositório Institucional da Universidade de Aveiro |
Registos relacionados
article Compact models for Critical Node Detection in telecommunication networks
por: Santos, Dorabella
Publicado em: (2018)
por: Santos, Dorabella
Publicado em: (2018)
article The minimum cost network upgrade problem with maximum robustness to multiple node failures
por: Barbosa, Fábio
Publicado em: (2021)
por: Barbosa, Fábio
Publicado em: (2021)
article The minimum cost design of transparent optical networks combining grooming, routing, and wavelength assignment
por: Agra, Agostinho
Publicado em: (2016)
por: Agra, Agostinho
Publicado em: (2016)
article Facets for the single node fixed-charge network set with a node set-up variable
por: Agra, Agostinho
Publicado em: (2014)
por: Agra, Agostinho
Publicado em: (2014)
article Lifted euclidean inequalities for the integer single node flow set with upper bounds
por: Agra, Agostinho
Publicado em: (2016)
por: Agra, Agostinho
Publicado em: (2016)
groups Topology design of transparent optical networks resilient to multiple node failures
por: Barbosa, Fábio
Publicado em: (2018)
por: Barbosa, Fábio
Publicado em: (2018)
article Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes
por: Barbosa, Fábio
Publicado em: (2020)
por: Barbosa, Fábio
Publicado em: (2020)
school Disaster-resilient network design and resource management of elastic optical networks
por: Barbosa, Fábio Daniel Moreira
Publicado em: (2022)
por: Barbosa, Fábio Daniel Moreira
Publicado em: (2022)
groups Evaluation and design of elastic optical networks resilient to multiple node failures
por: Barbosa, Fábio
Publicado em: (2019)
por: Barbosa, Fábio
Publicado em: (2019)
article Valid inequalities for the single arc design problem with set-ups
por: Agra, Agostinho
Publicado em: (2015)
por: Agra, Agostinho
Publicado em: (2015)
groups Combined control and data plane robustness of SDN networks against malicious node attacks
por: Santos, Dorabella
Publicado em: (2018)
por: Santos, Dorabella
Publicado em: (2018)
groups Critical node detection with connectivity based on bounded path lengths
por: Barbosa, Fábio
Publicado em: (2019)
por: Barbosa, Fábio
Publicado em: (2019)
article A computational comparison of compact MILP formulations for the zero forcing number
por: Agra, Agostinho
Publicado em: (2019)
por: Agra, Agostinho
Publicado em: (2019)
school Development of heuristics for transparent optical networks dimensioning
por: Fernandes, Eduardo José Domingues
Publicado em: (2019)
por: Fernandes, Eduardo José Domingues
Publicado em: (2019)
article The controller placement problem for robust SDNs against malicious node attacks considering the control plane with and without split-brain
por: Santos, Dorabella
Publicado em: (2019)
por: Santos, Dorabella
Publicado em: (2019)
article Lexicographical minimization of routing hops in hop-constrained node survivable networks
por: Gouveia, Luis
Publicado em: (2016)
por: Gouveia, Luis
Publicado em: (2016)
groups A RMSA algorithm resilient to multiple node failures on elastic optical networks
por: Barbosa, Fábio
Publicado em: (2019)
por: Barbosa, Fábio
Publicado em: (2019)
article Single PON network design with unconstrained splitting stages
por: Gouveia, Luís
Publicado em: (2015)
por: Gouveia, Luís
Publicado em: (2015)
article Mixed integer formulations for a routing problem with information collection in wireless networks
por: Flores-Luyo, Luis
Publicado em: (2020)
por: Flores-Luyo, Luis
Publicado em: (2020)
article Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
por: Agra, Agostinho
Publicado em: (2016)
por: Agra, Agostinho
Publicado em: (2016)
article RMSA algorithms resilient to multiple node failures in dynamic EONs
por: Barbosa, Fábio
Publicado em: (2021)
por: Barbosa, Fábio
Publicado em: (2021)
school Dimensioning and optimization in optical transport networks
por: Esteves, Tiago Duarte
Publicado em: (2018)
por: Esteves, Tiago Duarte
Publicado em: (2018)
groups Improving the connectivity resilience of a telecommunications network to multiple link failures through a third-party network
por: Sousa, Amaro de
Publicado em: (2020)
por: Sousa, Amaro de
Publicado em: (2020)
article The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem
por: Ben Ahmed, Mohamed
Publicado em: (2023)
por: Ben Ahmed, Mohamed
Publicado em: (2023)
article Optimizing make-to-stock policies through a robust lot-sizing model
por: Agra, Agostinho
Publicado em: (2018)
por: Agra, Agostinho
Publicado em: (2018)
groups The minimum cost D-geodiverse anycast routing with optimal selection of anycast nodes
por: de Sousa, Amaro
Publicado em: (2019)
por: de Sousa, Amaro
Publicado em: (2019)
article Mixing polyhedra with two non divisible coefficients
por: Agra, Agostinho
Publicado em: (2012)
por: Agra, Agostinho
Publicado em: (2012)
book The suppliers selection problem: a case study
por: Costa, Mariana
Publicado em: (2015)
por: Costa, Mariana
Publicado em: (2015)
groups A Novel Algorithm to Train Multilayer Hardlimit Neural Networks Based on a Mixed Integer Linear Program Model
por: Fonseca, José Barahona da
Publicado em: (2015)
por: Fonseca, José Barahona da
Publicado em: (2015)
article Weighted proximity search
por: Rodrigues, Filipe
Publicado em: (2021)
por: Rodrigues, Filipe
Publicado em: (2021)
school Remote experiment manager with mobile node in test infrastructure for wireless networks
por: Almeida, Rafael Alexandre Santos
Publicado em: (2019)
por: Almeida, Rafael Alexandre Santos
Publicado em: (2019)
book The shortest path in signed graphs
por: Costa, Inês Serôdio
Publicado em: (2023)
por: Costa, Inês Serôdio
Publicado em: (2023)
article Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks
por: Barbosa, Fábio
Publicado em: (2023)
por: Barbosa, Fábio
Publicado em: (2023)
article An integer multicommodity flow model applied to the rerostering of nurse schedules
por: Moz, Margarida
Publicado em: (2003)
por: Moz, Margarida
Publicado em: (2003)
article Addressing wildfire risk in a landscape-level scheduling model: an application in Portugal
por: Ferreira, Liliana
Publicado em: (2015)
por: Ferreira, Liliana
Publicado em: (2015)
article Weighted iterated local branching for mathematical programming problems with binary variables
por: Rodrigues, Filipe
Publicado em: (2022)
por: Rodrigues, Filipe
Publicado em: (2022)
draft Discrete time and continuous time formulations for a short sea inventory routing problem
por: Agra, Agostinho
Publicado em: (2013)
por: Agra, Agostinho
Publicado em: (2013)
article Prize collecting Steiner trees with node degree dependent costs
por: Gouveia, Luís
Publicado em: (2011)
por: Gouveia, Luís
Publicado em: (2011)
article Hybrid heuristics for a maritime short sea inventory routing problem
por: Agra, Agostinho
Publicado em: (2014)
por: Agra, Agostinho
Publicado em: (2014)
article An improved decomposition-based heuristic to design a water distribution network for an irrigation system
por: Gonçalves, Graça Marques
Publicado em: (2014)
por: Gonçalves, Graça Marques
Publicado em: (2014)
Registos relacionados
-
article Compact models for Critical Node Detection in telecommunication networks
por: Santos, Dorabella
Publicado em: (2018) -
article The minimum cost network upgrade problem with maximum robustness to multiple node failures
por: Barbosa, Fábio
Publicado em: (2021) -
article The minimum cost design of transparent optical networks combining grooming, routing, and wavelength assignment
por: Agra, Agostinho
Publicado em: (2016) -
article Facets for the single node fixed-charge network set with a node set-up variable
por: Agra, Agostinho
Publicado em: (2014) -
article Lifted euclidean inequalities for the integer single node flow set with upper bounds
por: Agra, Agostinho
Publicado em: (2016)