云环境中多目标优化的虚拟机放置算法

虚拟机放置（VMP）是虚拟机整合的核心,是一个多资源约束的多目标优化问题。高效的VMP算法不仅能显著地降低云数据中心能耗、提高资源利用率,还能保证服务质量（QoS）。针对数据中心能耗高和资源利用率低的问题,提出了基于离散蝙蝠算法的虚拟机放置（DBA-VMP）算法。首先,把最小化能耗和最大化资源利用率作为优化目标,建立多目标约束的VMP优化模型;然后,通过效仿人工蚁群在觅食过程中共享信息素的机制,将信息素反馈机制引入蝙蝠算法,并对经典蝙蝠算法进行离散化改进;最后,用改进的离散蝙蝠算法求解模型的Pareto最优解。实验结果表明,与其他多目标优化的VMP算法相比,所提算法在使用不同数据集的情况下都能有效降低能耗,提高资源利用率,实现了在保证QoS的前提下的降低能耗和提高资源利用率两者之间的优化平衡。     

高效能云计算虚拟机优化部署策略

针对云计算应用负载需求的动态变化特性,提出了一种自适应虚拟机优化部署策略。算法通过基于强局部加权回归的热点发现机制,可以根据负载所体现的资源占用历史信息动态决策主机的超载时机;通过迁移周期最优算法MPM和迁移量最少算法MNM进行超载主机的迁移虚拟机选择;提出基于功耗感知的PBFDH算法对迁移虚拟机再次优化部署。实验结果表明,算法不仅可以降低能耗,还可以降低SLA违例率。     

云环境下基于模糊隶属度的虚拟机放置算法

虚拟机放置问题是云数据中心资源调度的核心问题之一,它对数据中心的性能、资源利用率和能耗有着重要的影响。针对此问题,以降低数据中心能耗、改善资源利用率和保证服务质量(QoS)为优化目标,借助模糊聚类的思想提出了一种基于模糊隶属度的虚拟机放置算法。首先,结合物理主机过载概率和虚拟机与物理主机之间的相适性放置关系,提出了新的距离度量方法;然后,根据模糊隶属度函数计算得出虚拟机与物理主机之间的相适性模糊隶属度矩阵;最后,借助能耗感知机制,在模糊隶属度矩阵中进行局部搜索从而获得迁移虚拟机的最优放置方案。仿真实验结果表明,提出的算法在降低云数据中心能耗、改善资源利用率和保证QoS方面表现比较优异。     

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.     

An efficient energy-aware method for virtual machine placement in cloud data centers using the cultural algorithm

Excessive consumption of energy in cloud data centers whose number is increasing day by day has led to substantial problems. Hence, offering efficient schemes for virtual machine (VM) placement to decrease energy consumption in cloud computing environments has become a significant research field in recent years. In this paper, with the goal of reducing energy consumption in cloud data centers, we present a VM placement method using the cultural algorithm. In the proposed algorithm called balance-based cultural algorithm for virtual machine placement (BCAVMP), a new fitness function is introduced to evaluate VM allocation solutions. In this function, by using the sum of balance vector lengths for each VM placement, balanced utilization of resources is considered. Also, by applying the amount of energy usage in the fitness function, solutions with lower energy consumption are intended. The performance of the proposed method is evaluated using CloudSim simulator. The simulation results indicate that by appropriate VM assignment and resource wastage reduction, energy consumption in cloud data centers can be decreased.

     

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.     

云计算中能耗和性能感知的虚拟机优化部署算法

优化虚拟机部署是数据中心降低能耗的一个重要方法。目前大多数虚拟机部署算法都明显地降低了能耗,但过度虚拟机整合和迁移引起了系统性能较大的退化。针对该问题,首先构建虚拟机优化部署模型。然后提出一种二阶段迭代启发式算法来求解该模型,第一阶段是基于首次适应下降装箱算法,提出一种虚拟机优化部署算法,目标是最小化主机数;第二阶段是提出了一种虚拟机在线迁移选择算法,目标是最小化待迁移虚拟机数。实验结果表明,该算法能够有效地降低能耗,具有较低的服务等级协定(SLA)违背率和较好的时间性能。     

基于家族遗传算法的虚拟机放置策略

提出一种基于家族遗传算法的虚拟机放置策略FGA-VMP(family genetic algorithm based virtual machine place-ment).采用一个自调节的变异算子(mutation operator)避免普通遗传算法的早熟问题;把整个种群划分为多个家族,将这些家族的进化操作并行处理,...     

云计算环境下的虚拟机快速克隆技术

