scholarly journals Development and Implementation of Measures for Structural and Reliability Importance by Using Minimal Cut Sets and Minimal Path Sets

2012 ◽  
Vol 14 (1) ◽  
pp. 225-233
Author(s):  
Sung-Woon Choi
Keyword(s):  
Minimal Path ◽  
Minimal Cut Sets ◽  
Minimal Cut ◽  
Minimal Path Sets

Two-terminal Reliability Analysis for Time-evolving and Predictable Delay-tolerant Networks

2020 ◽  
Vol 13 (2) ◽  
pp. 236-250
Author(s):  
Gaurav Khanna ◽  
Sanjay K. Chaturvedi ◽  
Sieteng Soh
Keyword(s):  
Network Reliability ◽  
Dynamic Networks ◽  
Dynamic Network ◽  
Delay Tolerant Networks ◽  
Minimal Path ◽  
Minimal Cut Sets ◽  
Minimal Cut ◽  
Terminal Reliability ◽  
Delay Tolerant ◽  
Minimal Path Sets

Background: Several techniques are available to evaluate the two-terminal reliability (2TR) of static networks; however, the advent of dynamic networks in recent past, e.g., Delay Tolerant Networks (DTNs), has made this task extremely challenging due to their peculiar characteristics with an associated disruptive operational environment. Recently, a Cartesian product-based method has been proposed to enumerate time-stamped-minimal path sets (TS-MPS)-a precursor to compute the 2TR of such networks. However, it cannot be used to generate time-stamped-minimal cut sets (TS-MCS). TS-MCS cannot only be used as an alternative to generate 2TR but also to compute other unexplored reliability metrics in DTNs, e.g., the weakest link. Objective: To propose a novel approach to enumerate both TS-MPS and TS-MCS of a dynamic network, thereby computing the 2TR of such networks. Methods: The proposed technique converts the time aggregated graph model of a dynamic network into a Line Graph (LG) while maintaining the time-varying graph’s node reachability information. This LG is used thereafter to generate TS-MCS as well as TS-MPS to compute 2TR of the network. Results: The DTN examples are presented to show the efficacy and salient features of our algorithm to obtain 2TR of such networks. Conclusion: The terminologies and techniques used for studying/analyzing network reliability of static networks can be extended to dynamic networks as well, e.g., the notion of minimal path sets to TS-MPS or minimal cut sets to TS-MCS, to assess their network reliability-a potential area of furthering network reliability research.

ACTIVE REDUNDANCY ALLOCATION FOR COHERENT SYSTEMS WITH INDEPENDENT AND HETEROGENEOUS COMPONENTS

2018 ◽  
Vol 34 (1) ◽  
pp. 72-91 ◽  
Author(s):  
Rui Fang ◽  
Xiaohu Li
Keyword(s):  
Sufficient Conditions ◽  
Coherent Systems ◽  
Minimal Path ◽  
Redundancy Allocation ◽  
Numerical Examples ◽  
Minimal Cut Sets ◽  
Minimal Cut ◽  
Minimal Path Sets ◽  
Theoretical Results

This paper studies the allocation of active redundancies to coherent systems on the context that the base and redundancy components have mutual independent lifetimes. For systems with two symmetric components and systems with one component's minimal cut sets (minimal path sets) covering those of another, we derive sufficient conditions to compare the resultant system lifetimes. Some numerical examples are also presented to illustrate the theoretical results.

scholarly journals A Hierarchical Approach for Fast Calculating Minimal Cut Sets of a Microgrid

2017 ◽  
Vol 2017 ◽  
pp. 1-8
Author(s):  
Yanbo Che ◽  
Yuancheng Zhao ◽  
Jianmei Xu ◽  
Jinhuan Zhou
Keyword(s):  
Reliability Analysis ◽  
Analytical Techniques ◽  
Hierarchical Approach ◽  
Breadth First Search ◽  
Minimal Cut Sets ◽  
Minimal Cut ◽  
Electric Aircraft ◽  
Search Approach ◽  
Minimal Path Sets ◽  
More Electric Aircraft

Minimal cut sets are the basis of reliability analysis using analytical techniques. At the present stage, minimal cut sets are mainly obtained by dealing with minimal path sets, which involves cumbersome steps and slower operational speed. The speed of reliability analysis is limited by that of calculating minimal cut sets. In consideration of the characteristics of microgrid, a hierarchical approach for fast calculating minimal cut sets is proposed in this paper. Firstly, an equivalent principle is proposed to convert topology structure into network node diagram; then grades of nodes are designated based on their original connection and the breadth-first search approach; afterwards, root-leaf matrices and selected matrix are created to specify the direction and order of the search. Next, all possible combinations of minimal cut sets are vertically traversed out by replacing root nodes with leaf nodes to achieve a more rapid access to minimal cut sets. Finally, taking the electrical structure of type A380 more electric aircraft as an example, mainstream methods are compared to show the correctness and advantage of our proposed method.

scholarly journals Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System

2008 ◽  
Vol 4 (2) ◽  
pp. 161-174
Author(s):  
Mohammad Khanjari Sadegh ◽  
Bagher Moghaddaszadeh ◽  
◽  
Keyword(s):  
Minimal Path ◽  
Minimal Path Sets ◽  
F System

scholarly journals Minimal cut sets with time dependencies analysis

2013 ◽  
Vol 17 (2) ◽  
pp. 219
Author(s):  
Paweł Skrobanek
Keyword(s):  
Minimal Cut Sets ◽  
Minimal Cut ◽  
Time Dependencies

Reliability evaluation of circular k-out-of-n: G balanced systems through minimal path sets

2018 ◽  
Vol 180 ◽  
pp. 226-236 ◽  
Author(s):  
Alfonsus Julanto Endharta ◽  
Won Young Yun ◽  
Young Myoung Ko
Keyword(s):  
Reliability Evaluation ◽  
Minimal Path ◽  
Minimal Path Sets
Sign in / Sign up

Export Citation Format

Share Document