Abstract

QoS-aware binding of composite services provides the capability of binding each service invocation in a composition to a service chosen among a set of functionally equivalent ones to achieve a QoS goal. Hence, service selection approach plays a very important role in service computing. However existing approaches little considered the computation time. In this study, we propose a fast QoS-aware web service selection approach. This approach adopts a particle swarm optimization algorithm select the most service with users’ QoS requirements Experimental results show that our approach can find best suitable services with lower time cost than other approaches in web service selection.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call