A modified algorithm for computing the upper-bound reliabilty of computer networks

DOI10.1016/J.AMC.2003.11.019zbMath1095.68005OpenAlexW2016688501MaRDI QIDQ706780

D. Kharzeev

Publication date: 9 February 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.11.019

zbMATH Keywords

Computer networksNetwork reliabilityNetworks decompositionNodes removalThe upper bound reliability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Practical sequential bounds for approximating two-terminal reliability

Cites Work

• Unnamed Item
• On Reliability Evaluation by Network Decomposition
• Reliability Evaluation by Network Decomposition
• Bayesian Decomposition Method for Computing the Reliability of an Oriented Network
• A Method for Calculation of Network Reliability
• The Identification of Combinational Logic Switching Structure

This page was built for publication: A modified algorithm for computing the upper-bound reliabilty of computer networks