TY - GEN
T1 - A threat-aware routing algorithm for maximum physical-layer path survivability
AU - Yuan, Shengli
AU - Raghavachari, Balaji
AU - Chen, Lei
N1 - In this work, we study the problems of finding the path of maximum survivability between two end nodes. Multiple network devices and connections may fail s
PY - 2010
Y1 - 2010
N2 - In this work, we study the problems of finding the path of maximum survivability between two end nodes. Multiple network devices and connections may fail simultaneously due to either deliberate attacks or components failures. The problem is NP-hard and we propose a novel algorithm to find the optimal paths with semi-polynomial running time and prove its correctness.
AB - In this work, we study the problems of finding the path of maximum survivability between two end nodes. Multiple network devices and connections may fail simultaneously due to either deliberate attacks or components failures. The problem is NP-hard and we propose a novel algorithm to find the optimal paths with semi-polynomial running time and prove its correctness.
KW - Maximum survivable path
KW - Network survivability
KW - Threat-aware routing
UR - https://www.scopus.com/pages/publications/79551640788
U2 - 10.1109/GLOCOM.2010.5683786
DO - 10.1109/GLOCOM.2010.5683786
M3 - Conference article
SN - 9781424456383
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010
Y2 - 6 December 2010 through 10 December 2010
ER -