scholarly journals A Minimal Path-Based Method for Computing Multistate Network Reliability

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Xiu-Zhen Xu ◽  
Yi-Feng Niu ◽  
Can He
Keyword(s):  
Network Reliability ◽  
Network Capacity ◽  
Capacity Constraints ◽  
Minimal Path ◽  
Safe Operation ◽  
Effective Technique ◽  
Minimal Paths ◽  
Terminal Reliability ◽  
Solution Efficiency ◽  
Improved Model

Most of modern technological networks that can perform their tasks with various distinctive levels of efficiency are multistate networks, and reliability is a fundamental attribute for their safe operation and optimal improvement. For a multistate network, the two-terminal reliability at demand level d, defined as the probability that the network capacity is greater than or equal to a demand of d units, can be calculated in terms of multistate minimal paths, called d-minimal paths (d-MPs) for short. This paper presents an efficient algorithm to find all d-MPs for the multistate two-terminal reliability problem. To advance the solution efficiency of d-MPs, an improved model is developed by redefining capacity constraints of network components and minimal paths (MPs). Furthermore, an effective technique is proposed to remove duplicate d-MPs that are generated multiple times during solution. A simple example is provided to demonstrate the proposed algorithm step by step. In addition, through computational experiments conducted on benchmark networks, it is found that the proposed algorithm is more efficient.

scholarly journals Performance Assessment of a Freight Network with Stochastic Capacities

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Xiu-Zhen Xu ◽  
Yi-Feng Niu ◽  
Qing Li
Keyword(s):  
Performance Assessment ◽  
Network Reliability ◽  
Distribution Center ◽  
Operational Performance ◽  
Practical Case ◽  
Minimal Path ◽  
Minimal Paths ◽  
Capacity Bounds ◽  
Commodity Demand ◽  
Improved Model

This paper focuses on performance assessment of a freight network with stochastic capacities by using reliability analysis, in which a node denotes a supplier, a transfer center, a distribution center, or a market, while an arc denotes a logistics service provider offering the freight traffic service for a pair of nodes. Due to some uncertainties in real environment (for example, a proportion of vehicles owned by the provider may be reserved by other customers), the available capacity of the provider along each arc is stochastic. Thus, network reliability that at least d units of commodity demand can be successfully delivered from the source to the destination denotes the operational performance of such a freight network. A d-minimal path–based method is developed to evaluate the freight network reliability. To advance the efficiency of solving d-minimal paths, an improved model is established by redefining capacity bounds of arcs and minimal paths. Furthermore, a new concept of expected capacity grounded on network reliability is presented to measure the service performance of the freight network. A practical case related to the coal delivery network is studied to demonstrate the implications of both network reliability and expected capacity.

Design and Reliability Evaluation of Gamma-Minus Interconnection Network

2019 ◽  
Vol 26 (01) ◽  
pp. 1950003 ◽  
Author(s):  
S. Gupta ◽  
G. L. Pahuja
Keyword(s):  
Interconnection Network ◽  
Network Reliability ◽  
Network Size ◽  
Potential Candidate ◽  
Minimal Path ◽  
Reliability Indices ◽  
Terminal Reliability ◽  
Complexity Cost ◽  
Work Done ◽  
Improve Reliability

Gamma Interconnection Network (GIN) is characterized as Redundant Multistage Interconnection Network (MIN) which is considered as a potential candidate for use in broadband communications. Several advancements have been made to improve Reliability indices such as Terminal Reliability (TR), Broadcast Reliability (BR) and Network Reliability (NR) of these networks. But inspite of these advancements, there are certain issues which are yet to be explored such as Complexity, Cost, Number of disjoint paths on presumption that source/destination are failure free. Most of the work done in the literature addresses TR only and less work has been done on analysis of BR and NR. In literature networks, [Formula: see text] size has been explored and no attention has been paid to bigger network sizes although reliability of bigger size network is important for parallel processing systems. In this paper, existing class of Gamma Networks has been studied extensively and modifications have been proposed in existing Gamma Network which minimizes or resolves most of the limitations mentioned above. The proposed Gamma-Minus Network has more redundant paths than other networks. Proposed Network has been compared with some recently introduced members of this class. The results show that newly proposed Gamma-Minus Network has better reliability with lowest cost and path length and provides disjoint minimal-path set for [Formula: see text] to [Formula: see text] network size. The routing used in this paper eliminates the backtracking overhead which minimizes transmission delay.

