A Service Level Agreement Aware Online Algorithm for Virtual Machine Migration

The demand for cloud computing has increased manifold in the recent past.More specifically,on-demand computing has seen a rapid rise as organizations rely mostly on cloud service providers for their day-to-day computing needs.The cloud service provider fulfills different user requirements using virtualization-where a single physical machine can host multiple VirtualMachines.Each virtualmachine potentially represents a different user environment such as operating system,programming environment,and applications.However,these cloud services use a large amount of electrical energy and produce greenhouse gases.To reduce the electricity cost and greenhouse gases,energy efficient algorithms must be designed.One specific area where energy efficient algorithms are required is virtual machine consolidation.With virtualmachine consolidation,the objective is to utilize the minimumpossible number of hosts to accommodate the required virtual machines,keeping in mind the service level agreement requirements.This research work formulates the virtual machine migration as an online problem and develops optimal offline and online algorithms for the single host virtual machine migration problem under a service level agreement constraint for an over-utilized host.The online algorithm is analyzed using a competitive analysis approach.In addition,an experimental analysis of the proposed algorithm on real-world data is conducted to showcase the improved performance of the proposed algorithm against the benchmark algorithms.Our proposed online algorithm consumed 25%less energy and performed 43%fewer migrations than the benchmark algorithms.

A Resource Management Algorithm for Virtual Machine Migration in Vehicular Cloud Computing

In recent years,vehicular cloud computing(VCC)has gained vast attention for providing a variety of services by creating virtual machines(VMs).These VMs use the resources that are present in modern smart vehicles.Many studies reported that some of these VMs hosted on the vehicles are overloaded,whereas others are underloaded.As a circumstance,the energy consumption of overloaded vehicles is drastically increased.On the other hand,underloaded vehicles are also drawing considerable energy in the underutilized situation.Therefore,minimizing the energy consumption of the VMs that are hosted by both overloaded and underloaded is a challenging issue in the VCC environment.The proper and efcient utilization of the vehicle’s resources can reduce energy consumption signicantly.One of the solutions is to improve the resource utilization of underloaded vehicles by migrating the over-utilized VMs of overloaded vehicles.On the other hand,a large number of VM migrations can lead to wastage of energy and time,which ultimately degrades the performance of the VMs.This paper addresses the issues mentioned above by introducing a resource management algorithm,called resource utilization-aware VM migration(RU-VMM)algorithm,to distribute the loads among the overloaded and underloaded vehicles,such that energy consumption is minimized.RU-VMM monitors the trend of resource utilization to select the source and destination vehicles within a predetermined threshold for the process of VM migration.It ensures that any vehicles’resource utilization should not exceed the threshold before or after the migration.RU-VMM also tries to avoid unnecessary VM migrations between the vehicles.RU-VMM is extensively simulated and tested using nine datasets.The results are carried out using three performance metrics,namely number of nal source vehicles(nfsv),percentage of successful VM migrations(psvmm)and percentage of dropped VM migrations(pdvmm),and compared with threshold-based algorithm(i.e.,threshold)and cumulative sum(CUSUM)algorithm.The comparisons show that the RU-VMM algorithm performs better than the existing algorithms.RU-VMM algorithm improves 16.91%than the CUSUM algorithm and 71.59%than the threshold algorithm in terms of nfsv,and 20.62%and 275.34%than the CUSUM and threshold algorithms in terms of psvmm.

Layered virtual machine migration algorithm for network resource balancing in cloud computing

Due to the increasing sizes of cloud data centers, the number of virtual machines （VMs） and applications rises quickly. The rapid growth of large scale Internet services re- suits in unbalanced load of network resource. The bandwidth utilization rate of some physical hosts is too high, and this causes network congestion. This paper presents a layered VM migration algorithm （LVMM）. At first, the algorithm will divide the cloud data center into several regions according to the bandwidth utilization rate of the hosts. Then we bal- ance the load of network resource of each region by VM migrations, and ultimately achieve the load balance of net- work resource in the cloud data center. Through simulation experiments in different environments, it is proved that the LVMM algorithm can effectively balance the load of network resource in cloud computing.

Improved Metaheuristic Based Failure Prediction with Migration Optimization in Cloud Environment

Cloud data centers consume high volume of energy for processing and switching the servers among different modes.Virtual Machine(VM)migration enhances the performance of cloud servers in terms of energy efficiency,internal failures and availability.On the other end,energy utilization can be minimized by decreasing the number of active,underutilized sources which conversely reduces the dependability of the system.In VM migration process,the VMs are migrated from underutilized physical resources to other resources to minimize energy utilization and optimize the operations.In this view,the current study develops an Improved Metaheuristic Based Failure Prediction with Virtual Machine Migration Optimization(IMFP-VMMO)model in cloud environment.The major intention of the proposed IMFP-VMMO model is to reduce energy utilization with maximum performance in terms of failure prediction.To accomplish this,IMFPVMMO model employs Gradient Boosting Decision Tree(GBDT)classification model at initial stage for effectual prediction of VM failures.At the same time,VMs are optimally migrated using Quasi-Oppositional Artificial Fish Swarm Algorithm(QO-AFSA)which in turn reduces the energy consumption.The performance of the proposed IMFP-VMMO technique was validated and the results established the enhanced performance of the proposed model.The comparative study outcomes confirmed the better performance of the proposed IMFP-VMMO model over recent approaches.

