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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE/ACM transactions on networking Ročník 31; číslo 6; s. 1 - 12
Hlavní autori:	Vass, Balazs, Berczi-Kovacs, Erika R., Barabas, Abel, Hajdu, Zsombor Laszlo, Tapolcai, Janos
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!