Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget

Abstract This paper measures the performance of a computer network in the cloud computing environment. To retain a good quality of service (QOS), the computer network is required to preserve a sufficient capacity level so that it can send d units of data from the source (a cloud computing center) to the sink (a set of clients) through multiple paths within time T . Thus, the maintenance action should be taken when the computer network falls to a specific state so that it cannot provide sufficient capacity to satisfy demand d . Given the maintenance budget B and time constraint T , we evaluate the probability that d units of data can be sent from the source to the sink, where the probability is referred to as the system reliability. A branch-and-bound approach including an adjusting procedure is proposed to obtain all minimal capacity vectors satisfying d , B, and T . Subsequently, the corresponding system reliability can be derived in terms of such vectors by applying the recursive sum of disjoint products algorithm.

[1]  Carl Hewitt,et al.  ORGs for Scalable, Robust, Privacy-Friendly Client Cloud Computing , 2008, IEEE Internet Computing.

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

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

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

[5]  Wei-Chang Yeh Multistate network reliability evaluation under the maintenance cost constraint , 2004 .

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

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

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

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

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

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

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

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

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

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

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

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

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

[19]  Gen-Huey Chen,et al.  On the Quickest Path Problem , 1991, ICCI.

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

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

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

[23]  Yi-Kuei Lin,et al.  Reliability evaluation of a revised stochastic flow network with uncertain minimum time , 2010 .

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

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

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