Abstract
Background: Cloud Computing can process and utilize efficient resources within a metered premise. This feature is a significant research problem, giving great Quality-of-Services (QoS) to the clients in cloud.
Objective: The objective of this study is to confirm QoS with minimum resource utilization time and costs, cloud service providers ought to receive self-versatile resource provisioning at each level. Various guidelines and model-based methodologies have been proposed for the management of resources in cloud services.
Methods: In this research article, resource allocation is done using the Salp Swarm Algorithm (SSA), which combines various VMs on a constrained Data Center with SLA and QoS factors.
Results: Different existing optimization algorithms are available such as First Fit, Greedy Crow Search (GCS) and Hybrid Crow Search algorithm (TSPCS). The combination of the Travelling Salesman Problem (TSP) and Crow Search Algorithm (CSA) is more efficient than the Fist Fit, GCS, and TSPCS in terms of the parameters such as resource utilization and response time. It is clearly shown that a user’s request takes minimum time and maximum QoS when employing the SSA algorithm in cloud computing.
Conclusion: The proposed mechanism is simulated on Cloudsim Simulator. The simulation results show less migration time that improve the QoS and minimizes the energy consumption in a cloud and IoT environment.
Keywords: Service Level Agreement (SLA), greedy crow search, hybrid crow search, salp swarm, algorithm, IoT.
Graphical Abstract
[http://dx.doi.org/10.14445/22312803/IJCTT-V27P110]
[http://dx.doi.org/10.2174/2210327909666181204121850]
[http://dx.doi.org/10.4018/IJMDEM.2020010103]
[http://dx.doi.org/10.4018/IJeC.2020010104]
[http://dx.doi.org/10.2174/2210327905666150914225626]
[http://dx.doi.org/10.32890/jict2018.17.3.3]
[http://dx.doi.org/10.1016/j.fcij.2018.11.005]
[http://dx.doi.org/10.1007/s11761-016-0196-3]
[http://dx.doi.org/10.1145/3319804]
[http://dx.doi.org/10.1109/ACCESS.2019.2905870]
[http://dx.doi.org/10.1109/ICEBE.2017.55]
[http://dx.doi.org/10.1109/ICIEA.2016.7603547]
[http://dx.doi.org/10.1109/CIIS.2017.42]
[http://dx.doi.org/10.1109/ACCESS.2017.2761553]
[http://dx.doi.org/10.1109/ACP.2018.8596285]
[http://dx.doi.org/10.1186/s13174-014-0011-3]
[http://dx.doi.org/10.1145/3231053.3231070]
[http://dx.doi.org/10.1109/ACCESS.2019.2933265]
[http://dx.doi.org/10.1016/j.future.2018.07.062]
[http://dx.doi.org/10.1007/s12652-018-0773-8]
[http://dx.doi.org/10.1109/TVT.2019.2901761]
[http://dx.doi.org/10.1007/s41870-017-0059-y]
[http://dx.doi.org/10.1016/j.future.2019.02.048]
[http://dx.doi.org/10.26483/ijarcs.v8i7.4194]
[http://dx.doi.org/10.1109/ICACCS.2017.8014639]
[http://dx.doi.org/10.1016/j.advengsoft.2017.07.002]