Premium
Transformations for simplifying network reliability calculations
Author(s) -
Rosenthal A.,
Frisque D.
Publication year - 1977
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230070202
Subject(s) - subnetwork , terminal (telecommunication) , enhanced data rates for gsm evolution , connection (principal bundle) , computer science , reliability (semiconductor) , exponential function , series (stratigraphy) , mathematics , topology (electrical circuits) , algorithm , combinatorics , computer network , telecommunications , power (physics) , mathematical analysis , physics , geometry , paleontology , quantum mechanics , biology
All known methods for calculating the connection probability for two vertices of an unreliable network take time exponential in the size of the network. A method is presented for reducing network size by transforming three‐terminal subnetworks into Y‐shaped networks, thus reducing terminal degrees and possibly creating series combinations which can be reduced to a single edge. Previously defined transformations were approximate, restricted to triangles, and required perfect terminals. The transformations given here are exact, apply to any three‐terminal subnetwork with perfect terminals, and permit the inclusion of unreliable terminals which are incident to one external edge. In addition, transformations for reducing certain networks with directed edges, and transformations for eliminating positive failure correlations are discussed.