| 引用本文: | 武小悦,张维明,沙基昌.具有节点失效的网络可靠度的信息交互算法.[J].国防科技大学学报,1999,21(2):108-111.[点击复制] |
| Wu Xiaoyue,Zhang Weiming,Sha Jichang.Information Exchanging Algorithm for Reliability of Network with Node Failure[J].Journal of National University of Defense Technology,1999,21(2):108-111[点击复制] |
|
| |
|
|
| 本文已被：浏览 6201次 下载 6059次 |
| 具有节点失效的网络可靠度的信息交互算法 |
| 武小悦, 张维明, 沙基昌 |
|
(国防科技大学 系统工程与数学系 湖南 长沙 410073)
|
| 摘要: |
| 提出了一种用于计算具有节点失效的网络可靠度的新计算方法。该算法依据不交化代数及协同计算的思想, 采用节点信息义互的方法直接获得网络的不交化最小路集。算法简便易行, 具有分布计算的特点, 为大型网络系统的可靠性度计算提供了一种新的途径。 |
| 关键词: 网络可靠度, 协同计算, 算法, 最小路集 |
| DOI： |
| 投稿日期：1998-06-30 |
| 基金项目:国家部委基金资助项目 |
|
| Information Exchanging Algorithm for Reliability of Network with Node Failure |
| Wu Xiaoyue, Zhang Weiming, Sha Jichang |
|
(Department of Systems Engineering and Mathematics, NUDT, Changsha, 410073)
|
| Abstract: |
| A new algorithm for computing reliability of network with node failure is presented in this paper. Based on the principle of disjoint algebra and synergetic computing, the disjoint minimal path set is gotten directly by means of node information exchanging. The algorithm is simple and characterized by distributed computing. It provides a new approach to computing reliability of large scale network. |
| Keywords: network reliability, synergetic computing, algorithm, minimal path set |
|
|
|
|
|
