{"title":"基于学习的深度优先搜索的qos驱动的Web服务组合","authors":"Wonhong Nam, Hyunyoung Kil, Jungjae Lee","doi":"10.1109/CEC.2009.50","DOIUrl":null,"url":null,"abstract":"The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic features. In this paper, in particular, we study the Quality of Services (QoS)-driven WSC problem to optimize service quality criteria, e.g., response time and/or throughput. We propose a novel solution based on Learning-based Depth First Search (LDFS). Given a set of web service descriptions including QoS information and a requirement web service, we reduce the QoS-driven WSC problem into a planning problem on a state-transition system. We then find the optimal solution for the problem using a dynamic programming based on LDFS which recently has shown a promising result.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"QoS-Driven Web Service Composition Using Learning-Based Depth First Search\",\"authors\":\"Wonhong Nam, Hyunyoung Kil, Jungjae Lee\",\"doi\":\"10.1109/CEC.2009.50\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic features. In this paper, in particular, we study the Quality of Services (QoS)-driven WSC problem to optimize service quality criteria, e.g., response time and/or throughput. We propose a novel solution based on Learning-based Depth First Search (LDFS). Given a set of web service descriptions including QoS information and a requirement web service, we reduce the QoS-driven WSC problem into a planning problem on a state-transition system. We then find the optimal solution for the problem using a dynamic programming based on LDFS which recently has shown a promising result.\",\"PeriodicalId\":384060,\"journal\":{\"name\":\"2009 IEEE Conference on Commerce and Enterprise Computing\",\"volume\":\"2008 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"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.50\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Conference on Commerce and Enterprise Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2009.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
QoS-Driven Web Service Composition Using Learning-Based Depth First Search
The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic features. In this paper, in particular, we study the Quality of Services (QoS)-driven WSC problem to optimize service quality criteria, e.g., response time and/or throughput. We propose a novel solution based on Learning-based Depth First Search (LDFS). Given a set of web service descriptions including QoS information and a requirement web service, we reduce the QoS-driven WSC problem into a planning problem on a state-transition system. We then find the optimal solution for the problem using a dynamic programming based on LDFS which recently has shown a promising result.