Data Center Network Architecture

1 Introduction The history of data centers can be traced back to the 1960s. Early data centers were deployed on main- frames that were time-shared by users via remote terminals. The boom in data centers came duringthe internet era. Many companies started building large inter- net-connected facililies,

An Effective QoS-Constrained Scheduling Scheme for Cloud Computing Services

Cloud computing is becoming a hot topic of the information industry in recent years. Many companies provide the cloud services, such as Google Apps and Apple multimedia services. In general, by applying the virtulization technologies, the data center is built for cloud computing to provide users with the eomputing and storage resources, as well as the software environment. Thus, the quality of service （QoS） must be considered to satisfy users＇ requirements. This paper proposes a high efficiency scheduling scheme for supporting cloud computing. The virtual machine migration technique has been applied to the proposed scheduling scheme for improving the resources utilization and satisfying the QoS requirement of users. The experimental results show that in addition to satisfying the QoS requirement of users, the proposed scheme can improve the resources utilization effectively.

VM migration algorithm for the balance of energy resource across data centers in cloud computing

Cloud computing makes it possible for users to share computing power.The framework of multiple data centers gains a greater popularity in modern cloud computing.Due to the uncertainty of the requests from users,the loads of center processing unit(CPU)of different data centers differ.High CPU utilization rate of a data center affects the service provided for users,while low CPU utilization rate of a data center causes high energy consumption.Therefore,it is important to balance the CPU resource across data centers in modern cloud computing framework.A virtual machine(VM)migration algorithm was proposed to balance the CPU resource across data centers.The simulation results suggest that the proposed algorithm has a good performance in the balance of CPU resource across data centers and reducing energy consumption.

Energy-aware VM migration using dragonfly–crow optimization and support vector regression model in Cloud

Nowadays,virtual machine migration(VMM)is a trending research since it helps in balancing the load of the Cloud effectively.Several VMM-based strategies defined in the literature have considered various metrics,such as load,energy,and migration cost for balancing the load of the model.This paper introduces a novel VMM strategy by considering the load of the Cloud network.Two important aspects of the proposed scheme are the load prediction through the support vector regression(SVR)and the optimal VM placement through the proposed dragonfly-based crow(D-Crow)optimization algorithm.The proposed D-Crow optimization algorithm is developed by incorporating crow search algorithm(CSA)into dragonfly algorithm(DA).Also,the proposed VMM strategy defines a load balancing model based on the energy consumption,load,and the migration cost to achieve the energy-aware VMM.The simulation of the proposed VMM strategy is done based on the metrics such as load,energy consumption,and the migration cost.From the results,it can be shown that the proposed VMM strategy surpassed other comparative models by achieving the minimum values of 7.3719%,10.0368%,and 11.0639%for the load,energy consumption,and migration cost,respectively.

Optimization of cloud load balancing using fitness function and duopoly theory

Purpose-Current industrial scenario is largely dependent on cloud computing paradigms.On-demand services provided by cloud data centre are paid as per use.Hence,it is very important to make use of the allocated resources to the maximum.The resource utilization is highly dependent on the allocation of resources to the incoming request.The allocation of requests is done with respect to the physical machines present in the datacenter.While allocating the tasks to these physical machines,it needs to be allocated in such a way that no physical machine is underutilized or over loaded.To make sure of this,optimal load balancing is very important.Design/methodology/approach-The paper proposes an algorithm which makes use of the fitness functions and duopoly game theory to allocate the tasks to the physical machines which can handle the resource requirement of the incoming tasks.The major focus of the proposed work is to optimize the load balancing in a datacenter.When optimization happens,none of the physical machine is neither overloaded nor under-utilized,hence resulting in efficient utilization of the resources.Findings-The performance of the proposed algorithm is compared with different existing load balancing algorithms such as round-robin load(RR)ant colony optimization(ACO),artificial bee colony(ABC)with respect to the selected parameters response time,virtual machine migrations,host shut down and energy consumption.All the four parameters gave a positive result when the algorithm is simulated.Originality/value-The contribution of this paper is towards the domain of cloud load balancing.The paper is proposing a novel approach to optimize the cloud load balancing process.The results obtained show that response time,virtual machine migrations,host shut down and energy consumption are reduced in comparison to few of the existing algorithms selected for the study.The proposed algorithm based on the duopoly function and fitness function brings in an optimized performance compared to the four algorithms analysed.