Title :
Web Services Composition Based on Weighted Planning Graph
Author :
Li, Wenqiang ; Dai, Xuemei ; Jiang, Hao
Author_Institution :
Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China
Abstract :
For the sake of fulfilling a more complex and more powerful service function, a method of web service composition (WSC-WPG), which is based on weighted planning graph is proposed. The method using AI Graph-plan consists of two phases. The first one is to construct the planning graph, which can find a service composition in a polynomial time in distributed and heterogeneous web services. The second one uses reserved iterative method to search the optimal composition solution in planning graph. Experiments show that, WSC-WPG has greatly improved the efficiency of combination.
Keywords :
Web services; computational complexity; graph theory; AI Graph-plan; Web services composition; polynomial time; reserved iterative method; weighted planning graph; Algorithm design and analysis; Ontologies; Planning; Polynomials; Semantic Web; Semantics; Web services; OWL-S; ontology; planning graph; services composition; web service;
Conference_Titel :
Networking and Distributed Computing (ICNDC), 2010 First International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4244-8382-2
DOI :
10.1109/ICNDC.2010.27
