Parallel algorithms for terminal-pair reliability

Deo, Narsingh; Medidi, Muralidhar

doi:10.1109/24.257782

Cited by 30 publications

(12 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is a tree-based partitioning algorithm where all success/failure events of an event tree are incrementally collected. Reduction techniques can be applied to improve this approach [8], [9]. However, it takes prohibitively a huge amount of memory to store success/failure events for larger graph sizes.…”

Section: Introductionmentioning

confidence: 99%

Improving the Kuo-Lu-Yeh Algorithm for Assessing Two-Terminal Reliability

Lê¹,

Walter

Weidendorfer³

2014

2014 Tenth European Dependable Computing Conference

View full text Add to dashboard Cite

Currently, the most efficient approach for solving the NP-hard terminal-pair reliability problem is the Kuo-Lu-Yeh algorithm which applies the technique of Edge Expansion Diagram (EED) coupled with Ordered Binary Decision Diagram (OBDD). In this work we will show that this algorithm can be enhanced significantly by removing redundant biconnected components, which can be done in linear time and without needing additional memory. We empirically evaluated our approach against the original one by means of 24 benchmark networks. In addition, we examined our approach statistically using randomly generated graphs. Our new approach performs significantly better regarding runtime and memory consumption for most of the benchmark networks. For a regular 3x20 grid network we have even achieved a speedup of 464 and the memory consumption goes down to 0.3 percent. Thus, in practice, runtime and memory consumptions are drastically reduced for many "difficult" networks. When applied to networks without redundant biconnected components, there is no memory overhead and the additional runtime is negligible.

show abstract

Section: Introductionmentioning

confidence: 99%

Improving the Kuo-Lu-Yeh Algorithm for Assessing Two-Terminal Reliability

Lê¹,

Walter

Weidendorfer³

2014

2014 Tenth European Dependable Computing Conference

View full text Add to dashboard Cite

show abstract

“…Edge e is considered as a keystone edge or the pivot. The edge pivot cannot be chosen arbitrarily [2]. For that, several techniques have been proposed in the literature [3] [12].…”

Section: G V Ementioning

confidence: 99%

“…Several of them are called enumeration algorithms [2]- [12], summation of disjoint products [5] [8] [13], transformations of star-delta and delta-star structures [14], factoring & Reduction techniques [11] [14]- [22], binary decision diagrams methods [6] [7] [18] [23] [24], Bayesian models [25], etc. Simulation and approximating procedures have been used when the problem is tedious or when the exact value of the reliability is not necessary required [12] [26].…”

Section: Introductionmentioning

confidence: 99%

System Reliability Evaluation for Imperfect Networks Using Polygon-to-Chain Reduction

Rebaiaia¹,

Ait-Kadi²

2017

AJOR

View full text Add to dashboard Cite

The purpose of this paper is to propose a computational technique for evaluating the reliability of networks subject to stochastic failures. In this computation, a mathematical model is provided using a technique which incorporates the effect of the factoring decomposition theorem using polygonto-chain and series-parallel reductions. The algorithm proceeds by identifying iteratively one of seven polygons and when it is discovered, the polygon is immediately removed and replaced by a simple chain after having changed the individual values of the reliability of each edge and each node of the polygon. Theoretically, the mathematical development follows the results presented by Satyanarayana & Wood and Theologou & Carlier. The computation process is recursively performed and less constrained in term of execution time and memory space, and generates an exact value of the reliability.

show abstract

“…Although space limitations preclude reporting every test case, the results were excellent. Test Network A depicted in figure 1, for example, was introduced by Yo0 and Deo in [ 161 and was also analyzed by Deo and Medidi in [3]. Using node 15 as the source node and node 16 as the terminal node, Yo0 and Deo found that the exact s-t reliability for this network is 0.9972 for a uniform link reliability of 0.9.…”

Section: Network Design Algorithm Application and Numerical Resultsmentioning

confidence: 99%

A quadratic-time heuristic method for reliable network design with arbitrary traffic loads

Belovich¹

Proceedings International Phoenix Conference on Computers and Communications

View full text Add to dashboard Cite

The goal of a reliable network is to ensure that all transmitted messages arrive at their intended destinations uncorrupted. Most network design techniques concem themselves with channel capacity allocation and cost constraints and ignore reliability analysis. Conversely, network reliability analysis methods focus on connectivity and ignore traffic loads and channel capacities. This paper presents a design strategy to enhance the reliability of an existing network by modifying its topology. This method takes into account traffic distributions. A new reliability metric is introduced which is the probability that all transmitted messages arrive at their intended destinations under the given traffic distribution. The design strategy adds links to the network to maximize the probability that all transmitted messages arrive that their intended destinations. An reliability metric. The network design technique uses an approximate network reliability analysis algorithm to achieve quadratic-time performance. .O IntroductionCommunication networks are often modeled by directed graphs (digraphs) in which the communicating entities are vertices or "nodes" and the communication paths are "links". Digraphs are also the model of choice because they capture important topological information and analytical techniques exist to define and compute a variety of reliability measures. One of the more useful reliability measures is the source-to-terminal (s-t) reliability, which is the probability that a given "source" node can communicate with a given "terminal" node. Closely allied with this is the notion of k-terminal reliability, which is the probability that all nodes in a given set "k" can communicate.Many techniques have been proposed in the literature [1,4,10-13,16-18] to compute s-t reliabilities andor k-terminal reliabilities. These techniques vary widely in computational efficiency and although some of them may show impressive speed in many situations, the solution time is still an exponential function of the network size for a worst-case scenario. In fact, no published network analysis technique for s-t reliability or k-terminal reliability can guarantee exact results in polynomial-time for an arbitrary network topology. Typically, these methods also assume that network connectivity is the only determining factor in assessing network reliability. The effects of traffic distribution, channel capacity and other factors are generally ignored. In [I61 and [I71 Wassem presents a method for designing survivable fiber-optic networks using SONET technology. Although Wassem's algorithms determine ring routings and network topologies in polynomial-time, the allowed set of network topologies is restricted to ring-based structures. Typical local-area networks (LANs), such as PC computer networks and terminal server networks, are Ethemet-based and hence are not addressed by [ 161 or [ 171. Wassem's design method also does not compute s-t reliabilities or k-terminal reliabilities. In [IS], Yo0 and Deo compare the computational efficiency o...

show abstract

Parallel algorithms for terminal-pair reliability

Cited by 30 publications

References 15 publications

Improving the Kuo-Lu-Yeh Algorithm for Assessing Two-Terminal Reliability

Improving the Kuo-Lu-Yeh Algorithm for Assessing Two-Terminal Reliability

System Reliability Evaluation for Imperfect Networks Using Polygon-to-Chain Reduction

A quadratic-time heuristic method for reliable network design with arbitrary traffic loads

Contact Info

Product

Resources

About