Abstract:
The problem of radio-communication networks (RCN) reliability with 2 terminal is considered. The paper presents new concepts of the simplest path(SP) and the simplest path rooted directed tree(SPRT), introduces an algorithm looking for SPRT and computing 2-terminal reliability of RCN.
摘要: 提出了无线通信网络(RCN)的2-终点可靠性问题。给出了最简路(SP)和最简路有序根树(SPRT)的概念,介绍了一个找出最简路有序根树和计算RCN2-终点可靠性的有效算法。
关键词:
算法,
可靠性,
无线通信网络
CLC Number:
GAO Fei,WANG Guangxing. An Algorithm for Computing RCN Reliability with 2 Terminal[J]. , 2004, 30(03): 38-.
高飞,王光兴. 一种计算RCN2-终点可靠性的算法[J]. , 2004, 30(03): 38-.