Opportunistic Two Virtual Machines Placements in Distributed Cloud Environment

2020 ◽  
Vol 12 (4) ◽  
pp. 13-34
Author(s):  
Kamal Kumar ◽  
Jyoti Thaman
Keyword(s):  
Experimental Validation ◽  
Virtual Machines ◽  
Vm Placement ◽  
Placement Problem ◽  
Basic Aspect ◽  
Active Research ◽  
Placement Algorithm ◽  
Distributed Cloud ◽  
And Storage ◽  
Best Fit

Cloud computing is a potentially tremendous platform and its presence is experienced in day to day life. Most infrastructure and technology enterprises have migrated to a cloud-based infrastructure and storage. With so much dependence on the cloud as a distributed and reliable platform, but a few issues remain as a challenge and provide food for the ever-active research entity. Considering a very basic aspect of VM migration followed by VM placement, one VM at a time is a prominent approach. This article presents a novel idea of placing two VMs at a time. This proposal is a draft of solution for the Two VM Placement problem. The experimental validation was done against a well-known placement algorithm, the power aware best fit decreasing (PABFD). PABFD and TVMP were applied on a given context and results were obtained for three important parameters, which include the number of VM migrations, reallocation means, and energy efficiency. Improvements on these parameters may prove beneficial.

Energy and SLA Efficient Virtual Machine Placement in Cloud Environment Using Non-Dominated Sorting Genetic Algorithm

2021 ◽  
pp. 773-789
Author(s):  
Oshin Sharma ◽  
Hemraj Saini
Keyword(s):  
Genetic Algorithm ◽  
Energy Consumption ◽  
Data Centers ◽  
Virtual Machines ◽  
Cloud Environment ◽  
Vm Placement ◽  
Energy Consumption Reduction ◽  
Consumption Reduction ◽  
The World ◽  
Placement Algorithm

To increase the availability of the resources and simultaneously to reduce the energy consumption of data centers by providing a good level of the service are one of the major challenges in the cloud environment. With the increasing data centers and their size around the world, the focus of the current research is to save the consumption of energy inside data centers. Thus, this article presents an energy-efficient VM placement algorithm for the mapping of virtual machines over physical machines. The idea of the mapping of virtual machines over physical machines is to lessen the count of physical machines used inside the data center. In the proposed algorithm, the problem of VM placement is formulated using a non-dominated sorting genetic algorithm based multi-objective optimization. The objectives are: optimization of the energy consumption, reduction of the level of SLA violation and the minimization of the migration count.

A Virtual Machine Placement Algorithm with Energy-Efficiency in Cloud Computing

2017 ◽  
Vol 8 (2) ◽  
pp. 20-36
Author(s):  
Yu Cai
Keyword(s):  
Energy Efficiency ◽  
Energy Efficient ◽  
Virtual Machines ◽  
Live Migration ◽  
Vm Placement ◽  
Server Cluster ◽  
Simulated Environment ◽  
Resource Requirements ◽  
Placement Algorithm

Energy efficient virtual machines (VM) management and distribution on cloud platforms is an important research subject. Mapping VMs into PMs (Physical Machines) requires knowing the capacity of each PM and the resource requirements of the VMs. It should also take into accounts of VM operation overheads, the reliability of PMs, Quality of Service (QoS) in addition to energy efficiency. In this article, the authors propose an energy efficient statistical live VM placement scheme in a heterogeneous server cluster. Their scheme supports VM requests scheduling and live migration to minimize the number of active servers in order to save the overall energy in a virtualized server cluster. Specifically, the proposed VM placement scheme incorporates all VM operation overheads in the dynamic migration process. In addition, it considers other important factors in relation to energy consumption and is ready to be extended with more considerations on user demands. The authors conducted extensive evaluations based on HPC jobs in a simulated environment. The results prove the effectiveness of the proposed scheme.

Balancing Power And Performance In HPC Clouds

