基于负载不确定性的虚拟机整合方法

物理主机工作负载的不确定性容易造成物理主机过载和资源利用率低,从而影响数据中心的能源消耗和服务质量。针对该问题,通过分析物理主机的工作负载记录与虚拟机资源请求的历史数据,提出了基于负载不确定性的虚拟机整合（WU-VMC）方法。为了稳定云数据中心各主机的工作负载,该方法首先利用虚拟机的资源请求拟合物理主机工作负载,并利用梯度下降方法计算虚拟机与物理主机的虚拟机匹配度;然后,利用匹配度进行虚拟机整合,从而解决负载不确定造成的能耗增加和服务质量下降等问题。仿真实验结果表明,WU-VMC方法降低了数据中心的能源消耗,减少了虚拟机迁移次数,提高了数据中心的资源利用率及服务质量。     

基于模糊动态阈值机制的能效虚拟机合并决策方法

动态虚拟机合并是云数据中心改善功耗和资源利用率的有效方法,但负载变化使数据中心较难维持服务等级协议SLA和最优能效.针对该问题,提出一种模糊动态阈值方法对虚拟机合并过程进行决策,在动态负载环境下实现最小化的虚拟机迁移量.该算法利用模糊推理系统动态调整主机资源利用阈值,使得超载主机上的虚拟机迁移大幅降低,并可以满足服务等...     

An imperialist competitive algorithm for virtual machine placement in cloud computing

Abstract

Cloud computing, the recently emerged revolution in IT industry, is empowered by virtualisation technology. In this paradigm, the user’s applications run over some virtual machines (VMs). The process of selecting proper physical machines to host these virtual machines is called virtual machine placement. It plays an important role on resource utilisation and power efficiency of cloud computing environment. In this paper, we propose an imperialist competitive-based algorithm for the virtual machine placement problem called ICA-VMPLC. The base optimisation algorithm is chosen to be ICA because of its ease in neighbourhood movement, good convergence rate and suitable terminology. The proposed algorithm investigates search space in a unique manner to efficiently obtain optimal placement solution that simultaneously minimises power consumption and total resource wastage. Its final solution performance is compared with several existing methods such as grouping genetic and ant colony-based algorithms as well as bin packing heuristic. The simulation results show that the proposed method is superior to other tested algorithms in terms of power consumption, resource wastage, CPU usage efficiency and memory usage efficiency.     

一种能耗-性能协调优化的虚拟机重放置策略

在云计算环境中虚拟机重放置方法方面,现有多数算法通常聚焦单一目标的优化,而聚焦一个单一目标通常会牺牲其他目标来达到最优效果,因此有必要考虑多目标权衡的虚拟机重放置方法。以降低能耗和保证虚拟机的服务质量为目标,提出一种能耗-性能协调的虚拟机重放置优化算法,即能耗-性能优化配合降序最佳适应算法（Energy-Performance awareness best fit descending virtual machine relocating,EPAR）,把资源使用率转化为能耗,同时权衡了能耗和性能之间的关系。该算法在选择重放置虚拟机时使用自回归模型预测下一时间段的性能。通过原型验证,EPAR算法能够在确保虚拟机服务的情况下,有效降低宿主机的能耗,避免不必要的虚拟机的迁移。     

A two-stage approach for task and resource management in multimedia cloud environment

In recent years, multimedia cloud computing is becoming a promising technology that can effectively process multimedia services and provide quality of service (QoS) provisioning for multimedia applications from anywhere, at any time and on any device at lower costs. However, there are two major challenges exist in this emerging computing paradigm: one is task management, which maps multimedia tasks to virtual machines, and the other is resource management, which maps virtual machines (VMs) to physical servers. In this study, we aim at providing an efficient solution that jointly addresses these challenges. In particular, a queuing based approach for task management and a heuristic algorithm for resource management are proposed. By adopting allocation deadline in each VM request, both task manager and VM allocator receive better chances to optimize the cost while satisfying the constraints on the quality of multimedia service. Various simulations were conducted to validate the efficiency of the proposed task and resource management approaches. The results showed that the proposed solutions provided better performance as compared to the existing state-of-the-art approaches.     

云计算环境下基于多目标优化的虚拟机放置研究

