Improved Genetic Algorithm for Monitoring of Virtual Machines in Cloud Environment

2018 ◽  
pp. 319-326 ◽  
Author(s):  
Sayantani Basu ◽  
G. Kannayaram ◽  
Somula Ramasubbareddy ◽  
C. Venkatasubbaiah
Keyword(s):  
Genetic Algorithm ◽  
Virtual Machines ◽  
Cloud Environment ◽  
Improved Genetic Algorithm

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.

scholarly journals Mitigating Economic Denial of Sustainability (EDoS) in Cloud Environment using Genetic Algorithm and Artificial Neural Network

2019 ◽  
Vol 8 (10) ◽  
pp. 3415-3421
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Artificial Neural Network ◽  
Virtual Machines ◽  
Fitness Function ◽  
Medium Size ◽  
Cloud Environment ◽  
Edos Attacks ◽  
Artificial Neural ◽  
Artificial Neural Network Ann

Economic Denial of Sustainability (EDoS) is a latest threat in the cloud environment in which EDoS attackers continually request huge number of resources that includes virtual machines, virtual security devices, virtual networking devices, databases and so on to slowly exploit illegal traffic to trigger cloud-based scaling capabilities. As a result, the targeted cloud ends with a consumer bill that could lead to bankruptcy. This paper proposes an intelligent reactive approach that utilizes Genetic Algorithm and Artificial Neural Network (GANN) for classification of cloud server consumer to minimize the effect of EDoS attacks and will be beneficial to small and medium size organizations. EDoS attack encounters the illegal traffic so the work is progressed into two phases: Artificial Neural Network (ANN) is used to determine affected path and to detect suspected service provider out of the detected affected route which further consist of training and testing phase. The properties of every server are optimized by using an appropriate fitness function of Genetic Algorithm (GA) based on energy consumption of server. ANN considered these properties to train the system to distinguish between the genuine overwhelmed server and EDoS attack affected server. The experimental results show that the proposed Genetic and Artificial Neural Network (GANN) algorithm performs better compared to existing Fuzzy Entropy and Lion Neural Learner (FLNL) technique with values of precision, recall and f-measure are increased by 3.37%, 10.26% and 6.93% respectively.

An Improved Genetic Algorithm for Document Clustering on the Cloud

2018 ◽  
Vol 8 (4) ◽  
pp. 20-28
Author(s):  
Ruksana Akter ◽  
Yoojin Chung
Keyword(s):  
Genetic Algorithm ◽  
Virtual Machines ◽  
Document Clustering ◽  
Local Minima ◽  
Improved Genetic Algorithm ◽  
Crossover Point ◽  
Text Document ◽  
Modified Genetic Algorithm ◽  
Cloud Environments ◽  
Traditional Approaches

This article presents a modified genetic algorithm for text document clustering on the cloud. Traditional approaches of genetic algorithms in document clustering represents chromosomes based on cluster centroids, and does not divide cluster centroids during crossover operations. This limits the possibility of the algorithm to introduce different variations to the population, leading it to be trapped in local minima. In this approach, a crossover point may be selected even at a position inside a cluster centroid, which allows modifying some cluster centroids. This also guides the algorithm to get rid of the local minima, and find better solutions than the traditional approaches. Moreover, instead of running only one genetic algorithm as done in the traditional approaches, this article partitions the population and runs a genetic algorithm on each of them. This gives an opportunity to simultaneously run different parts of the algorithm on different virtual machines in cloud environments. Experimental results also demonstrate that the accuracy of the proposed approach is at least 4% higher than the other approaches.

An Improved Genetic Algorithm for Document Clustering on the Cloud

2021 ◽  
pp. 181-189
Author(s):  
Ruksana Akter ◽  
Yoojin Chung
Keyword(s):  
Genetic Algorithm ◽  
Virtual Machines ◽  
Document Clustering ◽  
Local Minima ◽  
Improved Genetic Algorithm ◽  
Crossover Point ◽  
Text Document ◽  
Cloud Environments ◽  
Traditional Approaches ◽  
Different Parts

This article presents a modified genetic algorithm for text document clustering on the cloud. Traditional approaches of genetic algorithms in document clustering represents chromosomes based on cluster centroids, and does not divide cluster centroids during crossover operations. This limits the possibility of the algorithm to introduce different variations to the population, leading it to be trapped in local minima. In this approach, a crossover point may be selected even at a position inside a cluster centroid, which allows modifying some cluster centroids. This also guides the algorithm to get rid of the local minima, and find better solutions than the traditional approaches. Moreover, instead of running only one genetic algorithm as done in the traditional approaches, this article partitions the population and runs a genetic algorithm on each of them. This gives an opportunity to simultaneously run different parts of the algorithm on different virtual machines in cloud environments. Experimental results also demonstrate that the accuracy of the proposed approach is at least 4% higher than the other approaches.

