Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate

In many real-time networks such as computer networks, each arc has stochastic capacity, lead time, and accuracy rate. Such a network is named a multi-state computer network (MSCN). Under the strict assumption that the capacity of each arc is deterministic, the quickest path (QP) problem is to find a path that sends a specific amount of data with minimum transmission time. From the viewpoint of internet quality, the transmission accuracy rate is one of critical performance indicators to assess internet network for system administrators and customers. Under both assured accuracy rate and time constraint, this paper extends the QP problem to discuss the flow assignment for a MSCN. An efficient algorithm is proposed to find the minimal capacity vector meeting such requirements. The system reliability, the probability to send $$d$$d units of data through multiple minimal paths under both assured accuracy rate and time constraint, can subsequently be computed. Furthermore, two routing schemes with spare minimal paths are adopted to reinforce the system reliability. The enhanced system reliability according to the routing scheme is calculated as well. The computational complexity in both the worst case and average case are analyzed.

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

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

[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]  Dirk Staehle,et al.  Radio resource management for the UMTS enhanced uplink in presence of QoS radio bearers , 2009, Ann. Oper. Res..

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

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

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

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

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

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

[11]  Miro Kraetzl,et al.  The Cross-Entropy Method for Network Reliability Estimation , 2005, Ann. Oper. Res..

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

[13]  Fengyu Wang,et al.  Identifying heavy-hitter flows fast and accurately , 2010, 2010 2nd International Conference on Future Computer and Communication.

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

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

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

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

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

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

[20]  Yi-Kuei Lin,et al.  System reliability of a stochastic-flow network through two minimal paths under time threshold , 2010 .

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

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

[23]  Gregory Levitin,et al.  A new approach to solving problems of multi‐state system reliability optimization , 2001 .

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

[25]  Yi-Kuei Lin,et al.  Transmission reliability of k minimal paths within time threshold , 2011, Comput. Ind. Eng..

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

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

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

[29]  David W. Coit,et al.  A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability , 2005, Reliab. Eng. Syst. Saf..

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

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

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

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

[34]  Won Kyung Kim,et al.  Improving system performance for stochastic activity network: A simulation approach , 2012, Comput. Ind. Eng..