Paper Info
Title
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 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.
Year
DOI
Venue
2012
10.1007/978-3-642-34321-6_48
ICSOC
Keywords
Field
DocType
semantic restriction,semantic input-output message structure,minimal solution graph,dynamic qos-aware semantic web,optimal qos-aware composition,service composition algorithm,initial solution,qos value,dijkstra shortest path algorithm,composition request,shortest path
Message structure,Data mining,Graph,Qos aware,Shortest path problem,Computer science,Quality of service,Algorithm,State space search,Semantic web service composition,Dijkstra's algorithm
Conference
Citations 
PageRank 
References 
10
0.55
10
Authors
3
Name
Order
Citations
PageRank
Pablo Rodriguez-Mier11666.77
Manuel Mucientes237835.05
Manuel Lama338334.84