【24h】

Multi-objective Energy Efficient Resource Allocation Using Virus Colony Search (VCS) Algorithm

机译:使用病毒殖民地搜索(VCS)算法的多目标节能资源分配

获取原文

摘要

Optimizing energy-efficient resource allocation in a cloud computing environment, which is a non-linear multi-objective NP-hard problem, plays a vital role in decreasing energy consumption, and increasing Quality of Service (QoS). In the area of resource allocation, Virtual Machine Placement (VMP) is one of the most vital problems to discuss with various possible formulations and a large number of optimization methods. Considering different objectives of cloud service providers, multi-objective VMP model is built to minimize energy consumption, Service Level Agreements Violation (SLAV) and number of Virtual Machine Migration (VMM). The multi-objective Virus Colony Search (MOVCS) algorithm is proposed to address this problem. We evaluate the performance of our algorithm by comparing two multi-objective algorithms, namely, Multi-Objective Evolutionary Algorithm based on Decomposition (MOEAD) and Non-dominated Sorting Genetic Algorithm (NSGAII). We conduct experiments to verify the effectiveness of the MOVCS algorithm. The performance of the MOVCS algorithm is comparing with MOEAD and NSGA-II on the quality of the pareto optimal solution set with different objectives. The simulation results illustrate that MOVCS find better solutions than others considering these objectives and with less iteration.
机译:在云计算环境中优化节能资源分配是一个非线性的多目标NP难题,它在降低能耗和提高服务质量(QoS)中起着至关重要的作用。在资源分配领域,虚拟机放置(VMP)是最重要的问题之一,需要用各种可能的公式和大量的优化方法进行讨论。考虑到云服务提供商的不同目标,构建了多目标VMP模型以最大程度地减少能耗,违反服​​务水平协议(SLAV)和虚拟机迁移(VMM)的数量。为了解决这个问题,提出了多目标病毒群搜索算法。我们通过比较两种多目标算法,即基于分解的多目标进化算法(MOEAD)和非支配排序遗传算法(NSGAII),来评估算法的性能。我们进行实验以验证MOVCS算法的有效性。 MOVCS算法的性能与MOEAD和NSGA-II在具有不同目标的pareto最优解集的质量上进行了比较。仿真结果表明,与考虑这些目标且迭代次数较少的MOVCS相比,MOVCS可以找到更好的解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号