A Survey of Some Network Reliability Analysis and Synthesis Results

被引：63

作者：

Boesch, F. T. ^{[1
]}

Satyanarayana, A. ^{[1
]}

Suffel, C. L. ^{[1
]}

机构：

[1] Stevens Inst Technol, Dept Comp Sci, Hoboken, NJ 07030 USA

来源：

NETWORKS | 2009年 / 54卷 / 02期

关键词：

network reliability; invulnerable networks; reliability domination; graph invariant; SPANNING-TREES; RELIABLE NETWORKS; MAXIMUM NUMBER; CONNECTEDNESS RELIABILITY; EDGE-CONNECTIVITY; DOMINATION THEORY; GRAPHS; COMPLEXITY; DESIGN; ALGORITHMS;

D O I：

10.1002/net.20300

中图分类号：

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

学科分类号：

0812 ;

摘要：

The purpose of this article is to introduce several results concerning the analysis and synthesis of reliable or invulnerable networks. First, the notion of signed reliability domination of systems is described and some applications to reliability analysis are reviewed. Then the analysis problem is considered and a brief summary of the difficulty of calculating various reliability measures is presented. Some relevant concepts in the synthesis of a most reliable network are studied. The article concludes with an introduction to a non-probabilistic approach to evaluate the vulnerability of a network. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 54(2), 99-107 2009

引用

页码：99 / 107

页数：9

共 58 条

[1] COMPUTING 2-TERMINAL RELIABILITY FOR RADIO-BROADCAST NETWORKS [J].

ABOELFOTOH, HM ;

COLBOURN, CJ .

IEEE TRANSACTIONS ON RELIABILITY, 1989, 38 (05) :538-555

[2] A SURVEY OF NETWORK RELIABILITY AND DOMINATION THEORY [J].

AGRAWAL, A ;

BARLOW, RE .

OPERATIONS RESEARCH, 1984, 32 (03) :478-492

[3] LINEAR TIME ALGORITHMS FOR NP-HARD PROBLEMS RESTRICTED TO PARTIAL K-TREES [J].

ARNBORG, S ;

PROSKUROWSKI, A .

DISCRETE APPLIED MATHEMATICS, 1989, 23 (01) :11-24

[4]

BAGGA K, 1988, C NUMERANTIUM, V66, P293

[5]

Bagga K.S., 1987, C NUMER, V60, P141

[6]

Barefoot CA, 1987, J. Combin. Math. Combin. Comput., V1, P13

[7] Toughness in graphs - A survey [J].

Bauer, D ;

Broersma, H ;

Schmeichel, E .

GRAPHS AND COMBINATORICS, 2006, 22 (01) :1-35

[8] ON THE VALIDITY OF A REDUCTION OF RELIABLE NETWORK DESIGN TO A GRAPH EXTREMAL PROBLEM [J].

BAUER, D ;

BOESCH, FT ;

SUFFEL, C ;

VANSLYKE, R .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1987, 34 (12) :1579-1581

[9] COMBINATORIAL OPTIMIZATION PROBLEMS IN THE ANALYSIS AND DESIGN OF PROBABILISTIC NETWORKS [J].

BAUER, D ;

BOESCH, F ;

SUFFEL, C ;

TINDELL, R .

NETWORKS, 1985, 15 (02) :257-271

[10]

BEINEKE L, 1991, P 6 INT C THEOR APPL, P159

← 1 2 3 4 5 6 →