A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network

A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network

This paper describes a recursive algorithm to calculate the probability that all paths between two nodes in a given network are interrupted. It is assumed that all links are undirected and that links and nodes fail with given probabilities. These failures are assumed to be statistically independent....

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 20; no. 3; pp. 637 - 640
Main Author: Hansler, E.
Format: Journal Article
Language:English
Published: IEEE 01-06-1972
Subjects:
Communication networks
Computer networks
Probability
Telecommunication network reliability
Testing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes a recursive algorithm to calculate the probability that all paths between two nodes in a given network are interrupted. It is assumed that all links are undirected and that links and nodes fail with given probabilities. These failures are assumed to be statistically independent. The probability that two nodes are disconnected is expressed in terms of the probability that pairs of nodes are disconnected in subnetworks smaller than the original one. The advantage of the algorithm given in this paper compared to other known procedures results from the fact that, in most cases, these subnetworks can be considerably simplified. These simplifications lead to considerable savings in computing time.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOM.1972.1091159