A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability

Shengli Yuan, Balaji Raghavachari, Lei Chen

Research output: Contribution to book or proceedingChapter

1 Scopus citations

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.
Original languageAmerican English
Title of host publicationProceedings of the IEEE Global Telecommunications Conference
DOIs
StatePublished - Dec 6 2010

Keywords

  • Algorithm
  • Physical-layer path survivability
  • Routing
  • Threat-aware

DC Disciplines

  • Databases and Information Systems

Fingerprint

Dive into the research topics of 'A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability'. Together they form a unique fingerprint.

Cite this