虚拟机克隆技术是指在云计算环境下快速复制出多个虚拟机（VM）并将这些VM分发到多台物理主机上,克隆出来的VM共享相同的初始状态然后独立运行提供服务。虚拟机克隆使得云计算提供商能够快速有效地部署系统资源。给出了一种虚拟机快速克隆方法,利用写时拷贝技术来创建虚拟磁盘和内存状态的快照,然后用按需分配内存技术和多点传送技术来请求和传输这些状态信息。在C3云平台上的实验表明,此方法在不中断源虚拟机中运行服务的情况下,实现了云计算中的快速虚拟机克隆。     

An energy-efficient cuckoo search algorithm for virtual machine placement in cloud computing data centers

The Journal of Supercomputing - The advent of virtualization technology has created a huge potential application for cloud computing. In virtualization, a large hardware resource is often broken...     

云环境下副本优化放置策略研究

为了提高云计算数据调度和副本访问的效率,对副本策略中的副本放置问题进行研究,提出一种基于蚁群算法的副本放置策略。根据自然界中蚁群觅食的原理,把蚁群算法应用于副本放置的整个过程; 利用信息素的动态更新以及拉普拉斯概率分布改进的蚁群算法得出一组最优解进行副本放置。在CloudSim平台上进行了仿真模拟,实验结果表明,提出的方案在平均作业完成时间、网络利用率和负载均衡度上均优于原始蚁群算法,并在一定程度上降低了副本放置的时间消耗和网络负载。     

An efficient and secure approach for a cloud collaborative editing

The demand for cloud-based collaborative editing service is rising along with the tremendously increased popularity in cloud computing. In the cloud-based collaborative editing environment, the data are stored in the cloud and able to be accessed from everywhere through every compatible device with the Internet. The information is shared with every accredited user in a group. In other words, multiple authorized users of the group are able to work on the same document and edit the document collaboratively and synchronously online. Meanwhile, during the whole collaborative editing process, the encryption technique is eventually applied to protect and secure the data. The encryption for the collaborative editing, however, could require much time to operate. To elevate the efficiency of the encryption, this study first analyzes the text editing in the collaborative service and presents a framework of the Red–Black tree, named as rbTree-Doc. The rbTree-Doc can reduce the amount of data to be encrypted. Although the trade-off for creating the Red–Black tree introduces extra cost, the experimental results of using rbTree-Doc in text editing operations, such as insertion and removal, show improved efficiency compared with other whole-document encryption strategy. Using rbTree-Doc, the efficiency is improved by 31.04% compared to that 3DES encryption is applied and by 23.94% compared to that AES encryption is applied.     

基于WFPSO算法的云虚拟机放置策略

随着云计算技术的大规模应用,云应用的交互更加依赖于网络,较差网络拓扑的选择,增加了应用在网络中的通信流量,严重影响应用的运行效率和服务质量。为解决此问题,提出了一种基于粒子群优化算法的虚拟机放置策略。该策略通过建立云环境内部时延模型,利用改进的粒子群优化算法求解目标函数,来降低应用的时延,提高运行效率。并在CloudSim平台上进行仿真实验,实验结果表明,该策略的响应时间低于基本粒子群优化算法（PSO）,并且修改后的PSO算法在不影响收敛精度的前提下较大幅度地提高粒子群算法的收敛速度,提高了云环境中应用的运行效率。     

私有云平台的虚拟机内存调度策略

在私有云平台中,现有的方法无法灵活地对虚拟机内存资源进行有效的监控和分配。针对以上问题,提出了内存实时监测和动态调度(MMS)模型,利用libvirt函数库和Xen提供的libxc函数库实现了对虚拟机内存紧缺、内存空闲时的实时监测和动态调度,并且提出虚拟机迁移策略,有效地缓解宿主机的内存紧缺问题。最后选取一台物理机作为主控节点,两台物理机作为子节点,利用Eucalyptus搭建一个小型的私有云平台。结果显示,当宿主机处于内存紧缺状态时,MMS系统通过启动虚拟机迁移策略有效地释放了内存空间;当虚拟机占用内存逼近初始最大内存时,MMS为其分配新的最大内存;当占用内容降低时,MMS系统对部分空闲的内存资源进行了回收,而且释放内存不超过150MB(最大内存512MB)时,其对虚拟机性能的影响不大。结果表明该模型对私有云平台中虚拟机内存进行实时监测和动态调度是有效的。     

一种新的蚁群算法优化的虚拟机放置策略

