Gabi, Danlami and Ismail, Abdul Samad and Zainal, Anazida and Zakaria, Zalmiyah and Abraham, Ajith and Muhammed Dankolo, Nasiru (2020) Cloud customers service selection scheme based on improved conventional cat swarm optimization. Neural Computing and Applications, 32 (18). pp. 14817-148381. ISSN 0941-0643
|
PDF
2MB |
Official URL: http://dx.doi.org/10.1007/s00521-020-04834-6
Abstract
With growing demand on resources situated at the cloud datacenters, the need for customers’ resource selection techniques becomes paramount in dealing with the concerns of resource inefficiency. Techniques such as metaheuristics are promising than the heuristics, most especially when handling large scheduling request. However, addressing certain limitations attributed to the metaheuristic such as slow convergence speed and imbalance between its local and global search could enable it become even more promising for customers service selection. In this work, we propose a cloud customers service selection scheme called Dynamic Multi-Objective Orthogonal Taguchi-Cat (DMOOTC). In the proposed scheme, avoidance of local entrapment is achieved by not only increasing its convergence speed, but balancing between its local and global search through the incorporation of Taguchi orthogonal approach. To enable the scheme to meet customers’ expectations, Pareto dominant strategy is incorporated providing better options for customers in selecting their service preferences. The implementation of our proposed scheme with that of the benchmarked schemes is carried out on CloudSim simulator tool. With two scheduling scenarios under consideration, simulation results show for the first scenario, our proposed DMOOTC scheme provides better service choices with minimum total execution time and cost (with up to 42.87%, 35.47%, 25.49% and 38.62%, 35.32%, 25.56% reduction) and achieves 21.64%, 18.97% and 13.19% improvement for the second scenario in terms of execution time compared to that of the benchmarked schemes. Similarly, statistical results based on 95% confidence interval for the whole scheduling scheme also show that our proposed scheme can be much more reliable than the benchmarked scheme. This is an indication that the proposed DMOOTC can meet customers’ expectations while providing guaranteed performance of the whole cloud computing environment.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | cat swarm optimization, cloud computing, pareto dominance, scheduling |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | Computing |
ID Code: | 91714 |
Deposited By: | Yanti Mohd Shah |
Deposited On: | 27 Jul 2021 05:46 |
Last Modified: | 27 Jul 2021 05:46 |
Repository Staff Only: item control page