# Cut set-based risk and reliability analysis for arbitrarily interconnected networks

## Abstract

Method for computing all-terminal reliability for arbitrarily interconnected networks such as the United States public switched telephone network. The method includes an efficient search algorithm to generate minimal cut sets for nonhierarchical networks directly from the network connectivity diagram. Efficiency of the search algorithm stems in part from its basis on only link failures. The method also includes a novel quantification scheme that likewise reduces computational effort associated with assessing network reliability based on traditional risk importance measures. Vast reductions in computational effort are realized since combinatorial expansion and subsequent Boolean reduction steps are eliminated through analysis of network segmentations using a technique of assuming node failures to occur on only one side of a break in the network, and repeating the technique for all minimal cut sets generated with the search algorithm. The method functions equally well for planar and non-planar networks.

- Inventors:

- (Albuquerque, NM)

- Issue Date:

- Research Org.:
- SANDIA CORP

- OSTI Identifier:
- 873270

- Patent Number(s):
- 6125453

- Assignee:
- Sandia Corporation (Albuquerque, NM) SNL

- DOE Contract Number:
- AC04-94AL85000

- Resource Type:
- Patent

- Country of Publication:
- United States

- Language:
- English

- Subject:
- cut; set-based; risk; reliability; analysis; arbitrarily; interconnected; networks; method; computing; all-terminal; united; public; switched; telephone; network; efficient; algorithm; generate; minimal; sets; nonhierarchical; directly; connectivity; diagram; efficiency; stems; basis; link; failures; novel; quantification; scheme; likewise; reduces; computational; effort; associated; assessing; based; traditional; importance; measures; vast; reductions; realized; combinatorial; expansion; subsequent; boolean; reduction; steps; eliminated; segmentations; technique; assuming; node; occur; break; repeating; generated; functions; equally; planar; non-planar; reduction step; interconnected networks; arbitrarily interconnected; /714/709/

### Citation Formats

```
Wyss, Gregory D.
```*Cut set-based risk and reliability analysis for arbitrarily interconnected networks*. United States: N. p., 2000.
Web.

```
Wyss, Gregory D.
```*Cut set-based risk and reliability analysis for arbitrarily interconnected networks*. United States.

```
Wyss, Gregory D. Sat .
"Cut set-based risk and reliability analysis for arbitrarily interconnected networks". United States. https://www.osti.gov/servlets/purl/873270.
```

```
@article{osti_873270,
```

title = {Cut set-based risk and reliability analysis for arbitrarily interconnected networks},

author = {Wyss, Gregory D.},

abstractNote = {Method for computing all-terminal reliability for arbitrarily interconnected networks such as the United States public switched telephone network. The method includes an efficient search algorithm to generate minimal cut sets for nonhierarchical networks directly from the network connectivity diagram. Efficiency of the search algorithm stems in part from its basis on only link failures. The method also includes a novel quantification scheme that likewise reduces computational effort associated with assessing network reliability based on traditional risk importance measures. Vast reductions in computational effort are realized since combinatorial expansion and subsequent Boolean reduction steps are eliminated through analysis of network segmentations using a technique of assuming node failures to occur on only one side of a break in the network, and repeating the technique for all minimal cut sets generated with the search algorithm. The method functions equally well for planar and non-planar networks.},

doi = {},

journal = {},

number = ,

volume = ,

place = {United States},

year = {2000},

month = {1}

}