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

Research output: Contribution to conferencePresentation

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
StatePublished - Dec 10 2010
EventIEEE Global Telecommunications Conference (GLOBECOM) - Miami, FL
Duration: Dec 10 2010 → …

Conference

ConferenceIEEE Global Telecommunications Conference (GLOBECOM)
Period12/10/10 → …

Disciplines

  • Databases and Information Systems

Keywords

  • Maximum physical-layer
  • Path survivability
  • Routing algorithm
  • Threat-aware

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