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.

scholarly journals NP-Hardness of Some Linear Control Design Problems

1997 ◽  
Vol 35 (6) ◽  
pp. 2118-2127 ◽  
Author(s):  
Vincent Blondel ◽  
John N. Tsitsiklis
Keyword(s):  
Control Design ◽  
Linear Control ◽  
Design Problems ◽  
Np Hardness

Network System Reliability and Unit Probability Importance Based on Monte Carlo Method

2014 ◽  
Vol 1049-1050 ◽  
pp. 1458-1462
Author(s):  
Rao Bin
Keyword(s):  
Reliability Analysis ◽  
System Reliability ◽  
Network Reliability ◽  
Approximate Algorithm ◽  
Network System ◽  
Reliability Design ◽  
Precise Calculation ◽  
Improve Calculation ◽  
Factor Decomposition ◽  
State Enumeration

The network system reliability research contains a number of problems, such as: Reliability analysis and reliability design, reliability, maintenance and a lot of problems so on. The calculation of reliability of the network is the important area of network reliability analysis, State enumeration method and principle of a class, don't pay the product and method, the factor decomposition method is a classic accurate algorithm of computing network reliability. Due to the difficulty of precise calculation, in the method, appeared and bound method, Monte carol method, the reliability of the approximate algorithm. Compared with the accurate algorithm, approximate algorithm is still under development. So far, no recognized classic algorithms, so the method to improve calculation accuracy, reduce the complexity of the target of the researchers.

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>

The Evaluation of Communication Network Reliability Based on Markov Process

2014 ◽  
Vol 602-605 ◽  
pp. 3367-3370
Author(s):  
Li Min Cui ◽  
Yun Na Wu
Keyword(s):  
Failure Rate ◽  
Communication System ◽  
System Reliability ◽  
General Model ◽  
Evaluation System ◽  
Network Reliability ◽  
Repair Rate ◽  
System A ◽  
Markov Repairable System ◽  
Typical Design

This paper introduces the general model of Markov repairable system, combined with the typical design of 750kV substation communication system, put forward the Markov general model for 750kV substation communication system, a communication system reliability evaluation system based on the state of the equipment. Sensitivity analysis of the equipment failure rate and repair rate parameters on the system reliability, the failure rate and repair rate impact on system reliability, to develop communication system state maintenance, and provide a method to improve the reliability of system.

Exploiting structural similarity in network reliability analysis using graph learning

2021 ◽  
pp. 1748006X2110093
Author(s):  
Ping Zhang ◽  
Min Xie ◽  
Xiaoyan Zhu
Keyword(s):  
Large Scale ◽  
System Analysis ◽  
Network Reliability ◽  
Computational Cost ◽  
Structural Similarity ◽  
Learning Approach ◽  
Network System ◽  
Network Systems ◽  
Graph Learning ◽  
Significance Levels

Considering the large-scale networks that can represent construction of components in a unit, a transportation system, a supply chain, a social network system, and so on, some nodes have similar topological structures and thus play similar roles in the network and system analysis, usually complicating the analysis and resulting in considerable duplicated computations. In this paper, we present a graph learning approach to define and identify structural similarity between the nodes in a network or the components in a network system. Based on the structural similarity, we investigate component clustering at various significance levels that represent different extents of similarity. We further specify a spectral-graph-wavelet based graph learning method to measure the structural similarity and present its application in easing computation load of evaluating system survival signature and system reliability. The numerical examples and the application show the insights of structural similarity and effectiveness of the graph learning approach. Finally, we discuss potential applications of the graph-learning based structural similarity and conclude that the proposed structural similarity, component clustering, and graph learning approach are effective in simplifying the complexity of the network systems and reducing the computational cost for complex network analysis.

A Network Reliability Approach to Optimal Decomposition of Design Problems

1994 ◽  
Author(s):  
Nestor F. Michelena ◽  
Panos Y. Papalambros
Keyword(s):  
Design Problem ◽  
Network Reliability ◽  
Network Connectivity ◽  
Master Problem ◽  
Design Problems ◽  
Decomposition Problem ◽  
Design Variables ◽  
Communication Links ◽  
Two Measures ◽  
Mathematical Programming Problems

Abstract This article addresses the problem of identifying the optimal decomposition of a design problem. Methods for solving decomposed mathematical programming problems require that an appropriate structure suitable for decomposition be identified. This first step consists of identifying linking (or coordinating) variables or functions that effect independent subproblems coordinated by a master problem. We present a network reliability-based solution of the optimal decomposition problem that avoids heuristics and subjective criteria for the identification of linking variables and evaluation of partitions. The relationships among design variables, i.e., the constraint functions, are modeled as the processing units of a network. The design variables themselves are modeled as the communication links between these units. The optimal decomposition problem is then reduced to one of finding the links that have the most effect on the overall network connectivity. Two measures of network reliability, all-terminal and pair-connected reliability, are used as measures of network (and design problem) connectivity. The optimal decomposition is attained by minimizing the network reliability while maximizing the number of operating links.

Research on Construction Reliability Calculation Method of Engineering Project

2014 ◽  
Vol 912-914 ◽  
pp. 1690-1694 ◽  
Author(s):  
Yu Fang Shi ◽  
Xiu Fen Wang
Keyword(s):  
Calculation Method ◽  
System Reliability ◽  
Network Reliability ◽  
Reliability Theory ◽  
International Management ◽  
Engineering Project ◽  
Engineering Research ◽  
Engineering Project Management ◽  
Reliability Calculation ◽  
Objective System

System reliability theory is becoming a focus of international management science and system engineering research, though specific studies are still at a starting stage in the field of engineering project management. According to objective system of engineering project, the connotation of construction reliability is defined and based on principle of network reliability, a method of disjointed minimal paths set is proposed and the symbol expression formula is given to calculate construction reliability. This method is proved efficient and accurate by an example and useful try on theory and method research of engineering project system reliability is made.

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.

Sign in / Sign up

Export Citation Format

Share Document