首页> 外文期刊>Sustainable Computing >Energy efficient VM scheduling and routing in multi-tenant cloud data center
【24h】

Energy efficient VM scheduling and routing in multi-tenant cloud data center

机译:多租户云数据中心中的节能VM调度和路由

获取原文
获取原文并翻译 | 示例

摘要

Cloud data center hosting many composite applications of multiple tenants consumes a massive amount of energy. Developing energy efficient mechanisms for data center management has become a vital issue for the cloud providers. Most of the works that deal with mechanisms for energy-efficient resource provisioning focus either on reducing the energy consumption of servers or reducing the energy consumption of network elements, but not both. We have formulated the problem of jointly optimizing the energy consumption of servers and network elements by optimal VM scheduling and routing as an integer programming problem. To solve it a phase-wise optimization approach with two ant colony based meta-heuristic algorithms is proposed. The topology features of the data center network and the communication patterns of the applications are considered in the construction of the solution. The solution is tested for three standard data center networks, 3-tier, B-Cube and Hyper-tree of different sizes and compared against two standard algorithms, first-fit and round-robin algorithms. The results showed that the proposed solution improves energy savings by 15% and 20% on an average when compared with first-fit and round-robin respectively. (C) 2019 Elsevier Inc. All rights reserved.
机译:托管多个租户的许多复合应用程序的云数据中心消耗大量能源。开发用于数据中心管理的节能机制已成为云提供商的重要问题。有关节能资源调配机制的大多数工作都集中于降低服务器的能耗或降低网络元素的能耗,但不能同时兼顾两者。我们已经提出了通过优化VM调度和路由来共同优化服务器和网络元素的能耗的问题,这是一个整数编程问题。为此,提出了一种基于两个蚁群的元启发式算法的分阶段优化方法。解决方案的构建考虑了数据中心网络的拓扑特征和应用程序的通信模式。该解决方案针对三种标准数据中心网络(大小不同的3层,B-Cube和Hyper-tree)进行了测试,并与两种标准算法(首次拟合和循环算法)进行了比较。结果表明,与首次拟合和循环法相比,所提出的解决方案分别平均节省了15%和20%的能源。 (C)2019 Elsevier Inc.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号