IMPLEMENTATION OF A FACTORING ALGORITHM FOR RELIABILITY EVALUATION OF UNDIRECTED NETWORKS

被引：14
|
作者：
RESENDE, LIP
机构：
[1] Univ of California, Berkeley, CA,, USA
来源：
IEEE TRANSACTIONS ON RELIABILITY | 1988年 / 37卷 / 05期
关键词：
Computer Networks--Reliability - Mathematical Techniques--Graph Theory;
D O I：
10.1109/24.9862
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A description is given of a Fortran implementation of a factoring algorithm, LR-F, for reliability evaluation of undirected networks. The algorithm is used in conjunction with PolyChain, a Fortran program for reliability evaluation of undirected networks of a special structure via polygon-to-chain reductions. PolyChain is used as a preprocessor to reduce the size of the network. It places a constraint on the topology of the input network, requiring it to be nonseparable. The present version of PolyChain checks for this condition. In the case of separable networks a code using PolyChain as a subroutine can be used to compute the reliability of each nonseparable component and then the overall reliability of the network. A brief theoretical review of the LR-F factoring algorithm and the design and implementation of the code is presented.
引用
收藏
页码：462 / 468
页数：7
相关论文
共 50 条
12345