scholarly journals Efficient Enumeration of d-Minimal Paths in Reliability Evaluation of Multistate Networks

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Xiu-Zhen Xu ◽  
Yi-Feng Niu ◽  
Qing Li
Keyword(s):  
State Vector ◽  
Power Transmission ◽  
Network Reliability ◽  
Search Space ◽  
Reliability Evaluation ◽  
Network Capacity ◽  
Necessary Condition ◽  
Enumeration Algorithm ◽  
Minimal Paths ◽  
Capacity Level

A number of real-world complex networks can be modeled as multistate networks for performance analysis. A multistate network consists of multistate components and possesses multiple different performance levels. For such a network, reliability is concerned with the probability of the network capacity level greater than or equal to a predetermined demand level d. One major method for multistate network reliability evaluation is using d-minimal paths. This paper proposes an efficient algorithm to find d-minimal paths. First, a new concept of qualified state vector is defined so as to fix a relatively smaller search space of d-minimal paths, and a sufficient and necessary condition for a qualified state vector to be d-minimal path is established. Then, the max-flow algorithm and the enumeration algorithm are integrated to search for d-minimal paths in the determined search space that is recursively divided into subspaces such that the searching efficiency can be increased as much as possible. Both analytical and numerical results show that the proposed algorithm is more efficient in finding all d-minimal paths. In addition, a case study related to power transmission network is performed to demonstrate the implication of network reliability.

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.

scholarly journals Reliability Measurement in A Multi-path Transmission Network using SMP-BP Algorithm

2019 ◽  
Vol 15 (11) ◽  
pp. 16
Author(s):  
Xiaoling Li ◽  
Xinwei Zhou
Keyword(s):  
Data Transmission ◽  
Data Security ◽  
Network Reliability ◽  
Transmission Network ◽  
Network Resources ◽  
Minimal Path ◽  
Transmission Networks ◽  
Backup Path ◽  
Efficient Data ◽  
Reliability Measurement

Data security is very important in the multi-path transmission networks (MTN). Efficient data security measurement in MTN is crucial so as to ensure the reliability of data transmission. To this end, this paper presents an improved algorithm using single-single minimal path based back-up path (SSMP-BP), which is designed to ensure the data transmission when the second path is out of work. From the simulation study, the proposed algorithm has the better network reliability compared with existing double minimal path based backup path (DMP-BP) approach. It could be found that, the proposed algorithm uses less back-up paths compared with DMP-BP so that less network resources like nodes are achieved.

scholarly journals Hybrid algorithm for two-terminal reliability evaluation in communication networks

2021 ◽  
Vol 21 (2) ◽  
pp. 1185
Author(s):  
Musaria Karim Mahmood ◽  
Osman Ucan ◽  
Zahraa Zaidan ◽  
Sulaiman M. Karim
Keyword(s):  
Communication Networks ◽  
Network Reliability ◽  
Computing Time ◽  
Reliability Evaluation ◽  
Design Stage ◽  
Hybrid Technique ◽  
Reduction Techniques ◽  
Node Network ◽  
Evaluation Problem ◽  
Terminal Reliability

<span>Network reliability is valuable in establishing a survivable communication network. Reliability evaluation algorithms are used in the design stage and during the network deployment. This work presents a new multistage hybrid technique for two-terminal reliability evaluation problem. It is based on a combination of graph reduction techniques and tie-set method. A new approach has been introduced for deducing tie-sets in a network containing both unidirectional and bi-directional edges. The proposed algorithm can be applied for both simple and complex networks without restrictions. The results confirm that new algorithm evaluates network's reliability with decreasing computing time compared to classical algorithms. The results for a case study of a 20-node network have demonstrated that the required time for reliability evaluation is decreased from (t&gt;1 hour) in the case of using a classical algorithm, to (t&lt;1 second) for the new algorithm.</span>

Distribution Network Reliability Calculation Base on Improved Minimal Path Method

