Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure

Authors:
Timothy C. Matisziw;Alan T. Murray
Affiliations:
Center for Urban and Regional Analysis, The Ohio State University, 1036 Derby Hall, 154 N. Oval Mall, Columbus, OH 43210, USA;Center for Urban and Regional Analysis, The Ohio State University, 1036 Derby Hall, 154 N. Oval Mall, Columbus, OH 43210, USA and Department of Geography, The Ohio State University, USA
Venue:
Computers and Operations Research
Year:
2009

Citing 8
Cited 15

Optimal attack and reinforcement of a network

Journal of the ACM (JACM)
Stochastic Network Interdiction

Operations Research
Optimizing Restoration Capacity in the AT&T Network

Interfaces
BEAMR: An exact and approximate model for the p-median problem

Computers and Operations Research
A bilevel mixed-integer program for critical infrastructure protection planning

Computers and Operations Research
Deterministic network interdiction

Mathematical and Computer Modelling: An International Journal
Most vital links and nodes in weighted networks

Operations Research Letters
Finding the most vital arcs in a network

Operations Research Letters

Decision support for network disruption mitigation

Decision Support Systems
Detecting critical nodes in sparse graphs

Computers and Operations Research
A disaster-severity assessment DSS comparative analysis

OR Spectrum
Assessing the reliability and the expected performance of a network under disaster risk

OR Spectrum
Risk approaches for delivering disaster relief supplies

OR Spectrum
Exploiting the robustness on power-law networks

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A tool suite for modelling spatial interdependencies of distributed systems with markovian agents

EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

Networks
A decomposition approach for solving critical clique detection problems

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Branch and cut algorithms for detecting critical nodes in undirected graphs

Computational Optimization and Applications
A Single-Objective Recovery Phase Model

International Journal of Information Technology Project Management
On the discovery of critical links and nodes for assessing network vulnerability

IEEE/ACM Transactions on Networking (TON)
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

Discrete Applied Mathematics
A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian Logistics

Computers and Operations Research
Characterizing multi-event disaster resilience

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The maintenance of system flow is critical for effective network operation. Any type of disruption to network facilities (arcs/nodes) potentially risks loss of service, leaving users without access to important resources. It is therefore an important goal of planners to assess infrastructures for vulnerabilities, identifying those vital nodes/arcs whose debilitation would compromise the most source-sink (s-t) interaction or system flow. Due to the budgetary limitations of disaster management agencies, protection/fortification and planning for the recovery of these vital infrastructure facilities is a logical and efficient proactive approach to reducing worst-case risk of service disruption. Given damage to a network, evaluating the potential for flow between s-t pairs requires assessing the availability of an operational s-t path. Recent models proposed for identifying infrastructure vital to system flow have relied on enumeration of all s-t paths to support this task. This paper proposes an alternative model constraint structure that does not require complete enumeration of s-t paths, providing computational benefits over existing models. To illustrate the model, an application to a practical infrastructure planning problem is presented.