Hybridization of meta-heuristic algorithm for load balancing in cloud computing environment

Load balancing of tasks on the cloud environment is an important aspect of distributing resources from a data centre. Due to the dynamic computing through the internet; cloud computing agonizes from overloading of requests. Load balancing has to be carried out in such a manner that all virtual machi...

Full description

Saved in:
Bibliographic Details
Main Authors: U.K. Jena, P.K. Das, M.R. Kabat
Format: Article
Language:English
Published: Springer 2022-06-01
Series:Journal of King Saud University: Computer and Information Sciences
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S1319157819309267
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Load balancing of tasks on the cloud environment is an important aspect of distributing resources from a data centre. Due to the dynamic computing through the internet; cloud computing agonizes from overloading of requests. Load balancing has to be carried out in such a manner that all virtual machines (VM) should have balanced load to achieve optimal utilization of its capabilities. This paper proposes a novel methodology of dynamic balancing of load among the virtual machines using hybridization of modified Particle swarm optimization (MPSO) and improved Q-learning algorithm named as QMPSO. The hybridization process is carried out to adjust the velocity of the MPSO through the gbest and pbest based on the best action generated through the improved Q-learning. The aim of hybridization is to enhance the performance of the machine by balancing the load among the VMs, maximize the throughput of VMs and maintain the balance between priorities of tasks by optimizing the waiting time of tasks. The robustness of the algorithm has been validated by comparing the results of the QMPSO obtained from the simulation process with the existing load balancing and scheduling algorithm. The comparison of the simulation and real platform result shows our proposed algorithm is outperforming its competitor.
ISSN:1319-1578