云数据中心的规模日益增长导致其产生的能源消耗及成本呈指数级增长。虚拟机的放置是提高云计算环境服务质量与节约成本的核心。针对传统的虚拟机放置算法存在考虑目标单一化和多目标优化难以找到最优解的问题,提出一种面向能耗、资源利用率、负载均衡的多目标优化虚拟机放置模型。通过改进蚁群算法求解优化模型,利用其信息素正反馈机制和启发式搜索寻找最优解。实验结果表明,该算法综合性能表现良好,符合云环境对高效率低能耗的要求。     

数据中心网络拓扑感知型能耗优化算法

针对数据中心网络中高能耗的问题,提出了一种拓扑感知型能耗优化算法。算法首先根据广义超立方体拓扑多维正交和单维全连接的结构特性,优化虚拟机的部署位置,进而提出多维最佳适应策略来充分利用服务器各维资源。然后利用虚拟机资源需求预测模型并结合迁移代价公式,均衡考虑服务器资源使用代价、虚拟机通信代价和迁移资源消耗,在合理迁移虚拟机以满足系统性能的前提下,降低了网络的能耗并且缓解了网络链路的拥塞。最终将网络的能耗优化问题转化成虚拟机在服务器上的优化配置问题。实验结果表明,与其他三种算法比较,算法在降低系统能耗和减少拥塞方面获得了良好的效果。     

Dynamic forecast scheduling algorithm for virtual machine placement in cloud computing environment

In most cloud computing platforms, the virtual machine quotas are seldom changed once initialized, although the current allocated resources are not efficiently utilized. The average utilization of cloud servers in most datacenters can be improved through virtual machine placement optimization. How to dynamically forecast the resource usage becomes a key problem. This paper proposes a scheduling algorithm called virtual machine dynamic forecast scheduling (VM-DFS) to deploy virtual machines in a cloud computing environment. In this algorithm, through analysis of historical memory consumption, the most suitable physical machine can be selected to place a virtual machine according to future consumption forecast. This paper formalizes the virtual machine placement problem as a bin-packing problem, which can be solved by the first-fit decreasing scheme. Through this method, for specific virtual machine requirements of applications, we can minimize the number of physical machines. The VM-DFS algorithm is verified through the CloudSim simulator. Our experiments are carried out on different numbers of virtual machine requests. Through analysis of the experimental results, we find that VM-DFS can save 17.08 % physical machines on the average, which outperforms most of the state-of-the-art systems.     

基于离散人工蜂群算法的云任务调度优化

针对现今云计算任务调度只考虑单目标和云计算应用对虚拟资源的服务的质量要求高等问题,综合考虑了用户最短等待时间、资源负载均衡和经济原则,提出一种离散人工蜂群(ABC)算法的云任务调度优化策略。首先,从理论上建立了云任务调度的多目标数学模型;然后,结合偏好满意度策略并引入局部搜索算子和改变侦察蜂搜索方式,提出多目标离散型人工蜂群(MDABC)算法的优化策略。通过不同的云任务调度仿真实验,显示了改进离散人工蜂群算法相对于基础离散人工蜂群算法、遗传算法以及经典贪心算法,能够得到较高的综合满意度,表明了改进离散人工蜂群算法能够更好地改善虚拟资源中云任务调度系统的性能,具有一定的普适性。     

双层虚拟化云架构下任务调度能耗优化算法

虚拟机上部署容器的双层虚拟化云架构在云数据中心中的使用越来越广泛。为了解决该架构下云数据中心的能耗问题,提出了一种工作流任务调度算法TUMS-RTC。针对有截止时间约束的并行工作流,算法将调度过程划分为时间利用率最大化调度和运行时间压缩两个阶段。时间利用率最大化调度通过充分使用给定的时间范围减少完成工作流所需的虚拟机和服务器数量;运行时间压缩阶段通过压缩虚拟机空闲时间以缩短虚拟机和服务器的工作时间,最终达到降低能耗的目标。使用大量特征可控的随机工作流对TUMS-RTC算法的性能进行了测试。实验结果表明,TUMS-RTC算法相较于对比算法有更高的资源利用率,虚拟机数量减少率和能耗节省率,并且可以很好地处理云计算中规模大且并行度高的工作流。     

Profile-based dynamic application assignment with a repairing genetic algorithm for greener data centers

