基于网络感知的两阶段虚拟机放置算法

摘要

现有的虚拟机放置研究多以节能为目标,通过资源整合减少能源消耗,然而资源的过度聚合会影响网络性能.为此,研究网络感知的虚拟机放置问题并分析相关影响因素,提出一种两阶段启发式虚拟机放置算法.根据虚拟机之间的相似度进行适当聚合,以提高虚拟机之间的网络通信能力,减少数据中心的网络流量,同时根据聚合结果,利用改进的背包算法在物理机之间合理分配虚拟机.实验结果表明,与最佳适应算法和随机算法相比,该算法能更有效地优化网络流量分布,减少激活的物理机数量,降低能源开销.%The existing Virtual Machine(VM)placement researches mostly aim at energy saving,which reduce energy consumption by consolidating of resources.However,the excessive consolidation of these resources may lead to network performance degradation.Aiming at this problem,this paper studies the network-aware VM placement problem,analyzes the influence factors of VM placement and proposes a two-phase heuristic VM placement algorithm.Firstly,based on analyzing the similarity between VMs,the aggregation is performed to improve communication ability among VMs and reduce the network traffic of data center.Then,a modified knapsack algorithm is used to implement the appropriate allocation of VMs between physical hosts.Experimental results show that,compared with Best Fit(BF)algorithm and random algorithm,the proposed algorithm can optimize the network traffic,reduce the number of avtivated physical hosts and save energy consumption more effectively.