Estimated and exact system reliabilities of a maintainable computer network

This paper presents an algorithm to evaluate estimated and exact system reliabilities for a computer network in the cloud computing environment. From the quality of service (QOS) viewpoint, the computer network should be maintained when falling to a specific state such that it cannot afford enough capacity to satisfy demand. Moreover, the transmission time should be concerned as well. Thus, the data can be sent through several disjoint minimal paths simultaneously to shorten the transmission time. Under the maintenance budget B and time constraint T, we evaluate the system reliability that d units of data can be sent from the cloud to the client through multiple paths. Two procedures are integrated in the proposed algorithm-an estimation procedure for estimated system reliability and an adjusting procedure utilizing the branch-and-bound approach for exact system reliability. Subsequently, the estimated system reliability with lower bound and upper bound, and exact system reliability are computed by applying the recursive sum of disjoint products (RSDP) algorithm.

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

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

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

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

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

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

[7]  Ahmad A. Moreb.  Allocating repairable system’s reliability subject to minimal total cost — An integer programming approach , 2007 .

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

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

[10]  David W. Coit,et al.  Optimization of system reliability in the presence of common cause failures , 2007, Reliab. Eng. Syst. Saf..

[11]  David W. Coit,et al.  A generalized multistate-based path vector approach to multistate two-terminal reliability , 2006 .

[12]  Wuyi Yue,et al.  A performance evaluation index system for multimedia communication networks and forecasting for web-based network traffic , 2004 .

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

[14]  Suresh P. Sethi,et al.  Optimal maintenance and replacement of extraction machinery , 2008 .

[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]  Thomas L. Magnanti,et al.  Deterministic network optimization: A bibliography , 1977, Networks.

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

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

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

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

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

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

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

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

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

[27]  Tongdan Jin,et al.  Approximating network reliability estimates using linear and quadratic unreliability of minimal cuts , 2003, Reliab. Eng. Syst. Saf..

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

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

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

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

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