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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking Jg. 31; H. 6; S. 1 - 12
Hauptverfasser:	Vass, Balazs, Berczi-Kovacs, Erika R., Barabas, Abel, Hajdu, Zsombor Laszlo, Tapolcai, Janos
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!