References
- Al-Ghanim , A. M. 1999 . A heuristic technique for generating minimal paths and cutsets of a general network . Comput. Ind. Eng. , 36 : 45 – 55 . (doi:10.1016/S0360-8352(98)00111-9)
- Amer , P. D. 1982 . A measurement center for the NBS local area computer network . IEEE Trans. Comput. , C-31 : 723 – 729 . (doi:10.1109/TC.1982.1676078)
- Aven , T. 1985 . Reliability evaluation of multistate systems with multistate components . IEEE Trans. Reliab. , R-34 : 473 – 479 . (doi:10.1109/TR.1985.5222235)
- Brecht , T. B. and Colbourn , C. J. 1988 . Lower bounds on two-terminal network reliability . Discret Appl. Math. , 21 : 185 – 198 . (doi:10.1016/0166-218X(88)90065-0)
- Chen , G. H. and Hung , Y. C. 1993 . On the quickest path problem . Inf. Process. Lett. , 46 : 125 – 128 . (doi:10.1016/0020-0190(93)90057-G)
- Chen , G. H. and Hung , Y. C. 1994 . Algorithms for the constrained quickest path problem and the enumeration of quickest paths . Comput. Oper. Res. , 21 : 113 – 118 . (doi:10.1016/0305-0548(94)90045-0)
- Chen , Y. L. 1993 . An algorithm for finding the k quickest paths in a network . Comput. Oper. Res. , 20 : 59 – 65 . (doi:10.1016/0305-0548(93)90096-2)
- Chen , Y. L. 1994 . Finding the k quickest simples paths in a network . Inf. Process. Lett. , 50 : 89 – 92 . (doi:10.1016/0020-0190(94)00008-5)
- Chen , Y. L. and Chin , Y. H. 1990 . The quickest path problem . Comput. Oper. Res. , 17 : 153 – 161 . (doi:10.1016/0305-0548(90)90039-A)
- Chen , Y. L. and Tang , K. 1998 . Minimum time paths in a network with mixed time constraints . Comput. Oper. Res. , 25 : 793 – 805 . (doi:10.1016/S0305-0548(98)00020-3)
- Cheng , S. T. 1998 . Topological optimization of a reliable communication network . IEEE Trans. Reliab. , 47 : 225 – 233 . (doi:10.1109/24.740489)
- 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 . Eur. J. Oper. Res. , 181 : 1045 – 1054 . (doi:10.1016/j.ejor.2006.03.013)
- Feldmann , A. , Greenberg , A. , Reingold , N. , Lund , C. , Rexford , J. and True , F. 2001 . Deriving traffic demands for operational IP networks: Methodology and experience . IEEE/ACM Trans. Netw. , 9 : 265 – 279 . (doi:10.1109/90.929850)
- Ford , L. R. and Fulkerson , D. R. 1962 . Flows in Networks , Princeton , NJ : Princeton University Press .
- Hung , Y. C. and Chen , G. H. 1992 . Distributed algorithms for the quickest path problem . Parallel Comput. , 18 : 823 – 834 . (doi:10.1016/0167-8191(92)90048-C)
- Jain , R. and Routhier , S. A. 1986 . Packet trains: Measurements and a new model for computer network traffic . IEEE J. Sel. Areas Commun. , 4 : 986 – 995 . (doi:10.1109/JSAC.1986.1146410)
- Jane , C. C. , Lin , J. S. and Yuan , J. 1993 . On reliability evaluation of a limited-flow network in terms of minimal cutsets . IEEE Trans. Reliab. , 42 : 354 – 361 . (doi:10.1109/24.257817)
- Jedwab , J. , Phaal , P. and Pinna , B. 1992 . Traffic estimation for the largest sources, on a network, using packet sampling with limited storage , Bristol , , UK : HP Laboratories . Tech. Rep. HPL-92-35
- Kobayashi , K. and Yamamoto , H. 1999 . A new algorithm in enumerating all minimal paths in a sparse network . Reliab. Eng. Syst. Saf. , 65 : 11 – 15 . (doi:10.1016/S0951-8320(98)00076-3)
- Lee , D. T. and Papadopoulou , E. 1993 . The all-pairs quickest path problem . Inf. Process. Lett. , 45 : 261 – 267 . (doi:10.1016/0020-0190(93)90214-T)
- 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 . (doi:10.1002/net.3230250306)
- Lin , Y. K. 2003 . Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network . Comput. Oper. Res. , 30 : 567 – 575 . (doi:10.1016/S0305-0548(02)00025-4)
- Lin , Y. K. 2007 . On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint . Eur. J. Oper. Res. , 176 : 347 – 360 . (doi:10.1016/j.ejor.2005.07.015)
- Lin , Y. K. 2007 . MC-based algorithm for a telecommunication network under node and budget constraints . Appl. Math. Comput. , 190 : 1540 – 1550 . (doi:10.1016/j.amc.2007.02.133)
- Lin , Y. K. 2009 . System reliability evaluation for a multistate supply chain network with failure nodes by using minimal paths . IEEE Trans. Reliab. , 58 : 34 – 40 . (doi:10.1109/TR.2008.2011660)
- Lin , Y. K. and Yeh , C. T. 2011 . Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts . J. Ind. Manag. Optim. , 7 : 211 – 227 . (doi:10.3934/jimo.2011.7.211)
- Lin , Y. K. and Yeh , C. T. 2011 . Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget . Comput. Oper. Res. , 38 : 1175 – 1187 . (doi:10.1016/j.cor.2010.10.024)
- Martins , E. D.Q.V. and Santos , J. L.E.D. 1997 . An algorithm for the quickest path problem . Oper. Res. Lett. , 20 : 195 – 198 . (doi:10.1016/S0167-6377(97)00008-4)
- Mori , T. , Takine , T. , Pan , J. , Kawahara , R. , Uchida , M. and Goto , S. 2007 . Identifying heavy-hitter flows from sampled flow statistics . IEICE Trans. Commun. , E90-B : 3061 – 3072 . (doi:10.1093/ietcom/e90-b.11.3061)
- Park , C. K. , Lee , S. and Park , S. 2004 . A label-setting algorithm for finding a quickest path . Comput. Oper. Res. , 31 ( 1 ) : 2405 – 2418 . (doi:10.1016/S0305-0548(03)00195-3)
- Pascoal , M. M.B. , Captivo , M. E.V. and Clímaco , J. C.N. 2005 . An algorithm for ranking quickest simple paths . Comput. Oper. Res. , 32 : 509 – 520 . (doi:10.1016/S0305-0548(03)00250-8)
- Ramirez-Marquez , J. E. and Coit , D. W. 2005 . A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability . Reliab. Eng. Syst. Saf. , 87 : 253 – 264 . (doi:10.1016/j.ress.2004.05.002)
- Rushdia , A. M. and Ba-rukab , O. M. 2005 . Fault-tree modelling of computer system security . Int. J. Comput. Math. , 82 : 805 – 819 . (doi:10.1080/00207160412331336017)
- Shen , Y. 1995 . A new simple algorithm for enumerating all minimal paths and cuts of a graph . Microelectron. Reliab. , 35 : 973 – 976 . (doi:10.1016/0026-2714(94)00121-4)
- Tiana , Y. C. and Levyb , D. 2008 . Dealing with network complexity in real-time networked control . Int. J. Comput. Math. , 85 : 1235 – 1253 . (doi:10.1080/00207160701697354)
- Xue , J. 1985 . On multistate system analysis . IEEE Trans. Reliab. , 34 : 329 – 337 . (doi:10.1109/TR.1985.5222178)
- Yeh , W. C. 2002 . Search for minimal paths in modified networks . Reliab. Eng. Syst. Saf. , 75 : 389 – 395 . (doi:10.1016/S0951-8320(01)00128-4)
- Yeh , W. C. 2008 . A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability . Reliab. Eng. Syst. Saf. , 93 : 125 – 136 . (doi:10.1016/j.ress.2006.11.004)
- Yeh , W. C. 2011 . An improved method for the multistate flow network reliability with unreliable nodes and the budget constraint based on path set . IEEE Trans. Syst. Man Cybern. A, Syst. Humans , 41 : 350 – 355 . (doi:10.1109/TSMCA.2010.2069093)
- Younesa , A. and Girgisb , M. R. 2005 . A tool for computing computer network reliability . Int. J. Comput. Math. , 82 : 1455 – 1465 . (doi:10.1080/0020716031000103385)
- 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 Trans. , 39 : 811 – 817 . (doi:10.1080/07408170601013653)