Authors: Fethallah Hadjila; Amine Belabed; Mohammed Merzoug
Addresses: LRIT Laboratory, Department of Computer Science, University of Tlemcen, Algeria ' LRIT Laboratory, Department of Computer Science, University of Tlemcen, Algeria ' LRIT Laboratory, Department of Computer Science, University of Tlemcen, Algeria
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.
Keywords: web service selection; QoS uncertainty; global QoS conformance; constraint programming.
International Journal of Computational Science and Engineering, 2020 Vol.21 No.3, pp.470 - 482
Received: 01 Jul 2018
Accepted: 03 Mar 2019
Published online: 13 Mar 2020 *