计算多级互联网络可靠度的一个算法  

An Algorithm to Compute the Reliability of Multistage Interconnection Network

作　　者：崔立彦[1] 孙艳蕊[1] 徐美进[2] 

机构地区：[1]东北大学,沈阳110006 [2]辽宁工学院

出　　处：《沈阳电力高等专科学校学报》2000年第2期37-39,共3页Journal of Shenyang Electric Power Institute

摘　　要：利用根有向树给出一个求有效路径的算法，从而得到一个计算多级互联网络可靠度的简捷方法。求网络可靠度时，该算法的计算量和文献[1]中算法相当；而求两终端可靠度时，计算量是文献[1]中算法的2／N倍（这里N是MIN的输入站或输出站的数目）；求K－终端可靠度时，计算量也要比文献[1]中算法小。因此本文算法是一个计算多级互联网络可靠度的一个有效算法。Gives an algorithm to find effective paths by using the rooted directed tree. A simple algorithm tocompute the reliability of multistage interconnection networks is obtained. The computational time of the al－gorithm for network reliability is the same as that of ref. [1],for two terminal re1iability is 2/N times that ofref. [1](where N is the input or output number of MIN), for k－terminal reliability is much smaller than thatof ref. [1]. Therefore, this algorithm is efficient in computing the reliability of multistage inter－connectionnetworks.

关 键 词：网络可靠度 计算机网络 多级互联网络 算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]