Publication Date:
2012-09-27
Description:
This paper proposes a novel approach based on the planning-graph to solve the top-k QoS-aware automatic composition problem of semantic Web services. The approach includes three sequential stages: a forward search stage to generate a planning-graph to reduce the search space of the following two stages greatly, an optimal local QoS calculating stage to compute all the optimal local QoS values of services in the planning, and a backward search stage to find the top-K composed services with optimal QoS values according to the planning-graph and the optimal QoS value. In order to validate the approach, experiments are carried out based on the test sets offered by the WS-Challenge competition 2009. The results show that the approach can find the same optimal solution as the champion system from the competition but also can provide more alternative solutions with the optimal QoS for users. Content Type Journal Article Category Regular Paper Pages 1-27 DOI 10.1007/s10115-012-0541-6 Authors Shuiguang Deng, College of Computer Science and Technology, Zhejiang University, Hang Zhou, 310012 China Bin Wu, College of Computer Science and Technology, Zhejiang University, Hang Zhou, 310012 China Jianwei Yin, College of Computer Science and Technology, Zhejiang University, Hang Zhou, 310012 China Zhaohui Wu, College of Computer Science and Technology, Zhejiang University, Hang Zhou, 310012 China Journal Knowledge and Information Systems Online ISSN 0219-3116 Print ISSN 0219-1377
Print ISSN:
0219-1377
Electronic ISSN:
0219-3116
Topics:
Computer Science
