Latest revision as of 20:32, 28 January 2021

Abstract

Data centers rely on virtualization to provide different services over a shared infrastructure. The placement of the different services and tasks in the physical machines is crucial for the performance of the whole system. A misplaced service can overload some network links, lead to congestion, or even connection disruptions. On the other hand, virtual machine migration allows reallocating services and changing the traffic matrix, leading to more efficient use of bandwidth. In this paper, we propose a Virtual Machine Placement (VMP) algorithm to (re)allocate virtual machines in the data center servers, based on the current traffic matrix, CPU, and memory usage. Analyzing the formation of community patterns in terms of traffic using graph theory, we are able to find virtual machines that are correlated because they exchange high amount of data. Those virtual machines are aggregated and allocated to servers as close as possible to each other, reducing traffic congestion. Our simulation results show that VMP was able to improve the traffic distribution. In some specific cases we were able to reduce 80% of the core traffic, concentrating it at the edge of the network.

Original document

The different versions of the original document can be found in:

• http://www.gta.ufrj.br/ftp/gta/TechReports/DC12.pdf

• http://xplorestaging.ieee.org/ielx7/6461168/6466654/06466665.pdf?arnumber=6466665,

http://dx.doi.org/10.1109/giis.2012.6466665

• https://ieeexplore.ieee.org/document/6466665,

https://dblp.uni-trier.de/db/conf/giis/giis2012.html#DiasC12,

https://academic.microsoft.com/#/detail/2015711261