{"title":"Dynamic Web Service Composition Based on Service Integration and HTN Planning","authors":"Xinhuai Tang, F. Tang, L. Bing, D. Chen","doi":"10.1109/IMIS.2013.58","DOIUrl":null,"url":null,"abstract":"Web Service Composition is an important but challenging issue because of the large number and dynamicity of Web services. This paper proposed a dynamic Web service composition framework which based on OWL-S and HTN planning. It uses OWL-S as Web service description language and HTN planning engine to calculate service execution sequence dynamically. Under this framework, we firstly develop a service integration algorithm based on an improved K-Means algorithm. Based on the proposed service integration algorithm, we design a two-stage service match algorithm, which reduce the time cost of service match making with a large number of services. In particular, our HTN planning approach is based on several service types, not all the service instances, which greatly improve the efficiency of the planning procedure.","PeriodicalId":425979,"journal":{"name":"2013 Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMIS.2013.58","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Web Service Composition is an important but challenging issue because of the large number and dynamicity of Web services. This paper proposed a dynamic Web service composition framework which based on OWL-S and HTN planning. It uses OWL-S as Web service description language and HTN planning engine to calculate service execution sequence dynamically. Under this framework, we firstly develop a service integration algorithm based on an improved K-Means algorithm. Based on the proposed service integration algorithm, we design a two-stage service match algorithm, which reduce the time cost of service match making with a large number of services. In particular, our HTN planning approach is based on several service types, not all the service instances, which greatly improve the efficiency of the planning procedure.