Teresa Gomes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Teresa Gomes has a total of 126 co-authors. Here are the top co-authors by number of shared publications:
- Lúcia Martins
Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal
23 shared publications - José Craveirinha
University of Coimbra
19 shared publications David Tipper
Department of Informatics and Networked Systems, University of Pittsburgh, Pittsburgh, PA, USA
16 shared publications- Rita Girão-Silva
Department of Electrical and Computer Engineering University of Coimbra Coimbra Portugal
12 shared publications - Abdulaziz Alashaikh
University of Jeddah, Jeddah, Saudi Arabia
8 shared publications Jacek Rak
University of Technology
7 shared publications
Latest Publications
A new linear path pair availability constraint for network design
It is essential for network operators to guarantee required levels of availability in the network without incurring in excessive costs. We address the optimization problem of upgrading links at a given cost, to achieve end‐to‐end availability guarantees in the network, via pairs of working and backup paths. These guarantees are expressed as nonlinear path pair availability constraints which cannot be readily linearized. For this reason, most works have only considered the working path availability or disaggregated models where availability guarantees are considered separately for the working and backup paths. We show that the aggregated models which jointly consider the availabilities of the working and backup paths can provide better solutions than the disaggregated models. Moreover, we present a more efficient aggregated model based on a novel strategy to linearize the path pair availability constraints, and show that it further improves previous results. It is usual to impose that the upgraded links belong to a spanning tree subgraph. We further compare the solutions with and without this imposition and show that relaxing the tree condition can provide better solutions.
A new linear path pair availability constraint for network design
It is essential for network operators to guarantee required levels of availability in the network without incurring in excessive costs. We address the optimization problem of upgrading links at a given cost, to achieve end‐to‐end availability guarantees in the network, via pairs of working and backup paths. These guarantees are expressed as nonlinear path pair availability constraints which cannot be readily linearized. For this reason, most works have only considered the working path availability or disaggregated models where availability guarantees are considered separately for the working and backup paths. We show that the aggregated models which jointly consider the availabilities of the working and backup paths can provide better solutions than the disaggregated models. Moreover, we present a more efficient aggregated model based on a novel strategy to linearize the path pair availability constraints, and show that it further improves previous results. It is usual to impose that the upgraded links belong to a spanning tree subgraph. We further compare the solutions with and without this imposition and show that relaxing the tree condition can provide better solutions.
- 12 April 2024
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 16 (5) , ONDM1-ONDM2
Introduction to the ONDM 2023 special issue
This JOCN special issue contains extended versions of selected papers presented at the 27th International Conference on Optical Network Design and Modeling (ONDM 2023), which took place on 8–11 May 2023 at the University of Coimbra, Coimbra, Portugal. The articles in this special issue contain several current topics of optical networking research: quality of transmission (QoT) estimation and its importance in network control and optimization, strategies to reduce power consumption in optical networks, analysis of optical network resilience from the link level up to inter-carrier networks, and strategies to upgrade long-haul quantum key distribution networks.
- 12 April 2024
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 16 (5) , ONDM1-ONDM2
Introduction to the ONDM 2023 special issue
This JOCN special issue contains extended versions of selected papers presented at the 27th International Conference on Optical Network Design and Modeling (ONDM 2023), which took place on 8–11 May 2023 at the University of Coimbra, Coimbra, Portugal. The articles in this special issue contain several current topics of optical networking research: quality of transmission (QoT) estimation and its importance in network control and optimization, strategies to reduce power consumption in optical networks, analysis of optical network resilience from the link level up to inter-carrier networks, and strategies to upgrade long-haul quantum key distribution networks.
- 26 June 2023
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 31 (3) , 1-21
Two Algorithms for the k-Widest Path Problem
- 26 June 2023
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 31 (3) , 1-21
Two Algorithms for the k-Widest Path Problem
- 27 April 2023
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 15 (5) , ONDM1-ONDM2
Introduction to the ONDM 2022 special issue
This JOCN special issue contains extended versions of selected papers presented at the 26th International Conference on Optical Network Design and Modeling (ONDM 2022), which took place 16–19 May 2022 at Warsaw University of Technology, Warsaw, Poland. The topics covered by the papers represent trends in optical networking research: application of machine learning to network management, cross-layer network performance optimization, visible light communication as well as coherent metro networks.
- 27 April 2023
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 15 (5) , ONDM1-ONDM2
Introduction to the ONDM 2022 special issue
This JOCN special issue contains extended versions of selected papers presented at the 26th International Conference on Optical Network Design and Modeling (ONDM 2022), which took place 16–19 May 2022 at Warsaw University of Technology, Warsaw, Poland. The topics covered by the papers represent trends in optical networking research: application of machine learning to network management, cross-layer network performance optimization, visible light communication as well as coherent metro networks.
- 30 September 2022
- Published by Springer Nature in Annals of Telecommunications
- Vol. 78 (1-2) , 1-12
A biobjective availability optimization problem with nonlinear constraints
- 30 September 2022
- Published by Springer Nature in Annals of Telecommunications
- Vol. 78 (1-2) , 1-12
A biobjective availability optimization problem with nonlinear constraints
- 1 November 2021
- Published by Elsevier in Optical Switching and Networking
- Vol. 42
Joint optimization of primary and backup controller placement and availability link upgrade in SDN networks
- 1 November 2021
- Published by Elsevier in Optical Switching and Networking
- Vol. 42
Joint optimization of primary and backup controller placement and availability link upgrade in SDN networks
- Open Access
- 1 November 2021
- Published by Elsevier in Optical Switching and Networking
- Vol. 42
Disaster resilience of optical networks: State of the art, challenges, and opportunities
- 1 November 2021
- Published by Elsevier in Optical Switching and Networking
- Vol. 42
Open AccessDisaster resilience of optical networks: State of the art, challenges, and opportunities
- Open Access
- 21 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 144927-144939
Determining the Minimum Cost Steiner Tree for Delay Constrained Problems
We address a variant of the Steiner tree problem for delay constrained problems. The addressed problem consists in determining the minimum cost Steiner tree, while guaranteeing that the delay between any two terminal nodes does not exceed a given maximum value. This problem is known as the bounded diameter Steiner minimum tree problem. We propose a compact formulation based on integer linear programming (ILP) to obtain optimal solutions, which was efficiently solved on two telecommunication core networks up to 75 nodes. However, given that for traditional Steiner tree graphs the ILP proved to be inefficient, we propose a heuristic method and compare it with the ILP formulation. We show that the heuristic provides optimal solutions, except for two cases in our experiments where it provided near-optimal solutions, always in reasonable runtimes. Additionally, to reduce the complexity of the problem, we propose some novel and modified graph reductions specific for the addressed problem.
- 21 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 144927-144939
Open AccessDetermining the Minimum Cost Steiner Tree for Delay Constrained Problems
We address a variant of the Steiner tree problem for delay constrained problems. The addressed problem consists in determining the minimum cost Steiner tree, while guaranteeing that the delay between any two terminal nodes does not exceed a given maximum value. This problem is known as the bounded diameter Steiner minimum tree problem. We propose a compact formulation based on integer linear programming (ILP) to obtain optimal solutions, which was efficiently solved on two telecommunication core networks up to 75 nodes. However, given that for traditional Steiner tree graphs the ILP proved to be inefficient, we propose a heuristic method and compare it with the ILP formulation. We show that the heuristic provides optimal solutions, except for two cases in our experiments where it provided near-optimal solutions, always in reasonable runtimes. Additionally, to reduce the complexity of the problem, we propose some novel and modified graph reductions specific for the addressed problem.
- Open Access
- 11 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 13125-13148
eFRADIR: An Enhanced FRAmework for DIsaster Resilience
This paper focuses on how to increase the availability of a backbone network with minimal cost. In particular, the new framework focuses on resilience against natural disasters and is an evolution of the FRADIR/FRADIR-II framework. It targets three different directions, namely: network planning, failure modeling, and survivable routing. The steady state network planning is tackled by upgrading a sub-network (a set of links termed the spine) to achieve the targeted availability threshold. A new two-stage approach is proposed: a heuristic algorithm combined with a mixed-integer linear problem to optimize the availability upgrade cost. To tackle the disaster-resilient network planning problem, a new integer linear program is presented for the optimal link intensity tolerance upgrades together with an efficient heuristic scheme to reduce the running time. Failure modeling is improved by considering more realistic disasters. In particular, we focus on earthquakes using the historical data of the epicenters and the moment magnitudes. The joint failure probabilities of the multi-link failures are estimated, and the set of shared risk link groups is defined. The survivable routing aims to improve the network’s connectivity during these shared risk link group failures. Here, a generalized dedicated protection algorithm is used to protect against all the listed failures. Finally, the experimental results demonstrate the benefits of the refined eFRADIR framework in the event of disasters by guaranteeing low disconnection probabilities even during large-scale natural disasters.
- 11 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 13125-13148
Open AccesseFRADIR: An Enhanced FRAmework for DIsaster Resilience
This paper focuses on how to increase the availability of a backbone network with minimal cost. In particular, the new framework focuses on resilience against natural disasters and is an evolution of the FRADIR/FRADIR-II framework. It targets three different directions, namely: network planning, failure modeling, and survivable routing. The steady state network planning is tackled by upgrading a sub-network (a set of links termed the spine) to achieve the targeted availability threshold. A new two-stage approach is proposed: a heuristic algorithm combined with a mixed-integer linear problem to optimize the availability upgrade cost. To tackle the disaster-resilient network planning problem, a new integer linear program is presented for the optimal link intensity tolerance upgrades together with an efficient heuristic scheme to reduce the running time. Failure modeling is improved by considering more realistic disasters. In particular, we focus on earthquakes using the historical data of the epicenters and the moment magnitudes. The joint failure probabilities of the multi-link failures are estimated, and the set of shared risk link groups is defined. The survivable routing aims to improve the network’s connectivity during these shared risk link group failures. Here, a generalized dedicated protection algorithm is used to protect against all the listed failures. Finally, the experimental results demonstrate the benefits of the refined eFRADIR framework in the event of disasters by guaranteeing low disconnection probabilities even during large-scale natural disasters.
- 4 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (1) , 301-314
SDN Controller Placement With Availability Upgrade Under Delay and Geodiversity Constraints
An inherent problem in Software-Defined Networking (SDN) is the Controller Placement Problem, which addresses how many controllers to deploy in the network, and where to place them. Several variants of this problem have been addressed and researched to find the placements that adapt best to different contexts. In this article, we address a more complex variant of this problem, to satisfy QoS requirements and to offer robustness against disaster-based failures. We address the joint optimization problem of controller placement and finding a tree subgraph which can be upgraded to have enhanced availability, in order to satisfy delay and availability constraints. Additionally, we consider geodiversity constraints as a way to enhance robustness to disaster-based failures.
- 4 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (1) , 301-314
SDN Controller Placement With Availability Upgrade Under Delay and Geodiversity Constraints
An inherent problem in Software-Defined Networking (SDN) is the Controller Placement Problem, which addresses how many controllers to deploy in the network, and where to place them. Several variants of this problem have been addressed and researched to find the placements that adapt best to different contexts. In this article, we address a more complex variant of this problem, to satisfy QoS requirements and to offer robustness against disaster-based failures. We address the joint optimization problem of controller placement and finding a tree subgraph which can be upgraded to have enhanced availability, in order to satisfy delay and availability constraints. Additionally, we consider geodiversity constraints as a way to enhance robustness to disaster-based failures.