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

References

• Al-Ghanim , A. M. 1999 . A heuristic technique for generating minimal paths and cutsets of a general network . Computers and Industrial Engineering , 36 : 45 – 55 .
   Web of Science ®Google Scholar
• Amer , P. D. 1982 . A measurement center for the NBS local area computer network . IEEE Transactions on Computers , C-31 : 723 – 729 .
   Web of Science ®Google Scholar
• Aven , T. 1985 . Reliability evaluation of multistate systems with multistate components . IEEE Transactions on Reliability , C-34 : 473 – 479 .
   Web of Science ®Google Scholar
• Brecht , T. B. and Colbourn , C. J. 1988 . Lower bounds on two-terminal network reliability . Discrete Applied Mathematics , 21 : 185 – 198 .
   Web of Science ®Google Scholar
• Chen , G. H. and Hung , Y. C. 1993 . On the quickest path problem . Information Processing Letters , 46 : 125 – 128 .
   Web of Science ®Google Scholar
• Chen , G. H. and Hung , Y. C. 1994 . Algorithms for the constrained quickest path problem and the enumeration of quickest paths . Computers and Operations Research , 21 : 113 – 118 .
   Web of Science ®Google Scholar
• Chen , Y. L. 1993 . An algorithm for finding the k quickest paths in a network . Computers and Operations Research , 20 : 59 – 65 .
   Web of Science ®Google Scholar
• Chen , Y. L. 1994 . Finding the k quickest simples paths in a network . Information Processing Letters , 50 : 89 – 92 .
   Web of Science ®Google Scholar
• Chen , Y. L. and Chin , Y. H. 1990 . The quickest path problem . Computers and Operations Research , 17 : 153 – 161 .
   Web of Science ®Google Scholar
• Chen , Y. L. and Tang , K. 1998 . Minimum time paths in a network with mixed time constraints . Computers and Operations Research , 25 : 793 – 805 .
   Web of Science ®Google Scholar
• Cheng , S. T. 1998 . Topological optimization of a reliable communication network . IEEE Transactions on Reliability , 47 : 225 – 233 .
   Web of Science ®Google Scholar
• Chlamtac , I. 1980 . “ Issues in design and measurement of local area networks ” . In Proc. Comput. Measurement Group Conf 32 – 34 . . Boston, MA, USA, Phoenix, Arizona, Computer Measurement Group, December 1980, pp.
   Google Scholar
• Choi , B. Y. , Park , J. and Zhang , Z. L. 2003 . “ Adaptive random sampling for traffic load measurement ” . In IEEE International Conference, on Communications, (ICC ‘03). 1552 – 1556 . Anchorage , Alaska
   Google Scholar
• Clímaco , J. C. N. , Pascoal , M. M. B. , Craveirinha , J. M. F. and Captivo , M. E. V. 2007 . Internet packet routing: Application of a K-quickest path algorithm . European Journal of Operational Research , 181 : 1045 – 1054 .
   Web of Science ®Google Scholar
• Feldmann , A. , Greenberg , A. , Reingold , N. , Lund , C. , Rexford , J. and True , F. 2001 . Deriving traffic demands for operational IP networks: Methodology and experience . ACM Transactions on Networking, IEEE , 9 : 265 – 279 .
   Web of Science ®Google Scholar
• Ford , L. R. and Fulkerson , D. R. 1962 . Flows in Networks , Princeton , NJ : Princeton University Press .
   Google Scholar
• Gorst-Rasmussen , A. and Hansen , M. B. 2009 . Asymptotic inference for waiting times and patiences in queues with abandonment . Communications in Statistics: Simulation and Computation , 2 : 318 – 334 .
   Web of Science ®Google Scholar
• Hung , Y. C. and Chen , G. H. 1992 . Distributed algorithms for the quickest path problem . Parallel Computing , 18 : 823 – 834 .
   Web of Science ®Google Scholar
• Jain , R. and Routhier , S. A. 1986 . Packet trains: Measurements and a new model for computer network traffic . IEEE Journal on Selected Areas Communications , 4 : 986 – 995 .
   Web of Science ®Google Scholar
• Jane , C. C. , Lin , J. S. and Yuan , J. 1993 . Reliability evaluation of a limited-flow network in terms of minimal cutsets . IEEE Transactions on Reliability , 42 : 354 – 361 .
   Web of Science ®Google Scholar