2020 ◽  
Vol 63 (6) ◽  
pp. 880-899
Author(s):  
Lixia Chen ◽  
Jian Li ◽  
Ruhui Ma ◽  
Haibing Guan ◽  
Hans-Arno Jacobsen
Keyword(s):  
Energy Consumption ◽  
High Performance ◽  
Virtual Machines ◽  
Support Vector ◽  
Frequency Scaling ◽  
Vm Placement ◽  
Placement Problem ◽  
Dynamic Voltage ◽  
And Performance ◽  
Save Energy

Abstract With energy consumption in high-performance computing clouds growing rapidly, energy saving has become an important topic. Virtualization provides opportunities to save energy by enabling one physical machine (PM) to host multiple virtual machines (VMs). Dynamic voltage and frequency scaling (DVFS) is another technology to reduce energy consumption. However, in heterogeneous cloud environments where DVFS may be applied at the chip level or the core level, it is a great challenge to combine these two technologies efficiently. On per-core DVFS servers, cloud managers should carefully determine VM placements to minimize performance interference. On full-chip DVFS servers, cloud managers further face the choice of whether to combine VMs with different characteristics to reduce performance interference or to combine VMs with similar characteristics to take better advantage of DVFS. This paper presents a novel mechanism combining a VM placement algorithm and a frequency scaling method. We formulate this VM placement problem as an integer programming (IP) to find appropriate placement configurations, and we utilize support vector machines to select suitable frequencies. We conduct detailed experiments and simulations, showing that our scheme effectively reduces energy consumption with modest impact on performance. Particularly, the total energy delay product is reduced by up to 60%.

Optimal Dynamic Placement of Virtual Machines in Geographically Distributed Cloud Data Centers

2017 ◽  
Vol 26 (03) ◽  
pp. 1750001 ◽  
Author(s):  
Hana Teyeb ◽  
Nejib Ben Hadj-Alouane ◽  
Samir Tata ◽  
Ali Balma
Keyword(s):  
Virtual Machines ◽  
Time Frame ◽  
Cloud Infrastructure ◽  
Vm Placement ◽  
Vm Migration ◽  
Cloud Data ◽  
Geographically Distributed ◽  
Optimal Dynamic ◽  
And Migration ◽  
Distributed Cloud

In geo-distributed cloud systems, a key challenge faced by cloud providers is to optimally tune and configure the underlying cloud infrastructure. An important problem in this context, deals with finding an optimal virtual machine (VM) placement, minimizing costs, while at the same time, ensuring good system performance. Moreover, due to the fluctuations of demand and traffic patterns, it is crucial to dynamically adjust the VM placement scheme over time. It should be noted that most of the existing studies, however, dealt with this problem either by ignoring its dynamic aspect or by proposing solutions that are not suitable for a geographically distributed cloud infrastructure. In this paper, exact as well as heuristic solutions based on Integer Linear programming (ILP) formulations are proposed. Our work focuses also on the problem of scheduling the VM migration by finding the best migration sequence of intercommunicating VMs that minimizes the resulting traffic on the backbone network. The proposed algorithms execute within a reasonable time frame to readjust VM placement scheme according to the perceived demand. Our aim is to use VM migration as a tool for dynamically adjusting the VM placement scheme while minimizing the network traffic generated by VM communication and migration. Finally, we demonstrate the effectiveness of our proposed algorithms by performing extensive experiments and simulation.

scholarly journals Energy-Delay Tradeoff for Virtual Machine Placement in Virtualized Multi-Access Edge Computing: A Two-Sided Matching Approach

2020 ◽  
Author(s):  
Long Zhang ◽  
Shanshan Zhuge ◽  
Yao Wang ◽  
Haitao Xu ◽  
Enchang Sun
Keyword(s):  
Virtual Machines ◽  
Cost Minimization ◽  
Cost Effective ◽  
Edge Computing ◽  
Vm Placement ◽  
Placement Problem ◽  
Matching Problem ◽  
Matching Algorithm ◽  
Effective Manner ◽  
Multi Access

