Task-oriented web Service Discovery Algorithm Using Semantic Similarity for Adaptive Service Composition

In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering service sis proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects, Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition (TWC) graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement real-time updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.

[1]  T. H. Tse,et al.  An Adaptive Service Selection Approach to Service Composition , 2008, 2008 IEEE International Conference on Web Services.

[2]  Elizabeth Chang,et al.  An Empirical Approach for Semantic Web Services Discovery , 2008, 19th Australian Conference on Software Engineering (aswec 2008).

[3]  Lifeng Ai,et al.  QoS-Based Web Service Composition Accommodating Inter-service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm , 2008, 2008 IEEE Fourth International Conference on eScience.

[4]  Christiane Fellbaum,et al.  Book Reviews: WordNet: An Electronic Lexical Database , 1999, CL.

[5]  James A. Hendler,et al.  HTN planning for Web Service composition using SHOP2 , 2004, J. Web Semant..