Reliability Modeling and Analysis of Computer Networks
- 1 June 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 35 (2) , 156-160
- https://doi.org/10.1109/tr.1986.4335390
Abstract
The reliability analysis of computer communication networks is generally based on Boolean algebra and probability theory. This paper discusses various reliability problems of computer networks including terminal-pair connectivity, tree connectivity, and multi-terminal connectivity. This paper also studies the dynamic computer network reliability by deriving time-dependent expressions for reliability measures assuming Markov behavior for failures and repairs. This allows computation of task and mission related measures such as mean time to first failure and mean time between failures. A detailed analysis of the bridge network is presented.Keywords
This publication has 9 references indexed in Scilit:
- A Unified Formula for Analysis of Some Network Reliability ProblemsIEEE Transactions on Reliability, 1982
- A New Algorithm for the Reliability Analysis of Multi-Terminal NetworksIEEE Transactions on Reliability, 1981
- Complexity of network reliability computationsNetworks, 1980
- Derivation and use of a survivability criterion for DDP systemsPublished by Association for Computing Machinery (ACM) ,1980
- Measures for distributed processing network survivabilityPublished by Association for Computing Machinery (ACM) ,1980
- A Recursive Method Based on Case Analysis for Computing Network Terminal ReliabilityIEEE Transactions on Communications, 1978
- Synthesis of Available NetworksIEEE Transactions on Reliability, 1976
- A Boolean algebra method for computing the terminal reliability in a communication networkIEEE Transactions on Circuit Theory, 1973
- A Fast Recursive Algorithm to Calculate the Reliability of a Communication NetworkIEEE Transactions on Communications, 1972