Data centers have become essential to modern society by catering to increasing number of Internet users and technologies. This results in significant challenges in terms of escalating energy consumption. Research on green initiatives that reduce energy consumption while maintaining performance levels is exigent for data centers. However, energy efficiency and resource utilization are conflicting in general. Thus, it is imperative to develop an application assignment strategy that maintains a trade-off between energy and quality of service. To address this problem, a profile-based dynamic energy management framework is presented in this paper for dynamic application assignment to virtual machines (VMs). It estimates application finishing times and addresses real-time issues in application resource provisioning. The framework implements a dynamic assignment strategy by a repairing genetic algorithm (RGA), which employs realistic profiles of applications, virtual machines and physical servers. The RGA is integrated into a three-layer energy management system incorporating VM placement to derive actual energy savings. Experiments are conducted to demonstrate the effectiveness of the dynamic approach to application management. The dynamic approach produces up to 48% better energy savings than existing application assignment approaches under investigated scenarios. It also performs better than the static application management approach with 10% higher resource utilization efficiency and lower degree of imbalance.     

Autonomic cloud resource provisioning and scheduling using meta-heuristic algorithm

We investigate that resource provisioning and scheduling is a prominent problem due to heterogeneity as well as dispersion of cloud resources. Cloud service providers are building more and more datacenters due to demand of high computational power which is a serious threat to environment in terms of energy requirement. To overcome these issues, we need an efficient meta-heuristic technique that allocates applications among the virtual machines fairly and optimizes the quality of services (QoS) parameters to meet the end user objectives. Binary particle swarm optimization (BPSO) is used to solve real-world discrete optimization problems but simple BPSO does not provide optimal solution due to improper behavior of transfer function. To overcome this problem, we have modified transfer function of binary PSO that provides exploration and exploitation capability in better way and optimize various QoS parameters such as makespan time, energy consumption, and execution cost. The computational results demonstrate that modified transfer function-based BPSO algorithm is more efficient and outperform in comparison with other baseline algorithm over various synthetic datasets.

     

Many-Objective Virtual Machine Placement

The process of selecting which virtual machines (VMs) should be executed at each physical machine (PM) of a virtualized infrastructure is commonly known as Virtual Machine Placement (VMP). This work presents a general many-objective optimization framework that is able to consider as many objective functions as needed when solving a VMP problem in a pure multi-objective context. As an example of utilization of the proposed framework, a formulation of a many-objective VMP problem (MaVMP) is proposed, considering the simultaneous optimization of the following five objective functions: (1) power consumption, (2) network traffic, (3) economical revenue, (4) quality of service and (5) network load balancing. To solve the formulated MaVMP problem, an interactive memetic algorithm is proposed. Experimental results prove the correctness of the proposed algorithm, its effectiveness converging to a manageable number of solutions and its capabilities to solve problem instances with large numbers of PMs and VMs.     

云应用资源交付与分裂聚类调度方法

针对私有云环境中资源交付与调度的高效实现问题,提出一种面向云应用的资源交付调度及实现方法。该方法以云应用元模型为核心,根据模型中虚拟机间数据交互特征生成最小生成树,采用图论分裂聚类算法拆分虚拟机集合并映射物理主机。通过对比分析面向虚拟机调度的实验数据,证明该方法能在提升云应用整体性能的同时降低云应用对物理网络设备及带宽资源的占用。     

基于灰色关联度的云计算虚拟机分配方法

针对云计算系统中资源利用率提高和系统能耗降低之间的协调问题,提出了一种新的基于灰色关联度的虚拟机分配方法,应用灰色关联度的基本理论建立了基于服务层协议(SLA)违背率、系统能耗和服务器负载评价函数的虚拟机分配决策模型,构造了基于灰色关联度的虚拟机分配算法,并在CloudSim仿真平台上进行了实验。实验结果表明,与传统的基于简单线性权重的多目标优化方法相比,在不同的虚拟机选择策略下,基于灰色关联度的虚拟机分配方法在系统能耗、SLA违背率和虚拟机迁移次数上平均降低〖BP(〗是提高吗？应该是降低吧？请明确一下。〖BP)〗了6.8%、5.2%和15.5%。因此,所提方法在不同的虚拟机选择策略下能够大幅度减少虚拟机迁移次数,较好地满足系统在能耗和SLA违背率上的优化需求。     

基于DVFS感知与虚拟机动态合并的云数据中心能效策略

