Luísa Jorge

Learn More
Keywords: OR in telecommunications Paths with minimal cost sum Dual arc costs Disjoint paths Routing optimisation in some types of networks requires the calculation of the minimal cost pair of disjoint paths such that the cost functions associated with the arcs in the two paths are different. An exact algorithm for solving this NP-complete problem is(More)
Path protection is a fast and capacity-efficient approach for increasing the availability of end-to-end connections. However, sometimes it is not possible to obtain a fully disjoint path pair. In this case, it may be admissible to consider a path pair which is as disjoint as possible, and thus provide the best (in a certain sense) level of the single-fault(More)
A shared risk link group (SRLG) is a set of links which share a common risk of failure. Routing protocols in Generalized MultiProtocol Label Switching, using distributed SRLG information, can calculate paths avoiding certain SRLGs. For single SRLG failure an end-to-end SRLG-disjoint path pair can be calculated, but to ensure connection in the event of(More)
This paper presents views on how quantitative multiple criteria decision-making (MCDM) approaches may be applied to certain aspects of user experience design and evaluation (D&E) methods identification, emphasizing its strengths and weaknesses for this task. Often D&E methods need to be applied in contexts different of those they had been applied before and(More)
  • 1