A virtual machine repacking in clouds: faster live migration algorithms

This paper focuses on optimal VM repacking algorithms inphysical infrastructures of Clouds to reduce overall cost andimprove utilization and nd the best tradeo s between theseconicting goals. We investigate algorithms that scale well,minimize SLA violations, converge reasonably fast and pro-vide the best possible tradeo s between the number of usedservers and migrations. These goals lead us to b-matchingalgorithms and a greedy algorithm resolution of a graphicmatroid representation [2] of the repacking problem. A tradi-tional Bin-Packing algorithm [1] is used for comparison andbenchmarks since it provides an upper bound on performance,but it does not scale with problem size.