Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks

A common measure of performance of a reliable network, i.e., a network in which elements are failure prone, is the expected value of the maximum s-t flow between a pre-specified source node s and a pre-specified terminal node t in the network. The problem of determining the expected value of maximum s-t flow is computationally hard. Therefore, for practical sized networks, it is estimated through Monte Carlo based simulation methods which estimate the measure by evaluating the maximum flows in a large sample of network states. Such methods are computationally expensive. In this paper, we present an algorithm which speeds up the process of evaluating maximum flows in the sampled states by a factor of three on two difficult classes of randomly generated networks. This speed-up allows us to compute the measure for larger networks than is currently possible. It also allows us to obtain more accurate estimates on similar sized problems within similar execution times.

[1]  Pitu B. Mirchandani,et al.  Shortest distance and reliability of probabilistic networks , 1976, Comput. Oper. Res..

[2]  M. Samad,et al.  An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network , 1987 .

[3]  José Luis Rojo-Álvarez,et al.  Optimal Double Route Search in a Telecommunication Network: A Telecontrol Network Application , 2011, IEEE Transactions on Reliability.

[4]  E. Jamoulle,et al.  Transportation networks with random arc capacities , 1972 .

[5]  A. Rosenthal.  Computing the Reliability of Complex Networks , 1977 .

[6]  Adam L. Buchsbaum,et al.  Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling , 1992, Computational Support for Discrete Mathematics.

[7]  S. Yau,et al.  A Note on the Reliability of Communication Networks , 1962 .

[8]  George S. Fishman.  A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness , 1986, IEEE Transactions on Reliability.

[9]  Yi-Kuei Lin,et al.  Spare Routing Reliability for a Stochastic Flow Network Through Two Minimal Paths Under Budget Constraint , 2010, IEEE Transactions on Reliability.

[10]  B. Suman.  Simulated annealing-based multiobjective algorithms and their application for system reliability , 2003 .

[11]  Rajesh Mishra,et al.  A Cutsets-Based Unified Framework to Evaluate Network Reliability Measures , 2009, IEEE Transactions on Reliability.

[12]  John A. Silvester,et al.  Performance Analysis of Networks with Unreliable Components , 1984, IEEE Trans. Commun..

[13]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[14]  Subhash Suri,et al.  Stochastic Minimum Spanning Trees and Related Problems , 2011, ANALCO.

[15]  Ravindra K. Ahuja,et al.  Computational investigations of maximum flow algorithms , 1997 .

[16]  Ahmed Younes,et al.  A tool for computing computer network reliability , 2005, Int. J. Comput. Math..

[17]  Terje Aven,et al.  Availability evaluation of oil/gas production and transportation systems , 1987 .

[18]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[19]  J. R. Evans,et al.  Maximum flow in probabilistic graphs-the discrete case , 1976, Networks.

[20]  K. K. Aggarwal,et al.  A Simple Method for Reliability Evaluation of a Communication System , 1975, IEEE Trans. Commun..

[21]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[22]  Samir Khuller,et al.  Fast Reconfiguration of Data Placement in Parallel Disks , 2006, ALENEX.

[23]  Wei-Chang Yeh,et al.  A Particle Swarm Optimization Approach Based on Monte Carlo Simulation for Solving the Complex Network Reliability Problem , 2010, IEEE Transactions on Reliability.

[24]  Chin-Chia Jane,et al.  Computing Multi-State Two-Terminal Reliability Through Critical Arc States That Interrupt Demand , 2010, IEEE Transactions on Reliability.

[25]  R. Jan,et al.  Topological optimization of a communication network subject to a reliability constraint , 1993 .

[26]  Ahmad R. Sharafat,et al.  All-Terminal Network Reliability Using Recursive Truncation Algorithm , 2009, IEEE Transactions on Reliability.

[27]  Fakhri Karray,et al.  Cumulative Update of All-Terminal Reliability for Faster Feasibility Decision , 2010, IEEE Transactions on Reliability.

[28]  S.H. Lee,et al.  Reliability Evaluation of a Flow Network , 1980, IEEE Transactions on Reliability.

[29]  Shyue-Kung Lu,et al.  OBDD-based evaluation of k-terminal network reliability , 2002, IEEE Trans. Reliab..

[30]  V Marianov,et al.  Survivable capacitated network design problem: new formulation and Lagrangean relaxation , 2000, J. Oper. Res. Soc..

[31]  Wei-Chang Yeh,et al.  Approximate Reliability Function Based on Wavelet Latin Hypercube Sampling and Bee Recurrent Neural Network , 2011, IEEE Transactions on Reliability.

[32]  Malachy Carey,et al.  Bounds on expected performance of networks with links subject to failure , 1984, Networks.

[33]  Suresh Rai,et al.  An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities , 2005, IEEE Transactions on Reliability.

[34]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[35]  Charles J. Colbourn,et al.  Combining monte carlo estimates and bounds for network reliability , 1990, Networks.