| 一种计算随机流网络可靠性的新算法 |
| |
| 引用本文： | 王芳,侯朝桢.一种计算随机流网络可靠性的新算法[J].通信学报,2004,25(1):70-77. |
| |
| 作者姓名： | 王芳 侯朝桢 |
| |
| 作者单位： | 北京理工大学,自动控制系,北京,100081 |
| |
| 摘 要： | 提出了一种计算随机流网络可靠性的新方法。通过一定的规则生成网络的状态树，使得每一个分支都是全序集合。在生成状态树的同时搜索每一个分支，对状态采用基于割集的方法进行判断。每个分支上的最小的有效状态就是网络的d-下界点。求得所有的d-下界点，进而求出网络的可靠性。
|
| 关 键 词： | 可靠性 随机流网络 d-下界点 状态树 |
| 文章编号： | 1000-436X(2004)01-0070-08 |
| 修稿时间： | 2002年12月18 |
A new method to calculate the reliability of stochastic flow network |
| |
| WANG Fang,HOU Chao-zhen.A new method to calculate the reliability of stochastic flow network[J].Journal on Communications,2004,25(1):70-77. |
| |
| Authors: | WANG Fang HOU Chao-zhen |
| |
| Abstract: | A new method to calculate the reliability of stochastic flow network is proposed. The state tree of the network is produced following a given rule, every branch of which is a fully ordered set. Search each branch while generating the state tree, and judge every state according to the method based on cutset. The minimal valid state on every branch is the lower boundary point of the network. Find all the lower boundary points, then the reliability of the network will be calculated. |
| |
| Keywords: | reliability stochastic flow network lower boundary point for d |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
