default search action
Teresa Gomes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j35]Massimo Tornatore
, Teresa Gomes, Carmen Mas Machuca, Eiji Oki, Chadi Assi, Dominic Schupke
Guest Editors' Introduction: Special Issue on Robust and Resilient Future Communication Networks. IEEE Trans. Netw. Serv. Manag. 21(5): 4929-4935 (2024) - 2023
- [j34]Dorabella Santos
A biobjective availability optimization problem with nonlinear constraints. Ann. des Télécommunications 78(1-2): 1-12 (2023) - [j33]Teresa Gomes
Two Algorithms for the k-Widest Path Problem. J. Netw. Syst. Manag. 31(3): 57 (2023) - [j32]Jaroslaw Piotr Turkiewicz, Teresa Gomes
Introduction to the ONDM 2022 special issue. JOCN 15(5): ONDM1-ONDM2 (2023) - [j31]Massimo Tornatore
Guest Editors' Introduction: Special Section on Robust and Reliable Networks of the Future. IEEE Trans. Netw. Serv. Manag. 20(3): 2151-2156 (2023) - [e2]Teresa Gomes, David Larrabeiti López, Carmen Mas Machuca, Luca Valcarenghi, Luísa Jorge, Paulo Melo:
International Conference on Optical Network Design and Modeling, ONDM 2023, Coimbra, Portugal, May 8-11, 2023. IEEE 2023, ISBN 978-3-903176-54-6 [contents] - 2022
- [j30]Massimo Tornatore
Guest Editors Introduction: Special Section on Recent Advances in the Design and Management of Reliable Communication Networks. IEEE Trans. Netw. Serv. Manag. 19(3): 2434-2439 (2022) - [c38]Dorabella Santos, Teresa Gomes
Resilient SDN Intercontroller Network Design under Availability Requirements and Geodiversity Constraints. DRCN 2022: 1-8 - [c37]Dorabella Santos, Lúcia Martins
Near Optimal Network Design for Path Pair Availability Guarantees. RNDM 2022: 1-8 - 2021
- [j29]Alija Pasic
eFRADIR: An Enhanced FRAmework for DIsaster Resilience. IEEE Access 9: 13125-13148 (2021) - [j28]Lúcia Martins
Determining the Minimum Cost Steiner Tree for Delay Constrained Problems. IEEE Access 9: 144927-144939 (2021) - [j27]Jacek Rak
Disaster resilience of optical networks: State of the art, challenges, and opportunities. Opt. Switch. Netw. 42: 100619 (2021) - [j26]Dorabella Santos
Joint optimization of primary and backup controller placement and availability link upgrade in SDN networks. Opt. Switch. Netw. 42: 100634 (2021) - [j25]Dorabella Santos
SDN Controller Placement With Availability Upgrade Under Delay and Geodiversity Constraints. IEEE Trans. Netw. Serv. Manag. 18(1): 301-314 (2021) - [j24]Massimo Tornatore
Guest Editors' Introduction: Special Section on Design and Management of Reliable Communication Networks. IEEE Trans. Netw. Serv. Manag. 18(3): 2455-2459 (2021) - [c36]Paulo E. Melo
Failure Simulation in Software-Defined Networks with Differential Link Availability. DRCN 2021: 1-6 - [c35]Dorabella Santos
Improving East/Westbound SDN Connectivity via Enhanced Availability. NoF 2021: 1-9 - 2020
- [j23]Rita Girão-Silva
Shared Risk Link Group disjointness and geodiverse routing: A trade-off between benefit and practical effort. Networks 75(4): 374-391 (2020) - [c34]Rita Girão-Silva, Teresa Gomes
A centrality-based heuristic for network design to support availability differentiation. DRCN 2020: 1-7 - [c33]Dorabella Santos
Software-Defined Network Design driven by Availability Requirements. DRCN 2020: 1-7 - [c32]Dorabella Santos
A Heuristic Method for Controller Placement and Enhanced Availability between SDN Controllers. NOF 2020: 82-90 - [p3]Teresa Gomes
Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios. Guide to Disaster-Resilient Communication Networks 2020: 429-453 - [p2]Teresa Gomes
Disaster-Resilient Routing Schemes for Regional Failures. Guide to Disaster-Resilient Communication Networks 2020: 483-506 - [p1]Teresa Gomes
Enhancing Availability for Critical Services. Guide to Disaster-Resilient Communication Networks 2020: 557-581
2010 – 2019
- 2019
- [j22]Abdulaziz Alashaikh
Embedded network design to support availability differentiation. Ann. des Télécommunications 74(9-10): 605-623 (2019) - [j21]Bruna Nogueira
Regeneration and grooming in MPLS over WDM networks. JOCN 11(8): 465-477 (2019) - [j20]Amaro de Sousa
Minimization of the network availability upgrade cost with geodiverse routing for disaster resilience. Opt. Switch. Netw. 31: 127-143 (2019) - [c31]Rita Girão-Silva, Lúcia Martins
Heuristic Approach for the Design of a High Availability Structure. DRCN 2019: 29-36 - [c30]Luís Alçada-Almeida, Teresa Gomes
Optimization of PMU Location and Communications in a Power Grid. RNDM 2019: 1-7 - [c29]Alija Pasic, Rita Girão-Silva, Bálazs Vass
FRADIR-II: An Improved Framework for Disaster Resilience. RNDM 2019: 1-7 - [c28]Dorabella Santos
Controller Placement and Availability Link Upgrade Problem in SDN Networks. RNDM 2019: 1-8 - [e1]Prosper Chemouil, Teresa Gomes, Dominic Schupke, David Tipper, Luísa Jorge, Paulo E. Melo:
15th International Conference on the Design of Reliable Communication Networks, DRCN 2019, Coimbra, Portugal, March 19-21, 2019. IEEE 2019, ISBN 978-1-5386-8461-0 [contents] - 2018
- [j19]Abdulaziz Alashaikh
Exploring the logical layer to support differentiated resilience classes in multilayer networks. Ann. des Télécommunications 73(1-2): 63-79 (2018) - [c27]Abdulaziz S. Alashaikh
Designing a high availability subnetwork to support availability differentiation. ICIN 2018: 1-8 - [c26]Boro Nedic, Matthias Gunkel, Teresa Gomes
SRLG-disjointness and geodiverse routing - a practical network study and operational conclusions. RNDM 2018: 1-8 - [c25]Alija Pasic, Rita Girão-Silva, Bálazs Vass
FRADIR: A Novel Framework for Disaster Resilience. RNDM 2018: 1-7 - 2017
- [j18]Lúcia Martins
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes. Networks 70(4): 292-307 (2017) - [j17]Teresa Gomes
Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks. Networks 70(4): 360-372 (2017) - [j16]Teresa Gomes
Algorithms for determining a node-disjoint path pair visiting specified nodes. Opt. Switch. Netw. 23: 189-204 (2017) - [c24]Amaro de Sousa, Teresa Gomes
Minimizing the network availability upgrade cost with geodiversity guarantees. RNDM 2017: 1-8 - 2016
- [j15]Velin Kounev, Martin Lévesque, David Tipper
Reliable Communication Networks for Smart Grid Transmission Systems. J. Netw. Syst. Manag. 24(2): 629-652 (2016) - [j14]Teresa Gomes
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach. Photonic Netw. Commun. 31(1): 11-22 (2016) - [c23]Abdulaziz Alashaikh
Supporting differentiated resilience classes in multilayer networks. DRCN 2016: 31-38 - [c22]Carlos Henggeler Antunes, Maria João Alves, Joana Dias, Teresa Gomes
Single and Multiple Objective Optimization Models for Opportunistic Preventive Maintenance. ICORES 2016: 107-114 - [c21]Jacek Rak
RECODIS: Resilient Communication Services Protecting End-user Applications from Disaster-based Failures. ICTON 2016: 1-4 - [c20]Ricardo Mendes
Impairment-aware optimization strategies to dimension optical transport networks with minimal regeneration requirements. ICUMT 2016: 67-74 - [c19]Andreas Mauthe
Disaster-resilient communication networks: Principles and best practices. RNDM 2016: 1-10 - [c18]Teresa Gomes
A survey of strategies for communication networks to protect against large-scale natural disasters. RNDM 2016: 11-22 - [c17]Lúcia Martins
An efficient heuristic for calculating a protected path with specified nodes. RNDM 2016: 150-157 - [c16]Luis Raposo, Teresa Gomes
A New Arc-Disjoint-Trees scheme for survivable multicasting in mixed-graph sparse-splitting optical networks. RNDM 2016: 158-165 - 2015
- [j13]Abdulaziz Alashaikh
The Spine concept for improving network availability. Comput. Networks 82: 4-19 (2015) - [j12]Teresa Gomes
Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost. J. Netw. Syst. Manag. 23(4): 1067-1103 (2015) - [j11]Jaime Silva
An effective algorithm for computing all-terminal reliability bounds. Networks 66(4): 282-295 (2015) - [j10]Jacek Rak
Future research directions in design of reliable communication systems. Telecommun. Syst. 60(4): 423-450 (2015) - [c15]Velin Kounev, Martin Lévesque, David Tipper
On smart grid communications reliability. DRCN 2015: 33-40 - [c14]Teresa Gomes
Protected shortest path visiting specified nodes. RNDM@WMNC 2015: 120-127 - 2014
- [j9]Xuelian Long
Measuring the survivability of networks to geographic correlated failures. Opt. Switch. Netw. 14: 117-133 (2014) - [j8]Teresa Gomes
Resilient arcs and node disjointness in diverse routing. Opt. Switch. Netw. 14: 149-163 (2014) - [c13]Teresa Gomes
A novel approach for ensuring high end-to-end availability: The spine concept. DRCN 2014: 1-8 - 2013
- [j7]Teresa Gomes
Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost. Telecommun. Syst. 52(2): 737-749 (2013) - [c12]Teresa Gomes, Luísa Jorge, Paulo E. Melo, Rita Girão-Silva, Sergio Mendes:
Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks. DRCN 2013: 314-321 - [c11]Xuelian Long, David Tipper
Evaluating geographic topological vulnerabilities. ICUMT 2013: 54-61 - [c10]Teresa Gomes
Finding the shortest node-disjoint pair of paths that are allowed to share resilient arcs. ICUMT 2013: 179-186 - 2012
- [c9]Teresa Gomes
Protected bicriteria paths in transport networks. ICUMT 2012: 731-737 - 2011
- [c8]Teresa Gomes
SRLG failure-disjoint path pair of min-sum cost in GMPLS networks. DRCN 2011: 196-203 - [c7]Miguel Ferreira, Teresa Gomes:
Candidate cycles generation for p-cycle calculation considering SRLGs. ICUMT 2011: 1-8 - [c6]Teresa Gomes, José Silva, José M. F. Craveirinha, Carlos Simões:
Failure protected shortest paths in GMPLS networks. ICUMT 2011: 1-7 - [c5]José Silva, Teresa Gomes, Luis Fernandes, Carlos Simões, José M. F. Craveirinha:
An heuristic for maximally SRLG-disjoint path pairs calculation. ICUMT 2011: 1-8 - 2010
- [j6]Teresa Gomes
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs. J. Comb. Optim. 19(3): 394-414 (2010) - [c4]Teresa Gomes
Obtaining a SRLG-disjoint path pair of min-sum cost. ICUMT 2010: 582-588
2000 – 2009
- 2009
- [j5]Teresa Gomes
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs. Comput. Oper. Res. 36(5): 1670-1682 (2009) - [j4]Teresa Gomes
A bicriteria routing model for multi-fibre WDM networks. Photonic Netw. Commun. 18(3): 287-299 (2009) - 2007
- [j3]Teresa Gomes
Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks. Eur. J. Oper. Res. 181(3): 1055-1064 (2007) - 2006
- [c3]Luísa Jorge
Survey of Recovery Schemes in MPLS Networks. DepCoS-RELCOMEX 2006: 110-118 - 2005
- [j2]Lúcia Martins
On a bi-dimensional dynamic alternative routing method. Eur. J. Oper. Res. 166(3): 828-842 (2005) - 2004
- [c2]Luísa Jorge
Network Performance of Multi-Service Circuit Switched Networks: Simulational Comparison of Variants of DAR and RTNR. MASCOTS 2004: 513-521 - 2002
- [j1]Teresa Gomes
An efficient algorithm for sequential generation of failure states in a network with multi-mode components. Reliab. Eng. Syst. Saf. 77(2): 111-119 (2002) - 2001
- [c1]Teresa Gomes, José M. F. Craveirinha, Lúcia Martins, Marta Pascoal:
An Algorithm for Calculating the k Most Reliable Link Disjoint Paths with a Maximum Number of Arcs in Each Path. DRCN 2001: 205-212
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: