Approximate Method to Evaluate Reliability of Complex Networks
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 in...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2018/5967604 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832554476655869952 |
|---|---|
| author | Petru Caşcaval |
| author_facet | Petru Caşcaval |
| author_sort | Petru Caşcaval |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-0cf6195dabf2437c89c64bb2ddb33cdb |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2018-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-0cf6195dabf2437c89c64bb2ddb33cdb2025-02-03T05:51:22ZengWileyComplexity1076-27871099-05262018-01-01201810.1155/2018/59676045967604Approximate Method to Evaluate Reliability of Complex NetworksPetru Caşcaval0Department of Computer Science and Engineering, “Gheorghe Asachi” Technical University of Iaşi, Dimitrie Mangeron Street, 27, 700050 Iaşi, RomaniaThis 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.http://dx.doi.org/10.1155/2018/5967604 |
| spellingShingle | Petru Caşcaval Approximate Method to Evaluate Reliability of Complex Networks Complexity |
| title | Approximate Method to Evaluate Reliability of Complex Networks |
| title_full | Approximate Method to Evaluate Reliability of Complex Networks |
| title_fullStr | Approximate Method to Evaluate Reliability of Complex Networks |
| title_full_unstemmed | Approximate Method to Evaluate Reliability of Complex Networks |
| title_short | Approximate Method to Evaluate Reliability of Complex Networks |
| title_sort | approximate method to evaluate reliability of complex networks |
| url | http://dx.doi.org/10.1155/2018/5967604 |
| work_keys_str_mv | AT petrucascaval approximatemethodtoevaluatereliabilityofcomplexnetworks |