Boundary Search and Traverse: Determining the Threshold Boundary for Infrastructure Network Resilience Problems
Abstract
Traditional network interdiction problems focus on finding the target package that yields the worst-case performance for network operations given a level of attack. However, in many cases it may be desirable to disrupt a network such that its performance falls below a given performance threshold while retaining other properties, such as the ability to quickly restore performance. This is important in traditional joint operations, where the military may conduct shaping operations by interdicting a network to enable tactical success, then conduct stabilization operations that require restoration of the network. This broader view of network shaping is important for exposing operationally relevant states that are not normally identified by the traditional interdiction and restoration methods of network flow problems. However, unlike attacker defender problems that can be solved efficiently using appropriate algorithms, identifying the complete boundary that separates operational from non-operational states requires some form of enumeration, which may take too long to be useful in joint military operations. This thesis considers the use of graph theoretic measures, such as edge betweenness centrality and modularity, to develop heuristic methods for enumerating the boundary between operational and non-operational states.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 2020
- Accession Number
- AD1126894
Entities
People
- Lewis C. Flinn
Organizations
- Naval Postgraduate School