System reliability of assured accuracy rate for multi-state computer networks from service level agreements viewpoint

From the viewpoint of service level agreements, the transmission accuracy rate is one of critical performance indicators to assess internet quality for system managers and customers. Under the assumption that each arc’s capacity is deterministic, the quickest path problem is to find a path sending a specific of data such that the transmission time is minimized. However, in many real-life 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. Under both assured accuracy rate and time constraints, we extend the quickest path problem to compute the probability that d units of data can be sent through multiple minimal paths simultaneously. Such a probability named system reliability is a performance indicator to provide to managers for understanding the ability of system and improvement. An efficient algorithm is proposed to evaluate the system reliability in terms of the approach of minimal paths.

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

[2]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2001, TNET.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[23]  Zhi-Li Zhang,et al.  Adaptive random sampling for traffic volume measurement , 2003, Telecommun. Syst..

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

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

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

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

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

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

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

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

[32]  Pei-Chann Chang,et al.  New challenges and opportunities in flexible and robust supply chain forecasting systems , 2010 .

[33]  A. Iera,et al.  A multi-agent system for managing the quality of service in telecommunications networks , 2005 .

[34]  Yi-Kuei Lin,et al.  Estimated and exact system reliabilities of a maintainable computer network , 2011 .

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

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

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

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