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, 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
WSPR*:基于A*算法的web服务规划器
当使用大量web服务时,快速找到满足给定请求的web服务是非常重要的。此外,当没有单个web服务完全满足给定请求时,需要“组合”多个web服务来实现目标。对底层web服务组合框架做出明智的决策非常重要,因为针对此类组合问题的搜索空间通常呈指数级增长。此外,如果涉及语义和QoS问题,则组合问题很容易变得棘手。针对这一问题,本文提出了WSPR* - web - service PlanneR,增强了A*算法(一种标签纠错算法)来有效地组合web服务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Web-Based Process Portals: Powering Business Process Management within Large Organisations Time-BPMN Process Mining of RFID-Based Supply Chains SARI-SQL: Event Query Language for Event Analysis Decision-Support for Optimizing Supply Chain Formation Based on CSET Model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1