Detecting Network Vulnerabilities Through Graph TheoreticalMethods
Identifying vulnerabilities in power networks is an important problem, as even a small number of vulnerable connections can cause billions of dollars in damage to a network. In this paper, we investigate a graph theoretical formulation for identifying vulnerabilities of a network. We first try to find the most critical components in a network by finding an optimal solution for each possible cutsize constraint for the relaxed version of the inhibiting bisection problem, which aims to find loosely coupled subgraphs with significant demand/supply mismatch. Then we investigate finding critical components by finding a flow assignment that minimizes the maximum among flow assignments on all edges. We also report experiments on IEEE 30, IEEE 118, and WSCC 179 benchmark power networks.
- Research Organization:
- COLLABORATION - VillanovaU.
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 918500
- Report Number(s):
- LBNL-63487; R&D Project: KL0504; TRN: US200818%%410
- Country of Publication:
- United States
- Language:
- English
Similar Records
The Inhibiting Bisection Problem
The peculiar phase structure of random graph bisection