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

被引:19
作者
Lin, Yi-Kuei [1 ]
Chang, Ping-Chen [1 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106, Taiwan
关键词
branch-and-bound; cloud computing system (CCS); imperfect node; system reliability; Recursive Sum of Disjoint Products (RSDP); QUICKEST PATH PROBLEM; STOCHASTIC-FLOW NETWORK; 2 MINIMAL PATHS; BUDGET CONSTRAINTS; MULTISTATE COMPONENTS; COST CONSTRAINT; ALGORITHM; TIME; FAILURE; ROBUST;
D O I
10.1002/sys.20196
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
From the perspective of system design and quality of service (QoS), system reliability is one of the essential performance indicators to measure the probable reliability of a network. In terms of a practical cloud computing system (CCS), edges and nodes have various capacities or states due to failure, partial failure, or maintenance. Thus, the CCS is a typical capacitated-flow network. To guarantee a good level of quality and reliability, the CCS should be maintained, so as not to fall into a failed state whereby it cannot provide sufficient capacity to satisfy demand. Thus, system reliability is developed in this paper to evaluate the capability of the CCS to send d units of data from the cloud to the client through two paths under both the maintenance budget and time constraints. An algorithm with an adjusting procedure based on the branch-and-bound approach is proposed to evaluate the system reliability. The relevant proof shows that the proposed algorithm is reasonable and appropriate for measuring the system reliability of the CCS. According to different maintenance budgets and corresponding system reliability, the system supervisor could determine a reasonable maintenance budget to maintain a good level of quality and reliability of the CCS. From the perspective of system design, the system supervisor could further conduct a sensitivity analysis to improve or investigate the most important part in a large CCS based on system reliability. (C) 2011 Wiley Periodicals, Inc.
引用
收藏
页码:83 / 94
页数:12
相关论文
共 36 条
[1]   SIMPLE METHOD FOR RELIABILITY EVALUATION OF A COMMUNICATION SYSTEM [J].
AGGARWAL, KK ;
GUPTA, JS ;
MISRA, KB .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1975, CO23 (05) :563-566
[2]   A NOTE ON STATE-SPACE DECOMPOSITION METHODS FOR ANALYZING STOCHASTIC FLOW NETWORKS [J].
ALEXOPOULOS, C .
IEEE TRANSACTIONS ON RELIABILITY, 1995, 44 (02) :354-357
[3]   RELIABILITY EVALUATION OF MULTISTATE SYSTEMS WITH MULTISTATE COMPONENTS [J].
AVEN, T .
IEEE TRANSACTIONS ON RELIABILITY, 1985, 34 (05) :473-479
[4]  
BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[5]   ALGORITHMS FOR THE CONSTRAINED QUICKEST PATH PROBLEM AND THE ENUMERATION OF QUICKEST PATHS [J].
CHEN, GH ;
HUNG, YC .
COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (02) :113-118
[6]   ON THE QUICKEST PATH PROBLEM [J].
CHEN, GH ;
HUNG, YC .
INFORMATION PROCESSING LETTERS, 1993, 46 (03) :125-128
[7]   THE QUICKEST PATH PROBLEM [J].
CHEN, YL ;
CHIN, YH .
COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (02) :153-161
[8]   Minimum time paths in a network with mixed time constraints [J].
Chen, YL ;
Tang, KW .
COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (10) :793-805
[9]  
Clausing D., 2005, Systems Engineering, V8, P245, DOI 10.1002/sys.20034
[10]   Internet packet routing:: Application of a K-quickest path algorithm [J].
Climaco, Joao C. N. ;
Pascoal, Marta M. B. ;
Craveirinha, Jos M. F. ;
Captivo, M. Eugenia V. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) :1045-1054