Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability

From a quality of service viewpoint, the transmission packet unreliability and transmission time are both critical performance indicators in a computer system when assessing the Internet quality for supervisors and customers. A computer system is usually modelled as a network topology where each branch denotes a transmission medium and each vertex represents a station of servers. Almost every branch has multiple capacities/states due to failure, partial failure, maintenance, etc. This type of network is known as a multi-state computer network (MSCN). This paper proposes an efficient algorithm that computes the system reliability, i.e., the probability that a specified amount of data can be sent through k (k ≥ 2) disjoint minimal paths within both the tolerable packet unreliability and time threshold. Furthermore, two routing schemes are established in advance to indicate the main and spare minimal paths to increase the system reliability (referred to as spare reliability). Thus, the spare reliability can be readily computed according to the routing scheme.

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

[2]  Dong Yue,et al.  Delay-distribution-dependent fault detection of networked control systems with stochastic quality of services , 2010, Int. J. Syst. Sci..

[3]  Raj Jain,et al.  Packet Trains-Measurements and a New Model for Computer Network Traffic , 1986, IEEE J. Sel. Areas Commun..

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

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

[6]  Charles J. Colbourn,et al.  Lower bounds on two-terminal network reliability , 1988, Discret. Appl. Math..

[7]  Yi-Kuei Lin.  Calculation of minimal capacity vectors through k minimal paths under budget and time constraints , 2010, Eur. J. Oper. Res..

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

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

[10]  Yi-Kuei Lin,et al.  Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion , 2013, Int. J. Syst. Sci..

[11]  Wei-Chang Yeh.  A new approach to evaluate reliability of multistate networks under the cost constraint , 2005 .

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

[13]  Y.-K. Lin.  Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network , 2006, Int. J. Syst. Sci..

[14]  Imrich Chlamtac.  Issues in Design and Measurement of Local Area Networks , 1980, Int. CMG Conference.

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

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

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

[18]  Wei-Chang Yeh.  Search for minimal paths in modified networks , 2002, Reliab. Eng. Syst. Saf..

[19]  Paul D. Amer,et al.  A Measurement Center for the NBS Local Area Computer Network , 1982, IEEE Transactions on Computers.

[20]  Amjed M. Al-Ghanim,et al.  A heuristic technique for generating minimal path and cutsets of a general network , 1999 .

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

[22]  Shigeki Goto,et al.  Identifying Heavy-Hitter Flows from Sampled Flow Statistics , 2007, IEICE Trans. Commun..

[23]  Yuanlong Shen,et al.  A new simple algorithm for enumerating all minimal paths and cuts of a graph , 1995 .

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

[25]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

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

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

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

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

[31]  Li Chunlin,et al.  Joint optimisation of application QoS and energy conservation in grid environment , 2010 .

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

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

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

[35]  K. Kobayashi,et al.  A new algorithm in enumerating all minimal paths in a sparse network , 1999 .

[36]  Yi-Kuei Lin.  Time version of the shortest path problem in a stochastic-flow network , 2009 .

[37]  Yi-Kuei Lin.  Reliability evaluation of a multistate network subject to time constraint under routing policy , 2013, Int. J. Syst. Sci..

[38]  Layuan Li,et al.  Joint optimisation of application QoS and energy conservation in grid environment , 2010, Int. J. Syst. Sci..

[39]  Sheng-Tzong Cheng.  Topological optimization of a reliable communication network , 1998 .

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