By decoupling network functions from the underlying physical machines (PMs) at the edge of the networks, the virtualized multi-access edge computing (MEC) enables deployment of new network services and elastic network scaling to reduce maintenance costs in a more flexible, scalable and cost-effective manner. Although there are appealing performance gains to be achieved, the placement of virtual machines (VMs) on top of the sharing PMs to support computation-intensive applications for the smart mobile devices becomes a major challenge, especially for an increasing network scale. In this paper, we attempt to deal with the VM placement problem in virtualized MEC system, which is targeted for finding a performance balance between energy consumption and computing/offloading delay. To capture such a tradeoff for VM placement, we formulate a weighted sum based cost minimization problem as a pure 0-1 integer linear programming problem, which is NP-complete and very complex to solve with lower complexity. Based on the one-to-one mapping relation constraint, the VM placement problem is converted into a many-to-many two-sided matching problem between the VM instances and the PMs. Motivated by the student project allocation problem, we develop an extended two-sided matching algorithm with lower computational complexity for solving the many-to-many matching problem. Simulation results are presented to demonstrate the effectiveness of our proposed matching algorithm, and the normalization factor is of great significance to obtain lower total cost.

scholarly journals Optimized Virtual Machine Placement with Traffic-Aware Balancing in Data Center Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Tao Chen ◽  
Xiaofeng Gao ◽  
Guihai Chen
Keyword(s):  
Virtual Machine ◽  
Heuristic Algorithm ◽  
Data Center ◽  
Virtual Machines ◽  
Virtual Machine Placement ◽  
Np Hard ◽  
Data Center Networks ◽  
Placement Problem ◽  
Placement Algorithm ◽  
Communication Locality

Virtualization has been an efficient method to fully utilize computing resources such as servers. The way of placing virtual machines (VMs) among a large pool of servers greatly affects the performance of data center networks (DCNs). As network resources have become a main bottleneck of the performance of DCNs, we concentrate on VM placement with Traffic-Aware Balancing to evenly utilize the links in DCNs. In this paper, we first proposed a Virtual Machine Placement Problem with Traffic-Aware Balancing (VMPPTB) and then proved it to be NP-hard and designed a Longest Processing Time Based Placement algorithm (LPTBP algorithm) to solve it. To take advantage of the communication locality, we proposed Locality-Aware Virtual Machine Placement Problem with Traffic-Aware Balancing (LVMPPTB), which is a multiobjective optimization problem of simultaneously minimizing the maximum number of VM partitions of requests and minimizing the maximum bandwidth occupancy on uplinks of Top of Rack (ToR) switches. We also proved it to be NP-hard and designed a heuristic algorithm (Least-Load First Based Placement algorithm, LLBP algorithm) to solve it. Through extensive simulations, the proposed heuristic algorithm is proven to significantly balance the bandwidth occupancy on uplinks of ToR switches, while keeping the number of VM partitions of each request small enough.

scholarly journals Power Management as a Service (Pmaas) – An Energy Saving Service by ―Auto-Fit VM Placement‖ Algorithm in Cloud Computing for Maximum Resource Utilization at Minimum Energy Consumption Without Live-Migrating the Virtual Machines by using the Concept of Virtual-Servers

2019 ◽  
Vol 9 (2) ◽  
pp. 1437-1446
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Power Consumption ◽  
Power Management ◽  
Resource Utilization ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Memory Storage ◽  
Vm Placement ◽  
Placement Algorithm

