Efficient web service selection with uncertain QoS Online publication date: Fri, 27-Mar-2020
by Fethallah Hadjila; Amine Belabed; Mohammed Merzoug
International Journal of Computational Science and Engineering (IJCSE), Vol. 21, No. 3, 2020
Abstract: The QoS-based service selection in a highly dynamical environment is becoming a challenging issue. In practice, the QoS fluctuations of a service composition entail major difficulties in measuring the degree to which the user requirements are satisfied. In addition, the search space of feasible compositions (i.e., the solutions that preserve the requirements) is generally large and cannot be explored in a limited time; therefore, we need an approach that not only copes with the presence of uncertainty but also ensures a pertinent search with a reduced computational cost. To tackle this problem, we propose a constraint programming framework and a set of ranking heuristics that both reduce the search space and ensure a set of reliable compositions. The conducted experiments show that the ranking heuristics, termed 'fuzzy dominance' and 'probabilistic skyline', outperform almost all existing state-of-the-art methods.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com