2014 ◽  
Vol 521 ◽  
pp. 502-507
Author(s):  
Jun Liu ◽  
Jian Su ◽  
Kang Ma ◽  
Hai Tao Liu ◽  
Tao Wei
Keyword(s):  
Network Reliability ◽  
Distribution Network ◽  
Reliability Assessment ◽  
General Purpose ◽  
Minimal Path ◽  
Reliability Calculation ◽  
Core Function ◽  
Function Modules ◽  
Distribution Network Planning ◽  
Minimal Path Method

Distribution network reliability calculation is an important function for distribution network planning and operating system software. It is also one of the earliest core function modules for distribution network calculating. This paper investigates into general-purpose distribution network reliability assessment technique. The paper improves the minimal path method for reliability assessment and solves the precision problem using general-purpose minimal path technique; the paper demonstrates an example to verify the validity of this method.

EFFICIENT COMPUTATION OF NETWORK RELIABILITY IMPORTANCE ON K-TERMINAL RELIABILITY

2005 ◽  
Vol 12 (03) ◽  
pp. 213-226 ◽  
Author(s):  
TAKESHI KOIDE ◽  
SHUICHI SHINMORI ◽  
HIROAKI ISHII
Keyword(s):  
System Reliability ◽  
Network Reliability ◽  
Quantitative Measure ◽  
System Component ◽  
Efficient Computation ◽  
Network Systems ◽  
Design Problems ◽  
Terminal Reliability ◽  
Np Hardness ◽  
Marginal Reliability

This paper proposes an algorithm to compute marginal reliability importance for network systems with k-terminal reliability efficiently. Marginal reliability importance is an appropriate quantitative measure on a system component against system reliability and it contributes to design of reliable systems. Computing marginal reliability importance in network systems is time-consuming due to its NP-hardness. This paper extends the algorithm proposed in our last study to deal with k-terminal reliability and incorporates an extended factoring theorem to improve the algorithm. Numerical experiments compare the proposed algorithm with a traditional method to reveal efficiency of the algorithm. The algorithm helps to construct efficient algorithm to reliable network design problems.

Increasing U.S. Freight Rail Network Capacity With ECP Braking and PTC Systems

2007 ◽  
Author(s):  
Robert C. Kull
Keyword(s):  
Network Capacity ◽  
Capacity Constraints ◽  
Traffic Density ◽  
Rail Freight ◽  
Rail Network ◽  
Train Control ◽  
Positive Train Control ◽  
Close Cooperation ◽  
Double Track ◽  
Industry Needs

Growth in U.S. rail freight demand, especially for intermodal and coal, is leading to capacity constraints on key corridors. The costs of building new rail lines are often prohibitive, and the industry needs to find other solutions for increasing capacity. Electronically Controlled Pneumatic (ECP) braking combined with new Positive Train Control (PTC) systems have the potential to double the traffic density on existing double-track rail corridors, as well as increase average network speeds. This has the potential to support the projected increase in rail traffic over the next 20 years, without needing significant additions to track infrastructure. Implementation of ECP and PTC is challenging, and will require close cooperation between railroads, car owners, shippers, railroad suppliers, and the Federal Railroad Administration (FRA).

Quantitative Analysis on Ventilation Network Reliability Assessments

2011 ◽  
Vol 94-96 ◽  
pp. 1894-1897
Author(s):  
Hong De Wang ◽  
Hua Li Mi
Keyword(s):  
Quantitative Analysis ◽  
Network Flow ◽  
Network Reliability ◽  
Deep Level ◽  
Likelihood Estimation ◽  
Ventilation Network ◽  
Minimal Path ◽  
Distribution Rules ◽  
Reliability Assessments ◽  
Variation Trends

In order to prevent the hazards of rock burst and the spontaneous fire in deep-level mine and ensure that the ventilation run safely and reliably, the variation trends and the distribution rules of the air flow in deep-level mine are analyzed. Based on the network flow theory and statistics principle, the density equations of the air quantities in the airways are established. With the maximum likelihood estimation (MLE), the rationality of the parameters in the air quantities distribution equations is verified. By means of the disjoint minimal path set algorithm, the reliability assessment models of mine ventilation network are founded. All the calculation processes are realized in the environment of MATLAB. The results indicate that the indexes of the quantitative analysis reflect the practical situation of the ventilation network in Daliuta coal mine.

Sign in / Sign up

Export Citation Format

Share Document