Teresa Gomes
Orcid: 0000-0002-3084-5608
According to our database1,
Teresa Gomes
authored at least 76 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Guest Editors' Introduction: Special Issue on Robust and Resilient Future Communication Networks.
IEEE Trans. Netw. Serv. Manag., October, 2024
2023
Guest Editors' Introduction: Special Section on Robust and Reliable Networks of the Future.
IEEE Trans. Netw. Serv. Manag., September, 2023
Ann. des Télécommunications, February, 2023
2022
Guest Editors Introduction: Special Section on Recent Advances in the Design and Management of Reliable Communication Networks.
IEEE Trans. Netw. Serv. Manag., 2022
Proceedings of the 12th International Workshop on Resilient Networks Design and Modeling, 2022
Resilient SDN Intercontroller Network Design under Availability Requirements and Geodiversity Constraints.
Proceedings of the 18th International Conference on the Design of Reliable Communication Networks, 2022
2021
Guest Editors' Introduction: Special Section on Design and Management of Reliable Communication Networks.
IEEE Trans. Netw. Serv. Manag., 2021
SDN Controller Placement With Availability Upgrade Under Delay and Geodiversity Constraints.
IEEE Trans. Netw. Serv. Manag., 2021
Joint optimization of primary and backup controller placement and availability link upgrade in SDN networks.
Opt. Switch. Netw., 2021
Disaster resilience of optical networks: State of the art, challenges, and opportunities.
Opt. Switch. Netw., 2021
IEEE Access, 2021
Proceedings of the 12th International Conference on Network of the Future, 2021
Proceedings of the 17th International Conference on the Design of Reliable Communication Networks, 2021
2020
Proceedings of the Guide to Disaster-Resilient Communication Networks, 2020
Proceedings of the Guide to Disaster-Resilient Communication Networks, 2020
Proceedings of the Guide to Disaster-Resilient Communication Networks, 2020
Shared Risk Link Group disjointness and geodiverse routing: A trade-off between benefit and practical effort.
Networks, 2020
A Heuristic Method for Controller Placement and Enhanced Availability between SDN Controllers.
Proceedings of the 11th International Conference on Network of the Future, 2020
Proceedings of the 16th International Conference on the Design of Reliable Communication Networks, 2020
A centrality-based heuristic for network design to support availability differentiation.
Proceedings of the 16th International Conference on the Design of Reliable Communication Networks, 2020
2019
Minimization of the network availability upgrade cost with geodiverse routing for disaster resilience.
Opt. Switch. Netw., 2019
Ann. des Télécommunications, 2019
Proceedings of the 11th International Workshop on Resilient Networks Design and Modeling, 2019
Proceedings of the 11th International Workshop on Resilient Networks Design and Modeling, 2019
Proceedings of the 11th International Workshop on Resilient Networks Design and Modeling, 2019
Proceedings of the 15th International Conference on the Design of Reliable Communication Networks, 2019
2018
Exploring the logical layer to support differentiated resilience classes in multilayer networks.
Ann. des Télécommunications, 2018
Proceedings of the 10th International Workshop on Resilient Networks Design and Modeling, 2018
SRLG-disjointness and geodiverse routing - a practical network study and operational conclusions.
Proceedings of the 10th International Workshop on Resilient Networks Design and Modeling, 2018
Proceedings of the 21st Conference on Innovation in Clouds, 2018
2017
Opt. Switch. Netw., 2017
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes.
Networks, 2017
Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks.
Networks, 2017
Proceedings of the 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM), 2017
2016
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach.
Photonic Netw. Commun., 2016
J. Netw. Syst. Manag., 2016
A New Arc-Disjoint-Trees scheme for survivable multicasting in mixed-graph sparse-splitting optical networks.
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016
A survey of strategies for communication networks to protect against large-scale natural disasters.
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016
Impairment-aware optimization strategies to dimension optical transport networks with minimal regeneration requirements.
Proceedings of the 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2016
RECODIS: Resilient Communication Services Protecting End-user Applications from Disaster-based Failures.
Proceedings of the 18th International Conference on Transparent Optical Networks, 2016
Single and Multiple Objective Optimization Models for Opportunistic Preventive Maintenance.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016
Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016
2015
Telecommun. Syst., 2015
Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost.
J. Netw. Syst. Manag., 2015
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015
Proceedings of the 11th International Conference on the Design of Reliable Communication Networks, 2015
2014
Opt. Switch. Netw., 2014
Proceedings of the 10th International Conference on the Design of Reliable Communication Networks, 2014
2013
Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost.
Telecommun. Syst., 2013
Proceedings of the 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2013
Finding the shortest node-disjoint pair of paths that are allowed to share resilient arcs.
Proceedings of the 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2013
Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks.
Proceedings of the 9th International Conference on the Design of Reliable Communication Networks, 2013
2012
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012
2011
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
Proceedings of the 8th International Workshop on the Design of Reliable Communication Networks, 2011
2010
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs.
J. Comb. Optim., 2010
Proceedings of the International Conference on Ultra Modern Telecommunications, 2010
2009
Photonic Netw. Commun., 2009
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs.
Comput. Oper. Res., 2009
2007
Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks.
Eur. J. Oper. Res., 2007
2006
Proceedings of the 2006 International Conference on Dependability of Computer Systems (DepCoS-RELCOMEX 2006), 2006
2005
2004
Network Performance of Multi-Service Circuit Switched Networks: Simulational Comparison of Variants of DAR and RTNR.
Proceedings of the 12th International Workshop on Modeling, 2004
2002
An efficient algorithm for sequential generation of failure states in a network with multi-mode components.
Reliab. Eng. Syst. Saf., 2002
2001
An Algorithm for Calculating the k Most Reliable Link Disjoint Paths with a Maximum Number of Arcs in Each Path.
Proceedings of the 3rd International Workshop on the Design of Reliable Communication Networks, 2001