Load Balancing based on Bee Colony Algorithm with Partitioning of Public Clouds

Cloud computing is an emerging trend in the IT industry that provides new opportunities to control costs associated with the creation and maintenance of applications. Of prevalent issues in cloud computing, load balancing is a primary one as it has a significant impact on efficiency and plays a leading role in improved management. In this paper, by using a heuristic search technique called the bee colony algorithm, tasks are balanced on a virtual machine such that their waiting time in the queue is minimized. In the proposed model, the cloud is partitioned into several sectors with many nodes as resources of distributed computing. Furthermore, the indices of speed and cost are considered to prioritize virtual machines. The results of a simulation show that the proposed model outperforms prevalent algorithms as it balances the prioritization of tasks on the virtual machine as well as the entire cloud system and minimizes the waiting times of tasks in the queue. It also reduces the completion time of tasks in comparison with the HBB-LB, WRR, and FCFS algorithms.