A Dynamic QoS-Aware Semantic Web Service Composition Algorithm

Abstract. The aim of this work is to present a dynamic QoS-aware semantic web service composition algorithm that finds the minimal so-lution graph that satisfies the composition request considering multiple QoS criteria and semantic input-output message structure matching re-strictions. Our proposal starts computing an initial solution by selecting only those services from the dataset that are relevant to the user request and meet the semantic restrictions. Then, an optimal QoS-aware com-position is calculated using Dijkstra shortest path algorithm. Once the solution is obtained, the number of services is minimized using the opti-mal aggregated QoS value calculated in the previous step as a bound to prune the state space search. Moreover, a set of extensive experiments with five different datasets from the Web Service Challenge 2009-2010 is presented to prove the efficiency of our proposal