Abstract
The estimation of data transfer rates in networks can be traced back to the problem of finding a flow of maximal value in undirected graphs. The probability that a certain requested flow is realizable within a network environment with unreliable links — the so called flow probability — can be considered as a reliability measure. This paper presents algorithms for the computation of the flow probability.
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
Colbourn, C. J. (1987). The Combinatorics of Network Reliability, New York-Oxford: Oxford Press.
Sachs, H. (1988). Einführung in die Theorie der endlichen Graphen (Teil 1), Teubner-Verlag, Lizenz Nr. 294/375/88/70-Es 19 B3.
Aggarwal, K. K., Chopra, Y. C. and Bajwa, J. S. (1982). Capacity consideration in reliability analysis of communication systems, IEEE Transactions on Reliability, 31, 177–181.
Lee, S. H. (1980). Reliability evaluation of a flow network, IEEE Transactions on Reliability, 29, 24–26.
Rüger, W. J. (1986). Reliability analysis of networks with capacity -constraints and failures at branches and nodes, IEEE Transactions on Reliability, 35, 523–528.
Ahuja, R. K., Magnanti, T. L. and Orlin, J. B. Network Flows, New York: Prentice Hall.
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
Jentsch, R. (1998). Reliability Analysis in Flow 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_16
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2234-7_16
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-7466-7
Online ISBN: 978-1-4612-2234-7
eBook Packages: Springer Book Archive