Reward-based Markov chain analysis adaptive global resource management for inter-cloud computing

被引:10
作者
Chang, Ben-Jye [1 ]
Lee, Yu-Wei [1 ]
Liang, Ying-Hsin [2 ]
机构
[1] Natl Yunlin Univ Sci & Technol, Dept Comp Sci & Informat Engn, Touliu, Yunlin, Taiwan
[2] Nan Kai Univ Technol, Caotun, Nantou, Taiwan
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2018年 / 79卷
关键词
Cloud computing; Adaptive cloud resource management; Markov chain model analysis; The large-scale and small-scale traffic predictions; VM migration; Task redirection; Resource over-sale policy; DATA CENTERS; SERVICE; INFRASTRUCTURE; ENVIRONMENTS; CONSTRAINTS; ALLOCATION; QUALITY; SYSTEMS;
D O I
10.1016/j.future.2017.09.046
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The cloud IaaS provider supports diverse services for users to access big data of the real-time entertainment or the non-real-time working traffic. The IaaS provider builds data centers that include different types cloud resources/equipment, e.g., physical machines, virtual machines, networking, storages, power equipment, etc., and significantly increases cloud cost. An efficient cloud resource management is required for the cloud provider to maximize system reward while satisfying the QoS of various SLAs. This paper proposes a Reward-based adaptive global Cloud Resource Management (RCRM) that consists of three main contributions: the Large-scale and Small-scale traffic Predictions (LSP), Adaptive Cloud resource Allocation, and Maximum Net Profit. The M/M/m/m Markov chain model analyzes the service blocking and the required number of VMs for each request. For maximizing the system net profit, the cloud providers always oversell cloud resources. However, the cost of deploying data centers at different areas in the world is different. This paper adopts the VM migration-in/migration-out and task redirection to adaptively allocate cloud resources among global data centers. Numerical results demonstrate RCRM outperforms the others in dropping probability, SLA violation, violation penalty and net profit. Furthermore, the dropping probability of analysis is very close to that of simulation and justifies the correctness of the proposed Markov chain model. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:588 / 603
页数:16
相关论文
共 32 条
[1]  
Abraham S., 2013, OPERATING SYSTEM CON
[2]  
[Anonymous], 2011, IBM SMART CLOUD ENTE
[3]  
[Anonymous], 2005, IUT D SG
[4]  
[Anonymous], 2014, 4 INT C COMP COMM NE
[5]   Dual time-scale distributed capacity allocation and load redirect algorithms for cloud systems [J].
Ardagna, Danilo ;
Casolari, Sara ;
Colajanni, Michele ;
Panicucci, Barbara .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2012, 72 (06) :796-808
[6]   Managing Overloaded Hosts for Dynamic Consolidation of Virtual Machines in Cloud Data Centers under Quality of Service Constraints [J].
Beloglazov, Anton ;
Buyya, Rajkumar .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (07) :1366-1379
[7]   On the Quality of Service of Cloud Gaming Systems [J].
Chen, Kuan-Ta ;
Chang, Yu-Chun ;
Hsu, Hwai-Jung ;
Chen, De-Yu ;
Huang, Chun-Ying ;
Hsu, Cheng-Hsin .
IEEE TRANSACTIONS ON MULTIMEDIA, 2014, 16 (02) :480-495
[8]   VMPlanner: Optimizing virtual machine placement and traffic flow routing to reduce network power costs in cloud data centers [J].
Fang, Weiwei ;
Liang, Xiangmin ;
Li, Shengxin ;
Chiaraviglio, Luca ;
Xiong, Naixue .
COMPUTER NETWORKS, 2013, 57 (01) :179-196
[9]   Performance and Cost Evaluation of an Adaptive Encryption Architecture for Cloud Databases [J].
Ferretti, Luca ;
Pierazzi, Fabio ;
Colajanni, Michele ;
Marchetti, Mirco .
IEEE TRANSACTIONS ON CLOUD COMPUTING, 2014, 2 (02) :143-155
[10]   Modeling and performance analysis of large scale IaaS Clouds [J].
Ghosh, Rahul ;
Longo, Francesco ;
Naik, Vijay K. ;
Trivedi, Kishor S. .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (05) :1216-1234