Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices

Kuo, Sy‐Yen; Yeh, Fu-Min; Lin, Hung-Yau

doi:10.1109/tr.2007.896770

Cited by 81 publications

(43 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By cons, if the link fails, the cause of the failure cannot be known a priori, because it could be that one of the three components of the link has failed, and the relative conditional probabilities are given by Equations (5) and (6). Anyway, this link will be lost and therefore it will be deleted.…”

Section: Polygon-to-chain Reductionmentioning

confidence: 99%

“…Several of them are called enumeration algorithms [2]- [12], summation of disjoint products [5] [8] [13], transformations of star-delta and delta-star structures [14], factoring & Reduction techniques [11] [14]- [22], binary decision diagrams methods [6] [7] [18] [23] [24], Bayesian models [25], etc. Simulation and approximating procedures have been used when the problem is tedious or when the exact value of the reliability is not necessary required [12] [26].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Rebaiaia¹,

Ait-Kadi²

2017

AJOR

View full text Add to dashboard Cite

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 polygonto-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.

show abstract

Section: Polygon-to-chain Reductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

Rebaiaia¹,

Ait-Kadi²

2017

AJOR

View full text Add to dashboard Cite

show abstract

“…, A n )) can be constructed if a high-speed method for computing the availability A can be constructed. Many researchers have studied ways of computing the system availability [3,[7][8][9][10] but this problem is known to be NP-hard [3,13], which means that any existing method for exactly computing the system availability causes an exponential increase in the computing time if the system is large. The reason this problem is NP-hard is that if we could solve this problem in polynomial time, then we could also solve the problem of counting the number of cutsets in polynomial time, but this counting problem is known to be NP-hard [13].…”

Section: Approximationmentioning

confidence: 99%

A New Method of Approximation for Computing System-Failure Frequency

Hayashi

Yamamoto

2016

JORSJ

View full text Add to dashboard Cite

A method for approximately computing the frequency of system failures is proposed. The method uses multilinear polynomials to compute lower and upper bounds of system availability and transforms these bounds into lower and upper bounds of the system failure frequency without increasing the computational complexity. Most of the currently used high-speed approximation methods that compute the lower and upper bounds of availability use multilinear polynomials, so it is a relatively simple matter to transform these methods into new ones for computing the failure frequency while preserving their speed and accuracy. Experimental results demonstrate that the proposed method can quickly and accurately compute the system failure frequency.

show abstract

“…Conversely a cut can be considered as a set of network components such that if these components fail, the system is down. Some research [1,22] shows that the number of cuts is usually much smaller than the number of paths for many practical systems, meaning that cut-based methods (i.e. to calculate the unreliability) have better performance.…”

Section: Introductionmentioning

confidence: 99%

Two-terminal reliability analysis for multi-phase communication networks

Lu¹,

Innal²,

Xiao-yue³

et al. 2016

EiN

View full text Add to dashboard Cite

Two-Terminal reliabiliTy analysis for mulTi-phase communicaTion neTworks analiza niezawodności par Terminali w wielofazowych sieciach komunikacyjnych Większość badań niezawodności sieci ogólnie przyjąć, że struktury systemu nie zmieniają się w czasie. W artykule przedstawiono koncepcję systemów sieciowych wielofazowych (MPNS) rozpatrywanie dynamicznych właściwości sieci i analizy niezawodności MPNS. MPNS niezawodność jest oceniany przez cross-fazowego schematu decyzyjnego binarny (BDD

show abstract

Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices

Cited by 81 publications

References 36 publications

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

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

A New Method of Approximation for Computing System-Failure Frequency

Two-terminal reliability analysis for multi-phase communication networks

Contact Info

Product

Resources

About