摘要
提出了一种计算随机流网络可靠性的新方法。通过一定的规则生成网络的状态树,使得每一个分支都是全序集合。在生成状态树的同时搜索每一个分支,对状态采用基于割集的方法进行判断。每个分支上的最小的有效状态就是网络的d-下界点。求得所有的d-下界点,进而求出网络的可靠性。
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.
出处
《通信学报》
EI
CSCD
北大核心
2004年第1期70-77,共8页
Journal on Communications
基金
国防预研基金资助项目
关键词
可靠性
随机流网络
d-下界点
状态树
reliability
stochastic flow network
lower boundary point for d
