scholarly journals Toward Enhancing the Energy Efficiency and Minimizing the SLA Violations in Cloud Data Centers

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
E. I. Elsedimy ◽  
Fahad Algarni
Keyword(s):  
Energy Efficiency ◽  
Bin Packing ◽  
Virtual Machines ◽  
Optimal Solution ◽  
Packing Problem ◽  
Service Level ◽  
Entropy Method ◽  
Cloud Data Center ◽  
Cloud Data ◽  
And Performance

Recently, the problem of Virtual Machine Placement (VMP) has received enormous attention from the research community due to its direct effect on the energy efficiency, resource utilization, and performance of the cloud data center. VMP is considered as a multidimensional bin packing problem, which is a type of NP-hard problem. The challenge in VMP is how to optimally place multiple independent virtual machines into a few physical servers to maximize a cloud provider’s revenue while meeting the Service Level Agreements (SLAs). In this paper, an effective multiobjective algorithm based on Particle Swarm Optimization (PSO) technique for the VMP problem, referred to as VMPMOPSO, is proposed. The proposed VMPMOPSO utilizes the crowding entropy method to optimize the VMP and to improve the diversity among the obtained solutions as well as accelerate the convergence speed toward the optimal solution. VMPMOPSO was compared with a simple single-objective algorithm, called First-Fit-Decreasing (FFD), and two multiobjective ant colony and genetic algorithms. Two simulation experiments were conducted to verify the effectiveness and efficiency of the proposed VMPMOPSO. The first experiment shows that the proposed algorithm has better performance than the algorithms we compared it to in terms of power consumption, SLA violation, and resource wastage. The second indicates that the Pareto optimal solutions obtained by applying VMPMOPSO have a good distribution and a better convergence than the comparative algorithms.

SLA and Performance Efficient Heuristics for Virtual Machines Placement in Cloud Data Centers

2017 ◽  
Vol 9 (3) ◽  
pp. 17-33 ◽  
Author(s):  
Oshin Sharma ◽  
Hemraj Saini
Keyword(s):  
Energy Consumption ◽  
Data Centers ◽  
Virtual Machines ◽  
Service Level Agreement ◽  
Service Level ◽  
Consolidation Process ◽  
Cloud Data ◽  
Trade Offs ◽  
And Performance ◽  
High Level

Cloud computing has revolutionized the working models of IT industry and increasing the demand of cloud resources which further leads to increase in energy consumption of data centers. Virtual machines (VMs) are consolidated dynamically to reduce the number of host machines inside data centers by satisfying the customer's requirements and quality of services (QoS). Moreover, for using the services of cloud environment every cloud user has a service level agreement (SLA) that deals with energy and performance trade-offs. As, the excess of consolidation and migration may degrade the performance of system, therefore, this paper focuses the overall performance of the system instead of energy consumption during the consolidation process to maintain a trust level between cloud's users and providers. In addition, the paper proposed three different heuristics for virtual machine (VM) placement based on current and previous usage of resources. The proposed heuristics ensure a high level of service level agreements (SLA) and better performance of ESM metric in comparison to previous research.

Optimizing the Migration of Virtual Machines in Cloud Data Centers

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0
Keyword(s):  
Data Centers ◽  
Bin Packing ◽  
Virtual Machines ◽  
Service Level Agreement ◽  
Service Level ◽  
Virtual Machine Migration ◽  
Cloud Data ◽  
Time Simulation ◽  
Cloud Data Centers ◽  
Dynamic Resource

Dynamic resource allocation of cloud data centers is implemented with the use of virtual machine migration. Selected virtual machines (VM) should be migrated on appropriate destination servers. This is a critical step and should be performed according to several criteria. It is proposed to use the criteria of minimum resource wastage and service level agreement violation. The optimization problem of the VM placement according to two criteria is formulated, which is equivalent to the well-known main assignment problem in terms of the structure, necessary conditions, and the nature of variables. It is suggested to use the Hungarian method or to reduce the problem to a closed transport problem. This allows the exact solution to be obtained in real time. Simulation has shown that the proposed approach outperforms widely used bin-packing heuristics in both criteria.

