An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks

Abstract The paper addresses a bicriteria optimisation problem in telecommunication networks that aims at finding Pareto efficient pairs of paths between two given nodes, seeking to minimise the number of SRLGs (Shared Risk Link Groups) common to both paths and the path pair cost. This problem is of particular importance in telecommunication routing design, namely concerning resilient routing models where both a primary and a backup paths have to be calculated to minimise the risk of failure of a connection between origin and terminal nodes, in case of failure in the primary path. An exact resolution method is applied for solving this problem, enabling the calculation of the whole set of Pareto optimal solutions, which combines a transformation of the network representation with a path ranking algorithm. A comprehensive experimental study on the application of this approach, using reference network topologies, considering random SRLG assignments to the links and random link bandwidth occupations, together with the discussion on typical examples of solution selection and potential advantages of the method, are presented.

[1]  J. Clímaco,et al.  An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks , 2021, TOP.

[2]  João C. N. Clímaco,et al.  On a relaxed maximally disjoint path pair problem: a bicriteria approach , 2020, Int. Trans. Oper. Res..

[3]  Rita Girão-Silva,et al.  Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach , 2016, Photonic Network Communications.

[4]  Rita Girão-Silva,et al.  Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks , 2013, 2013 9th International Conference on the Design of Reliable Communication Networks (DRCN).

[5]  Teresa Gomes,et al.  Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost , 2011, Telecommunication Systems.

[6]  Federico Malucelli,et al.  Resource Constrained Shortest Paths with a Super Additive Objective Function , 2012, CP.

[7]  Teresa Gomes,et al.  An heuristic for maximally SRLG-disjoint path pairs calculation , 2011, 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[8]  David Pisinger,et al.  Multi-objective and multi-constrained non-additive shortest path problems , 2011, Comput. Oper. Res..

[9]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[10]  Matthias Ehrgott,et al.  A comparison of solution strategies for biobjective shortest path problems , 2009, Comput. Oper. Res..

[11]  Siavash Khorsandi,et al.  CoSE: A SRLG-Disjoint Routing Algorithm , 2007, Fourth European Conference on Universal Multiservice Networks (ECUMN'07).

[12]  A. Todimala,et al.  IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[13]  R. K. Wood,et al.  Near‐shortest and K‐shortest simple paths , 2003, Networks.

[14]  Marta M. B. Pascoal,et al.  A new implementation of Yen’s ranking loopless paths algorithm , 2003, 4OR.

[15]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

[16]  David Bernstein,et al.  Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models , 2000, Comput. Math. Organ. Theory.

[17]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[18]  E. Martins,et al.  A bicriterion shortest path algorithm , 1982 .

[19]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[20]  A. Almeida,et al.  MCDA/M in Telecommunication Networks-challenges and trends , 2020 .

[21]  Lúcia Martins,et al.  Minimization of the network availability upgrade cost with geodiverse routing for disaster resilience , 2019, Opt. Switch. Netw..

[22]  João C. N. Clímaco,et al.  Multicriteria path and tree problems: discussion on exact algorithms and applications , 2012, Int. Trans. Oper. Res..

[23]  José Craveirinha,et al.  An Algorithm for Enumerating SRLG Diverse Path Pairs , 2010 .