Performance Evaluation of VM Placement Using Classical Bin Packing and Genetic Algorithm for Cloud Environment

2017 ◽  
Vol 13 (1) ◽  
pp. 45-57 ◽  
Author(s):  
Oshin Sharma ◽  
Hemraj Saini
Keyword(s):  
Genetic Algorithm ◽  
Bin Packing ◽  
Virtual Machines ◽  
Cloud Environment ◽  
Vm Placement ◽  
Consolidation Process ◽  
Physical Machine ◽  
Overall Performance ◽  
Vm Consolidation ◽  
New Algorithms

In current era, the trend of cloud computing is increasing with every passing day due to one of its dominant service i.e. Infrastructure as a service (IAAS), which virtualizes the hardware by creating multiple instances of VMs on single physical machine. Virtualizing the hardware leads to the improvement of resource utilization but it also makes the system over utilized with inefficient performance. Therefore, these VMs need to be migrated to another physical machine using VM consolidation process in order to reduce the amount of host machines and to improve the performance of system. Thus, the idea of placing the virtual machines on some other hosts leads to the proposal of many new algorithms of VM placement. However, the reduced set of physical machines needs the lesser amount of power consumption therefore; in current work the authors have presented a decision making VM placement system based on genetic algorithm and compared it with three predefined VM placement techniques based on classical bin packing. This analysis contributes to better understand the effects of the placement strategies over the overall performance of cloud environment and how the use of genetic algorithm delivers the better results for VM placement than classical bin packing algorithms.

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

2019 ◽  
Vol 13 (1) ◽  
pp. 1-16 ◽  
Author(s):  
Oshin Sharma ◽  
Hemraj Saini
Keyword(s):  
Genetic Algorithm ◽  
Energy Consumption ◽  
Data Centers ◽  
Virtual Machines ◽  
Cloud Environment ◽  
Vm Placement ◽  
Energy Consumption Reduction ◽  
Sla Violation ◽  
Consumption Reduction ◽  
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.

Performance Evaluation of VM Placement Using Classical Bin Packing and Genetic Algorithm for Cloud Environment

2021 ◽  
pp. 1456-1470
Author(s):  
Oshin Sharma ◽  
Hemraj Saini
Keyword(s):  
Genetic Algorithm ◽  
Bin Packing ◽  
Virtual Machines ◽  
Cloud Environment ◽  
Vm Placement ◽  
Consolidation Process ◽  
Physical Machine ◽  
Overall Performance ◽  
Vm Consolidation ◽  
New Algorithms

In current era, the trend of cloud computing is increasing with every passing day due to one of its dominant service i.e. Infrastructure as a service (IAAS), which virtualizes the hardware by creating multiple instances of VMs on single physical machine. Virtualizing the hardware leads to the improvement of resource utilization but it also makes the system over utilized with inefficient performance. Therefore, these VMs need to be migrated to another physical machine using VM consolidation process in order to reduce the amount of host machines and to improve the performance of system. Thus, the idea of placing the virtual machines on some other hosts leads to the proposal of many new algorithms of VM placement. However, the reduced set of physical machines needs the lesser amount of power consumption therefore; in current work the authors have presented a decision making VM placement system based on genetic algorithm and compared it with three predefined VM placement techniques based on classical bin packing. This analysis contributes to better understand the effects of the placement strategies over the overall performance of cloud environment and how the use of genetic algorithm delivers the better results for VM placement than classical bin packing algorithms.

Deadline-Constrained Cost-Effective Load-Balanced Improved Genetic Algorithm for Workflow Scheduling

2021 ◽  
Vol 16 (4) ◽  
pp. 1-34
Author(s):  
Sandeep Kumar Bothra ◽  
Sunita Singhal ◽  
Hemlata Goyal
Keyword(s):  
Genetic Algorithm ◽  
Virtual Machines ◽  
Cost Effective ◽  
Critical Issue ◽  
Scientific Workflow ◽  
Workflow Scheduling ◽  
Improved Genetic Algorithm ◽  
Greedy Strategy ◽  
Mutation Operators ◽  
Load Balanced

Resource scheduling in a cloud computing environment is noteworthy for scientific workflow execution under a cost-effective deadline constraint. Although various researchers have proposed to resolve this critical issue by applying various meta-heuristic and heuristic approaches, no one is able to meet the strict deadline conditions with load-balanced among machines. This article has proposed an improved genetic algorithm that initializes the population with a greedy strategy. Greedy strategy assigns the task to a virtual machine that is under loaded instead of assigning the tasks randomly to a machine. In general workflow scheduling, task dependency is tested after each crossover and mutation operators of genetic algorithm, but here the authors perform after the mutation operation only which yield better results. The proposed model also considered booting time and performance variation of virtual machines. The authors compared the algorithm with previously developed heuristics and metaheuristics both and found it increases hit rate and load balance. It also reduces execution time and cost.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document