Virtual Machine Placement Optimization Research Articles

Taxonomy of optimization algorithms combined with CNN for optimal placement of virtual machines within physical machines in data centers

Energy management in datacenters is a major challenge today due to the environmental and economic impact of increasing energy consumption. Efficient placement of virtual machines in physical machines within modern datacenters is crucial for their effective management. In this context, five algorithms named CNN-GA, CNN-greedy, CNN-ABC, CNN-ACO and CNN-PSO, have been developed to minimize hosts’ power consumption and ensure service quality with relatively low response times. We propose a comparative approach between the developed algorithms and other existing methods for virtual machine placement. The algorithms use optimization algorithms combined with Convolutional Neural Networks to build predictive models of virtual machine placement. The models were evaluated based on their accuracy and complexity to select the optimal solution. The necessary data is collected using the CloudSim Plus simulator, and the prediction results were used to allocate virtual machines according to the predictions of the models. The main objective of this research is to optimize the management of Information Technology resources within datacenters. This is achieved by seeking a virtual machine placement policy that minimizes hosts’ power consumption and ensures an appropriate level of service for users' needs. It considers the imperatives of sustainability, performance, and availability by reducing energy consumption and response times. We studied six scenarios under specific constraints to determine the best model for virtual machines’ placement. This approach aims to address current challenges in energy management and operational efficiency.

Designing an optimal task scheduling and VM placement in the cloud environment with multi-objective constraints using Hybrid Lemurs and Gannet Optimization Algorithm

ABSTRACT An efficient resource utilization method can greatly reduce expenses and unwanted resources. Typical cloud resource planning approaches lack support for the emerging paradigm regarding asset management speed and optimization. The use of cloud computing relies heavily on task planning and allocation of resources. The task scheduling issue is more crucial in arranging and allotting application jobs supplied by customers on Virtual Machines (VM) in a specific manner. The task planning issue needs to be specifically stated to increase scheduling efficiency. The task scheduling in the cloud environment model is developed using optimization techniques. This model intends to optimize both the task scheduling and VM placement over the cloud environment. In this model, a new hybrid-meta-heuristic optimization algorithm is developed named the Hybrid Lemurs-based Gannet Optimization Algorithm (HL-GOA). The multi-objective function is considered with constraints like cost, time, resource utilization, makespan, and throughput. The proposed model is further validated and compared against existing methodologies. The total time required for scheduling and VM placement is 30.23%, 6.25%, 11.76%, and 10.44% reduced than ESO, RSO, LO, and GOA with 2 VMs. The simulation outcomes revealed that the developed model effectively resolved the scheduling and VL placement issues.

Hybrid Metaheuristic Technique for Optimization of Virtual Machine Placement in Cloud

Hybrid Metaheuristic Technique for Optimization of Virtual Machine Placement in Cloud

Towards optimal virtual machine placement methods in cloud environments

The rapid growth of cloud services for hosting applications in the scientific, commercial, web, and social networks has led to enormous growth in the number of large-scale data centers. By shifting the costs of data center maintenance, hardware, and software from customers to service providers using a pay-as-you-go policy, service providers and customers are benefited. On the other hand, the massive growth of data centers has been accompanied by challenges that have limited the boundaries of this technology. Thus, researchers in this field tend to focus on eliminating these limitations. Since virtualization is at the core of cloud computing, allocating Virtual Machines (VMs) to physical hosts in the Infrastructure as a Service layer (IaaS) is one of the most significant challenges. Nonetheless, the VM allocation problem is a combinatorial optimization problem that is known to be NP-Hard. In this paper, we presented a comprehensive analysis of virtual machine placement problem and outlined different approaches to solving it. This paper aims to provide insight into the challenges and issues for recent virtual machine placement strategies. The current study aims to comprehensively classify the physical resource allocation for VMs by overviewing available trends.

Two-Phase Virtual Machine Placement in Cloud Computing Data Centers Using Extreme Learning Machine Prediction-Based Triggering Method

