Novel binary addition tree algorithm (BAT) for calculating the direct lower-bound of the highly reliable binary-state network reliability

•A new binary-addition tree algorithm (BAT) called the AppBAT is proposed.•A new lower-bound of the network reliability is proposed using the AppBAT.•AppBAT outperforms Monte Carlo Simulations (MCS) and other reliability bound algorithms.•AppBAT can overcome the obstacle of NP-hardness by finding a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Reliability engineering & system safety Jg. 223; S. 108509
Hauptverfasser: Yeh, Wei-Chang, Tan, Shi-Yi, Zhu, Wenbo, Huang, Chia-Ling, Yang, Guang-yi
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Barking Elsevier Ltd 01.07.2022
Elsevier BV
Schlagworte:
Algorithms
Approximate reliability
Binary addition tree algorithm (BAT)
Binary-state network
Bounds
Communication networks
Component reliability
Internet of Things
Layered search algorithm (LSA)
Lower bounds
Network reliability
Reliability analysis
Reliability engineering
Smart grid
Social interactions
Social networks
Social organization
Structural reliability
System reliability
Transportation networks
Wireless networks
Wireless sensor networks
Approximate reliability
Network reliability
Binary addition tree algorithm (BAT)
Layered search algorithm (LSA)
Binary-state network
Bounds
ISSN:0951-8320, 1879-0836
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•A new binary-addition tree algorithm (BAT) called the AppBAT is proposed.•A new lower-bound of the network reliability is proposed using the AppBAT.•AppBAT outperforms Monte Carlo Simulations (MCS) and other reliability bound algorithms.•AppBAT can overcome the obstacle of NP-hardness by finding a good solution.•AppBAT also can be improved by combining MCS-based algorithms. Real-world applications such as the internet of things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems are typically modeled as network structures. Network reliability represents the success probability of a network and it is an effective and popular metric for evaluating the performance of all types of networks. Binary-state networks composed of binary-state (e.g., working or failed) components (arcs and/or nodes) are some of the most popular network structures. The scale of networks has grown dramatically in recent years. For example, social networks have more than a billion users. Additionally, the reliability of components has increased as a result of both mature and emergent technology. For highly reliable networks, it is more practical to calculate approximated reliability, rather than exact reliability, which is an NP-hard problem. Therefore, we propose a novel direct reliability lower bound based on the binary addition tree algorithm called AppBAT to calculate approximate reliability. The efficiency and effectiveness of the proposed reliability bound are analyzed based on time complexity and validated through numerical experiments.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0951-8320
1879-0836
DOI:10.1016/j.ress.2022.108509