Cut set-based risk and reliability analysis for arbitrarily interconnected networks
- Albuquerque, NM
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.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- DOE Contract Number:
- AC04-94AL85000
- Assignee:
- Sandia Corporation (Albuquerque, NM)
- Patent Number(s):
- US 6125453
- OSTI ID:
- 873270
- Country of Publication:
- United States
- Language:
- English
Efficient algorithms for reliability analysis of planar networks - a survey
|
journal | August 1986 |
Bounds on the Reliability of Networks
|
journal | January 1986 |
Probabilistic logic modeling of network reliability for hybrid network architectures
|
conference | January 1996 |
Factoring Algorithms for Computing K-Terminal Network Reliability
|
journal | August 1986 |
Computational Complexity of Network Reliability Analysis: An Overview
|
journal | January 1986 |
Similar Records
Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming
Risk and reliability assessment for telecommunications networks
Related Subjects
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/