Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem

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 fai...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annual Joint Conference of the IEEE Computer and Communications Societies s. 940 - 949
Hlavní autoři: Vass, Balazs, Berczi-Kovacs, Erika, Barabas, Abel, Hajdu, Zsombor Laszlo, Tapolcai, Janos
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 02.05.2022
Témata:
Heuristic algorithms
Reliability
Roads
Routing
Runtime
Task analysis
Topology
ISSN:2641-9874
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 restriction is that the topology is a planar graph, and the SRLGs form a set of connected edges in the dual of the planar graph. 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% longer than the shortest path on average.
ISSN:2641-9874
DOI:10.1109/INFOCOM48880.2022.9796870