Seog-Chan Oh, Ju-Yeon Lee, Seon-Hwa Cheong, Soo-min Lim, Min-Woo Kim, Sang-Seok Lee, Jin-Bum Park, S. Noh, Mye M. Sohn
{"title":"WSPR*: Web-Service Planner Augmented with A* Algorithm","authors":"Seog-Chan Oh, Ju-Yeon Lee, Seon-Hwa Cheong, Soo-min Lim, Min-Woo Kim, Sang-Seok Lee, Jin-Bum Park, S. Noh, Mye M. Sohn","doi":"10.1109/CEC.2009.13","DOIUrl":null,"url":null,"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.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Conference on Commerce and Enterprise Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2009.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24
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.
当使用大量web服务时,快速找到满足给定请求的web服务是非常重要的。此外,当没有单个web服务完全满足给定请求时,需要“组合”多个web服务来实现目标。对底层web服务组合框架做出明智的决策非常重要,因为针对此类组合问题的搜索空间通常呈指数级增长。此外,如果涉及语义和QoS问题,则组合问题很容易变得棘手。针对这一问题,本文提出了WSPR* - web - service PlanneR,增强了A*算法(一种标签纠错算法)来有效地组合web服务。