Background: Two-phase Optimization of Virtual Machine Placement (VMP) Problem considers both the Online Incremental VMP (iVMP) phase in which the new arrival of dynamic requests of Virtual Machines VMs are attended to and the Offline VMP reconfiguration (VMPr) phase that performs placement recalculation. In the two-phase scheme, the first part of the two-phase approach is the iVMP, where virtual machines (VMs) can be built, changed, or destroyed at runtime. While the second phase focuses on raising the standard of solutions produced by the iVMP, several studies have been done in different literature to solve the VMP problem. However, the methods used tend to be over-forecast and have long runs of a linear trend. This affects the prediction and produces a less optimal solution. Objective: The following four objective functions are optimized using the proposed Extreme Learning Machine Prediction-Based Triggering Method for Virtual Machine Placement in Cloud Computing Datacenters in Two-Phases, which combines the advantages of both online (dynamic) and static (offline) VMP formulations: the length of the reconfiguration process, the amount of energy used, the way resources are used, and the financial expenses. This study suggests a brand-new strategy for deciding when to start the VMP reconfiguration phase. Results: The Method provides more accuracy to the predicted requests as well as reduces the total economic penalties for service Level Agreement(SLA) violations. An experimental comparison with the existing approach is conducted utilizing 400 cases. Conclusion: The results demonstrated that, in comparison to the benchmark approach, the proposed work obtained a minimum cost function with a 10.5% improvement

An efficient fault tolerance scheme based enhanced firefly optimization for virtual machine placement in cloud computing

SummaryThe virtual machine placement for the highly reliable cloud application is considered as one of the challenging and critical issues. To tackle such an issue, this article proposes the enhanced firefly algorithm based virtual machine placement model. But the migration time of the virtual machine placement is high and to reduce the migration time of the virtual machine placement, this article utilizes the K‐means clustering algorithm. In addition, to obtain the optimal cluster for the virtual machine placement, the adaptive particle swarm optimization with the coyote optimization algorithm is employed. The experimental results are conducted for the proposed approach using various measures such as transmission overhead, total execution time, packet size, parallel applications numbers, and virtual machine numbers. The results demonstrate that the proposed method offers improved performance and an optimal virtual machine placement scheme with respect to the various constraint factors. The evaluation exposes that the proposed method offers less execution time when compared to other methods.

Hybrid meta‐heuristic algorithm for optimal virtual machine placement and migration in cloud computing

SummaryData sharing in cloud computing happens with multiple participants to freely distribute the group data, which focuses on advancing the effectiveness of work in cooperative backgrounds and has attained widespread benefits. The main intent of this article is to accomplish a virtual machines (VMs) placement and migration model using a hybrid meta‐heuristic concept. A new meta‐heuristic algorithm named DJ‐HA is developed for optimal VM placement and migration to reduce the count of active servers, and minimization of makespan, and energy consumption with a faster convergence rate in a cloud background. Then, the VM migration is done based on the multi‐objective function concerning energy consumption and makespan using the same hybrid DJ‐HA. From the result analysis, the energy consumption of the DJ‐HA is correspondingly secured at 4.3%, 3.5%, 31%, and 33% more advanced than PSO, GWO, DHOA, and JA, at the 100th iteration for Experiment 1. Accordingly, the cost function of the suggested DJ‐HA is secured at 88.8%, 89.4%, 33.3%, and 50% increased than PSO, GWO, DHOA, and JA at the 100th iteration for Experiment 4. Hence, it is proved that the suggested VM migration using DJ‐HA is enriched than the other conventional algorithms.

Energy efficient VM placement and task scheduling techniques to achieve green cloud environment

