Quasi Oppositional Dragonfly Algorithm for Load Balancing in Cloud Computing Environment

In cloud computing (CC), load balancing tasks remain a critical problem in distributing resources from a data center. Ensure that every virtual machine (VM) has a balanced load to maximize capacity utilization. In the CC world, load balancing is a Non-Polynomial (NP) problem resolved with metaheuristic algorithms. A new Quasi-Oppositional Dragonfly Algorithm for Load Balancing (QODA-LB) has been developed to obtain optimum resource scheduling in a CC configuration. The proposed QODA-LB algorithm uses three variables to calculate an objective function: execution time, execution cost, and charge. The QODA-LB algorithm assigns tasks to VM according to its potential and the resulting objective function. Also, the QODA-LB algorithm employs the Quasi-Oppositional Based Learning principle to increase the standard convergence rate of the Dragonfly (DA) algorithm. A complete series of experiments were conducted, and the results were analyzed in various ways to ensure the increased efficiency of the QODA-LB algorithm. Simulation results demonstrated an optimal load balancing efficiency and outperformed key approaches.