A survey of some network reliability analysis and synthesis results

Authors:
F T. Boesch;A. Satyanarayana;C. L. Suffel
Affiliations:
Department of Computer Science, Stevens Institute of Technology, Hoboken, New Jersey 07030;Department of Computer Science, Stevens Institute of Technology, Hoboken, New Jersey 07030;Department of Computer Science, Stevens Institute of Technology, Hoboken, New Jersey 07030
Venue:
Networks
Year:
2009

Citing 0
Cited 3

The enumeration of vertex induced subgraphs with respect to the number of components

European Journal of Combinatorics
Resilience enhancing expansion strategies for water distribution systems: A network theory approach

Environmental Modelling & Software
Monte Carlo estimation of diameter-constrained network reliability conditioned by pathsets and cutsets

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this article is to introduce several results concerning the analysis and synthesis of reliable or invulnerable networks. First, the notion of signed reliability domination of systems is described and some applications to reliability analysis are reviewed. Then the analysis problem is considered and a brief summary of the difficulty of calculating various reliability measures is presented. Some relevant concepts in the synthesis of a most reliable network are studied. The article concludes with an introduction to a non-probabilistic approach to evaluate the vulnerability of a network. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009