具有不完整QoS信息的Web服务组合

2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI:10.1109/CIT.2008.WORKSHOPS.13

Yanping Chen

{"title":"具有不完整QoS信息的Web服务组合","authors":"Yanping Chen","doi":"10.1109/CIT.2008.WORKSHOPS.13","DOIUrl":null,"url":null,"abstract":"Web services composition becomes an ideal choice for enterprise level integration. This paper focuses on the problem of how to select the existed Web services so as to compose a complex service with incomplete QoS information constrains. We first proposed a model of composite service based on Markov process, and then a novel service composition algorithm was designed and implemented, which is built on the k-armed bandit theory to solve the service selection problem. Finally, we carried out extensive experiment on E-Wsframe to verify the solution proposed in the paper. Experimental results show that our method can ensure both the functions and QoS of composite services when selecting and composing Web services at runtime.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"212 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Web Services Composition with Incomplete QoS Information\",\"authors\":\"Yanping Chen\",\"doi\":\"10.1109/CIT.2008.WORKSHOPS.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Web services composition becomes an ideal choice for enterprise level integration. This paper focuses on the problem of how to select the existed Web services so as to compose a complex service with incomplete QoS information constrains. We first proposed a model of composite service based on Markov process, and then a novel service composition algorithm was designed and implemented, which is built on the k-armed bandit theory to solve the service selection problem. Finally, we carried out extensive experiment on E-Wsframe to verify the solution proposed in the paper. Experimental results show that our method can ensure both the functions and QoS of composite services when selecting and composing Web services at runtime.\",\"PeriodicalId\":155998,\"journal\":{\"name\":\"2008 IEEE 8th International Conference on Computer and Information Technology Workshops\",\"volume\":\"212 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 8th International Conference on Computer and Information Technology Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIT.2008.WORKSHOPS.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

Web服务组合成为企业级集成的理想选择。本文主要研究如何选择已有的Web服务，从而组成具有不完全QoS信息约束的复杂服务。首先提出了一种基于马尔可夫过程的组合服务模型，然后设计并实现了一种基于k臂强盗理论的组合服务算法来解决服务选择问题。最后，我们在E-Wsframe上进行了大量的实验来验证本文提出的解决方案。实验结果表明，该方法在运行时选择和组合Web服务时，能够保证组合服务的功能和服务质量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Web Services Composition with Incomplete QoS Information

Web services composition becomes an ideal choice for enterprise level integration. This paper focuses on the problem of how to select the existed Web services so as to compose a complex service with incomplete QoS information constrains. We first proposed a model of composite service based on Markov process, and then a novel service composition algorithm was designed and implemented, which is built on the k-armed bandit theory to solve the service selection problem. Finally, we carried out extensive experiment on E-Wsframe to verify the solution proposed in the paper. Experimental results show that our method can ensure both the functions and QoS of composite services when selecting and composing Web services at runtime.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 IEEE 8th International Conference on Computer and Information Technology Workshops

自引率

0.00%

发文量