Please use this identifier to cite or link to this item:
Title: An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
Authors: Pascoal, Marta
Craveirinha, José
Clímaco, João
Keywords: Lexicographic shortest paths; Ranking; Pairs of paths; Telecommunication network design
Issue Date: 14-Sep-2021
Publisher: Springer
Project: UID/Multi/00308/2019 
Serial title, monograph or event: TOP: An Official Journal of the Spanish Society of Statistics and Operations Research
Abstract: The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that aims at finding a pair of paths between two given nodes, which is the shortest (in terms of cost) among those that have the fewest risks in common. This problem is of particular importance in telecommunication network design, namely concerning resilient routing models where both a primary and a backup path have to be calculated to minimize the risk of failure of a connection between origin and terminal nodes, in case of failure along the primary path and where bandwidth routing costs should also be minimized. An exact combinatorial algorithm is proposed for solving this problem which combines a path ranking method and a path labelling algorithm. Also an integer linear programming (ILP) formulation is shown for comparison purposes. After a theoretical justification of the algorithm foundations, this is described and tested, together with the ILP procedure, for a set of reference networks in telecommunications, considering randomly generated risks, associated with Shared Risk Link Groups (SRLGs) and arc costs. Both methods were capable of solving the problem instances in relatively short times and, in general, the proposed algorithm was clearly faster than the ILP formulation excepting for the networks with the greatest dimension and connectivity.
Rights: openAccess
Appears in Collections:I&D INESCC - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
PascoalEtAlEGeral2021.pdf364.51 kBAdobe PDFView/Open
Show full item record

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.