A Method of Automatic Web Services Composition Based on Directed Graph

Existed methods for automatic web services composition based on output parameters and input parameters matching relations of services are limited to linear or tree composition plan and malfunction to the netty plan because they ignore relations between services participating in composition. In order to overcome the shortcoming of the existed methods, a new method is proposed in this paper. In this method, services composition is modeled as a directed graph, and the maximal services composition graph is constructed first, then all the minimal composition graphs will be abstracted from the maximal one by the shared nodes in it. This method can deal with linear/tree/netty composition plan because it finds out not only all services participating in composition, but also all relations between services. All composition plans can be acquired for user to choose by using this method.

[1]  Jun Ma,et al.  An Efficient Approach to Web Services Discovery and Composition when Large Scale Services are Available , 2006, 2006 IEEE Asia-Pacific Conference on Services Computing (APSCC'06).

[2]  Freddy Lécué,et al.  Semantic Web Service Composition Based on a Closed World Assumption , 2006, 2006 European Conference on Web Services (ECOWS'06).

[3]  Freddy Lécué,et al.  Semantic Web Service Composition through a Matchmaking of Domain , 2006, 2006 European Conference on Web Services (ECOWS'06).

[4]  Ming He,et al.  AND/OR Tree Search Algorithm in Web Service Composition , 2008, 2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application.

[5]  Chang Yang,et al.  A Tree-based Method of Web Service Composition , 2008, 2008 Third International Conference on Pervasive Computing and Applications.

[6]  Lerina Aversano,et al.  An algorithm for Web service discovery through their composition , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

[7]  Jun Ma,et al.  An Efficient Algorithm for Web Services Composition with a Chain Data Structure , 2006, APSCC.

[8]  Byung-Won On,et al.  BF*: Web services discovery and composition as graph search problem , 2005, 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service.

[9]  Lerina Aversano,et al.  An algorithm for Web service discovery through their composition , 2004 .

[10]  Marco Aiello,et al.  Web Service Indexing for Efficient Retrieval and Composition , 2006, The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06).