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}
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.