Abstract
Complex systems, whose components are subject to failure, are generally modelled by undirected and connected graphs where an edge e connecting two nodes is available only with a certain probability p e < 1. Generally network reliability is measured by the so-called “all-terminal reliability”, which is the probability that all nodes of the network are connected with one another. Besides, the so-called K-terminal reliability is used in reliability analysis of systems, where K is a subset of the set of nodes, and the K-terminal reliability is the probability that all the nodes of K are connected with one another. The problem is to determine these reliability measures for a general system, which turns out to be possible only for rather small (w.r.t.the number of nodes and edges) or specially structured (parallel or serial) systems. Thus simple approximations are needed to enable to compute the reliability for general systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beichelt, F. (1993). Decomposition and reduction techniques, In New Trends in System Reliability Evaluation (Ed., K. B. Misra), pp. 75–116, Elsevier.
Bienstock, D. (1986). An algorithm for the reliability analysis of planar graphs, Networks, 16, 411–422.
Blechschmidt, A. (1993). Rechnergestützte Zuverlässigkeitsanalyse stochastischer Netzstrukturen auf der Basis von Dekompositions- und Reduktionstechniken, Ph.D. Dissertation, Ingenieurhochschule Mittweida, Mittweida.
Colbourn, Ch. J. (1987). The Combinatorics of Network Reliability, New York: Oxford University Press.
Kohlas, J. (1987). Zuverlässigkeit und Verfügbarkeit, Stuttgart: Teubner-Verlag.
Politof, T. and Santyanarayana, A. (1986). Efficient algorithms for reliability analysis of planar networks—A survey, IEEE Transactions on Reliability, 35, 384–393.
Tittmann, P. and Blechschmidt, A. (1991). Reliability bounds based on networks splitting, J. Infor. Process. Cybern., 27, 317–326.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Birkhäuser Boston
About this chapter
Cite this chapter
von Collani, E. (1998). A Simple Algorithm for Calculating Approximately the Reliability of Almost Arbitrary Large Networks. In: Kahle, W., von Collani, E., Franz, J., Jensen, U. (eds) Advances in Stochastic Models for Reliability, Quality and Safety. Statistics for Industry and Technology. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-2234-7_15
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2234-7_15
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-7466-7
Online ISBN: 978-1-4612-2234-7
eBook Packages: Springer Book Archive