| 一个计算无圈有向网络可靠度的新算法 |
| |
| 引用本文： | 孙艳蕊,陈永川,张祥德.一个计算无圈有向网络可靠度的新算法[J].通信学报,2002,23(12):1-7. |
| |
| 作者姓名： | 孙艳蕊 陈永川 张祥德 |
| |
| 作者单位： | 1. 东北大学,辽宁,沈阳,110004
2. 南开大学,天津,300071 |
| |
| 基金项目： | 国家自然科学基金资助项目(19701006)，辽宁省科学基金资助项目 |
| |
| 摘 要： | 本文对无圈有向网络的可靠度计算进行了研究。提出了加权有序根树的概念，给出了路径集合的一种特殊排序方法，导出一个计算无圈有向网络可靠度的拓扑公式。在该公式的基础上提出了一个新的计算无圈有向网络可靠度的不交积和算法，算法可以生成简洁的可靠度表达式，从而可以有效地计算无圈有向网络的可靠度。同时验证了算法的有效性。
|
| 关 键 词： | 无圈有向网络 可靠度 算法 计算机通信网络 |
| 文章编号： | 1000-436X(2002)12-0001-07 |
| 修稿时间： | 2001年10月8日 |
A new algorithm for computing the reliability of acyclic directed networks |
| |
| SUN Yan-rui,CHEN Yong-chuan,ZHANG Xiang-de.A new algorithm for computing the reliability of acyclic directed networks[J].Journal on Communications,2002,23(12):1-7. |
| |
| Authors: | SUN Yan-rui CHEN Yong-chuan ZHANG Xiang-de |
| |
| Affiliation: | SUN Yan-rui1,CHEN Yong-chuan2,ZHANG Xiang-de1 |
| |
| Abstract: | This paper studies the computation of the two-terminal reliability. Presents a concept of weighted DFS ordered root tree and gives a special method to order the s-t minimal paths of a network. Deduces a new topological formula, based on which presents a new algorithm for computing reliability of acyclic directed networks. This algorithm can generate a simple expression of reliability and therefore can efficiently compute the reliability of acyclic directed network. The efficiency of the algorithm is illustrated. |
| |
| Keywords: | acyclic directed network reliability algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