Continuous increase in the demand for cloud services has resulted in increased workloads. Effective distribution of these augmented tasks on a limited infrastructure for providing the services is a challenging issue. This necessitates servers to run continuously raising the power usage in the data centres. High power consumption results in releasing major amount of CO2 gas to the atmosphere, polluting our natural environment. So, there is a need to think of green cloud computing to reduce this effect of harmful gas to our environment. Designing an energy efficient data centre is a perennial challenge. Hence in this paper, optimal virtual machine placement strategy using knapsack dynamic programming technique and an efficient precedence-based task distribution approach are proposed to alleviate the power consumption and achieve the quality of service maintaining the service level agreements. The implementation results obtained have proved its power efficiency with better quality of service.

A Dynamic Virtual Machine Placement and Migration Scheme for Data Centers

We study the problem of virtual machine (VM) placement and migration in a data center. In the current approaches, VMs are assigned to physical servers using on-demand provisioning. Such an approach is simple but it often results in a poor performance due to resource fragmentation. Additionally, sub-optimal VM placement usually generates unneeded VM migration and unnecessary cross network traffic. The efficiency of a datacenter therefore significantly depends on how VMs are provisioned and where they are placed. A good placement scheme will not only improve the quality of service but also reduce the operation cost of the data center. In this paper, we study the problem of optimal VM placement and migration to minimize resource usage and power consumption in a data center. We formulate the optimization problem as a joint multiple objective function and solve it by leveraging the framework of convex optimization. Due to the intractable nature of the combinatorial optimization, we then propose Multi-level Join VM Placement and Migration (MJPM) algorithms based on the relaxed convex optimization framework to approximate the optimal solution. The theoretical analysis demonstrates the effectiveness of our proposed algorithms that substantially increases data center efficiency. In addition, our extensive simulation results on different practical topologies show significant performance improvement over the existing approaches.

A discrete chaotic multi-objective SCA-ALO optimization algorithm for an optimal virtual machine placement in cloud data center

Cloud computing, with its immense potentials in low cost and on-demand services, is a promising computing platform for both commercial and non-commercial computation applications. It focuses on the sharing of information and computation in a large network that are quite likely to be owned by geographically disbursed different venders. Power efficiency in cloud data centers (DCs) has become an important topic in recent years as more and larger DCs have been established and the electricity cost has become a major expense for operating them. Server consolidation using virtualization technology has become an important technology to improve the energy efficiency of DCs. Virtual machine (VM) assignment is the key in server consolidation. In the past few years, many methods to VM assignment have been proposed, but existing VM assignment approaches to the VM assignment problem consider the energy consumption by physical machines (PM). In current paper a new approach is proposed that using a combination of the sine cosine algorithm (SCA) and ant lion optimizer (ALO) as discrete multi-objective and chaotic functions for optimal VM assignment. First objective of our proposed model is minimizing the power consumption in cloud DCs by balancing the number of active PMs. Second objective is reducing the resources wastage by using optimal VM assignment on PMs in cloud DCs. Reducing SLA levels was another purpose of this research. By using the method, the number of increase of migration of VMs to PMs is prevented. In this paper, several performance metrics such as resource wastage, power consumption, overall memory utilization, overall CPU utilization, overall storage space, and overall bandwidth, a number of active PMs, a number of shutdowns, a number of migrations, and SLA are used. Ultimately, the results obtained from the proposed algorithm were compared with those of the algorithms used in this regard, including First Fit (FF), VMPACS and MGGA.

Link-Aware Virtual Machine Placement for Cloud Services based on Service-Oriented Architecture

Data center benefits cloud applications in providing high scalability and ensuring service availability. However, virtual machine (VM) placement in data center poses new challenges for service provisioning. For many cloud services such as storage and video streaming, present placement approaches are unable to support network-demanding services due to overwhelming communication traffic and time. Therefore VM placement concerning link capacity is vital to cloud data centers. In this paper, we define the network-aware VM placement optimization (NAVMPO) problem based on integer linear programming. The objective function of NAVMPO problem aims to minimize communication time for VMs of the same service type. Then we propose the service-oriented physical machine (PM) selection (SOPMS) algorithm and link-aware VM placement (LAVMP) algorithm. The SOPMS algorithm selects the most appropriate PM based on service-oriented architecture, and then the LAVMP algorithm deploys the most suitable VM to target PM regarding to the link capacity between them. Simulation results show that the proposed placement approach significantly decreases communication time compared to existing non-service-oriented and service-oriented VM placement algorithms, and also improves the average utility rate of PMs with lower power consumption.

