TY - GEN
T1 - Minimizing communication traffic in data centers with power-aware VM placement
AU - Zhang, Bolei
AU - Qian, Zhuzhong
AU - Huang, Wei
AU - Li, Xin
AU - Lu, Sanglu
PY - 2012
Y1 - 2012
N2 - Virtualization is one of the most promising ways to enhance the scalability of data centers. Individual physical machines(PMs) can be carved into multiple virtual machines(VMs) for consolidation. In fact, most data centers are still using static greedy allocation of resources to VMs, regardless of the resource characteristics of both VMs and PMs. In this paper, we address that by optimizing the placement of VMs, we can save the cost of resource usage and improve the performance of applications at the same time. The objective is to minimize the total traffic in a data center. We should consolidate VMs with high inter traffic on the same PM, because VMs on the same PM can communicate using only memory copy. We also need to reduce the number of active PMs to save the power cost. This paper first formulates the VM placement as an optimization problem. Then, we propose a heuristic algorithm based on clustering to deploy VMs on PMs. A greedy algorithm is used for the online scenario. In the end, we experiment on data sets collected from a data center. Results show that our algorithm can efficiently reduce the overall traffic and power cost in the data center.
AB - Virtualization is one of the most promising ways to enhance the scalability of data centers. Individual physical machines(PMs) can be carved into multiple virtual machines(VMs) for consolidation. In fact, most data centers are still using static greedy allocation of resources to VMs, regardless of the resource characteristics of both VMs and PMs. In this paper, we address that by optimizing the placement of VMs, we can save the cost of resource usage and improve the performance of applications at the same time. The objective is to minimize the total traffic in a data center. We should consolidate VMs with high inter traffic on the same PM, because VMs on the same PM can communicate using only memory copy. We also need to reduce the number of active PMs to save the power cost. This paper first formulates the VM placement as an optimization problem. Then, we propose a heuristic algorithm based on clustering to deploy VMs on PMs. A greedy algorithm is used for the online scenario. In the end, we experiment on data sets collected from a data center. Results show that our algorithm can efficiently reduce the overall traffic and power cost in the data center.
UR - http://www.scopus.com/inward/record.url?scp=84867718217&partnerID=8YFLogxK
U2 - 10.1109/IMIS.2012.71
DO - 10.1109/IMIS.2012.71
M3 - 会议稿件
AN - SCOPUS:84867718217
SN - 9780769546841
T3 - Proceedings - 6th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2012
SP - 280
EP - 285
BT - Proceedings - 6th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2012
T2 - 6th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2012
Y2 - 4 July 2012 through 6 July 2012
ER -