Improving Service Selection for Cloud Service Brokerage using Hybrid Method

Faruku Umar Ambarsa

Abstract


In today's landscape, scheduling users' applications on distributed web services has become increasingly challenging due to the diverse and stringent nature of users' requirements. Additionally, the web market is flooded with a large number of web services, many of which exhibit dynamic performance characteristics during runtime, leading to significant uncertainties. Consequently, service agents face difficulties in selecting the most suitable web services that can meet the users' Quality of Service (QoS) demands. As a result, users often experience violations of their requirements. Several mechanisms have been proposed to address these issues. However, in demanding scenarios, these mechanisms often generate subpar solutions of low quality. To tackle this problem, this paper introduces a service selection scheme specifically designed for cloud service brokers. This scheme aims to minimize overhead while efficiently searching and recommending a suitable set of services that can fulfill the users' QoS demands. Experimental results demonstrate the capabilities of the proposed strategy and its effectiveness in producing satisfactory outcomes.

Full Text:

PDF

References


Y. Wang, J. Jiang, Y. Xia, Q. Wu and X. Luo, "A Multi-stage Dynamic Game-Theoretic," Springer International Publishing AG, part of Springer, pp. 137-152, 2018.

X. Zhenzhen, C. Xin, X. Xiujuan, Z. Xiaowei, J. J. Dai and Mingfei, "A look-ahead algorithm for online multiple workflow scheduling problem," Concurrent Engineering: Research, 2017.

M. H. Hilman, M. A. Rodriguez and R. Buyya, "Resource-sharing Policy in Multi-tenant Scientific Workflow as a Service Platform," JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8,, 2015.

Singh, G., & Chaturvedi, A. K. (2021, May). Particle swarm optimization-based approaches for cloud-based task and workflow scheduling: a systematic literature review. In 2021 2nd International Conference on Secure Cyber Computing and Communications (ICSCCC) (pp. 350-358). IEEE.

Saif, F. A., Latip, R., Derahman, M. N., & Alwan, A. A. (2022, October). Hybrid meta-heuristic genetic algorithm: Differential evolution algorithms for scientific workflow scheduling in heterogeneous cloud environment. In Proceedings of the Future Technologies Conference (pp. 16-43). Cham: Springer International Publishing.

Alsaih, M. A., Latip, R., Abdullah, A., Subramaniam, S. K., & Ali Alezabi, K. (2020). Dynamic job scheduling strategy using jobs characteristics in cloud computing. Symmetry, 12(10), 1638.

U. A. Faruku, L. Rohaya, A. Azizol and S. Shamala, "A particle swarm optimization and min–max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids," Springer Science+Business Media New York 2017, 2017.

M. Adhikari and S. Koley, "A Multi-workflow Scheduling Algorithm with Dynamic Reusability," Arabian Journal for Science and Engineering, 2017.

Y. Wang, S. Cao, Z. Feng, G. Wang and H. G. Zhang, "Fairness Scheduling with Dynamic Priority for Multi Workflow on Heterogeneous," in 2017 the 2nd IEEE International Conference on Cloud Computing and Big Data Analysis, 2017.

R. Amin, N. Mahmoud and E. D. H. J., "Fair multiple-workflow scheduling with different quality-of-service goals," Springer Science+Business Media, LLC, part of Springer Nature 2018, 2018.

S. Sharif, J. Taheri and A. Y. Zomaya, "Online Multiple Workflow Scheduling under Privacy and Deadline in Hybrid Cloud Environment," 2014 IEEE 6th International Conference on Cloud Computing Technology and Science, 2014.

G. Xie, G. Ze ng, J. Jiang, C. Fand, R. Lia and K. Li, "Energy Management for Multiple Real-time Workflows on Cyber-Physical Cloud Systems," Future Generation Computer Systems, 2017.

Bäck, T., Fogel, D. B., & Michalewicz, Z. (Eds.). (2018). Evolutionary computation 1: Basic algorithms and operators. CRC press.


Refbacks

  • There are currently no refbacks.