Power efficient virtual machine placement in cloud data centers with a discrete and chaotic hybrid optimization algorithm

Cloud computing is a new computation technology that provides services to consumers and businesses. The main idea of Cloud computing is to present software and hardware services through the Internet to the users and organizations at all levels. In Cloud computing, the users pay for the services, which means a usage-based payment system is used in this technology. Using virtualization technology in computation resources enables the appropriate utilization of resources in cloud computing. One of the most significant challenging issues in virtualization technology is the placement of optimal virtual machines on physical machines in cloud data centers. The placement of virtual machines comprises a process wherein virtual machines are mapped onto physical machines in cloud data centers. Optimal deployment leads to the reduction in power consumption, optimal use of resources, traffic reduction in data centers, costs reduction, and efficiency enhancement of the data center in the cloud. The present article proposed a new approach using a combination of the Sine–Cosine Algorithm and Salp Swarm Algorithm as discrete multi-objective and chaotic functions for optimal virtual machine placement. The first goal of the proposed algorithm was to reduce the power consumption in cloud data centers by condensing the number of active physical machines. The second goal was to reduce the waste of resources and manage it by optimally virtual machine placement on physical machines in cloud data centers. The third objective was to minimize and reduce Service Level Agreement among the active physical machines in cloud data centers. The proposed method prevent the increase in the migration of virtual machines onto physical machines. Ultimately, the results obtained from the proposed algorithm were compared with those of previous akin algorithms in the literature, including First Fit, Virtual Machine Placement Ant Colony System, and Modified Best Fit Decreasing. The proposed scheme is tested using Amazon EC2 Instances and the result indicated that the proposed algorithm performs better than the existing algorithms for various performance metrics.

Virtual machine placement in cloud data centers using a hybrid multi-verse optimization algorithm

Cloud computing is a computing paradigm, where a large pool of systems is connected in private or public networks to provide dynamically scalable infrastructure for application, data, and file storage. With the advent of this technology, the cost of power computation, application hosting, content storage, resource wastage, and delivery is reduced significantly. Cloud computing provides the possibility of merely concentrating on business goals instead of expanding hardware resources for users. Challenging work in virtualization technology is the placement of virtual machines under optimal conditions on physical machines in cloud data centers. Optimal placement of virtual machines over physical ones in cloud data centers can lead to the management of resources and prevention of the resources waste. Hereby, a new approach is proposed based on the combination of the hybrid discrete multi-object whale optimization algorithm, multi-verse optimizer with chaotic functions for optimal placement in the cloud data center. The first object of the proposed algorithm is to decrease power consumption, which is consumed in cloud data centers by reducing active physical machines. The second goal is to cut the resource wastage and managing resources using the optimal placement of virtual machines over physical machines in cloud data centers. With this method, the increasing rate of virtual migration to physical machines is prevented. Finally, the results obtained from the proposed algorithm were compared to some algorithms such as first fit, VMPACS, MBFD.

Optimized Energy Cost and Carbon Emission-Aware Virtual Machine Allocation in Sustainable Data Centers

