Adaptive Threshold-Based Algorithm for Multi-objective VM Placement in Cloud Data Centers

2019 ◽  
pp. 118-129
Author(s):  
Nithiya Baskaran ◽  
R. Eswari
Keyword(s):  
Data Centers ◽  
Adaptive Threshold ◽  
Vm Placement ◽  
Cloud Data ◽  
Multi Objective ◽  
Cloud Data Centers

scholarly journals An Enhanced Multi-Objective Gray Wolf Optimization for Virtual Machine Placement in Cloud Data Centers

Electronics ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 218 ◽  
Author(s):  
Aisha Fatima ◽  
Nadeem Javaid ◽  
Ayesha Anjum Butt ◽  
Tanzeela Sultana ◽  
Waqar Hussain ◽  
...  
Keyword(s):  
Data Centers ◽  
Virtual Machines ◽  
Service Providers ◽  
Utilization Rate ◽  
Gray Wolf ◽  
Vm Placement ◽  
Cloud Data ◽  
Multi Objective ◽  
Cloud Data Centers ◽  
Better Than

Cloud computing offers various services. Numerous cloud data centers are used to provide these services to the users in the whole world. A cloud data center is a house of physical machines (PMs). Millions of virtual machines (VMs) are used to minimize the utilization rate of PMs. There is a chance of unbalanced network due to the rapid growth of Internet services. An intelligent mechanism is required to efficiently balance the network. Multiple techniques are used to solve the aforementioned issues optimally. VM placement is a great challenge for cloud service providers to fulfill the user requirements. In this paper, an enhanced levy based multi-objective gray wolf optimization (LMOGWO) algorithm is proposed to solve the VM placement problem efficiently. An archive is used to store and retrieve true Pareto front. A grid mechanism is used to improve the non-dominated VMs in the archive. A mechanism is also used for the maintenance of an archive. The proposed algorithm mimics the leadership and hunting behavior of gray wolves (GWs) in multi-objective search space. The proposed algorithm was tested on nine well-known bi-objective and tri-objective benchmark functions to verify the compatibility of the work done. LMOGWO was then compared with simple multi-objective gray wolf optimization (MOGWO) and multi-objective particle swarm optimization (MOPSO). Two scenarios were considered for simulations to check the adaptivity of the proposed algorithm. The proposed LMOGWO outperformed MOGWO and MOPSO for University of Florida 1 (UF1), UF5, UF7 and UF8 for Scenario 1. However, MOGWO and MOPSO performed better than LMOGWO for UF2. For Scenario 2, LMOGWO outperformed the other two algorithms for UF5, UF8 and UF9. However, MOGWO performed well for UF2 and UF4. The results of MOPSO were also better than the proposed algorithm for UF4. Moreover, the PM utilization rate (%) was minimized by 30% with LMOGWO, 11% with MOGWO and 10% with MOPSO.

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.

scholarly journals Multi-Objective Service Placement Scheme Based on Fuzzy-AHP System for Distributed Cloud Computing

2019 ◽  
Vol 9 (17) ◽  
pp. 3550 ◽  
Author(s):  
A-Young Son ◽  
Eui-Nam Huh
Keyword(s):  
Energy Efficiency ◽  
Cloud Computing ◽  
Response Time ◽  
Data Centers ◽  
Cloud Data ◽  
Multi Objective ◽  
Service Placement ◽  
Service Response Time ◽  
Cloud Data Centers ◽  
Distributed Cloud

With the rapid increase in the development of the cloud data centers, it is expected that massive data will be generated, which will decrease service response time for the cloud data centers. To improve the service response time, distributed cloud computing has been designed and researched for placement and migration from mobile devices close to edge servers that have secure resource computing. However, most of the related studies did not provide sufficient service efficiency for multi-objective factors such as energy efficiency, resource efficiency, and performance improvement. In addition, most of the existing approaches did not consider various metrics. Thus, to maximize energy efficiency, maximize performance, and reduce costs, we consider multi-metric factors by combining decision methods, according to user requirements. In order to satisfy the user’s requirements based on service, we propose an efficient service placement system named fuzzy- analytical hierarchical process and then analyze the metric that enables the decision and selection of a machine in the distributed cloud environment. Lastly, using different placement schemes, we demonstrate the performance of the proposed scheme.

scholarly journals An Distributed Virtual Machine Placement Algorithm for Balanced Resource Utilization and Low Energy Consumption

2018 ◽  
Vol 173 ◽  
pp. 03092
Author(s):  
Bo Li ◽  
Yun Wang
Keyword(s):  
Virtual Machine ◽  
Data Centers ◽  
Virtual Machine Placement ◽  
Vm Placement ◽  
Energy Aware ◽  
Cloud Data ◽  
Low Energy Consumption ◽  
Cloud Data Centers ◽  
Placement Algorithm ◽  
Heterogeneous Cloud

Virtual machine placement is the process of selecting the most suitable server in large cloud data centers to deploy newly-created VMs. Traditional load balancing or energy-aware VM placement approaches either allocate VMs to PMs in centralized manner or ignore PM’s cost-capacity ratio to implement energy-aware VM placement. We address these two issues by introducing a distributed VM placement approach. A auction-based VM placement algorithm is devised for help VM to find the most suitable server in large heterogeneous cloud data centers. Our algorithm is evaluated by simulation. Experimental results show two major improvements over the existing approaches for VM placement. First, our algorithm efficiently balances the utilization of multiple types of resource by minimizing the amount of physical servers used. Second, it reduces system cost compared with existing approaches in heterogeneous environment.

Sign in / Sign up

Export Citation Format

Share Document