Approximate method to evaluate reliability of complex networks

DOI10.1155/2018/5967604MaRDI QIDQ1723066zbMATH OpenOpenAlexFDO

Authors Petru Caşcaval

Publication date 19 February 2019

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2018/5967604

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Review text

Summary: This paper deals with the issue of reliability evaluation in complex networks, in which both link and node failures are considered, and proposes an approximate method based on the minimal paths between two specified nodes. The method requires an algorithm for transforming the set of minimal paths into a sum of disjoint products (SDP). To reduce the computation burden, in the first stage, only the links of the network are considered. Then, in the second stage, each term of the set of disjoint link-products is separately processed, taking into consideration the reliability values for both links and adjacent nodes. In this way, a reliability expression with a one-to-one correspondence to the set of disjoint products is obtained. This approximate method provides a very good accuracy and greatly reduces the computation for complex networks.

Recommendations

• Reliability analysis of networks using stochastic model
• scientific article; zbMATH DE number 1218894
• A method of rapid estimation of the reliability and the coefficient of potential structural invulnerability of links in complex systems
• Reliability evaluation of large telecommunication networks
• Efficient enumeration of d-minimal paths in reliability evaluation of multistate networks

Cites work

• A Minimizing Algorithm for Sum of Disjoint Products
• A Simple Method for Reliability Evaluation of a Communication System
• An Improved Abraham-Method for Generating Disjoint Sums
• An Improved Algorithm for Network Reliability
• An improved algorithm for symbolic reliability analysis
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• Disjoint Products and Efficient Computation of Reliability
• scientific article; zbMATH DE number 5967560 (Why is no real title available?)
• scientific article; zbMATH DE number 5967577 (Why is no real title available?)
• scientific article; zbMATH DE number 5967593 (Why is no real title available?)
• scientific article; zbMATH DE number 4012285 (Why is no real title available?)
• scientific article; zbMATH DE number 108614 (Why is no real title available?)
• Network reliability. Measures and evaluation
• Reliability engineering. Theory and practice
• Smaller sums of disjoint products by subproduct inversion

Cited in

(3)

• Efficient enumeration of d-minimal paths in reliability evaluation of multistate networks
• The cross-entropy method for network reliability estimation
• On Reliability Evaluation by Network Decomposition

This page was built for publication: Approximate method to evaluate reliability of complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1723066)