Reliability evaluation of a revised stochastic flow network with uncertain minimum time

This paper constructs a revised stochastic flow network to model a realistic computer network in which each arc has a lead time and a stochastic capacity. The minimum time to send a specified amount of data through the network is thus uncertain. Hence, this paper mainly proposes an approach for evaluating the system reliability that d units of data can be transmitted through k minimal paths simultaneously within the time threshold T. The idea of lower boundary points for (d,T), the minimal system states satisfying the demand d within the time threshold T, is proposed firstly. All system states meeting the time and demand requirements can be represented as the union of subsets generated from all lower boundary points for (d,T), and thus the system reliability is computed quickly.

[1]  D. T. Lee,et al.  The All-Pairs Quickest Path Problem , 1993, Inf. Process. Lett..

[2]  Yi-Kuei Lin,et al.  On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint , 2007, Eur. J. Oper. Res..

[3]  Wei-Chang Yeh,et al.  A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability , 2008, Reliab. Eng. Syst. Saf..

[4]  Ernesto de Queirós Vieira Martins,et al.  An algorithm for the quickest path problem , 1997, Oper. Res. Lett..

[5]  John Erik Hershey,et al.  Fast algorithm for computing the reliability of a communication network , 1991 .

[6]  Zidong Wang,et al.  Exponential stability of uncertain stochastic neural networks with mixed time-delays , 2007 .

[7]  John Yuan,et al.  Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .

[8]  João C. N. Clímaco,et al.  An algorithm for ranking quickest simple paths , 2005, Comput. Oper. Res..

[9]  He Huang,et al.  Corrigendum to “Delay-dependent stability for uncertain stochastic neural networks with time-varying delay” [Physica A 381 (2007) 93–103] , 2008 .

[10]  Y. H. Chin,et al.  The quickest path problem , 1990, Comput. Oper. Res..

[11]  Terje Aven,et al.  Reliability Evaluation of Multistate Systems with Multistate Components , 1985, IEEE Transactions on Reliability.

[12]  Gen-Huey Chen,et al.  Algorithms for the constrained quickest path problem and the enumeration of quickest paths , 1994, Comput. Oper. Res..

[13]  G. Feng,et al.  Delay-dependent stability for uncertain stochastic neural networks with time-varying delay , 2007 .

[14]  Yen-Liang Chen,et al.  Minimum time paths in a network with mixed time constraints , 1998, Comput. Oper. Res..

[15]  João C. N. Clímaco,et al.  Internet packet routing: Application of a K , 2007, Eur. J. Oper. Res..

[16]  C. Alexopoulos.  A note on state-space decomposition methods for analyzing stochastic flow networks , 1995 .

[17]  Chin-Chia Jane,et al.  On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.

[18]  Yi-Kuei Lin,et al.  Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network , 2003, Comput. Oper. Res..

[19]  Yi-Kuei Lin,et al.  Reliability of a stochastic-flow network with unreliable branches & nodes, under budget constraints , 2004, IEEE Trans. Reliab..

[20]  Yi-Kuei Lin,et al.  Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[21]  Soondal Park,et al.  A label-setting algorithm for finding a quickest path , 2004, Comput. Oper. Res..

[22]  Jian-an Fang,et al.  Global stability of stochastic high-order neural networks with discrete and distributed delays , 2008 .

[23]  Wei-Chang Yeh.  An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths , 2007, Reliab. Eng. Syst. Saf..

[24]  Yen-Liang Chen,et al.  An algorithm for finding the k quickest paths in a network , 1993, Comput. Oper. Res..

[25]  Kailash C. Kapur,et al.  Reliability Bounds for Multistate Systems with Multistate Components , 1985, Oper. Res..

[26]  Y. L. Chen,et al.  Finding the k Quickset Simple Paths in a Network , 1994, Inf. Process. Lett..

[27]  Xue Janan,et al.  On Multistate System Analysis , 1985, IEEE Transactions on Reliability.

[28]  Gen-Huey Chen,et al.  Distributed algorithms for the quickest path problem , 1992, Parallel Comput..