提出了一种新的蚁群算法优化的虚拟机放置策略ACA-VMP (Ant Colony Algorithm based virtual machine placement);ACA-VMP以云数据中心的总体能量消耗降低、服务质量最佳及减少虚拟机迁移次数为目标函数;根据蚁群优化算法,ACA-VMP采用了全局最优解和局部最优解信息素强度更新规则;全局最优解经过多次迭代后,蚂蚁路径的多次寻优,保证这个虚拟机放置优化策略的完成;局部信息素强度参数更新可以补充蚂蚁其他局部最优路径的寻找,这样也可以使得ACA-VMP虚拟机放置优化算法更快的接近全局最优解;仿真结果表明:ACA-VMP策略使得云数据中心的各类性能指标都可以改善,该实验结果对于其他企业构造节能云数据中心有很好的参考价值.     

FlatVC:云环境下虚拟机集群的扁平化版本控制

IaaS的发展使得云服务能够快速地部署虚拟机集群。然而,在部署过程中虚拟机群的版本控制效率不高。目前的版本控制方法存在网络负载大、操作速度慢的问题。提出一种新颖的虚拟机集群版本控制方法,叫做FlatVC。FlatVC在计算节点增量地生成虚拟机版本,以避免将版本数据传输至存储节点,并在虚拟机版本恢复时按需传输版本数据,因此减小了网络传输负载并加速了版本控制过程。通过使用缓存树结构来共享网络传输数据,FlatVC减小了根节点数据传输压力。此外,我们针对增量版本所构成的版本链进行了I/O优化,避免了版本链导致的性能下降。实验结果显示,FlatVC能有效地实施虚拟机集群版本控制,加速版本生成以及恢复过程。     

An efficient scheduling optimization strategy for improving consistency maintenance in edge cloud environment

The development of Internet of Things leads to an increase in edge devices, and the traditional cloud is unable to meet the demands of the low latency of numerous devices in edge area. On the hand, the media delivery requires high-quality solution to meet ever-increasing user demands. The edge cloud paradigm is put forward to address the issues, which facilitates edge devices to acquire resources dynamically and rapidly from nearby places. However, in order to complete as many tasks as possible in a limited time to meet the needs of users, and to complete the consistency maintenance in as short a time as possible, a two-level scheduling optimization scheme in an edge cloud environment is proposed. The first-level scheduling is by using our proposed artificial fish swarm-based job scheduling method, most jobs will be scheduled to edge data centers. If the edge data center does not have enough resource to complete, the job will be scheduled to centralized cloud data center. Subsequently, the job is divided into same-sized tasks. Then, the second-level scheduling, considering balance load of nodes, the edge cloud task scheduling is proposed to decrease completion time, while the centralized cloud task scheduling is presented to reduce total cost. The experimental results show that our proposed scheme performs better in terms of minimizing latency and completion time, and cutting down total cost.

     

A multi-objective Monarch Butterfly Algorithm for virtual machine placement in cloud computing

Neural Computing and Applications - The growing demand for cloud computing adoption presents more challenges for researchers to make cloud computing more efficient and affordable for infrastructure...     

Time efficient secure DNA based access control model for cloud computing environment

The uses of Big Data (BD) are gradually increasing in many new emerging applications, such as Facebook, eBay, Snapdeal, etc. BD is a term, which is used for describing a large volume of data. The data security is always a big concern of BD. Besides the data security, other issues of BD are data storage, high data accessing time, high data searching time, high system overhead, server demand, etc. In this paper, a new access control model has been proposed for BD to solve all these issues, where fast accessing of the large volume of data are provided based on the data size Here, a long 512-bit Deoxyribonucleic Acid (DNA) based key sequence has been used for improving the data security, and it is secured against the collision attack, man-in-the-middle attack, internal attack, etc. The proposed scheme is evaluated in terms of both theoretical and experimental results, which show the proficiency of the proposed scheme over the existing schemes.     

Energy-credit scheduler: An energy-aware virtual machine scheduler for cloud systems

Virtualization facilitates the provision of flexible resources and improves energy efficiency through the consolidation of virtualized servers into a smaller number of physical servers. As an increasingly essential component of the emerging cloud computing model, virtualized environments bill their users based on processor time or the number of virtual machine instances. However, accounting based only on the depreciation of server hardware is not sufficient because the cooling and energy costs for data centers will exceed the purchase costs for hardware. This paper suggests a model for estimating the energy consumption of each virtual machine without dedicated measurement hardware. Our model estimates the energy consumption of a virtual machine based on in-processor events generated by the virtual machine. Based on this estimation model, we also propose a virtual machine scheduling algorithm that can provide computing resources according to the energy budget of each virtual machine. The suggested schemes are implemented in the Xen virtualization system, and an evaluation shows that the suggested schemes estimate and provide energy consumption with errors of less than 5% of the total energy consumption.