Power efficient virtual machine placement in cloud data centers with a discrete and chaotic hybrid optimization algorithm

被引:0
作者
Sasan Gharehpasha
Mohammad Masdari
Ahmad Jafarian
机构
[1] Islamic Azad University,Department of Computer Engineering, Urmia Branch
[2] Islamic Azad University,Department of Mathematics, Urmia Branch
来源
Cluster Computing | 2021年 / 24卷
关键词
Cloud computing; Virtualization technology; Sine Cosine algorithm; Salp Swarm optimizer; Chaotic functions; Power consumption; Resource management; SLA;
D O I
暂无
中图分类号
学科分类号
摘要
Cloud computing is a new computation technology that provides services to consumers and businesses. The main idea of Cloud computing is to present software and hardware services through the Internet to the users and organizations at all levels. In Cloud computing, the users pay for the services, which means a usage-based payment system is used in this technology. Using virtualization technology in computation resources enables the appropriate utilization of resources in cloud computing. One of the most significant challenging issues in virtualization technology is the placement of optimal virtual machines on physical machines in cloud data centers. The placement of virtual machines comprises a process wherein virtual machines are mapped onto physical machines in cloud data centers. Optimal deployment leads to the reduction in power consumption, optimal use of resources, traffic reduction in data centers, costs reduction, and efficiency enhancement of the data center in the cloud. The present article proposed a new approach using a combination of the Sine–Cosine Algorithm and Salp Swarm Algorithm as discrete multi-objective and chaotic functions for optimal virtual machine placement. The first goal of the proposed algorithm was to reduce the power consumption in cloud data centers by condensing the number of active physical machines. The second goal was to reduce the waste of resources and manage it by optimally virtual machine placement on physical machines in cloud data centers. The third objective was to minimize and reduce Service Level Agreement among the active physical machines in cloud data centers. The proposed method prevent the increase in the migration of virtual machines onto physical machines. Ultimately, the results obtained from the proposed algorithm were compared with those of previous akin algorithms in the literature, including First Fit, Virtual Machine Placement Ant Colony System, and Modified Best Fit Decreasing. The proposed scheme is tested using Amazon EC2 Instances and the result indicated that the proposed algorithm performs better than the existing algorithms for various performance metrics.
引用
收藏
页码:1293 / 1315
页数:22
相关论文
共 160 条
[1]  
Masdari M(2016)Towards workflow scheduling in cloud computing: a comprehensive analysis J. Netw. Comput. Appl. 66 64-82
[2]  
ValiKardan S(2016)A survey and taxonomy of DoS attacks in cloud computing Secur. Commun. Netw. 9 3724-3751
[3]  
Shahi Z(2016)A new technique for efficient live migration of multiple virtual machines Future Gener. Comput. Syst. 55 74-86
[4]  
Azar SI(2018)Discrete PSO-based workload optimization in virtual machine placement Pers. Ubiquit. Comput. 22 589-596
[5]  
Masdari M(2017)Simulated annealing based VM placement strategy to maximize the profit for Cloud Service Providers Eng . Sci. Technol. Int. J. 20 1249-1259
[6]  
Jalali M(2019)The placement of virtual machines under optimal conditions in cloud datacenter Inform. Technol. Control 48 545-556
[7]  
Sun G(2019)A survey and classification of the workload forecasting methods in cloud computing Clust. Comput. 36 1-26
[8]  
Liao D(2019)Efficient task and workflow scheduling in inter-cloud environments: challenges and opportunities J. Supercomput. 52 1-37
[9]  
Anand V(2018)A multi-objective ant colony system algorithm for virtual machine placement in traffic intense data centers IEEE Access 6 58912-58923
[10]  
Zhao D(2017)Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm Eng. Sci. Technol. Int. J. 20 616-628