当前位置: X-MOL 学术IEEE Trans. Serv. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Dynamic Virtual Machine Placement and Migration Scheme For Data Centers
IEEE Transactions on Services Computing ( IF 8.1 ) Pub Date : 2019-01-01 , DOI: 10.1109/tsc.2018.2817208
Thuan Hong Duong-Ba , Thinh Nguyen , Bella Bose , Tuan Tho Tran

We study the problem of virtual machine (VM) placement and migration in a data center. In the current approaches, VMs are assigned to physical servers using on-demand provisioning. Such an approach is simple but it often results in a poor performance due to resource fragmentation. Additionally, sub-optimal VM placement usually generates unneeded VM migration and unnecessary cross network traffic. The efficiency of a datacenter therefore significantly depends on how VMs are provisioned and where they are placed. A good placement scheme will not only improve the quality of service but also reduce the operation cost of the data center. In this paper, we study the problem of optimal VM placement and migration to minimize resource usage and power consumption in a data center. We formulate the optimization problem as a joint multiple objective function and solve it by leveraging the framework of convex optimization. Due to the intractable nature of the combinatorial optimization, we then propose Multi-level Join VM Placement and Migration (MJPM) algorithms based on the relaxed convex optimization framework to approximate the optimal solution. The theoretical analysis demonstrates the effectiveness of our proposed algorithms that substantially increases data center efficiency. In addition, our extensive simulation results on different practical topologies show significant performance improvement over the existing approaches.

中文翻译:

数据中心的动态虚拟机放置和迁移方案

我们研究了数据中心中虚拟机 (VM) 的放置和迁移问题。在当前的方法中,使用按需供应将 VM 分配给物理服务器。这种方法很简单,但由于资源碎片化,往往会导致性能不佳。此外,次优虚拟机放置通常会产生不必要的虚拟机迁移和不必要的跨网络流量。因此,数据中心的效率在很大程度上取决于虚拟机的配置方式和放置位置。一个好的布局方案不仅可以提高服务质量,还可以降低数据中心的运营成本。在本文中,我们研究了优化虚拟机放置和迁移的问题,以最大限度地减少数据中心的资源使用和功耗。我们将优化问题表述为一个联合多目标函数,并通过利用凸优化的框架来解决它。由于组合优化的难以处理的性质,我们提出了基于松弛凸优化框架的多级加入虚拟机放置和迁移(MJPM)算法来逼近最优解。理论分析证明了我们提出的算法的有效性,大大提高了数据中心的效率。此外,我们在不同实际拓扑结构上的大量仿真结果表明,与现有方法相比,性能有了显着提高。然后,我们提出了基于松弛凸优化框架的多级加入 VM 放置和迁移(MJPM)算法来逼近最优解。理论分析证明了我们提出的算法的有效性,大大提高了数据中心的效率。此外,我们在不同实际拓扑结构上的大量仿真结果表明,与现有方法相比,性能有了显着提高。然后,我们提出了基于松弛凸优化框架的多级加入 VM 放置和迁移(MJPM)算法来逼近最优解。理论分析证明了我们提出的算法的有效性,大大提高了数据中心的效率。此外,我们在不同实际拓扑结构上的大量仿真结果表明,与现有方法相比,性能有了显着提高。
更新日期:2019-01-01
down
wechat
bug