基于虚拟机动态迁移的负载均衡策略

针对数据中心由于异构节点资源利用率不均衡导致的负载均衡问题,本文提出了一种基于动态阈值的迁移时机判决算法与基于负载类型感知的选择算法相结合的虚拟机动态迁移选择策略.该策略先通过监控全局负载度与高低负载节点占比动态调整状态阈值,并结合负载评估值判断迁移时机;再分析虚拟机负载类型,依据虚拟机与节点资源的依赖度、虚拟机当前内存带宽比和虚拟机贡献度选择待迁移虚拟机,并根据虚拟机与目的节点的资源匹配度与迁移代价选择目的节点,实现对高负载与低负载节点的虚拟机动态调整,从而优化节点资源配置问题.实验结果表明,该策略可以有效减少虚拟机迁移次数并保证数据中心服务质量,最终改善数据中心的负载均衡能力.     

基于动态调整阈值的虚拟机迁移算法

针对当前数据中心服务器能耗优化和虚拟机迁移时机合理性问题,提出一种基于动态调整阈值（DAT）的虚拟机迁移算法。该算法首先通过统计分析物理机历史负载数据动态地调整虚拟机迁移的阈值门限,然后通过延时触发和预测物理机的负载趋势确定虚拟机迁移时机。最后将该算法应用到实验室搭建的数据中心平台上进行实验验证,结果表明基于DAT的虚拟机迁移算法比静态阈值法关闭的物理机数量更多,云数据中心能耗更低。基于DAT的虚拟机迁移算法能根据物理机的负载变化动态迁移虚拟机,达到提高物理机资源利用率、降低数据中心能耗、提高虚拟机迁移效率的目的。     

基于三支决策的虚拟机节能迁移策略

虚拟机迁移技术作为云计算中降低数据中心能耗的重要手段被广泛应用。结合三支决策的分、治、效模型提出一种基于三支决策的虚拟机迁移调度策略（TWD-VMM）。首先,通过建立层次阈值树搜索所有可能取到的阈值,由此以数据中心能耗为优化目标得到总能耗最低的一对阈值,从而实现三分区域,即高负载区域、中负载区域和低负载区域。其次,针对不同负载的主机采取不同的迁移策略：对于高负载主机,以主机预迁出后的多维资源均衡度和主机负载下降幅度为目标;对于低负载主机,主要考虑主机预放置后的多维资源均衡度;对于中等负载主机,如果迁移过来的虚拟机依旧满足中负载特性,则可以接受迁入。实验采用CloudSim模拟器进行,将TWD-VMM算法分别与基于阈值调度算法（TVMS）、基于虚拟机迁移节能调度算法（EEVS）、云计算中心节能调度算法（REVMS）算法在主机负载、主机多维资源利用均衡度、数据中心总能耗等方面进行比较,结果表明TWD-VMM算法在提高主机资源利用率、均衡主机负载等方面有明显效果,且能耗平均降低了27%。     

云数据中心中一种物理资源利用阈值边界管理策略

提出了云数据中心的一种物理资源利用阈值边界管理策略RUT-MS(physical resource utilization thresholds management strategy)。RUT-MS把虚拟机迁移过程进一步划分为超负载主机检测、虚拟机选择、虚拟机放置第1阶段、低负载主机检测和虚拟机放置第2阶段。使用一种迭代权重线性回归方法来预测物理资源的阈值上限,避免超负载的物理主机数量的增加;采用最小能量消耗策略完成虚拟机选择过程。使用多维物理资源的均方根来确定其资源使用阈值下限,减少低负载主机数量。实验结果表明： RUT-MS物理资源利用阈值边界管理策略使云数据中心的能量消耗和虚拟机迁移次数明显减少,SLA违规率和SLA及能量消耗联合指标只有少量的增加。     

云数据中心基于温度感知的虚拟机迁移模型

提出云数据中心基于温度感知的虚拟机迁移模型TA-VMM.TA-VMM迁移时着重考虑物理主机处理器的温度情况和物理主机负载均衡情况.在物理主机状态检测阶段寻找出候选迁移主机MigrationFromHosts;在虚拟机选择阶段寻找出候选迁移虚拟机列表VmstoMigrateList;在最后的虚拟机放置阶段完成候选迁移虚拟机的重新放置.CloudSim云计算模拟器仿真结果表明,TA-VMM中温度阈值对云数据中心的性能影响十分重要,TA-VMM比其他虚拟机迁移模型具有更低的能量消耗.     

