Abstract

Virtual Machine (VM) consolidation technique plays an important role in energy management and load-balancing of cloud computing systems. Dynamic VM consolidation is a promising consolidation approach in this direction, which aims at using least active physical machines (PMs) through appropriately migrating VMs to reduce resource consumption. The resulting optimization problem is well-acknowledged to be NP-hard optimization problems. In this paper, we propose a novel merge-and-split-based coalitional game-theoretic approach for VM consolidation in heterogeneous clouds. The proposed approach first partitions PMs into different groups based on their workload levels, then employs a coalitional-game-based VM consolidation algorithm (CGMS) in choosing members from such groups to form effective coalitions, performs VM migrations among the coalition members to maximize the payoff of every coalition, and finally keeps PMs running in a high energy-efficiency state. The simulation results based on three scenarios clearly suggest that our proposed approach outperforms traditional ones in terms of energy-saving, and also achieve a fair level of load balance.

Highlights

  • Cloud computing is becoming an increasingly popular computational paradigm featured by the ability to provide elastic services over the internet for a huge number of global users [1]

  • Energy saved by dynamic Virtual Machine (VM) consolidation m The amount of physical machines (PMs) types in a datacenter h

  • We propose a novel energy-aware and mergesplit-based coalitional game-theoretic approach inspired by [19] for dynamic VM consolidation for heterogeneous cloud, which is load-aware and energy-efficiency

Read more

Summary

C A single coalition in a coalitional game v

Energy saved by dynamic VM consolidation m The amount of PM types in a datacenter h. X. Xiao et al.: A Workload-Aware VM Consolidation Method Based on Coalitional Game for Energy-Saving in Cloud fs fd ak bk. Energy-cost by source PM per unit time during VM migration Energy-cost by destination PM per unit time during VM migration Energy-cost by a PM of type k per unit time after consolidation Energy-cost by a PM of type k per unit time before consolidation The first quantile and the third quantile of PM workloads Threshold values triggering VM migrations based on Q1, Q3 The set of PMs with extrahigh load The set of PMs with high load The set of PMs with low load Number of PMs in C except PMs from E The final PM group formed by CGMS Degree of load fairness Number of PMs in H Number of PMs in L Number of PMs in E

INTRODUCTION
Step 2
24 Step 4
Findings
CONCLUSION AND FUTURE WORK
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call