High Performance Approach for Multi-QoS Constrained Web Services Selection

In general, multi-QoS constrained Web Services composition, with or without optimization, is a NP-complete problem on computational complexity that cannot be exactly solved in polynomial time. A lot of heuristics and approximation algorithms with polynomial- and pseudo-polynomial-time complexities have been designed to deal with this problem. However, they suffer from excessive computational complexities that cannot be used for service composition in runtime. In this paper, we propose a high performance approach for multi-QoS constrained Web Services selection. Firstly, a correlation model of candidate services are established in order to reduce the search space efficiently. Based on the correlation model, a heuristic algorithm is then proposed to find a feasible solution for multi-QoS constrained Web Services selection with high performance and high precision. The experimental results show that the proposed approach can achieve the expecting goal.