On performance evaluation for a multistate network under spare routing

This paper focuses on a multistate network composed of multistate edges to study the relationship between transmission reliability and spare routing. In the network, each edge has several possible capacities and may fail due to failure, maintenance, etc. Hence, the minimum transmission time to send a given amount of data is not a fixed number. The spare routing is a transmission rule which indicates the first and the second priority pairs of minimal paths. The second one takes charge of the transmission duty if the first one is out of order. We evaluate the probability that the required amount of data can be sent through a pair of minimal paths simultaneously under both time threshold and budget constraint. Such a probability is named transmission reliability which can be regarded as a performance index to measure the transmission capability of a multistate network. An efficient solution procedure is thus proposed to generate all lower boundary points meeting the constraints. The transmission reliability is calculated in terms of such points.

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

[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]  D. T. Lee,et al.  The All-Pairs Quickest Path Problem , 1993, Inf. Process. Lett..

[4]  Gen-Huey Chen,et al.  On the Quickest Path Problem , 1990, Inf. Process. Lett..

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

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

[7]  Yi-Kuei Lin,et al.  Optimal routing policy of a stochastic-flow network , 2009, Comput. Ind. Eng..

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

[9]  Stephen J. H. Yang,et al.  An optimal QoS-based Web service selection scheme , 2009, Inf. Sci..

[10]  Hong-Zhong Huang,et al.  An efficient method for reliability evaluation of multistate networks given all minimal path vectors , 2007 .

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

[12]  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..

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

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

[15]  Yi-Kuei Lin,et al.  Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths , 2009, Comput. Oper. Res..

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

[17]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[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.  Computer network reliability optimization under double-resource assignments subject to a transmission budget , 2011, Inf. Sci..

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

[21]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[22]  Ravindra K. Ahuja,et al.  Minimum cost-reliability ratio path problem , 1988, Comput. Oper. Res..

[23]  Thomas L. Magnanti,et al.  Deterministic network optimization: A bibliography , 1977, Networks.

[24]  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..

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

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

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

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

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

[30]  Angelo Perkusich,et al.  Broadcast routing in wireless sensor networks with dynamic power management and multi-coverage backbones , 2010, Inf. Sci..

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

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

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

[34]  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.

[35]  Lei Guo,et al.  Availability guarantee in survivable WDM mesh networks: A time perspective , 2008, Inf. Sci..

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

[37]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..