System Reliability Evaluation for Imperfect Networks Using Polygon-to-Chain Reduction

• 作者: Daoud Ait-Kadi Mohamed-Larbi Rebaiaia
• 来源期刊: 美国运筹学期刊(英文)
• 学科: 数学
• 关键词: Reliability NETWORKS Algorithms FACTORIZATION Polygon-to-Chain REDUCTION Decomposition
• 年，卷（期）: 2017,（3）
• 页码范围: 201-224
• 页数: 24页
• 分类号: O1

摘要

The purpose of this paper is to propose a computational technique for evaluating the reliability of networks subject to stochastic failures. In this computation, a mathematical model is provided using a technique which incorporates the effect of the factoring decomposition theorem using polygon-to-chain and series-parallel reductions. The algorithm proceeds by identifying iteratively one of seven polygons and when it is discovered, the polygon is immediately removed and replaced by a simple chain after having changed the individual values of the reliability of each edge and each node of the polygon. Theoretically, the mathematical development follows the results presented by Satyanarayana & Wood and Theologou & Carlier. The computation process is recursively performed and less constrained in term of execution time and memory space, and generates an exact value of the reliability.