Nature inspired meta-heuristic algorithms for solving the load-balancing problem in cloud environments

被引:53
作者
Milan, Sara Tabaghchi [1 ]
Rajabion, Lila [2 ]
Ranjbar, Hamideh [3 ]
Navimipour, Nima Jafari [4 ]
机构
[1] Islamic Azad Univ, Tabriz Branch, Dept Comp Engn, Tabriz, Iran
[2] Univ S Florida, Dept Informat Technol, Sarasota, FL USA
[3] Islamic Azad Univ, Yasooj Branch, Dept Math, Yasuj, Iran
[4] Islamic Azad Univ, Islamshahr Branch, Young Researchers & Elite Club, Islamshahr, Iran
关键词
Cloud computing; Load-balancing; Meta-heuristic; Nature-inspired; Review; OPTIMIZATION ALGORITHM; RESOURCE-MANAGEMENT; FORECAST ENGINE; EXPERT CLOUD; GENETIC ALGORITHM; FEATURE-SELECTION; VIRTUAL MACHINES; SEARCH; SYSTEM; MECHANISMS;
D O I
10.1016/j.cor.2019.05.022
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In a cloud environment, the aim of using optimal resources can be achieved using a load-balancing technique. The load-balancing technique assigns a set of requests into a set of resources for distributing the load. It is one of the significant issues in cloud computing and known as an NP-hard problem. Therefore, many nature-inspired meta-heuristic techniques are proposed to provide high efficiency. However, despite the importance of the nature-inspired meta-heuristic techniques for solving the problem of the load-balancing in the cloud environment, there is not a complete and detailed paper about reviewing and studying the main important issues in this domain. Therefore, this paper presents comprehensive coverage of the nature-inspired meta-heuristic techniques applied in the area of the cloud load-balancing. The main goal of this paper is to highlight the emphasis on optimization algorithms and the benefits that they provide to overcome the cloud load-balancing challenges. In addition, to solve the load-balancing problem in the cloud environments, the advantages and disadvantage of the nature-inspired meta-heuristic algorithms have been analyzed and their significant challenges are considered for proposing the techniques that are more effective in the future. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:159 / 187
页数:29
相关论文
共 206 条
[11]  
[Anonymous], P 2 INT C INT TECHN
[12]  
[Anonymous], P 2017 IEEE INT S PA
[13]  
[Anonymous], P 2015 IEEE 7 INT C
[14]  
[Anonymous], P 2013 27 INT C ADV
[15]  
[Anonymous], PRIORITY BASED TASK
[16]  
[Anonymous], P IEEE 5 INT C INT C
[17]  
[Anonymous], 2014, Advanced Computing, Networking and Informatics, DOI DOI 10.1007/978-3-319-07350-7_45
[18]  
[Anonymous], P 2016 3 INT C DIG I
[19]  
[Anonymous], P 2014 IEEE 12 INT C
[20]  
[Anonymous], INT J INNOV RES SCI