构造网络不交化最小路集的一种新算法  

A New Algorithm for Constructing Disjoint Minimal Path Set of Network

作　　者：武小悦[1] 沙基昌[1] 

机构地区：[1]国防科技大学系统工程与数学系,湖南长沙410073

出　　处：《系统工程理论与实践》2000年第1期62-66,共5页Systems Engineering-Theory & Practice

基　　金：国防科技"九五"预研项目

摘　　要：网络系统不交化最小路集的求解是进行网络系统可靠性分析的重要途径.本文以网络计算为基础,根据不交化代数及不交化最小路集的树生成算法提出了一种新的直接求解网络系统不交化最小路集的算法.该算法简便易行,具有分布计算的特点,为大型网络系统的可靠性分析提供了一种新的途径.Constructing disjoint minimal path set is an important approach for reliability analysis of network. In this paper, based on network computation and developed from disjoint algebra and tree constructing algorithm for disjoint minimal path set, is presented a new algorithm for directly constructing disjoint minimal path set. The algorithm is simple and characterized by distributed computing, It provides a new approach for reliability analysis of large scale network system.

关 键 词：网络系统 可靠性 最小路集 算法 

分 类 号：N94[自然科学总论—系统科学] O213.2[理学—概率论与数理统计]