Effective Pruning Algorithm for QoS-Aware Service Composition

Zhenqiu Huang, Wei Jiang, Songlin Hu, Zhiyong Liu
{"title":"Effective Pruning Algorithm for QoS-Aware Service Composition","authors":"Zhenqiu Huang, Wei Jiang, Songlin Hu, Zhiyong Liu","doi":"10.1109/CEC.2009.41","DOIUrl":null,"url":null,"abstract":"Abstract—Automatic service composition has been a hottopic in both academia and industry. It begins with syntacticcomposition, and then evolves semantic description. Recently, QoS of the composition comes into researchers’ mind, which aims at meeting the need of the overall qualities like service fee, response time, throughput, etc. In this paper, a novel QoSaware approach is presented. It adopts a forward filtering algorithm to reduce the number of service candidates, along with a modified dynamic programming approach to compute optimal values. Finally, a backward search is utilized to find out the optimal composition results efficiently.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"61","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.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 61

Abstract

Abstract—Automatic service composition has been a hottopic in both academia and industry. It begins with syntacticcomposition, and then evolves semantic description. Recently, QoS of the composition comes into researchers’ mind, which aims at meeting the need of the overall qualities like service fee, response time, throughput, etc. In this paper, a novel QoSaware approach is presented. It adopts a forward filtering algorithm to reduce the number of service candidates, along with a modified dynamic programming approach to compute optimal values. Finally, a backward search is utilized to find out the optimal composition results efficiently.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
qos感知服务组合的有效剪枝算法
服务自动组合一直是学术界和工业界关注的热点问题。它从句法构成开始,然后发展为语义描述。最近,组合物的QoS进入了研究者的脑海,它旨在满足服务费用、响应时间、吞吐量等整体质量的需要。本文提出了一种新的QoSaware方法。它采用前向过滤算法来减少候选服务的数量,并采用改进的动态规划方法来计算最优值。最后,采用反向搜索的方法,有效地找出最优组合结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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