Evaluation of system reliability for a cloud computing system with imperfect nodes

Systems Engineering

Volumn 15, Issue 1, 2012, Pages 83-94

  Lin, Yi Kuei ^a   Chang, Ping Chen ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

branch and bound; cloud computing system (CCS); imperfect node; Recursive Sum of Disjoint Products (RSDP); system reliability

Indexed keywords

BRANCH AND BOUNDS; CLOUD COMPUTING SYSTEM (CCS); IMPERFECT NODE; RECURSIVE SUM OF DISJOINT PRODUCTS (RSDP); SYSTEM RELIABILITY;

ALGORITHMS; BENCHMARKING; BUDGET CONTROL; COMPUTER NETWORK PERFORMANCE EVALUATION; COMPUTER SYSTEMS; MAINTENANCE; QUALITY CONTROL; QUALITY OF SERVICE; RELIABILITY ANALYSIS; SENSITIVITY ANALYSIS; SUPERVISORY PERSONNEL; SYSTEMS ANALYSIS;

CLOUD COMPUTING;

EID: 84855691471     PISSN: 10981241     EISSN: 15206858     Source Type: Journal    
DOI: 10.1002/sys.20196     Document Type: Article

References (36)

1. K.K. Aggarwal, J.S. Gupta, and, K.B. Misra, A simple method for reliability evaluation of a communication system, IEEE Trans Commun 23 (5) (1975), 563-566.
2. C. Alexopoulos, A note on state-space decomposition methods for analyzing stochastic flow networks, IEEE Trans Reliab 44 (2) (1995), 354-357.
3. T. Aven, Reliability evaluation of multistate systems with multistate components, IEEE Trans Reliab 34 (5) (1985), 473-479. (Pubitemid 16539769)
4. L.D. Bodin, B.L. Golden, A.A. Assad, and, M.O. Ball, Routing and scheduling of vehicles and crews: the state of the art, Comput Oper Res 10 (2) (1982), 63-211.
5. Y.L. Chen, and, Y.H. Chin, The quickest path problem, Comput Oper Res 17 (2) (1990), 153-161.
6. G.H. Chen, and, Y.C. Hung, On the quickest path problem, Inf Process Lett 46 (3) (1993), 125-128.
7. G.H. Chen, and, Y.C. Hung, Algorithms for the constrained quickest path problem and the enumeration of quickest paths, Comput Oper Res 21 (2) (1994), 113-118.
8. Y.L. Chen, and, K. Tang, Minimum time paths in a network with mixed time constraints, Comput Oper Res 25 (10) (1998), 793-805. (Pubitemid 128431070)
9. D. Clausing, and, D.D. Frey, Improving system reliability by failure-mode avoidance including four concept design strategies, Syst Eng 8 (3) (2005), 245-261. (Pubitemid 41557350)
10. J.C.N. Clímaco, M.M.B. Pascoal, J.M.F. Craveirinha, and, M.E.V. Captivo, Internet packet routing: application of a k-quickest path algorithm, Eur J Oper Res 181 (3) (2007), 1045-1054. (Pubitemid 46498511)
11. D. Frey, J. Palladino, J. Sullivan, and, M. Atherton, Part count and design of robust systems, Syst Eng 10 (3) (2007), 203-221. (Pubitemid 47366470)
12. B.L. Golden, and, T.L. Magnanti, Deterministic network optimization: A bibliography, Networks 7 (2) (1977), 149-183.
13. C. Hewitt, ORGs for scalable, robust, privacy-friendly client cloud computing, IEEE Internet Comput 12 (5) (2008), 96-99.
14. J.C. Hudson, and, K.C. Kapur, Reliability bounds for multistate systems with multistate components, Oper Res 33 (1) (1985), 153-160.
15. Y.C. Hung, and, G.H. Chen, Distributed algorithms for the quickest path problem, Parallel Comput 18 (7) (1992), 823-834.
16. R. Kelso, Innovative bandwidth arrangements for the Australian Education and Training Sector; Stage 1: Assessment of overseas approaches, RMIT University, Melbourne, Australia, 2001,.
17. E. Kujawski, Unintended consequences of performance specifications for the reliability of military weapon systems, Syst Eng 13 (4) (2010), 405-412.
18. D.T. Lee, and, E. Papadopoulou, The all-pairs quickest path problem, Inform Process Lett 45 (5) (1993), 261-267.
19. J.S. Lin, Reliability evaluation of capacitated-flow networks with budget constraints, IIE Trans 30 (12) (1998), 1175-1180.
20. J.S. Lin, C.C. Jane, and, J. Yuan, On reliability evaluation of a capacitated-flow network in terms of minimal pathsets, Networks 25 (3) (1995), 131-138.
21. Y.K. Lin, A simple algorithm for reliability evaluation of a stochastic-flow network with node failure, Comput Oper Res 28 (13) (2001), 1277-1285.
22. Y.K. Lin, Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints, IEEE Trans Reliab 53 (3) (2004), 381-387.
23. Y.K. Lin, Reliability evaluation for an information network with node failure under cost constraint, IEEE Trans Syst Man Cybernet Part A Syst Hum 37 (2) (2007), 180-188.
24. Y.K. Lin, Optimal pair of minimal paths under both time and budget constraints, IEEE Trans Syst Man Cybernet Part A Syst Hum 39 (3) (2009), 619-625.
25. Y.K. Lin, System reliability of a stochastic-flow network through two minimal paths under time threshold, Int J Prod Econ 124 (2) (2010a), 382-387.
26. Y.K. Lin, Spare routing reliability for a stochastic flow network through two minimal paths under budget constraint, IEEE Trans Reliab 59 (1) (2010b), 2-10.
27. Y.K. Lin, On transmission time through k minimal paths of a capacitated-flow network, Appl Math Model 34 (2) (2010c), 245-253.
28. E.D.Q.V. Martins, and, J.L.E.D. Santos, An algorithm for the quickest path problem, Oper Res Lett 20 (4) (1997), 195-198.
29. J.S. Osmundson, A systems engineering methodology for information systems, Syst Eng 3 (2) (2000), 68-76.
30. M.M.B. Pascoal, M.E.V. Captivo, and, J.C.N. Clímaco, An algorithm for ranking quickest simple paths, Comput Oper Res 32 (3) (2005), 509-520.
31. I. Shin, and, A.H. Levis, Performance prediction of networked information systems via Petri nets and queuing nets, Syst Eng 6 (1) (2003), 1-18. (Pubitemid 41289465)
32. W.J. Stevenson, Operation management: international student edition with global readings, McGrawHill, New York, 2007.
33. J. Xue, On multistate system analysis, IEEE Trans Reliab 34 (4) (1985), 329-337.
34. R. Yarlagadda, and, J. Hershey, Fast algorithm for computing the reliability of communication network, Int J Electron 70 (3) (1991), 549-564.
35. W.C. Yeh, Multistate network reliability evaluation under the maintenance cost constraint, Int J Prod Econ 88 (1) (2004), 73-83.
36. 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 (8) (2007), 811-817. (Pubitemid 46876942)