An Algorithm for Computing All-terminal Reliability Bounds

被引：0

作者：

Silva, Jaime ^{[1
,2
]}

Gomes, Teresa ^{[3
,4
]}

Tipper, David ^{[5
]}

Martins, Lucia ^{[3
,4
]}

Kounev, Velin ^{[5
]}

机构：

[1] Univ Coimbra, Dept Informat Engn, CISUC, Polo 2, P-3030290 Coimbra, Portugal

[2] Univ Coimbra, Dept Phys, CFC, P-3004516 Coimbra, Portugal

[3] Univ Coimbra, Dept Elect & Comp Engn, P-3030290 Coimbra, Portugal

[4] INESC Coimbra, P-3000033 Coimbra, Portugal

[5] Univ Pittsburgh, Grad Telecommun & Networking Program, Pittsburgh, PA 15260 USA

来源：

2014 6TH INTERNATIONAL WORKSHOP ON RELIABLE NETWORKS DESIGN AND MODELING (RNDM) | 2014年

关键词：

All-terminal network reliability; Bonferroni bounds; Network availability; Network reduction; IMPROVED ABRAHAM-METHOD; MINIMIZING ALGORITHM; DISJOINT PRODUCTS; SUM; COMPLEXITY;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The exact calculation of all-terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all-terminal reliability have been utilized. We propose using an ordered subset of the mincuts and an ordered subset of minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The advantage of the proposed approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The performance of the algorithm is compared with the first two Bonferroni bounds, for networks where all mincuts could be calculated. The results show that the proposed approach is computationally feasible and reasonably accurate. Thus allowing one to obtain bounds when it not possible to enumerate all mincuts or all minpaths.

引用

页码：76 / 83

页数：8

共 50 条

[41] Algorithm for computing RCN reliability with 2 terminal
Gao, Fei
Wang, Guangxing
Jisuanji Gongcheng/Computer Engineering, 2004, 30 (03):
[42] All-terminal reliability analysis of the SRP-RING: The effect of enhanced intelligent protection switching
Qian, M
Logothetis, D
Trivedi, KS
ELEVENTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2002, : 52 - 57
[43] Poster: Exact All-terminal Reliability Analysis of Bounded-degree Networks with Tutte Polynomials
Park, Jae-Hyun
SENSYS'15: PROCEEDINGS OF THE 13TH ACM CONFERENCE ON EMBEDDED NETWORKED SENSOR SYSTEMS, 2015, : 383 - 384
[44] An Simple Enumeration of All Minimal Cutsets of an All-Terminal Graph
Zhang Hongfen(Shijiazhuang Postal College
The Journal of China Universities of Posts and Telecommunications, 1995, (02) : 78 - 80
[45] All-terminal reliability of multi-AUV cooperative systems in horizontally stratified SOFAR channel
Liang, Qingwei
Ou, Junlin
Xue, Zengxi
SHIPS AND OFFSHORE STRUCTURES, 2020, 15 (05) : 474 - 478
[46] An Approximate All-Terminal Reliability Evaluation method for Large-Scale Smart Grid Communication Systems
Jin, Wenjun
Yu, Peng
Xiong, Ao
Zhang, Qiang
Jin, Dan
Zhang, Geng
Wang, Yang
NOMS 2018 - 2018 IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM, 2018,
[47] A deep neural network and Bayesian method based framework for all-terminal network reliability estimation considering degradation
Davila-Frias A.
Yodo N.
Le T.
Yadav O.P.
Reliability Engineering and System Safety, 2023, 229
[48] Network topologies for achieving maximal all-terminal network availability
Krajnovic, N.
2016 24TH TELECOMMUNICATIONS FORUM (TELFOR), 2016, : 65 - 69
[49] An algorithm for lower reliability bounds of multistate two-terminal networks
Satitsatian, Sarintip
Kapur, Kailash C.
IEEE TRANSACTIONS ON RELIABILITY, 2006, 55 (02) : 199 - 206
[50] AN O(N.LOG(N)) ALGORITHM TO COMPUTE THE ALL-TERMINAL RELIABILITY OF (K(5), K(2),2,2) FREE NETWORKS
POLITOF, T
SATYANARAYANA, A
TUNG, L
IEEE TRANSACTIONS ON RELIABILITY, 1992, 41 (04) : 512 - 517

← 1 2 3 4 5 →