Now a day Energy Consumption is one of the most promising fields amongst several computing services of cloud computing. A maximum amount of Power resources are absorbed by the data centre because of huge amount of data processing which is increased abnormally. So it’s the time to think about the energy consumption in cloud environment. Existing Energy Consumption systems are limited in terms of virtualization because improper virtualization leads to loads imbalance and excessive power consumption and inefficiency in terms of computational power. Billing[1,2 ] is another exciting feature that is closely related to energy consumption, because higher or lesser billing depends on energy consumption somehow-as we know that cloud providers allow cloud users to access resources as pay-per-use, so these resources need to be optimally selected to process the user request to maximize user satisfaction in the distributed virtualized environment. There may be an inequity between the actual power consumption by the users and the provided billing records by the providers, So any false accusation that may claimed by each other to get illegal compensations. To avoid such accusation, we propose a work to consolidate the VMs using the Power Management as a Service (PMaaS) model in such a way, to reduce power consumption by maximum resource utilization without live-migration of the virtual machines by using the concept of Virtual Servers. The proposed PMaaS model uses a new “Auto-fit VM placement algorithm”, which computes tasks resource demands, models a Virtual Machine that fits those demands, and places the Virtual Machines on a Virtual server made by the collective resources (CPU, Memory, Storage and Bandwidth) from the respective schedulers directly connected to the actual physical servers and that has the minimum remaining resources which is large enough to accommodate such a Virtual Machine.

scholarly journals Task Based Virtual Machine Placement in Cloud

2020 ◽  
Vol 9 (5) ◽  
pp. 1994-1998
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Research Work ◽  
Test System ◽  
Vm Placement ◽  
Cloud Architecture ◽  
Use Of Resources ◽  
Placement Algorithm

Cloud computing offers many advantages by optimizing various parameters to meet the complex requirements .Some of the problems of cloud computing are utilization of resources and less energy consumption. More research and resources heterogeneity complicates the consolidation problem inside cloud architecture. VM placement refers to an ideal mapping of a task to virtual machines (VM) and virtual machines to physical machines (PM). The task-based VM placement algorithm is introduced in this research work. Here tasks are divided in accordance with their requirements, and then search for appropriate VM, again searching for appropriate PM, where selected VM could be sent. The algorithm decreases the use of resources by devaluation of the number of dynamic PMs while further decreases the rate of dismissal of make span and assignment. CloudSim test System is used to evaluate our algorithm in this research work. The outcomes of this implementation show the effectiveness of some current algorithms such as Round robin and Shortest Job First (SJF) algorithms.

scholarly journals Energy-Delay Tradeoff for Virtual Machine Placement in Virtualized Multi-Access Edge Computing: A Two-Sided Matching Approach

2021 ◽  
Author(s):  
Long Zhang ◽  
Shanshan Zhuge ◽  
Yao Wang ◽  
Haitao Xu ◽  
Enchang Sun
Keyword(s):  
Virtual Machines ◽  
Cost Minimization ◽  
Cost Effective ◽  
Edge Computing ◽  
Vm Placement ◽  
Placement Problem ◽  
Matching Problem ◽  
Matching Algorithm ◽  
Effective Manner ◽  
Multi Access

By decoupling network functions from the underlying physical machines (PMs) at the edge of the networks, the virtualized multi-access edge computing (MEC) enables deployment of new network services and elastic network scaling to reduce maintenance costs in a more flexible, scalable and cost-effective manner. Although there are appealing performance gains to be achieved, the placement of virtual machines (VMs) on top of the sharing PMs to support computation-intensive applications for the smart mobile devices becomes a major challenge, especially for an increasing network scale. In this paper, we attempt to deal with the VM placement problem in virtualized MEC system, which is targeted for finding a performance balance between energy consumption and computing/offloading delay. To capture such a tradeoff for VM placement, we formulate a weighted sum based cost minimization problem as a pure 0-1 integer linear programming problem, which is NP-complete and very complex to solve with lower complexity. Based on the one-to-one mapping relation constraint, the VM placement problem is converted into a many-to-many two-sided matching problem between the VM instances and the PMs. Motivated by the student project allocation problem, we develop an extended two-sided matching algorithm with lower computational complexity for solving the many-to-many matching problem. Simulation results are presented to demonstrate the effectiveness of our proposed matching algorithm, and the normalization factor is of great significance to obtain lower total cost.

Sign in / Sign up

Export Citation Format

Share Document