2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010(2010)
Univ Houston Downtown
被引用20|浏览12
摘要
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.