Teresa Martinez dos Santos Gomes


AuthID: R-000-H69

Confirmed Publications: 20



1
TITLE: Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks
AUTHORS: Teresa Gomes ; Luisa Jorge; Paulo Melo ; Rita Girao Silva ; Sergio Mendes;
PUBLISHED: 2013, SOURCE: 9th International Conference on the Design of Reliable Communication Networks (DRCN) in 2013 9TH INTERNATIONAL CONFERENCE ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS (DRCN)
INDEXED IN: Scopus WOS
IN MY: ORCID
2
TITLE: Backup Path calculation in diverse routing considering shared risk link groups
AUTHORS: Silva, J; Gomes, T ; Simoes, C;
PUBLISHED: 2012, SOURCE: European Safety and Reliability Conference: Advances in Safety, Reliability and Risk Management, ESREL 2011 in Advances in Safety, Reliability and Risk Management - Proceedings of the European Safety and Reliability Conference, ESREL 2011
INDEXED IN: Scopus
IN MY: ORCID
3
TITLE: Protected bicriteria paths in transport networks
AUTHORS: Teresa Gomes ; Lucia Martins ; Jose Silva; Nuno Gomes Ferreira; Jose Craveirinha ; Joao Climaco ; Ricardo Cadime; Catarina Monica;
PUBLISHED: 2012, SOURCE: 4th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT) in IV INTERNATIONAL CONGRESS ON ULTRA MODERN TELECOMMUNICATIONS AND CONTROL SYSTEMS 2012 (ICUMT)
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
4
TITLE: An heuristic for maximally SRLG-disjoint path pairs calculation
AUTHORS: Silva, J; Gomes, T ; Fernandes, L; Simoes, C; Craveirinha, J ;
PUBLISHED: 2011, SOURCE: 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2011 in International Congress on Ultra Modern Telecommunications and Control Systems and Workshops
INDEXED IN: Scopus
IN MY: ORCID
5
TITLE: Candidate cycles generation for p-cycle calculation considering SRLGs
AUTHORS: Ferreira, M; Gomes, T ;
PUBLISHED: 2011, SOURCE: 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2011 in International Congress on Ultra Modern Telecommunications and Control Systems and Workshops
INDEXED IN: Scopus
IN MY: ORCID
6
TITLE: Failure protected shortest paths in GMPLS networks
AUTHORS: Gomes, T ; Silva, J; Craveirinha, J ; Simoes, C;
PUBLISHED: 2011, SOURCE: 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2011 in International Congress on Ultra Modern Telecommunications and Control Systems and Workshops
INDEXED IN: Scopus
IN MY: ORCID
7
TITLE: An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs  Full Text
AUTHORS: Gomes, T ; Craveirinha, J ; Jorge, L ;
PUBLISHED: 2010, SOURCE: JOURNAL OF COMBINATORIAL OPTIMIZATION, VOLUME: 19, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
8
TITLE: Obtaining a SRLG-disjoint path pair of min-sum cost
AUTHORS: Gomes, T ; Fernandes, L;
PUBLISHED: 2010, SOURCE: 2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2010 in 2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2010
INDEXED IN: Scopus CrossRef: 5
IN MY: ORCID
9
TITLE: A bi-objective model for routing and wavelength assignment in resilient WDM networks
AUTHORS: Teresa Gomes ; Jose Craveirinha ; Carlos Simoes; Joao Climaco ;
PUBLISHED: 2009, SOURCE: European Safety and Reliability Conference (ESREL)/17th Annual Meeting of the Society-for-Risk-Analysis-Europe (SRA-Europe) in SAFETY, RELIABILITY AND RISK ANALYSIS: THEORY, METHODS AND APPLICATIONS, VOLS 1-4, VOLUME: 4
INDEXED IN: Scopus WOS
IN MY: ORCID
10
TITLE: A bicriteria routing model for multi-fibre WDM networks  Full Text
AUTHORS: Gomes, T ; Craveirinha, J ; Climaco, J ; Simoes, C;
PUBLISHED: 2009, SOURCE: PHOTONIC NETWORK COMMUNICATIONS, VOLUME: 18, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 4
IN MY: ORCID
Page 1 of 2. Total results: 20.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service