Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations

Error rate and transmission time are both critical factors in a computer system. In addition to guarantee the robustness of the computer system under both tolerable error rate and latency, enhancing the system reliability by a routing scheme, named spare reliability, is also a critical task. Virtually, each branch possesses multiple possible capacities. Such a network is termed a capacitated computer network (CCN). Hence, this article develops an efficient algorithm to derive the spare reliability of a CCN, where the spare reliability is the probability that data can be sent through multiple minimal paths considering routing scheme.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[15]  Peter Phaal,et al.  Traffic estimation for the largest sou r ces on a n etwork , u sin g pa ck et sampling with limited storage , 2000 .

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

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

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

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

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

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

[22]  Martin B. Hansen,et al.  Asymptotic Inference for Waiting Times and Patiences in Queues with Abandonment , 2009, Commun. Stat. Simul. Comput..

[23]  Michael P. Wiper,et al.  Bayesian Analysis of a Queueing System with a Long-Tailed Arrival Process , 2008, Commun. Stat. Simul. Comput..

[24]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.

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

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

[27]  Zhi-Li Zhang,et al.  Adaptive random sampling for traffic load measurement , 2003, IEEE International Conference on Communications, 2003. ICC '03..

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

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

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

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

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

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

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

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

[36]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

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

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

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

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

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