Abstract
Systems of interconnected components can often be usefully represented by networks. It is practically important to calculate the reliability of such network systems when the components are subject to (statistically independent) failures. We define several commonly occurring reliability models and summarize the computational complexity of calculating their associated reliability measures. Some general techniques for exact and approximate calculation of network reliability are surveyed.
| Original language | English (US) |
|---|---|
| Title of host publication | Encyclopedia of Statistics in Quality and Reliability |
| Publisher | Wiley |
| Pages | 1-6 |
| Number of pages | 6 |
| ISBN (Electronic) | 9780470061572 |
| ISBN (Print) | 9780470018613 |
| DOIs | |
| State | Published - Jan 1 2008 |
Keywords
- bounds
- cutsets
- disjoint products
- factoring
- inclusion–exclusion
- networks
- paths
- reliability
ASJC Scopus subject areas
- General Engineering
- General Mathematics
Fingerprint
Dive into the research topics of 'Computational Issues in Network Reliability'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS