An Optimal Service Selection with Constraints Based on QoS Algorithm

In the paper, we propose an allocation scheme that minimizes the response time and cost of the solution subject to reliability and availability constraints in terms of expected value. The algorithm proposed in this paper aims to discover services with high QoS performance, and reduce the execute time at the same time. First, we identify the impact of various structural aspects of the composition in terms of the performance and outcomes of the composition. Then, an algorithm is proposed which can reduce the computing time and makes sure better quality of the services selection at the same time by examining a very tiny fraction of the solution space. Finally, we proves the advantage of the new algorithm by comparing the time obtained by our proposed algorithm with the one achieved by other algorithm.