基于多目标优化服务执行时间线的qos感知服务自动组合

Zhaoning Wang, B. Cheng, Wenkai Zhang, Junliang Chen
{"title":"基于多目标优化服务执行时间线的qos感知服务自动组合","authors":"Zhaoning Wang, B. Cheng, Wenkai Zhang, Junliang Chen","doi":"10.1109/SCC49832.2020.00046","DOIUrl":null,"url":null,"abstract":"With the evolution of web technologies, various services become available in the pervasive network environment. Combining atomic services via the input and output dependency according to functional requirements with the multiple nonfunctional Quality-of-Service (QoS) guarantees has become a widely considered optimization problem. The conventional multi-objective service composition relying on manually predefined service chains fails to ensure global optimality. Although the automatic service composition successfully expands the search space, the searching graph which it relies on causes computationally expensive and fails to handle multiple objectives. Therefore, this paper proposes a novel efficient multi-objective automatic service composition approach. Particularly, it introduces a service execution timeline model to decompose the composition problem into several sub-problems to reduce computational complexity. Further, it employs an evolutionary process to explore the search space and determine the approximately Pareto front of the composition solutions. The experimental results on the benchmarks show that our approach could achieve a better trade-off between the computation cost and ensuring a better QoS compared with two recently proposed automatic composition approaches.","PeriodicalId":274909,"journal":{"name":"2020 IEEE International Conference on Services Computing (SCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"QoS-aware Automatic Service Composition Based on Service Execution Timeline with Multi-objective Optimization\",\"authors\":\"Zhaoning Wang, B. Cheng, Wenkai Zhang, Junliang Chen\",\"doi\":\"10.1109/SCC49832.2020.00046\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the evolution of web technologies, various services become available in the pervasive network environment. Combining atomic services via the input and output dependency according to functional requirements with the multiple nonfunctional Quality-of-Service (QoS) guarantees has become a widely considered optimization problem. The conventional multi-objective service composition relying on manually predefined service chains fails to ensure global optimality. Although the automatic service composition successfully expands the search space, the searching graph which it relies on causes computationally expensive and fails to handle multiple objectives. Therefore, this paper proposes a novel efficient multi-objective automatic service composition approach. Particularly, it introduces a service execution timeline model to decompose the composition problem into several sub-problems to reduce computational complexity. Further, it employs an evolutionary process to explore the search space and determine the approximately Pareto front of the composition solutions. The experimental results on the benchmarks show that our approach could achieve a better trade-off between the computation cost and ensuring a better QoS compared with two recently proposed automatic composition approaches.\",\"PeriodicalId\":274909,\"journal\":{\"name\":\"2020 IEEE International Conference on Services Computing (SCC)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Conference on Services Computing (SCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCC49832.2020.00046\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Services Computing (SCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC49832.2020.00046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着web技术的发展,普适网络环境中出现了各种各样的服务。根据功能需求通过输入和输出依赖关系将原子服务与多个非功能服务质量(QoS)保证相结合已经成为一个被广泛考虑的优化问题。传统的依赖于人工预定义服务链的多目标服务组合不能保证全局最优性。虽然自动服务组合成功地扩展了搜索空间,但它所依赖的搜索图计算量大,不能处理多个目标。为此,本文提出了一种新颖高效的多目标自动服务组合方法。特别地,它引入了服务执行时间轴模型,将组合问题分解为几个子问题,以降低计算复杂度。此外,它采用进化过程来探索搜索空间并确定组合解的近似帕累托前。在基准测试上的实验结果表明,与最近提出的两种自动合成方法相比,我们的方法可以在计算成本和保证更好的QoS之间实现更好的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
QoS-aware Automatic Service Composition Based on Service Execution Timeline with Multi-objective Optimization
With the evolution of web technologies, various services become available in the pervasive network environment. Combining atomic services via the input and output dependency according to functional requirements with the multiple nonfunctional Quality-of-Service (QoS) guarantees has become a widely considered optimization problem. The conventional multi-objective service composition relying on manually predefined service chains fails to ensure global optimality. Although the automatic service composition successfully expands the search space, the searching graph which it relies on causes computationally expensive and fails to handle multiple objectives. Therefore, this paper proposes a novel efficient multi-objective automatic service composition approach. Particularly, it introduces a service execution timeline model to decompose the composition problem into several sub-problems to reduce computational complexity. Further, it employs an evolutionary process to explore the search space and determine the approximately Pareto front of the composition solutions. The experimental results on the benchmarks show that our approach could achieve a better trade-off between the computation cost and ensuring a better QoS compared with two recently proposed automatic composition approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信