Cloud data center’s total operating cost is conquered by electricity cost and carbon tax incurred due to energy consumption from the grid and its associated carbon emission. In this work, we consider geo-distributed sustainable datacenter’s with varying on-site green energy generation, electricity prices, carbon intensity and carbon tax. The objective function is devised to reduce the operating cost including electricity cost and carbon cost incurred on the power consumption of servers and cooling devices. We propose renewable-aware algorithms to schedule the workload to the data centers with an aim to maximize the green energy usage. Due to the uncertainty and time variant nature of renewable energy availability, an investigation is performed to identify the impact of carbon footprint, carbon tax and electricity cost in data center selection on total operating cost reduction. In addition, on-demand dynamic optimal frequency-based load distribution within the cluster nodes is performed to eliminate hot spots due to high processor utilization. The work suggests optimal virtual machine placement decision to maximize green energy usage with reduced operating cost and carbon emission.

Virtual Machine Placement Optimization in Mobile Cloud Gaming Through QoE-Oriented Resource Competition

Cloud gaming is a novel service provisioning paradigm, which hosts video games in the cloud and transmits interactive game streams to game players via the Internet. In such cloud gaming scenarios, the cloud is required to consume tremendous resources for video rendering and streaming, especially when the number of concurrent players reaches a certain level. On the other hand, different game players may have distinct requirements on Quality-of-Experience, such as high video quality, low delay, etc. Under this circumstance, how to satisfy players of different interests by efficiently leveraging cloud resources becomes a major challenge to existing cloud gaming services. In order to meet the overall requirements of players in a cost-effective manner, this article applies game theory to cloud gaming scenarios. It proposes a distributed algorithm to optimize virtual machine (VM) placement in mobile cloud gaming through resource competition. Further, by constructing a potential function, we prove that the resource competition game is a potential game, and the proposed algorithm scales well as the player population increases. We prove theoretically and verify experimentally that, with the proposed distributed VM placement algorithm, players can achieve a mutually satisfying state within a finite number of iterations.

Adaptive management and multi-objective optimization of virtual machine in cloud computing based on particle swarm optimization

In order to improve the adaptive management ability of virtual machine placement in cloud computing, an adaptive management and multi-objective optimization method for virtual machine placement in cloud computing is proposed based on particle swarm optimization (PSO). The objective optimization model of adaptive management of virtual machine placement in cloud computing is constructed by particle swarm evolution, and the global optimization control of adaptive management of virtual machine placement in cloud computing is carried out by introducing extremum perturbation operator. The global dynamic objective function of particle swarm optimization is constructed, and the global optimal solution of virtual machine in cloud computing is found by deconvolution algorithm, and the optimal position of particle swarm is searched in two-dimensional space. The multi-objective optimization problem of adaptive management of virtual machine placement is transformed into particle swarm optimization problem to realize adaptive management and multi-objective optimization of virtual machine placement in cloud computing. Simulation results show that the adaptive management of virtual machine placement in cloud computing using this method has better global optimization ability, better convergence of particle swarm optimization, and better performance of multi-objective optimization.

Virtual machine optimization to achieve energy efficient optimum resource utilization in cloud data center

Objectives: Cloud offers multiple benefits through its data center-based services. The whole world uses these services that are hosted by physical machines. Millions of virtual machines get an optimized utilization of hardware to utilize these physical machines. The unbalanced distribution of virtual machines to physical machines offers an in-efficient utilization of data center hardware that will also lead to more carbon emission and harm the environment as well. Methods/material: A learning function is needed to offer energy efficiency in the cloud data center through VM optimization through its optimal allocation to physical machines. Therefore, an optimal VM placement and migration algorithm is a challenge that is addressed in this paper to reach an efficient energy optimization and resource utilization level. Finding/Novelty: The proposed algorithm is led by a learning function that takes into account the available number of physical machines, number of virtual machines, incoming requests and decides to run an optimal number of physical machines to obtain energy efficiency level for the cloud data center by migrating the virtual machines (VMs). Keywords: Datacenter; Cloud computing; Energy efficiency; VM placement; VM migration; Green Cloud

ChicWhale optimization algorithm for the VM migration in cloud computing platform

