An exact lexicographic approach for the maximally risk‑disjoint/minimal cost path pair problem in telecommunication networks
-
Marta Pascoal [1] ; José Craveirinha [1] ; João Clímaco [1]
-
[1] Universidade de Coimbra
Universidade de Coimbra
Coimbra (Sé Nova), Portugal
-
- Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 30, Nº. 2, 2022, págs. 405-425
- Idioma: inglés
- Enlaces
-
Resumen
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that aims at fnding 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 justifcation 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
