scholarly journals Multi-Agent Genetic Algorithm for Efficient Load Balancing in Cloud Computing

Cloud computing, one of the fastest growing fields, is the the delivery of computing resources and services. Load balancing is a key problem in cloud computing (CC) that deals with the even distribution of work load across multiple virtual machines to ensure that no machine is overloaded or underutilized during the task computation. The load balancing optimization problem is an NP-hard problem, hence, for the optimal usage of available resources, we propose a new efficient user-priority multi-agent genetic algorithm (GA). Our algorithm takes the “users’ priority and earliest job finishing time” into consideration for minimizing the response time and energy. We simulate our algorithm using Cloud-Analyst and show that our algorithm outperforms the existing algorithms for load balancing.

Cloud computing is a research trend which bring various cloud services to the users. Cloud environment face various challenges and issues to provide efficient services. In this paper, a novel Genetic Algorithm based load balancing algorithm has been implemented to balance the load in the network. The literature review has been studied to understand the research gap. More specifically, load balancing technique authenticate the network by enabling Virtual Machines (VM). The proposed technique has been further evaluated using the Schedule Length Runtime (SLR) and Energy consumption (EC) parameters. Overall, the effective results has been obtained such as 46% improvement in consuming the energy and 12 % accuracy for the SLR measurement. In addition, results has been compared with the conventional approaches to validate the outcomes.


Author(s):  
Sovban Nisar ◽  
Deepika Arora

A structural design in which virtual machines are implicated and connect to the cloud service provider is called cloud computing. On the behalf of the users, the virtual machines connect to the cloud service provider. The uncertainties overload the virtual machines. The genetic algorithm is implemented for the migration of virtual machine in the earlier study. The genetic algorithm is low depicts latency within the network is high at the time of virtual machine migration. The genetic algorithm is implemented for virtual machine migration in this study. The proposed algorithm is applied in MATLAB in this work. The obtained results are compared with the results of earlier algorithm. Various parameters like latency, bandwidth consumption, and space utilization are used to analyze the achieved results.


2021 ◽  
Vol 10 (4) ◽  
pp. 2320-2326
Author(s):  
Yasameen A. Ghani Alyouzbaki ◽  
Muaayed F. Al-Rawi

The cloud is the framework in which communication is connected with virtual machines, data centers, hosts, and brokers. The broker searches for a highly reliable cloudlet virtual machine for execution. Vulnerability can occur in the network because of which framework gets overburden. A research strategy is introduced in this article to expand the fault tolerance of the framework. The proposed approach improvement depends on the algorithm of ant colony optimization (ACO) that can choose the better virtual machine on which is to migrate the cloudlet to reduce the execution time and energy consumption. The efficiency of the proposed approach simulated in terms of execution time, energy consumption and examined with CloudSim. The introduction is provided in this article with a detailed description of cloud computing and, in addition, green cloud computing with its models. This article also discussed the virtual machine (VM) in more depth in the introduction section, which allows cloud service providers to supervise cloud resources competently while dispensing with the need for human oversight. Then the article submitted and explained the related works with their discussion and then it explained the novel proposed load balancing based on ACO technique and concluded that the execution time and energy consumption of the proposed technique is better than the three-threshold energy saving algorithm (TESA) technique that is commonly used in cloud load balancing.


2021 ◽  
Vol 11 (14) ◽  
pp. 6244
Author(s):  
Rohail Gulbaz ◽  
Abdul Basit Siddiqui ◽  
Nadeem Anjum ◽  
Abdullah Alhumaidi Alotaibi ◽  
Turke Althobaiti ◽  
...  

Task scheduling is one of the core issues in cloud computing. Tasks are heterogeneous, and they have intensive computational requirements. Tasks need to be scheduled on Virtual Machines (VMs), which are resources in a cloud environment. Due to the immensity of search space for possible mappings of tasks to VMs, meta-heuristics are introduced for task scheduling. In scheduling makespan and load balancing, Quality of Service (QoS) parameters are crucial. This research contributes a novel load balancing scheduler, namely Balancer Genetic Algorithm (BGA), which is presented to improve makespan and load balancing. Insufficient load balancing can cause an overhead of utilization of resources, as some of the resources remain idle. BGA inculcates a load balancing mechanism, where the actual load in terms of million instructions assigned to VMs is considered. A need to opt for multi-objective optimization for improvement in load balancing and makespan is also emphasized. Skewed, normal and uniform distributions of workload and different batch sizes are used in experimentation. BGA has exhibited significant improvement compared with various state-of-the-art approaches for makespan, throughput and load balancing.


2009 ◽  
Vol 26 (04) ◽  
pp. 479-502 ◽  
Author(s):  
BIN LIU ◽  
TEQI DUAN ◽  
YONGMING LI

In this paper, a novel genetic algorithm — dynamic ring-like agent genetic algorithm (RAGA) is proposed for solving global numerical optimization problem. The RAGA combines the ring-like agent structure and dynamic neighboring genetic operators together to get better optimization capability. An agent in ring-like agent structure represents a candidate solution to the optimization problem. Any agent interacts with neighboring agents to evolve. With dynamic neighboring genetic operators, they compete and cooperate with their neighbors, and they can also use knowledge to increase energies. Global numerical optimization problems are the most important ones to verify the performance of evolutionary algorithm, especially of genetic algorithm and are mostly of interest to the corresponding researchers. In the corresponding experiments, several complex benchmark functions were used for optimization, several popular GAs were used for comparison. In order to better compare two agents GAs (MAGA: multi-agent genetic algorithm and RAGA), the several dimensional experiments (from low dimension to high dimension) were done. These experimental results show that RAGA not only is suitable for optimization problems, but also has more precise and more stable optimization results.


