Game Theory based Dynamic Resource Allocation for Hybrid Environment with Cloud and Big Data Application

被引:0
作者
Zhang, Junxue [1 ]
Dong, Fang [1 ]
Shen, Dian [1 ]
Luo, Junzhou [1 ]
机构
[1] Southeast Univ, Sch Comp Sci & Engn, Nanjing, Jiangsu, Peoples R China
来源
2014 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC) | 2014年
关键词
resource allocation; cloud; big data; game theory;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Virtualization based cloud and big data applications have been widely adopted in various fields. Because deploying the big data applications on the cloud will cause obvious performance degradation, the cloud and big data applications are provided with fixed resource separately. However, the traditional fixed resource allocation mechanism has two drawbacks: (1) low resource utility and (2) unresponsiveness to the performance degradation. To address these drawbacks, the cloud and big data hybrid environment is designed, where fair resource allocation is used to ensure fairness between cloud and big data applications while virtual machine migration is used to make each virtual machine in cloud application reach its own satisfactory. Herein, game theory is used to model the conflict and negotiation between cloud and big data applications. Firstly, the Nash Equilibrium is used to discover the best strategy for both applications. Secondly, as for virtual machine migration, we use Nash Bargaining game to present the situation where virtual machines compete for more resources allocation while their minimal demand is ensured. Finally, experiments are carried out to prove that the hybrid environment outperforms the traditional method both in resource utility and application performance.
引用
收藏
页码:1128 / 1133
页数:6
相关论文
共 14 条
[11]  
Sridharan Mukundan, 2011, UT CLOUD COMP UCC IE
[12]  
Wu Yongwei, 2007, IEEE ACM INT C GRID
[13]  
Yang Yang, 2013, P INT C INT SYST DES
[14]  
Yuan Yi, 2013, QUAL SERV IWQOS IEEE