WSPR*: Web-Service Planner Augmented with A* Algorithm
Seog‐Chan Oh, Ju-Yeon Lee, Seon-Hwa Cheong, Soo-min Lim, Minwoo Kim, Sang‐Seok Lee, Jin-Bum Park, Sang Do Noh, Mye M. Sohn · 2009
When there are a large number of web services in use, it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to ldquocomposerdquo multiple web services to fulfill the goal. It is important to have a wise decision on underlying web-service composition framework because the search space for such a composition problem is in general exponentially increasing. Furthermore, if semantic and QoS issues are concerned, the composition problems become easily intractable. Toward this problem, in this paper, we present WSPR* - Web-Service PlanneR augmented with A* algorithm (a Label Correcting variation algorithm) to compose web services effectively.