Approximate method to evaluate reliability of complex networks (Q1723066)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate method to evaluate reliability of complex networks |
scientific article; zbMATH DE number 7025075
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate method to evaluate reliability of complex networks |
scientific article; zbMATH DE number 7025075 |
Statements
Approximate method to evaluate reliability of complex networks (English)
0 references
19 February 2019
0 references
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.
0 references