云数据中心基于贪心算法的虚拟机迁移策略

为了节省云数据中心的能量消耗,提出了几种基于贪心算法的虚拟机（VM）迁移策略。这些策略将虚拟机迁移过程划分为物理主机状态检测、虚拟机选择和虚拟机放置三个步骤,并分别在虚拟机选择和虚拟机放置步骤中采用贪心算法予以优化。提出的三种迁移策略分别为：最小主机使用效率选择且最大主机使用效率放置算法MinMax_Host_Utilization、最大主机能量使用选择且最小主机能量使用放置算法MaxMin_Host_Power_Usage、最小主机计算能力选择且最大主机计算能力放置算法MinMax_Host_MIPS。针对物理主机处理器使用效率、物理主机能量消耗、物理主机处理器计算能力等指标设置最高或者最低的阈值,参考贪心算法的原理,在指标上超过或者低于这些阈值范围的虚拟机都将进行迁移。利用CloudSim作为云数据中心仿真环境的测试结果表明,基于贪心算法的迁移策略与CloudSim中已存在的静态阈值迁移策略和绝对中位差迁移策略比较起来,总体能量消耗少15%,虚拟机迁移次数少60%,平均SLA违规率低5%。     

面向低能耗的虚拟机部署和迁移策略

为提高数据中心的资源利用率并降低能耗,提出了面向低能耗的虚拟机部署和迁移策略,包括虚拟机初始部署算法BT-MPA和虚拟机动态迁移算法MMT-MMA。BT-MPA算法基于回溯法实现虚拟机集合和主机集合的最优初始映射,MMT-MMA算法基于最小迁移时间策略实现虚拟机动态迁移。仿真验证了所提出策略能够在降低数据中心总能耗的同时避免了不必要的迁移开销。     

虚拟化云计算数据中心能量感知资源分配机制

针对云计算的资源管理问题,提出了云计算数据中心的能量模型以及四个虚拟机放置算法。首先计算每个机架上主机的负载并根据设定的阈值进行归类,然后采用最少迁移策略从主机上选择合适迁移的虚拟机并且接受新的虚拟机分配请求,对每个虚拟机与主机集合进行匹配,选择最优化的主机进行放置。实验结果表明,与现有的能量感知资源分配方法相比,该方法在主机、网络设备以及冷却系统方面能量利用率分别提高了2.4%,18.5%和28.1%,总的能量利用率平均提高了14.5%。     

基于迁移技术的云资源动态调度策略研究

现有云资源管理平台存在着瞬时资源利用率峰值易引发迁移、动态负载效果不佳等问题。依据云资源动态调度模型,提出了有效的基于迁移技术的虚拟机动态调度算法。算法将物理节点负载与虚拟机迁移损耗评估、多次触发控制、目标节点定位三者有机结合,实现云计算数据中心高效的动态负载均衡。实验结果表明,该算法优于CloudSim的DVFS调度策略,在保证应用服务水平的同时能减少虚拟机迁移次数和物理机启用数量。     

数据中心虚拟机节能管理机制

大规模数据中心需要消耗大量的电能,由此带来了高额的运营成本以及环境污染等问题。为了降低数据中心的能耗,在构造了数据中心管理模型的基础上,提出了虚拟机静态安置算法与动态调整算法。虚拟机的动态迁移技术能够有效地降低数据中心能耗,提升资源利用率。然而,过度地迁移虚拟机,会影响应用的运行质量,造成SLA违背。动态调整阶段,采用了动态阈值的方法来控制虚拟机的迁移,降低能耗。最后,利用CloudSim平台进行了大量的模拟实验。实验结果表明,所提出的数据中心虚拟机节能管理机制(EAMVM)能够降低能源消耗,减少虚拟机的迁移次数。     

Decentralized cloud datacenter reconsolidation through emergent and topology-aware behavior

