Stable marriage matching for homogenizing load distribution in cloud data center
Journal article, Peer reviewed
MetadataVis full innførsel
OriginalversjonSangar D, Upreti R, Haugerud H, Begnum KM, Yazidi A. Stable marriage matching for homogenizing load distribution in cloud data center. Transactions on Large-Scale Data- and Knowledge-Centered Systems. 2020;45:172-198 https://doi.org/10.1007/978-3-662-62308-4_7
Running a sheer virtualized data center with the help of Virtual Machines (VM) is the de facto-standard in modern data centers. Live migration offers immense flexibility opportunities as it endows the system administrators with tools to seamlessly move VMs across physical machines. Several studies have shown that the resource utilization within a data center is not homogeneous across the physical servers. Load imbalance situations are observed where a significant portion of servers are either in overloaded or underloaded states. Apart from leading to inefficient usage of energy by underloaded servers, this might lead to serious QoS degradation issues in the overloaded servers. In this paper, we propose a lightweight decentralized solution for homogenizing the load across different machines in a data center by mapping the problem to a Stable Marriage matching problem. The algorithm judiciously chooses pairs of overloaded and underloaded servers for matching and subsequently VM migrations are performed to reduce load imbalance. For the purpose of comparisons, three different greedy matching algorithms are also introduced. In order to verify the feasibility of our approach in real-life scenarios, we implement our solution on a small test-bed. For the larger scale scenarios, we provide simulation results that demonstrate the efficiency of the algorithm and its ability to yield a near-optimal solution compared to other algorithms. The results are promising, given the low computational footprint of the algorithm.