Introduction: Service-oriented computing
Communications of the ACM - Service-oriented computing
BF*: Web Services Discovery and Composition as Graph Search Problem
EEE '05 Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'05) on e-Technology, e-Commerce and e-Service
Web Services Platform Architecture: SOAP, WSDL, WS-Policy, WS-Addressing, WS-BPEL, WS-Reliable Messaging and More
A comparative illustration of AI planning-based web services composition
ACM SIGecom Exchanges
A Graph-Based Framework for Composition of Stateless Web Services
ECOWS '06 Proceedings of the European Conference on Web Services
Different Approaches to Semantic Web Service Composition
ICIW '08 Proceedings of the 2008 Third International Conference on Internet and Web Applications and Services
Applied Ontology
An Incremental Graph-based Approach to Automatic Service Composition
SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 1
Generalized Semantics-Based Service Composition
ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
Automatic Service Composition Using AND/OR Graph
CECANDEEE '08 Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services
WSC-08: Continuing the Web Services Challenge
CECANDEEE '08 Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services
Semantic Web Service Composition for Service-Oriented Architectures
CECANDEEE '08 Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services
Visualizing Compositions of Services from Large Repositories
CECANDEEE '08 Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services
WSPR*: Web-Service Planner Augmented with A* Algorithm
CEC '09 Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
HTN planning for Web Service composition using SHOP2
Web Semantics: Science, Services and Agents on the World Wide Web
QSynth: A Tool for QoS-aware Automatic Service Composition
ICWS '10 Proceedings of the 2010 IEEE International Conference on Web Services
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
ICWS '10 Proceedings of the 2010 IEEE International Conference on Web Services
Web Services: Concepts, Architectures and Applications
Web Services: Concepts, Architectures and Applications
AWSP: An Automatic Web Service Planner Based on Heuristic State Space Search
ICWS '11 Proceedings of the 2011 IEEE International Conference on Web Services
International Journal of Web Services Research
Hi-index | 0.00 |
The ability of web services to build and integrate loosely-coupled systems has attracted a great deal of attention from researchers in the field of the automatic web service composition. The combination of different web services to build complex systems can be carried out using different control structures to coordinate the execution flow and, therefore, finding the optimal combination of web services represents a non-trivial search effort. Furthermore, the time restrictions together with the growing number of available services complicate further the composition problem. In this paper the authors present an optimal and complete algorithm which finds all valid compositions from the point of view of the semantic input-output message structure matching. Given a request, a service dependency graph which represents a suboptimal solution is dynamically generated. Then, the solution is improved using a backward heuristic search based on the A* algorithm which finds all the possible solutions with different number of services and runpath. Moreover, in order to improve the scalability of our approach, a set of dynamic optimization techniques have been included. The proposal has been validated using eight different repositories from the Web Service Challenge 2008, obtaining all optimal solutions with minimal overhead.