Consolidation of multiple applications on a single Physical Machine (PM) within a cloud data center can increase utilization, minimize energy consumption, and reduce operational costs. However, these benefits come at the cost of increasing the complexity of the scheduling problem.In this paper, we present a topology-aware resource management framework. As part of this framework, we introduce a Reconsolidating PlaceMent scheduler (RPM) that provides and maintains durable allocations with low maintenance costs for data centers with dynamic workloads. We focus on workloads featuring both short-lived batch jobs and latency-sensitive services such as interactive web applications. The scheduler assigns resources to Virtual Machines (VMs) and maintains packing efficiency while taking into account migration costs, topological constraints, and the risk of resource contention, as well as the variability of the background load and its complementarity to the new VM.We evaluate the model by simulating a data center with over 65,000 PMs, structured as a three-level multi-rooted tree topology. We investigate trade-offs between factors that affect the durability and operational cost of maintaining a near-optimal packing. The results show that the proposed scheduler can scale to the number of PMs in the simulation and maintain efficient utilization with low migration costs.     

基于自适应过载阈值选择的虚拟机动态整合方法

针对云环境下动态工作负载的不确定性,提出了基于自适应过载阈值选择的虚拟机动态整合方法。为了权衡数据中心能源有效性与服务质量间的关系,将自适应过载阈值的选择问题建模为马尔可夫决策过程,计算过载阈值的最优选择策略,并根据系统能效和服务质量调整阈值。通过过载阈值检测过载物理主机,然后根据最小迁移时间原则以及最小能耗增加放置原则确定虚拟机的迁移策略,最后切换轻负载物理主机至休眠状态完成虚拟机整合。仿真实验结果表明,所提出的方法在减少虚拟机迁移次数方面效果显著,在节约数据中心能源开销与保证服务质量方面表现良好,在能源的有效性与云服务质量二者之间取得了比较理想的平衡。     

Power-efficient distributed scheduling of virtual machines using workload-aware consolidation techniques

There is growing demand on datacenters to serve more clients with reasonable response times, demanding more hardware resources, and higher energy consumption. Energy-aware datacenters have thus been amongst the forerunners to deploy virtualization technology to multiplex their physical machines (PMs) to as many virtual machines (VMs) as possible in order to utilize their hardware resources more effectively and save power. The achievement of this objective strongly depends on how smart VMs are consolidated. In this paper, we show that blind consolidation of VMs not only does not reduce the power consumption of datacenters but it can lead to energy wastage. We present four models, namely the target system model, the application model, the energy model, and the migration model, to identify the performance interferences between processor and disk utilizations and the costs of migrating VMs. We also present a consolidation fitness metric to evaluate the merit of consolidating a number of known VMs on a PM based on the processing and storage workloads of VMs. We then propose an energy-aware scheduling algorithm using a set of objective functions in terms of this consolidation fitness metric and presented power and migration models. The proposed scheduling algorithm assigns a set of VMs to a set of PMs in a way to minimize the total power consumption of PMs in the whole datacenter. Empirical results show nearly 24.9% power savings and nearly 1.2% performance degradation when the proposed scheduling algorithm is used compared to when other scheduling algorithms are used.     

VMMB: Virtual Machine Memory Balancing for Unmodified Operating Systems

Virtualization technology has been widely adopted in Internet hosting centers and cloud-based computing services, since it reduces the total cost of ownership by sharing hardware resources among virtual machines (VMs). In a virtualized system, a virtual machine monitor (VMM) is responsible for allocating physical resources such as CPU and memory to individual VMs. Whereas CPU and I/O devices can be shared among VMs in a time sharing manner, main memory is not amendable to such multiplexing. Moreover, it is often the primary bottleneck in achieving higher degrees of consolidation. In this paper, we present VMMB (Virtual Machine Memory Balancer), a novel mechanism to dynamically monitor the memory demand and periodically re-balance the memory among the VMs. VMMB accurately measures the memory demand with low overhead and effectively allocates memory based on the memory demand and the QoS requirement of each VM. It is applicable even to guest OS whose source code is not available, since VMMB does not require modifying guest kernel. We implemented our mechanism on Linux and experimented on synthetic and realistic workloads. Our experiments show that VMMB can improve performance of VMs that suffers from insufficient memory allocation by up to 3.6 times with low performance overhead (below 1%) for monitoring memory demand.     

Network-aware virtual machine migration in an overcommitted cloud

