Lúcia Martins

Learn More
In this paper, an improved version of a previously proposed heuristic that finds ‘good’ compromise solutions for a bi-criteria Steiner trees problem is presented. This bi-criteria formulation of the Steiner’s tree problem is well suited for application in telecommunication networks whenever it is important to find the minimum amount of resources to connect(More)
The paper describes new developments of a multiple objective dynamic routing method (MODR) for circuitswitched networks previously presented, based on the periodic calculation of alternative paths for every node pair by a specialised bi-objective shortest path algorithm (MMRA). A model is presented that enables the numerical calculation of two global(More)
Received March 2015; accepted August 2015 Correspondence to: T. Gomes; e-mail: teresa@deec.uc.pt Contract grant sponsor: ICIS Project CENTRO-07-0224-FEDER-002003 (to J.S.) Contract grant sponsor: Portuguese Foundation for Science and Technology (to T.G. and L.M.); Contract grant numbers: UID/MULTI/00308/2013 and ICIS Project CENTRO-07-0224-FEDER-002003 DOI(More)
Recent natural disasters have revealed that emergency networks presently cannot disseminate the necessary disaster information, making it difficult to deploy and coordinate relief operations. These disasters have reinforced the knowledge that telecommunication networks constitute a critical infrastructure of our society, and the urgency in establishing(More)
In this paper heuristics are proposed for finding the shortest loopless path, from a source node to a target node, that visits a given set of nodes in a directed graph, such that it can be protected using a node-disjoint path. This type of problem may arise due to network management constraints. The problem of calculating the shortest path that visits a(More)
We present a first simplified version of the MultiObjective Dynamic Routing (MODR) method, more suitable for a realistic network environment as the computational effort is very much reduced while good results can still be reached. The simplified version presented herein is based on the results obtained from a discrete event simulation study which shows(More)
The exact calculation of all-terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all-terminal reliability have been utilized. We propose using an ordered subset of the mincuts and an ordered subset of minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The(More)