Title :
A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability
Author :
Yuan, Shengli ; Raghavachari, Balaji ; Chen, Lei
Author_Institution :
Dept. of Comput. & Math. Sci., Univ. of Houston, Houston, TX, USA
Abstract :
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.
Keywords :
computational complexity; optimisation; polynomials; telecommunication network reliability; telecommunication network routing; NP-hard problem; maximum physical layer path survivability; multiple network devices; optimal path; semipolynomial running time; threat aware routing algorithm; Computers; Conferences; IEEE Communications Society; Optical fiber communication; Peer to peer computing; Polynomials; Sorting;
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
Conference_Location :
Miami, FL
Print_ISBN :
978-1-4244-5636-9
Electronic_ISBN :
1930-529X
DOI :
10.1109/GLOCOM.2010.5683786
