摘要
通信网的可靠性不仅与网内节点、支路可靠性和网的拓朴结构有关，还与容量有关。只有在保证一定容量的信息（ｗｍｉｎ）通过网络从源节点送到终节点时，才能认为网络是有效和可靠的。在本文中，我们给出了２种考虑了容量的通信网可靠性的算法：卡诺图法和复合路由法。
The reliability of telecommunication network not only related to the node, link and topology of network, but also related to the capacity of network. The network is good if and only if a specified amount of information capacity (wmin) can be transmitted from the input to the output. Two algorithms, Karnaugh map and composite paths, both of which can solve the problem of reliability related to capacity, are presented.
出处
《南京邮电学院学报》
北大核心
1995年第1期1-5,共5页
Journal of Nanjing University of Posts and Telecommunications(Natural Science)
关键词
通信网
可靠性
算法
卡诺图
拓扑结构
telecommunication network, reliability, algorithm, Karnaugh map, composite paths
