A Practical Algorithm for Network Reliability Evaluation Based on the Factoring Theorem-A Case Study of a Generic Radiocommunication System

依據因子定理評估網路可靠度的實用演算法－以無線通信系統個案研究為例

Mohamed-Larbi Rebaiaia ； Daoud Ait-Kadi ； Arturo Merlano

《品質學報》 16卷5期 (2009/10) Pp. 323-336

摘要

複雜系統的可靠度衡量是一個可避免系統營運與基礎建設發生故障的重要檢測。本研究提出了一個以網路分解方法來解決網路可靠度的問題，並且與其他方法來進行比較。本演算法根據因子定理並結合多邊鍊結降低法則與簡化方法來解決一個節點與路徑會隨機失效的網路問題。從實驗結果得到，本演算法的執行效能與時間均優於文獻案例。

關鍵字

可靠度 ； 網路問題 ； 因子定理 ； 多邊鍊結降低法則 ； 無線通信

並列摘要

The evaluation of complex systems reliability is a crucial test to secure operations and infrastructure against failures. This paper presents the network decomposition method and compares some results to solve network reliability problem. The algorithm proceeds recursively according to the factoring theorem in conjunction with simplification and polygon-to-chain reduction rules and considers the case where network components-vertices and edges could fail randomly. The implementation of the algorithm is efficient and proceeds in less time comparing with the best examples found in the literature.

並列關鍵字

reliability ； network ； factoring theorem ； polygon-to-chain reduction ； radiocommunication

參考文獻

Abraham, J. A.(1979).An improved algorithm for network reliability.IEEE Transactions on Reliability.28,58-61.

Brace, K. S.,Rudell, K. L.,Bryant, R. E.(1990).Efficient implementation of a B DD package.(Proceedings of the 27th ACM/IEEE Design Automation Conference).

Bryant, R(1986).Graph based algorithms fur Boolean function manipulation.IEEE Transactions on Computers.35(8),677-691.

Choi, M. S.,Jun, C. H.(1995).Some variants of polygon-to-chain reductions in evaluating reliability of undirected network.Microelectronics and Reliability.35(1),1-11.

Deo, N.,Medidi, M.(1992).Parallel algorithms for terminal-pair reliability.IEEE Transactions on Reliability.41(2),201-209.