|
The current best practice in survivable routing is to compute link or node disjoint paths in the network topology graph. It can protect single-point failures; however, several failure events may cause the interruption of multiple network elements. The set of network elements subject to potential failure events is called Shared Risk Link Group (SRLG), identified during network planning. Unfortunately, for any given list of SRLGs, finding two paths that can survive a single SRLG failure is NP-Complete. In this paper, we provide a polynomial-time SRLG-disjoint routing algorithm for planar network topologies and a large set of SRLGs. Namely, we focus on regional failures, where the failed network elements must not be far from each other. We use a flexible definition of regional failure, where the only restrictions are that i) the topology is a planar graph, ii) each SRLG forms a set of connected edges in the dual of the planar graph, and iii) for each node v, the links incident to v are part of an SRLG. The proposed algorithm is based on a max-min theorem. Through extensive simulations, we show that the algorithm scales well with the network size, and one of the paths returned by the algorithm is only 4 percent longer than the shortest path on average.
Bibtex entry:
| AUTHOR | = | {Vass, Bal{\'a}zs and B{\'e}rczi-Kov{\'a}cs Ren{\'a}ta, Erika and Barab{\'a}s, Ábel and Hajd{\'u} L{\'a}szl{\'o}, Zsombor and Tapolcai, J{\'a}nos}, |
| TITLE | = | {Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2022}, |
| NUMBER | = | {TR-2022-14} |