WSPR*: Web-service planner augmented with A* algorithm

Seog Chan Oh, Ju Yeon Lee, Seon Hwa Cheong, Soo Min Lim, Min Woo Kim, Sang Seok Lee, Jin Bum Park, Sang Do Noh, Mye M. Sohn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

Abstract

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 "compose" 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.

Original languageEnglish
Title of host publication2009 IEEE Conference on Commerce and Enterprise Computing, CEC 2009
Pages515-518
Number of pages4
DOIs
StatePublished - 2009
Event2009 IEEE Conference on Commerce and Enterprise Computing, CEC 2009 - Vienna, Austria
Duration: 20 Jul 200023 Jul 2009

Publication series

Name2009 IEEE Conference on Commerce and Enterprise Computing, CEC 2009

Conference

Conference2009 IEEE Conference on Commerce and Enterprise Computing, CEC 2009
Country/TerritoryAustria
CityVienna
Period20/07/0023/07/09

Fingerprint

Dive into the research topics of 'WSPR*: Web-service planner augmented with A* algorithm'. Together they form a unique fingerprint.

Cite this