Reliability assessment of a stochastic node-failure network with multiple sinks under tolerable error rate

References

• C. Alexopoulos, A note on state-space decomposition methods for analyzing stochastic flow networks, IEEE Trans. Reliab. 44 (1995), pp. 354–357. doi: 10.1109/24.387394
   Web of Science ®Google Scholar
• A.M. Al-Ghanim, A heuristic technique for generating minimal paths and cutsets of a general network, Comput. Ind. Eng. 36 (1999), pp. 45–55. doi: 10.1016/S0360-8352(98)00111-9
   Web of Science ®Google Scholar
• P.D. Amer, A measurement center for the NBS local area computer network, IEEE Trans. Comput. C-31 (1982), pp. 723–729. doi: 10.1109/TC.1982.1676078
   Google Scholar
• S.T. Cheng, Topological optimization of a reliable communication network, IEEE Trans. Reliab. 47 (1998), pp. 225–233. doi: 10.1109/24.740489
   Web of Science ®Google Scholar
• K.C. Claffy, G.C. Polyzos, and H.W. Braun, Application of sampling methodologies to network traffic characterization, Proceedings of ACM SIGCOMM, San Francisco, CA, 1993, pp. 13–17.
   Google Scholar
• L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, 1962.
   Google Scholar
• J.C. Hudson and K.C. Kapur, Reliability bounds for multistate systems with multistate components, Oper. Res. 33 (1985), pp. 153–160. doi: 10.1287/opre.33.1.153
   Web of Science ®Google Scholar
• R. Jain and S.A. Routhier, Packet trains: Measurements and a new model for computer network traffic, IEEE J. Sel. Areas Commun. 4 (1986), pp. 986–995.
   Google Scholar
• C.C. Jane and Y.W. Laih, Computing multi-state two-terminal reliability through critical arc states that interrupt demand, IEEE Trans. Reliab. 59 (2010), pp. 328–345.
   Google Scholar
• J. Jedwab, P. Phaal, and B. Pinna, Traffic estimation for the largest sources, on a network, using packet sampling with limited storage, Tech. Rep. HPL-92-35, HP Labs Tech. Rep. 1992.
   Google Scholar
• K. Kobayashi and H. Yamamoto, A new algorithm in enumerating all minimal paths in a sparse network, Reliab. Eng. Syst. Saf. 65 (1999), pp. 11–15. doi: 10.1016/S0951-8320(98)00076-3
   Web of Science ®Google Scholar
• Y.K. Lin, On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint, Eur. J. Oper. Res. 176 (2007), pp. 347–360. doi: 10.1016/j.ejor.2005.07.015
   Web of Science ®Google Scholar
• Y.K. Lin, System reliability evaluation for a multistate supply chain network with failure nodes by using minimal paths, IEEE Trans. Reliab. 58 (2009), pp. 34–40. doi: 10.1109/TR.2008.2011660
   Web of Science ®Google Scholar
• Y.K. Lin, A stochastic model to study the system capacity for supply chains in terms of minimal cuts, Int. J. Prod. Econ. 124 (2010), pp. 181–187. doi: 10.1016/j.ijpe.2009.10.022
   Web of Science ®Google Scholar
• Y.K. Lin, Network reliability of a time-based multistate network under spare routing with p minimal paths, IEEE Trans. Reliab. 60 (2011), pp. 61–69. doi: 10.1109/TR.2010.2103594
   Web of Science ®Google Scholar
• Y.K. Lin and C.T. Yeh, Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts, J. Ind. Manage. Optim. 7 (2011), pp. 211–227. doi: 10.3934/jimo.2011.7.211
   Web of Science ®Google Scholar
• T. Mori, T. Takine, J. Pan, R. Kawahara, M. Uchida, and S. Goto, Identifying heavy-hitter flows from sampled flow statistics, IEICE Trans. Commun. E90-B (2007), pp. 3061–3072. doi: 10.1093/ietcom/e90-b.11.3061
   Google Scholar
• J. Paquette, J.F. Cordeau, and G. Laporte, Quality of service in dial-a-ride operations, Comput. Ind. Eng. 56 (2009), pp. 1721–1734. doi: 10.1016/j.cie.2008.07.005
   Web of Science ®Google Scholar
• J.E. Ramirez-Marquez and C.M. Rocco, Stochastic network interdiction optimization via capacitated network reliability modeling and probabilistic solution discovery, Reliab. Eng. Syst. Saf. 94 (2009), pp. 913–921. doi: 10.1016/j.ress.2008.10.006
   Web of Science ®Google Scholar
• J.E. Ramirez-Marquez, C.M. Rocco, and G. Levitin, Optimal protection of general source-sink networks via evolutionary techniques, Reliab. Eng. Syst. Saf. 94 (2009), pp. 1676–1684. doi: 10.1016/j.ress.2009.05.002
   Web of Science ®Google Scholar
• A.M. Rushdia and O.M. Ba-rukab, Fault-tree modelling of computer system security, Int. J. Comput. Math. 82 (2005), pp. 805–819. doi: 10.1080/00207160412331336017
   Web of Science ®Google Scholar
• Y. Shen, A new simple algorithm for enumerating all minimal paths and cuts of a graph, Microelectron. Reliab. 35 (1995), pp. 973–976. doi: 10.1016/0026-2714(94)00121-4
   Web of Science ®Google Scholar
• W.C. Yeh, An improved algorithm for searching all minimal cuts in modified networks, Reliab. Eng. Syst. Saf. 93 (2008), pp. 1018–1024. doi: 10.1016/j.ress.2007.05.003
   Web of Science ®Google Scholar
• W.C. Yeh, An improved method for multistate flow network reliability with unreliable nodes and a budget constraint based on path set, IEEE Trans. Syst. Man Cybern. Part A: Syst. Hum. 41 (2011), pp. 350–355. doi: 10.1109/TSMCA.2010.2069093
   Web of Science ®Google Scholar
• A. Younesa and M.R. Girgisb, A tool for computing computer network reliability, Int. J. Comput. Math. 82 (2005), pp. 1455–1465. doi: 10.1080/0020716031000103385
   Web of Science ®Google Scholar
• M.J. Zuo, Z. Tian, and H.Z. Huang, An efficient method for reliability evaluation of multistate networks given all minimal path vectors, IIE Trans. 39 (2007), pp. 811–817. doi: 10.1080/07408170601013653
   Web of Science ®Google Scholar