Virtualization, which acts as the underlying technology for cloud computing, enables large amounts of third-party applications to be packed into virtual machines (VMs). VM migration enables servers to be reconsolidated or reshuffled to reduce the operational costs of data centers. The network traffic costs for VM migration currently attract limited attention.However, traffic and bandwidth demands among VMs in a data center account for considerable total traffic. VM migration also causes additional data transfer overhead, which would also increase the network cost of the data center.This study considers a network-aware VM migration (NetVMM) problem in an overcommitted cloud and formulates it into a non-deterministic polynomial time-complete problem. This study aims to minimize network traffic costs by considering the inherent dependencies among VMs that comprise a multi-tier application and the underlying topology of physical machines and to ensure a good trade-off between network communication and VM migration costs.The mechanism that the swarm intelligence algorithm aims to find is an approximate optimal solution through repeated iterations to make it a good solution for the VM migration problem. In this study, genetic algorithm (GA) and artificial bee colony (ABC) are adopted and changed to suit the VM migration problem to minimize the network cost. Experimental results show that GA has low network costs when VM instances are small. However, when the problem size increases, ABC is advantageous to GA. The running time of ABC is also nearly half than that of GA. To the best of our knowledge, we are the first to use ABC to solve the NetVMM problem.     

A Review of Dynamic Resource Management in Cloud Computing Environments

In a cloud environment, Virtual Machines (VMs) consolidation and resource provisioning are used to address the issues of workload fluctuations. VM consolidation aims to move the VMs from one host to another in order to reduce the number of active hosts and save power. Whereas resource provisioning attempts to provide additional resource capacity to the VMs as needed in order to meet Quality of Service (QoS) requirements. However, these techniques have a set of limitations in terms of the additional costs related to migration and scaling time, and energy overhead that need further consideration. Therefore, this paper presents a comprehensive literature review on the subject of dynamic resource management (i.e., VMs consolidation and resource provisioning) in cloud computing environments, along with an overall discussion of the closely related works. The outcomes of this research can be used to enhance the development of predictive resource management techniques, by considering the awareness of performance variation, energy consumption and cost to efficiently manage the cloud resources.     

基于云预存储技术的Docker在线迁移方法

针对基于Docker容器的分布式云计算下出现负载不均衡问题, 有必要将较高负载服务器中的Docker容器进程迁移到其他相对空闲的服务器上. 而传统的容器迁移算法忽视了容器本身的特征, 从而导致在迁移过程中传输效率低下. 基于此, 利用第三方管理平台和数据预存储阈值机制, 提出一种Docker容器动态迁移预存储算法PF-Docker. 首先将Docker容器内部进程运行相关文件和流动数据预存至云端存储器, 然后通过预存储阈值机制减少流动数据的无效传输, 最后在停机传输阶段将流动数据和冗余数据传输给目的服务器. 实验表明, 该方法在Docker容器迁移中能有效地降低迁移时间, 减少数据传输量, 提高容器的容错率.     

基于微波无线传能的动态无线传能链路多目标规划问题

针对利用无线传能技术对移动无人单元进行动态传能的需求,选取微波无线传能作为传能方式.考虑在无线传能发射端与接收端之间设置中继传能节点的必要性,以及因无人单元连续移动所导致的无线传能链路的动态性,基于这类动态链路上采用不同中继传能节点部署方案所带来的在传能效率、系统成本等指标上的变化,构建一个包含发射端、接收端和可移动能量中继平台的动态无线传能链路多目标规划模型,在此基础上根据决策变量的特点,采用两种不同的进化算法对动态无线传能链路多目标规划模型进行双层迭代求解.求解结果验证了模型的有效性和微波能量中继传输对提高动态无线传能链路平均传能效率的作用.     

StreamTune: dynamic resource scheduling approach for workload skew in video data center

Video surveillance applications need video data center to provide elastic virtual machine (VM) provisioning. However, the workloads of the VMs are hardly to be predicted for online video surveillance service. The unknown arrival workloads easily lead to workload skew among VMs. In this paper, we study how to balance the workload skew on online video surveillance system. First, we design the system framework for online surveillance service which consists of video capturing and analysis tasks. Second, we propose StreamTune, an online resource scheduling approach for workload balancing, to deal with irregular video analysis workload with the minimum number of VMs. We aim at timely balancing the workload skew on video analyzers without depending on any workload prediction method. Furthermore, we evaluate the performance of the proposed approach using a traffic surveillance application. The experimental results show that our approach is well adaptive to the variation of workload and achieves workload balance with less VMs.