QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
Effective Web Service Composition in Diverse and Large-Scale Service Networks
IEEE Transactions on Services Computing
Optimal QoS-Aware Web Service Composition
CEC '09 Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing
WSPR*: Web-Service Planner Augmented with A* Algorithm
CEC '09 Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing
A QoS-Driven Approach for Semantic Service Composition
CEC '09 Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing
QSynth: A Tool for QoS-aware Automatic Service Composition
ICWS '10 Proceedings of the 2010 IEEE International Conference on Web Services
Automatic Web Service Composition with a Heuristic-Based Search Algorithm
ICWS '11 Proceedings of the 2011 IEEE International Conference on Web Services
Service selection algorithms for composing complex services with multiple qos constraints
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
A survey of automated web service composition methods
SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
| Hi-index | 0.00 |
The aim of this work is to present a dynamic QoS-aware semantic web service composition algorithm that finds the minimal solution graph that satisfies the composition request considering multiple QoS criteria and semantic input-output message structure matching restrictions. 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 composition is calculated using Dijkstra shortest path algorithm. Once the solution is obtained, the number of services is minimized using the optimal 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.