Mendeley
TY  _  JOUR
ID  -  1402062844115
TI  -  Improving the load balancing in Cloud computing using a rapid SFL algorithm (R-SFLA)
JO  -  Journal of Information and Communication Technology
JA  -  ES
LA  -  fa
SN  -  2717-0411
AU  -  Salimi Kiomars
AU  -  Mollamotalebi Mahdi
AD  -  گروه کامپیوتر، واحد بوئین زهرا، دانشگاه آزاد اسلامی، بوئین زهرا، ایران
AD  -  گروه مهندسی کامپیوتر و فناوری اطلاعات، واحد قزوین، دانشگاه آزاد اسلامی، قزوین، ایران
Y1  -  2023
PY  -  2023
VL  -  57
IS  -  
SP  -  191
EP  -  210
KW  -  Cloud computing
KW  -   Load balancing
KW  -   Rapid shuffled frog leaping
KW  -   Resource scheduling
KW  -   Response time
DO  -  
N2  -  Nowadays, Cloud computing has many applications due to various services. On the other hand, due to rapid growth, resource constraints and final costs, Cloud computing faces with several challenges such as load balancing. The purpose of load balancing is management of the load distribution among the processing nodes in order to have the best usage of resources while having minimum response time for the users’ requests. Several methods for load balancing in Cloud computing have been proposed in the literature. The shuffled frog leaping algorithm for load balancing is a dynamic, evolutionary, and inspired by nature. This paper proposed a modified rapid shuffled frog leaping algorithm (R-SFLA) that converge the defective evolution of frogs rapidly. In order to evaluate the performance of R-SFLA, it is compared to Shuffled Frog Leaping Algorithm (SFLA) and Augmented Shuffled Frog Leaping Algorithm (ASFLA) by the overall execution cost, Makespan, response time, and degree of imbalance. The simulation is performed in CloudSim, and the results obtained from the experiments indicated that the proposed algorithm acts more efficient compared to other methods based on the above mentioned factors.
UR  - rimag.ir/en/Article/44115
L1  - rimag.ir/en/Article/Download/44115
ER  -  