Virtual Machine Migrating Algorithm Based on Genetic Algorithm in Cloud Data Center

2014 ◽  
Vol 513-517 ◽  
pp. 2031-2034
Author(s):  
Hui Zhang ◽  
Yong Liu
Keyword(s):  
Genetic Algorithm ◽  
Resource Utilization ◽  
Virtual Machine ◽  
Data Center ◽  
Virtual Machines ◽  
Heuristic Algorithms ◽  
Optimal Solution ◽  
Virtual Machine Migration ◽  
Cloud Data Center ◽  
Cloud Data

Virtual machine migration is an effective method to improve the resource utilization of cloud data center. The common migration methods use heuristic algorithms to allocation virtual machines, the solution results is easy to fall into local optimal solution. Therefore, an algorithm called Migrating algorithm based on Genetic Algorithm (MGA) is introduced in this paper, which roots from genetic evolution theory to achieve global optimal search in the map of virtual machines to target nodes, and improves the objective function of Genetic Algorithm by setting the resource utilization of virtual machine and target node as an input factor into the calculation process. There is a contrast between MGA, Single Threshold (ST) and Double Threshold (DT) through simulation experiments, the results show that the MGA can effectively reduce migrations times and the number of host machine used.

scholarly journals An Efficient Cloud Data Center Allocation to the Source of Requests

2020 ◽  
Vol 32 (3) ◽  
pp. 23-36
Author(s):  
Kanniga Devi R. ◽  
Murugaboopathi Gurusamy ◽  
Vijayakumar P.
Keyword(s):  
Data Center ◽  
Data Centers ◽  
Virtual Machines ◽  
Service Level Agreement ◽  
Cloud Service ◽  
Service Level ◽  
Cloud Data Center ◽  
Cloud Data ◽  
Service Consumer ◽  
Cloud Data Centers

A Cloud data center is a network of virtualized resources, namely virtualized servers. They provision on-demand services to the source of requests ranging from virtual machines to virtualized storage and virtualized networks. The cloud data center service requests can come from different sources across the world. It is desirable for enhancing Quality of Service (QoS), which is otherwise known as a service level agreement (SLA), an agreement between cloud service requester and cloud service consumer on QoS, to allocate the cloud data center closest to the source of requests. This article models a Cloud data center network as a graph and proposes an algorithm, modified Breadth First Search where the source of requests assigned to the Cloud data centers based on a cost threshold, which limits the distance between them. Limiting the distance between Cloud data centers and the source of requests leads to faster service provisioning. The proposed algorithm is tested for various graph instances and is compared with modified Voronoi and modified graph-based K-Means algorithms that they assign source of requests to the cloud data centers without limiting the distance between them. The proposed algorithm outperforms two other algorithms in terms of average time taken to allocate the cloud data center to the source of requests, average cost and load distribution.

scholarly journals Virtual Machine Placement via Bin Packing in Cloud Data Centers

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 389 ◽  
Author(s):  
Aisha Fatima ◽  
Nadeem Javaid ◽  
Tanzeela Sultana ◽  
Waqar Hussain ◽  
Muhammad Bilal ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Data Centers ◽  
Bin Packing ◽  
Virtual Machines ◽  
Particle Swarm ◽  
Vm Placement ◽  
Swarm Optimization ◽  
Cloud Data ◽  
Cloud Data Centers ◽  
Vm Consolidation

With the increasing size of cloud data centers, the number of users and virtual machines (VMs) increases rapidly. The requests of users are entertained by VMs residing on physical servers. The dramatic growth of internet services results in unbalanced network resources. Resource management is an important factor for the performance of a cloud. Various techniques are used to manage the resources of a cloud efficiently. VM-consolidation is an intelligent and efficient strategy to balance the load of cloud data centers. VM-placement is an important subproblem of the VM-consolidation problem that needs to be resolved. The basic objective of VM-placement is to minimize the utilization rate of physical machines (PMs). VM-placement is used to save energy and cost. An enhanced levy-based particle swarm optimization algorithm with variable sized bin packing (PSOLBP) is proposed for solving the VM-placement problem. Moreover, the best-fit strategy is also used with the variable sized bin packing problem (VSBPP). Simulations are done to authenticate the adaptivity of the proposed algorithm. Three algorithms are implemented in Matlab. The given algorithm is compared with simple particle swarm optimization (PSO) and a hybrid of levy flight and particle swarm optimization (LFPSO). The proposed algorithm efficiently minimized the number of running PMs. VM-consolidation is an NP-hard problem, however, the proposed algorithm outperformed the other two algorithms.

