Follow
Luisa Jorge
Luisa Jorge
Instituto Politécnico de Bragança, CEDRI, INESC Coimbra
Verified email at inescc.pt
Title
Cited by
Cited by
Year
A survey of strategies for communication networks to protect against large-scale natural disasters
T Gomes, J Tapolcai, C Esposito, D Hutchison, F Kuipers, J Rak, ...
2016 8th international workshop on resilient networks design and modeling …, 2016
1802016
Interdependence between power grids and communication networks: A resilience perspective
L Martins, R Girao-Silva, L Jorge, A Gomes, F Musumeci, J Rak
DRCN 2017-Design of Reliable Communication Networks; 13th International …, 2017
472017
A survey on network resiliency methodologies against weather-based disruptions
M Tornatore, J André, P Babarczi, T Braun, E Følstad, P Heegaard, ...
2016 8th International Workshop on Resilient Networks Design and Modeling …, 2016
362016
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
T Gomes, J Craveirinha, L Jorge
Computers & Operations Research 36 (5), 1670-1682, 2009
312009
Survey of recovery schemes in MPLS networks
L Jorge, T Gomes
2006 International Conference on Dependability of Computer Systems, 110-118, 2006
242006
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach
T Gomes, L Jorge, P Melo, R Girão-Silva
Photonic Network Communications 31, 11-22, 2016
152016
Quantitative support for UX methods identification: how can multiple criteria decision making help?
P Melo, L Jorge
Universal Access in the Information Society, 1-15, 2014
132014
Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost
T Gomes, M Soares, J Craveirinha, P Melo, L Jorge, V Mirones, A Brízido
Journal of Network and Systems Management 23, 1067-1103, 2015
122015
Fundamental schemes to determine disjoint paths for multiple failure scenarios
T Gomes, L Jorge, R Girão-Silva, J Yallouz, P Babarczi, J Rak
Guide to Disaster-Resilient Communication Networks, 429-453, 2020
112020
Application protocols and wireless communication for IoT: a simulation case study proposal
L Novelli, L Jorge, P Melo, A Koscianski
2018 11th International Symposium on Communication Systems, Networks …, 2018
112018
Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks
T Gomes, L Jorge, P Melo, R Girão-Silva, S Mendes
2013 9th International Conference on the Design of Reliable Communication …, 2013
62013
Um estudo simulacional de redes inter-centrais com encaminhamento dinâmico incluindo redes com integração de serviços
LMG Jorge
PQDT-Global, 2001
52001
Network performance of multi-service circuit switched networks: simulational comparison of variants of DAR and RTNR
L Jorge, J Craveirinha, T Gornes
The IEEE Computer Society's 12th Annual International Symposium on Modeling …, 2004
42004
Conflicts and resolutions in managing water allocation at the watershed scale
Z Srdjevic, B Srdjevic, P Melo, L Jorge
Bodenkultur 70 (3), 161-170, 2019
22019
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
T Gomes, J Craveirinha, L Jorge
Journal of combinatorial optimization 19, 394-414, 2010
22010
An on-line routing algorithm of locally protected paths with exact reservations
L Jorge, T Gomes
Proceedings of the 6th IASTED International Conference on Communication …, 2007
22007
Uma versão melhorada de um algoritmo de encaminhamento para protecção local com partilha de largura de banda de protecção
L Jorge, T Gomes
Instituto de Ciência Aplicada e Tecnologia, 2006
22006
Multi-scheme recovery in MPLS networks
L Jorge, T Gomes
Proceedings of the Conference ESREL 2006, 2263-2271, 2006
22006
Recuperação em redes MPLS-uma resenha de esquemas de recuperação
L Jorge, T Gomes
Instituto de Ciência Aplicada e Tecnologia, 2005
22005
Modelling with NGSI-LD: the VALLPASS project case study
T Ribeiro, JP Coelho, L Jorge, J Sardão, J Gonçalves, H Rosse
2023 IEEE 21st International Conference on Industrial Informatics (INDIN), 1-8, 2023
12023
The system can't perform the operation now. Try again later.
Articles 1–20