An Efficient Method for Reliability Evaluation of a General Network

Rai, Suresh; Aggarwal, K. K.

doi:10.1109/tr.1978.5220325

Cited by 104 publications

(26 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Meyer [10] studied robustness in the context of his performability framework [11], whilst Cholda et al [12] surveyed various robustness frameworks. In previous research [13][14][15], maintenance of connectivity under failure has typically been used to characterize network robustness. Connectivity has been studied from a probabilistic point of view in the context of graph percolation [16,17] and reliability polynomials [18].…”

Section: Related Workmentioning

confidence: 99%

Robustness envelopes of networks

Trajanovski

Martı́n-Hernández

Winterbach

et al. 2013

Journal of Complex Networks

View full text Add to dashboard Cite

We study the robustness of networks under node removal, considering random node failure, as well as targeted node attacks based on network centrality measures. Whilst both of these have been studied in the literature, existing approaches tend to study random failure in terms of average-case behavior, giving no idea of how badly network performance can degrade purely by chance. Instead of considering average network performance under random failure, we compute approximate network performance probability density functions as functions of the fraction of nodes removed. We find that targeted attacks based on centrality measures give a good indication of the worst-case behavior of a network. We show that many centrality measures produce similar targeted attacks and that a combination of degree centrality and eigenvector centrality may be enough to evaluate worst-case behavior of networks. Finally, we study the robustness envelope and targeted attack responses of networks that are rewired to have high-and lowdegree assortativities, discovering that moderate assortativity increases confer more robustness against targeted attacks whilst moderate decreases confer more robustness against random uniform attacks.

show abstract

Section: Related Workmentioning

confidence: 99%

Robustness envelopes of networks

Trajanovski

Martı́n-Hernández

Winterbach

et al. 2013

Journal of Complex Networks

View full text Add to dashboard Cite

show abstract

“…Initially, such studies investigated connectivity after failures [11][12][13], using common theoretical [14] and empirical methodologies. The robustness of power-law networks has been studied [4,15,16], as they accurately model real world examples, such as World Wide Web [17].…”

Section: Introductionmentioning

confidence: 99%

Error and attack vulnerability of temporal networks

2012

View full text Add to dashboard Cite

The study of real-world communication systems via complex network models has greatly expanded our understanding on how information flows, even in completely decentralized architectures such as mobile wireless networks. Nonetheless, static network models cannot capture the time-varying aspects and, therefore, various temporal metrics have been introduced. In this paper, we investigate the robustness of time-varying networks under various failures and intelligent attacks. We adopt a methodology to evaluate the impact of such events on the network connectivity by employing temporal metrics in order to select and remove nodes based on how critical they are considered for the network. We also define the temporal robustness range, a new metric that quantifies the disruption caused by an attack strategy to a given temporal network. Our results show that in real-world networks, where some nodes are more dominant than others, temporal connectivity is significantly more affected by intelligent attacks than by random failures. Moreover, different intelligent attack strategies have a similar effect on the robustness: even small subsets of highly connected nodes act as a bottleneck in the temporal information flow, becoming critical weak points of the entire system. Additionally, the same nodes are the most important across a range of different importance metrics, expressing the correlation between highly connected nodes and those that trigger most of the changes in the optimal information spreading. Contrarily, we show that in randomly generated networks, where all the nodes have similar properties, random errors and intelligent attacks exhibit similar behavior. These conclusions may help us in design of more robust systems and fault-tolerant network architectures.

show abstract

“…In order to improve the computational efficiency, it is necessary to deal with minimal cut sets by disjointing. The Method of Delete-Leave proposed by Aggarwal [12] is adopted, of which the basic idea is to the disjoint minimal cut sets by adding variables.…”

Section: Calculation Of Disjointed Minimal Cut Setsmentioning

confidence: 99%

Minimal Cut Sets-Based Reliability Evaluation of the More Electric Aircraft Power System

Zhao

Che

Lin

et al. 2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The More Electric Aircraft (MEA) stands for the direction of aviation development in the new era, and the reliability of power systems on the MEA has attracted widespread attention. Based on the characteristics of MEA power systems, an equivalent method of electrical topology structure is presented in this article, and evaluation method is proposed which shows the reliability of the overall system with the reliability of specific nodes. Firstly, electrical topology structure of a MEA power system is converted into a network node diagram according to the proposed equivalent method. Then, the minimal path sets of specific nodes are obtained by the adjacent matrix algorithm, and the low-order minimal cut sets of disjointed are obtained. After that, the actual failure rate of components is converted to node failure rate, and the reliability of the overall system is evaluated by operational reliability indexes of specific nodes. Finally, taking the MEA A380 as an example, this paper compares and analyzes the reliability of AC loads, DC loads, and key loads to verify the validity and feasibility of the proposed evaluation method. This evaluation system can predict the weak points existing in the MEA power system, as well as providing theoretical support for maintenance schedule.

show abstract

An Efficient Method for Reliability Evaluation of a General Network

Cited by 104 publications

References 9 publications

Robustness envelopes of networks

Robustness envelopes of networks

Error and attack vulnerability of temporal networks

Minimal Cut Sets-Based Reliability Evaluation of the More Electric Aircraft Power System

Contact Info

Product

Resources

About