An Optimal Service Selection with Constraints Based on QoS

The SOA model brings new benefits to software design and architecture by enabling re-use and sharing of services. Due to the uncertain of web service, it is important to make sure that the selected service is always reliable and available. In this work, 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. 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. (C) 2011 Published by Elsevier B.V. Selection and/or peer-review under responsibility of Garry Lee