• Jedwab , J. , Phaal , P. and Pinna , B. 1992 . Traffic Estimation for the Largest Sources, on a Network, using Packet Sampling with Limited Storage. , HPL-92-35, HP Labs Technical Report .
   Google Scholar
• Kobayashi , K. and Yamamoto , H. 1999 . A new algorithm in enumerating all minimal paths in a sparse network . Reliability Engineering and System Safety , 65 : 11 – 15 .
   Web of Science ®Google Scholar
• Lee , D. T. and Papadopoulou , E. 1993 . The all-pairs quickest path problem . Information Processing Letters , 45 : 261 – 267 .
   Web of Science ®Google Scholar
• Levitin , G. and Lisnianski , A. 2001 . A new approach to solving problems of multi-state system reliability optimization . Quality Reliability Engineering International , 17 : 93 – 104 .
   Web of Science ®Google Scholar
• Lin , J. S. , Jane , C. C. and Yuan , J. 1995 . On reliability evaluation of a capacitated-flow network in terms of minimal pathsets . Networks , 25 : 131 – 138 .
   Web of Science ®Google Scholar
• Lin , Y. K. 2003 . Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network . Computers and Operations Research , 30 : 567 – 575 .
   Web of Science ®Google Scholar
• Lin , Y. K. 2006 . Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network . International Journal of Systems Science , 37 : 1123 – 1130 .
   Web of Science ®Google Scholar
• Lin , Y. K. 2007 . On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint . European Journal of Operational Research , 176 : 347 – 360 .
   Web of Science ®Google Scholar
• Lin , Y. K. 2009 . Time version of the shortest path problem in a stochastic-flow network . Journal of Computational and Applied Mathematics , 228 : 150 – 157 .
   Web of Science ®Google Scholar
• Lin , Y. K. 2010 . Calculation of minimal capacity vectors through k minimal paths under budget and time constraints . European Journal of Operational Research , 200 : 160 – 169 .
   Web of Science ®Google Scholar
• Martins , E. D. Q. V. and Santos , J. L. E. D. 1997 . An algorithm for the quickest path problem . Operations Research Letters , 20 : 195 – 198 .
   Web of Science ®Google Scholar
• Mori , T. , Takine , T. , Pan , J. , Kawahara , R. , Uchida , M. and Goto , S. 2007 . Identifying heavy-hitter flows from sampled flow statistics . IEICE Transactions on Communications , E90-B : 3061 – 3072 .
   Web of Science ®Google Scholar
• Park , C. K. , Lee , S. and Park , S. 2004 . A label-setting algorithm for finding a quickest path . Computers and Operations Research , 31 : 2405 – 2418 .
   Web of Science ®Google Scholar
• Pascoal , M. M. B. , Captivo , M. E. V. and Cl′ımaco , J. C. N. 2005 . An algorithm for ranking quickest simple paths . Computers and Operations Research , 32 : 509 – 520 .
   Web of Science ®Google Scholar
• Ramírez , P. , Lillo , R. E. and Wiper , M. P. 2008 . Bayesian analysis of a queueing system with a long-tailed arrival process . Communications in Statistics:Simulation and Computation , 4 : 697 – 712 .
   Web of Science ®Google Scholar
• Shen , Y. 1995 . A new simple algorithm for enumerating all minimal paths and cuts of a graph . Microelectronics Reliability , 35 : 973 – 976 .
   Web of Science ®Google Scholar
• Xue , J. 1985 . On multistate system analysis . IEEE Transactions on Reliability , R-34 : 329 – 337 .
   Web of Science ®Google Scholar
• Yeh , W. C. 2002 . Search for minimal paths in modified networks . Reliability Engineering and System Safety , 75 : 389 – 395 .
   Web of Science ®Google Scholar
• Yeh , W. C. 2004 . Multistate network reliability evaluation under the maintenance cost constraint . International Journal of Production Economics , 88 : 73 – 83 .
   Web of Science ®Google Scholar
• Yeh , W. C. 2005 . A new approach to evaluating reliability of multistate networks under the cost constraint . Omega , 33 : 203 – 209 .
   Web of Science ®Google Scholar
• Yeh , W. C. 2008 . A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability . Reliability Engineering and System Safety , 93 : 125 – 136 .
   Web of Science ®Google Scholar
• Zuo , M. J. , Tian , Z. and Huang , H. Z. 2007 . An efficient method for reliability evaluation of multistate networks given all minimal path vectors . IIE Transactions , 39 : 811 – 817 .
   Web of Science ®Google Scholar