RELIABILITY OF DIRECTED NETWORKS USING THE FACTORING THEOREM

被引：42

作者：

PAGE, LB

PERRY, JE

机构：

[1] N CAROLINA STATE UNIV,DEPT MATH,RALEIGH,NC 27695

[2] N CAROLINA STATE UNIV,DEPT COMP SCI,RALEIGH,NC 27695

来源：

IEEE TRANSACTIONS ON RELIABILITY | 1989年 / 38卷 / 05期

关键词：

D O I：

10.1109/24.46479

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：556 / 562

页数：7

共 19 条

[1]

[Anonymous], 1968, PROBABILISTIC RELIAB

[2] A RECURSIVE ALGORITHM FOR COMPUTING EXACT RELIABILITY-MEASURES [J].

BAILEY, MP ;

KULKARNI, VG .

IEEE TRANSACTIONS ON RELIABILITY, 1986, 35 (01) :36-40

[3] COMPUTING NETWORK RELIABILITY [J].

BALL, MO .

OPERATIONS RESEARCH, 1979, 27 (04) :823-838

[4]

BALL MO, 1979, NETWORKS, V10, P153

[5]

BALL MO, MODELING SIMULATION, V17, P1799

[6] A RECURSIVE ALGORITHM FOR FINDING RELIABILITY-MEASURES RELATED TO THE CONNECTION OF NODES IN A GRAPH [J].

BUZACOTT, JA .

NETWORKS, 1980, 10 (04) :311-327

[7] NETWORK RELIABILITY EVALUATION USING PROBABILITY-EXPRESSIONS [J].

DEBANY, WH ;

VARSHNEY, PK ;

HARTMANN, CRP .

IEEE TRANSACTIONS ON RELIABILITY, 1986, 35 (02) :161-166

[8] NEW ANALYSIS TECHNIQUE FOR PROBABILISTIC GRAPHS [J].

DOTSON, WP ;

GOBIEN, JO .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1979, 26 (10) :855-865

[9] BOOLEAN-ALGEBRA METHOD FOR COMPUTING TERMINAL RELIABILITY IN A COMMUNICATION NETWORK [J].

FRATTA, L ;

MONTANARI, UG .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1973, CT20 (03) :203-211

[10]

FRATTA L, 1978, IEEE T COMMUN, V26, P1166, DOI 10.1109/TCOM.1978.1094215

← 1 2 →