Nowadays, Virtual Machine (VM) migration becomes very popular in the cloud computing platform. Various VM migration based mechanisms are designed for optimal VM placement but remain a challenge due to improper energy consumption in the cloud model. This paper proposes an approach for VM migration in the cloud using an optimization algorithm, Chicken-Whale optimization algorithm (ChicWhale), which is developed by integrating the Whale optimization algorithm in Chicken swarm optimization. In the developed approach, a local migration agent is utilized for monitoring the memory and resources utilization in the cloud continuously, and the VM is migrated using the service provider based on the requirement of the VMs to complete a task assigned. At first, the cloud system is designed, and then the proposed ChicWhale is employed by moving the VMs optimally, and the fitness function for best VM migration is carried out by considering several parameters, like load, migration cost, resource availability, and energy. The performance of the VM migration strategy based on ChicWhale is evaluated in terms of energy consumption, resource availability, migration cost, and load. The proposed ChicWhale method achieves the maximal resource availability of 0.989, minimal migration cost of 0.0564, the minimal energy consumption of 0.481, and the minimal load of 0.0001.

An energy-efficient algorithm for virtual machine placement optimization in cloud data centers

Cloud providers offer computing services based on user demands using the Infrastructure as a Service (IaaS) service model. In a cloud data center, it is possible that multiple Virtual Machines (VMs) run on a Physical Machine (PM) using virtualization technology. Virtual Machine Placement (VMP) problem is the mapping of virtual machines across multiple physical ones. This process plays a vital role in defining energy consumption and resource usage efficiency in the cloud data center infrastructure. However, providing an efficient solution is not trivial due to difficulties such as machine heterogeneity, multi-dimensional resources, and large scale cloud data centers. In this paper, we propose an efficient heuristic algorithm that focuses on power consumption and resource wastage optimization to solve the aforementioned problem. The proposed algorithm, called MinPR, minimizes the total power consumption by reducing the number of active physical machines and prioritizing the power-efficient ones. Also, it reduces resource wastage by maximizing and balancing resource utilization among physical machines. To achieve these goals, we propose a new Resource Usage Factor model that manages virtual machine placement on physical machines using reward and penalty mechanisms. Simulations based on cloud user-customized VMs and Amazon EC2 Instances workloads illustrate that the proposed algorithm outperforms existing approaches. In particular, the proposed algorithm reduces total energy consumption by up to 15% for cloud user-customized VMs and by up to 10% for Amazon EC2 Instances.

Utilization-aware energy-efficient virtual machine placement in cloud networks using NSGA-III meta-heuristic approach

One of the most important issues in the context of cloud computing concerns the placement of virtual machines (VMs). The purpose of multi-objective virtual machine placement (MO-VMP) is to find the best place of VMs on physical machines (PMs) so as to reach predetermined goals. In this regard, a fundamental goal is maximizing the utilization of available resources while minimizing energy consumption. It is clear that inefficient use of computing resources (for instance CPU, memory, storage capacity, and bandwidth) could cause increased energy wastage. On the other hand, with optimal placement of VMs on PMs, one may prevent migrating them from one PM to another in the future, itself a secondary cause of increased energy consumption. Concerning the MO-VMP, there are very serious challenges in previous studies. Some of these works have attempted to minimize the number of active PMs. Others have investigated minimizing rack link traffic and optimizing communication and VM migration costs regarding routing goals. Since the MO-VMP is an NP-hard problem and involves high spatial and temporal complexities, heuristic and meta-heuristic methods have been widely used to solve the problem in the past decade. In the present research, we use the non-dominated sorting genetic algorithm (NSGA-III) to determine the optimal MO-VMP. To this end, a multi-objective optimizing problem is designed, and after introducing a non-linear convex optimization solution, we solve it with the NSGA-III method. Our main purpose is to minimize overall resource loss while minimizing power consumption as well as decreasing the number of active PMs. The simulation results on the CloudSim simulator confirm the superiority of the proposed method over basic methods such as first-fit decreasing (FFD) and exact mathematical approaches in terms of significant criteria such as execution time, utilization, resource wastage, and energy consumption.