Dynamic composition of Web services using efficient planners in large-scale service repository
Web services as independent software components are published by service providers over the Internet and invoked by service requesters for their desired functionalities. In many cases, however, there is no single service in a Web service repository satisfying a service request. So how to design an efficient method for composing a chain of connected services has become an important research issue. Recently, much research has been done into the search time reduction when finding a composite service. However, most methods take a long time for traversing all of the Web services in a service repository, thus it makes their response time significantly overrun a users waiting patience. This paper develops an efficient approach for automatic composition of Web services using the state-of-the-art Artificial Intelligence (AI) planners, where a Web service composition (WSC) problem is regarded as a WSC planning problem. Unlike most traditional WSC methods that traverse a Web service repository many times, our approach converts a Web service repository into a planning domain in PDDL just once, which will only be regenerated when the Web service repository changes. This treatment substantially reduces the response time and improves the scalability of solving WSC problems. We have implemented a prototype system and conducted extensive experiments on large-scale Web service repositories. The experimental results demonstrate that our proposed approach outperforms the state-of-the-art.
web service service composition pddl automated planning deterministic planner