Dynamic Pick Method of Web Service Selection Algorithms Based on Use Mode in Self-adaptive Web Service Composition

Liao Guohong, Na Jun, Zhang Bin, Dong Pengxiang, Zhang Yuesong
{"title":"Dynamic Pick Method of Web Service Selection Algorithms Based on Use Mode in Self-adaptive Web Service Composition","authors":"Liao Guohong, Na Jun, Zhang Bin, Dong Pengxiang, Zhang Yuesong","doi":"10.1109/IJCSS.2011.13","DOIUrl":null,"url":null,"abstract":"To solve the contradiction between self-adaptive efficiency and optimization effect existing in the execution of current self-adaptive Web service composition, this paper proposes a dynamic pick method of Web service selection algorithms based on use mode. The dynamic pick method chooses service selection algorithm which best fits the runtime self-adaptive situation as adaptive strategy in self-adaptive Web service composite. And to achieve the dynamic pick, this paper presents two estimation methods of service selection algorithm's execution time in different ways. Through implementation and analysis, this paper adopts an associative way of two estimation methods. At last, this paper implements and tests the dynamic pick method. Test results show that the dynamic pick method based on use mode can effectively relieve the contradiction.","PeriodicalId":251415,"journal":{"name":"2011 International Joint Conference on Service Sciences","volume":"45 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Joint Conference on Service Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCSS.2011.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To solve the contradiction between self-adaptive efficiency and optimization effect existing in the execution of current self-adaptive Web service composition, this paper proposes a dynamic pick method of Web service selection algorithms based on use mode. The dynamic pick method chooses service selection algorithm which best fits the runtime self-adaptive situation as adaptive strategy in self-adaptive Web service composite. And to achieve the dynamic pick, this paper presents two estimation methods of service selection algorithm's execution time in different ways. Through implementation and analysis, this paper adopts an associative way of two estimation methods. At last, this paper implements and tests the dynamic pick method. Test results show that the dynamic pick method based on use mode can effectively relieve the contradiction.
自适应Web服务组合中基于使用模式的Web服务选择算法动态选择方法
针对当前自适应Web服务组合执行中存在的自适应效率与优化效果之间的矛盾,提出了一种基于使用模式的Web服务选择算法的动态选择方法。动态选择方法选择最适合运行时自适应情况的服务选择算法作为自适应Web服务组合的自适应策略。为了实现服务选择算法的动态选择,本文提出了两种不同方式的服务选择算法执行时间估计方法。通过实现和分析,本文采用了两种估计方法的关联方式。最后,本文对动态拾取方法进行了实现和测试。试验结果表明,基于使用模式的动态拾取方法可以有效地缓解这一矛盾。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信