为了解决云数据中心资源分配时能耗与性能间的均衡问题,提出了一种基于DVFS感知与虚拟机动态合并的能效优化策略。首先,策略通过新的DVFS管理算法（DVFS-perf）在不降低系统性能的同时降低了数据中心功耗,然后,通过频率感知的虚拟机VM部署合并算法（Frequency-aware Placement）在实现DVFS最优配置的同时最小化总体能耗,同时确保了虚拟机映射时的QoS保障。最后,通过真实云负载数据流构建仿真实验进行了性能分析。结果表明,在动态负载条件下,策略可以在不降低QoS和不增加SLA违例的情况下,降低虚拟机迁移次数和数据中心的总体能耗,更好地实现能耗与性能的均衡。     

一种时延约束下可靠性保证的服务功能链部署方法

针对网络功能虚拟化环境中底层网络物理节点随机失效导致网络服务中断问题,提出了一种兼顾网络服务可靠性和时延约束的服务功能链部署方法以保证网络服务的可靠性。首先提出一种相邻虚拟网络功能备份实例资源共享的备份机制和单路径与多路径混合的路由策略,然后对时延约束下服务功能链可靠性部署问题建立混合整数线性规划模型,并设计了基于K最短路径扩展的服务功能链部署算法。仿真结果表明,与现有方法相比,该方法降低了节点和带宽资源开销,并提高了网络服务请求接受率。     

基于资源需求分布特征的异构云环境虚拟机放置算法

针对异构云环境中的虚拟机放置（VMP）问题,提出一种基于虚拟机资源需求分布特征的放置算法（RDDFPA）。首先,建立基于CPU资源和内存资源比例系数的虚拟机需求和物理机配置描述方法,并根据该比例系数对所有虚拟机进行排序;其次,通过分析虚拟机需求与物理机配置各自在CPU资源和内存资源比例方面的关系,确定比例分界点,完成虚拟机集合的划分,每个虚拟机子集合的规模反映出对相匹配的不同配置物理机的需求比例;最后,利用启发式算法如首次适应（First Fit）算法完成虚拟机子集合在相匹配配置的物理机子集合上的放置。理论分析和仿真实验结果表明,与采用任意单一配置的物理机总数量相比,所提算法所需物理机的总台数减少了2%~17%。RDDFPA能够根据虚拟机资源需求分布的不同,确定各类配置物理机的数量,高效完成虚拟机的放置,在提高资源利用率的同时,降低了系统能耗。     

人工鱼群算法在虚拟机分配中的应用

虚拟机分配是云数据中心的一个重要任务,它实现物理机和虚拟机的映射,这对整个云数据中心中计算集群的性能,响应时间和服务质量有重要影响。需要采用一定的虚拟机分配策略来保障在同一集群中自动地完成虚拟机分配,以便达到物理机集群的负载均衡,虚拟机迁移次数最小并且节能环保等目的。提出了一种添加新型行为策略的人工鱼群算法,并将该算法成功应用于虚拟机分配问题的求解。与多种虚拟机分配算法的对比结果表明,算法能更快获得符合云数据中心多个需求的分配方案,对于其他实时性要求较高的组合优化问题同样具有应用价值。     

Improving performance by network-aware virtual machine clustering and consolidation

Modern data center consists of thousands of servers, racks and switches. Complicated structure means it requires well-designed algorithms to utilize resources of data centers efficiently. Current virtual machine scheduling algorithms mainly focus on the initial allocation of virtual machines based on the CPU, memory and network bandwidth requirements. However, when tasks finished or lease expired, related virtual machines would be deleted from the system which would generate resource fragments. Such fragments lead to unbalanced resource utilization and decline of communication performance. This paper investigates the network influence on typical applications in data centers and proposed a self-adaptive network-aware virtual machine clustering and consolidation algorithm to maintain an optimal system-wide status. Our consolidation algorithm periodically checks whether consolidation is necessary and then clusters and consolidates virtual machines to lower communication cost with an online heuristic. We used two benchmarks in a real environment to examine network influence on different tasks. To evaluate the advantages of the proposed algorithm, we also built a cloud computing testbed. Real workload trace-driven simulations and testbed-based experiments showed that, our algorithm greatly shortened the average finish time of map-reduce tasks and reduced time delay of web applications. Simulation results showed that our algorithm considerably reduced the amount of high-delay jobs, lowered the average traffic passed through aggregate switches and improved the communication ability among virtual machines.