大型网络的SKT可靠性的分散计算法  

Using Decomposition Method to Calculate SKT Reliability of Large-scale Network

作　　者：王芳[1] 侯朝桢[1] 

机构地区：[1]北京理工大学自动控制系,北京100081

出　　处：《计算机工程》2003年第18期18-19,156,共3页Computer Engineering

基　　金：国防预研基金项目

摘　　要：提出了一种基于分解法的计算大型网络从源点到特定节点集K(即SKT)可靠性的算法。按照一定的分解规则将大型网络划分为若干较小规模的子网络，从而最终将枚举原网络的K树这一复杂问题转化为计算这些子网络的最小路。对求得的K树进行不交化运算，最终得到网络的SKT可靠性。In this article, an algorithm to solve SKT reliability of large-scale networks based on decomposition method is put forward. The complex problem of enumerating K-trees of the original network is changed into calculating minimal paths of several subnets by means of dividing large network into some small subnets according to certain decomposition rules. All the K-trees are disjointed in order to get the SKT reliability of network .

关 键 词：SKT可靠性 分解法 不交化 网络可靠性 

分 类 号：TP302.7[自动化与计算机技术—计算机系统结构]