A Whirling Dervish: 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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE/ACM transactions on networking Vol. 31; no. 6; pp. 1 - 12
Main Authors:	Vass, Balazs, Berczi-Kovacs, Erika R., Barabas, Abel, Hajdu, Zsombor Laszlo, Tapolcai, Janos
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Best practice disaster resilience Faces Failure Graph theory IEEE transactions Minimax techniques Network topologies Network topology Planning polynomial algorithm Polynomials Routing shared risk link group (SRLG) Shortest-path problems Topology
ISSN:	1063-6692, 1558-2566
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!