2017 ◽  
Vol 7 (1) ◽  
pp. 485-490 ◽  
Author(s):  
M.N. Satymbekov ◽  
I.T. Pak ◽  
L. Naizabayeva ◽  
Ch.A. Nurzhanov

AbstractIn this study the work presents the system designed for automated load balancing of the contributor by analysing the load of compute nodes and the subsequent migration of virtual machines from loaded nodes to less loaded ones. This system increases the performance of cluster nodes and helps in the timely processing of data. A grid system balances the work of cluster nodes the relevance of the system is the award of multi-agent balancing for the solution of such problems.


Author(s):  
Pooja Arora ◽  
Anurag Dixit

Purpose The advancements in the cloud computing has gained the attention of several researchers to provide on-demand network access to users with shared resources. Cloud computing is important a research direction that can provide platforms and softwares to clients using internet. However, handling huge number of tasks in cloud infrastructure is a complicated task. Thus, it needs a load balancing (LB) method for allocating tasks to virtual machines (VMs) without influencing system performance. This paper aims to develop a technique for LB in cloud using optimization algorithms. Design/methodology/approach This paper proposes a hybrid optimization technique, named elephant herding-based grey wolf optimizer (EHGWO), in the cloud computing model for LB by determining the optimal VMs for executing the reallocated tasks. The proposed EHGWO is derived by incorporating elephant herding optimization (EHO) in grey wolf optimizer (GWO) such that the tasks are allocated to the VM by eliminating the tasks from overloaded VM by maintaining the system performance. Here, the load of physical machine (PM), capacity and load of VM is computed for deciding whether the LB has to be done or not. Moreover, two pick factors, namely, task pick factor (TPF) and VM pick factor (VPF), are considered for choosing the tasks for reallocating them from overloaded VM to underloaded VM. The proposed EHGWO decides the task to be allocated in the VM based on the newly derived fitness functions. Findings The minimum load and makespan obtained in the existing methods, constraint measure based LB (CMLB), fractional dragonfly based LB algorithm (FDLA), EHO, GWO and proposed EHGWO for the maximum number of VMs is illustrated. The proposed EHGWO attained minimum makespan with value 814,264 ns and minimum load with value 0.0221, respectively. Meanwhile, the makespan values attained by existing CMLB, FDLA, EHO, GWO, are 318,6896 ns, 230,9140 ns, 1,804,851 ns and 1,073,863 ns, respectively. The minimum load values computed by existing methods, CMLB, FDLA, EHO, GWO, are 0.0587, 0.026, 0.0248 and 0.0234. On the other hand, the proposed EHGWO with minimum load value is 0.0221. Hence, the proposed EHGWO attains maximum performance as compared to the existing technique. Originality/value This paper illustrates the proposed LB algorithm using EHGWO in a cloud computing model using two pitch factors, named TPF and VPF. For initiating LB, the tasks assigned to the overloaded VM are reallocated to under loaded VMs. Here, the proposed LB algorithm adapts capacity and loads for the reallocation. Based on TPF and VPF, the tasks are reallocated from VMs using the proposed EHGWO. The proposed EHGWO is developed by integrating EHO and GWO algorithm using a new fitness function formulated by load of VM, migration cost, load of VM, capacity of VM and makespan. The proposed EHGWO is analyzed based on load and makespan.


2017 ◽  
Vol 10 (13) ◽  
pp. 162
Author(s):  
Amey Rivankar ◽  
Anusooya G

Cloud computing is the latest trend in large-scale distributed computing. It provides diverse services on demand to distributive resources such asservers, software, and databases. One of the challenging problems in cloud data centers is to manage the load of different reconfigurable virtual machines over one another. Thus, in the near future of cloud computing field, providing a mechanism for efficient resource management will be very significant. Many load balancing algorithms have been already implemented and executed to manage the resources efficiently and adequately. The objective of this paper is to analyze shortcomings of existing algorithms and implement a new algorithm which will give optimized load balancingresult.


2019 ◽  
Vol 10 (4) ◽  
pp. 1-17 ◽  
Author(s):  
Mohit Agarwal ◽  
Gur Mauj Saran Srivastava

Cloud computing is an emerging technology which involves the allocation and de-allocation of the computing resources using the internet. Task scheduling (TS) is one of the fundamental issues in cloud computing and effort has been made to solve this problem. An efficient task scheduling mechanism is always needed for the allocation to the available processing machines in such a manner that no machine is over or under-utilized. Scheduling tasks belongs to the category of NP-hard problem. Through this article, the authors are proposing a particle swarm optimization (PSO) based task scheduling mechanism for the efficient scheduling of tasks among the virtual machines (VMs). The proposed algorithm is compared using the CloudSim simulator with the existing greedy and genetic algorithm-based task scheduling mechanism. The simulation results clearly show that the PSO-based task scheduling mechanism clearly outperforms the others as it results in almost 30% reduction in makespan and increases the resource utilization by 20%.


Sign in / Sign up

Export Citation Format

Share Document