Dynamic service selection based on adaptive global QoS constraints decomposition

14Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

As there are more and more available Web services with the same or similar functionalities but different Quality of Service (QoS), the challenge of QoS-aware service composition is to efficiently select appropriate component services to achieve maximum utility and meet the global QoS constraints with low time cost. In this paper, we propose a dynamic service selection approach based on adaptive global QoS constraints decomposition. Fuzzy logic technology and Cultural Genetic Algorithm are used to adaptively decompose global QoS constraints into near-optimal local constraints. According to the near-optimal local constraints, the optimal service is selected for each service class during the running time efficiently. Experimental results show that the proposed approach not only achieves the near-optimal solution, but also significantly reduces the computation time, and has good adaptability and scalability.

Cite

CITATION STYLE

APA

Yuan, Y., Zhang, W., Zhang, X., & Zhai, H. (2019). Dynamic service selection based on adaptive global QoS constraints decomposition. Symmetry, 11(3). https://doi.org/10.3390/sym11030403

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free