In modern computing environments characterized by high variability and complex workloads, traditional load-balancing algorithms such as Round Robin and Least Connections are often found to be less effective in distributing tasks and maintaining optimal performance. In this paper, a hybrid load-balancing algorithm is proposed, where the strengths of Fastest Response Load Balancing (FRLB) and Priority-Based Load Balancing (PBLB) are combined. Through this adaptive approach, response times are minimized and load distribution across heterogeneous server environments is balanced more effectively. In the recent literature, the need for enhanced load-balancing solutions that can adapt to dynamic conditions in cloud computing, IoT, and large-scale web services has been increasingly emphasized. By integrating a hybrid mechanism, a robust solution is provided by the hybrid algorithm, which is designed to merge between FRLB and PBLB. As demonstrated through simulations, a noticeable improvement in performance is achieved, with a significant reduction in average response time when compared to FRLB and PBLB. The proposed algorithm outperforms the classical FRLB and PBLB.
Yahia Jazyah (Tue,) studied this question.