Abstract
Some important dependability aspects of single-fault tolerant networks consisting of a pair of nodes, both of which are connected with all the other nodes, are investigated. First “classical” connectivity aspects are reviewed. Then it is shown how, under various constraints concerning link capacities and minimum flow demands, fault trees can be found.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Stallings W.: Local Networks, an Introduction. New York: Macmillan 1987 (2nd ed.)
Kümmerle K., Limb J., Tobagi F. (eds.): Advances in Local Area Networks. New York: IEEE Press 1987.
Rai S., Agrawal D. (eds.): Distributed Computing Network Reliability: Los Alamitos: IEEE Comp. Soc. Press Tutorial 1990
Colborn C.: The Combinatorics of Network Reliability. Oxford: University Press 1987
Schneeweiss W.: SyRePa’89, a package of programs for system reliability evaluation. Informatik-Ber. 91 (2/1990). Hagen: Fernuniversität.
Schneeweiss W.: Boolean Functions with Engineering Applications and Computer Programs. Heidelberg, New York, Tokyo: Springer 1989.
Lee S.: Reliability evaluation of a flow network. IEEE Trans. R-29 (1980) 24–26.
Kohlas J.: Zuverlässigkeit und Verfügbarkeit (Reliability and Availability). Stuttgart: Teubner 1987 ( German language book).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schneeweiss, W., Holtmann, F.P. (1991). Star Type Networks with Fault Tolerance. In: Cin, M.D., Hohl, W. (eds) Fault-Tolerant Computing Systems. Informatik-Fachberichte, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76930-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-76930-6_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54545-3
Online ISBN: 978-3-642-76930-6
eBook Packages: Springer Book Archive