Multidimensional Resource Scheduling in Cloud Data Centers

2014 ◽  
Vol 1008-1009 ◽  
pp. 1513-1516
Author(s):  
Hai Na Song ◽  
Xiao Qing Zhang ◽  
Zhong Tang He
Keyword(s):  
Cloud Computing ◽  
Data Centers ◽  
Bin Packing ◽  
Virtual Machines ◽  
Three Dimensional ◽  
Resource Scheduling ◽  
Computing Environment ◽  
Cloud Computing Environment ◽  
Cloud Data ◽  
Cloud Data Centers

Cloud computing environment is regarded as a kind of multi-tenant computing mode. With virtulization as a support technology, cloud computing realizes the integration of multiple workloads in one server through the package and seperation of virtual machines. Aiming at the contradiction between the heterogeneous applications and uniform shared resource pool, using the idea of bin packing, the multidimensional resource scheduling problem is analyzed in this paper. We carry out some example analysis in one-dimensional resource scheduling, two-dimensional resource schduling and three-dimensional resource scheduling. The results shows that the resource utilization of cloud data centers will be improved greatly when the resource sheduling is conducted after reorganizing rationally the heterogeneous demands.

scholarly journals Client Aware Scalable Cloudlet to Augment Edge Computing with Mobile Cloud Migration Service

2020 ◽  
Vol 14 (12) ◽  
pp. 165
Author(s):  
Uma Nandhini D ◽  
Udhayakumar S ◽  
Latha Tamilselvan ◽  
Silviya Nancy J
Keyword(s):  
Wireless Lan ◽  
High Speed ◽  
Virtual Machines ◽  
Linear Regression Analysis ◽  
Mobile Cloud ◽  
Cloud Data Center ◽  
Cloud Data ◽  
Battery Lifetime ◽  
Network Bandwidth ◽  
Load Conditions

<p class="0abstract">Computing with mobile is still in its infancy due to its limitations of computational power, battery lifetime and storage capacity. These limitations hinder the growth of mobile computing, which in-turn affects the growth of computationally intensive applications developed for the mobile devices. So in-order to help execute complex applications within the mobile device, mobile cloud computing (MCC) emerged as a feasible solution. The job of offloading the task to the cloud data center for storage and execution from the mobile seems to gain popularity, however, issues related to network bandwidth, loss of mobile data connectivity, and connection setup does not augment well to extend the benefits offered by MCC. Cloudlet servers filled this gab by assisting the mobile cloud environment as an edge device, offering compute power to the connected devices with high speed wireless LAN connectivity. Implementation constraints of cloudlet faces severe challenges in-terms of its storage, network sharing, and VM provisioning. Moreover, the number of connected devices of the cloudlet and its load conditions vary drastically leading to unexpected bottleneck, in which case the availability to server becomes an issue. Therefore, a scalable cloudlet, Client Aware Scalable Cloudlet (CASC) is proposed with linear regression analysis, predicting the knowledge of expected load conditions for provisioning new virtual machines and to perform resource migration.</p>

LSRU: A Novel Deep Learning based Hybrid Method to Predict the Workload of Virtual Machines in Cloud Data Center

2020 ◽  
Author(s):  
Md. Nahid Hasan Shuvo ◽  
Md. Nahid Hasan Shuvo ◽  
Mirza Mohd Shahriar Maswood ◽  
Mirza Mohd Shahriar Maswood ◽  
Abdullah G. Alharbi ◽  
...  
Keyword(s):  
Deep Learning ◽  
Hybrid Method ◽  
Data Center ◽  
Virtual Machines ◽  
Cloud Data Center ◽  
Cloud Data
Sign in / Sign up

Export Citation Format

Share Document