Skip to Main Content
Dynamic services selection is an important and challenging work, especially, when a set of services have similar functionality and are available to the requesters' demands. Therefore, it is necessary to distinguish among these reliable services by computing the QoS value. Crucially, an optimal service can be selected depending on a combined evaluation of qualities of service (QoS). At the same time, these web services that meet the users' requirements should support rapid and dynamic composition of services. In this paper, we presented a QoS-based computation model for web service selection through improving the previous normalization algorithm by which the same QoS value may be gained for different services. In addition, it should have minimal time overhead and more precise service location.