{"title":"qos感知服务组合的有效剪枝算法","authors":"Zhenqiu Huang, Wei Jiang, Songlin Hu, Zhiyong Liu","doi":"10.1109/CEC.2009.41","DOIUrl":null,"url":null,"abstract":"Abstract—Automatic service composition has been a hottopic in both academia and industry. It begins with syntacticcomposition, and then evolves semantic description. Recently, QoS of the composition comes into researchers’ mind, which aims at meeting the need of the overall qualities like service fee, response time, throughput, etc. In this paper, a novel QoSaware approach is presented. It adopts a forward filtering algorithm to reduce the number of service candidates, along with a modified dynamic programming approach to compute optimal values. Finally, a backward search is utilized to find out the optimal composition results efficiently.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"61","resultStr":"{\"title\":\"Effective Pruning Algorithm for QoS-Aware Service Composition\",\"authors\":\"Zhenqiu Huang, Wei Jiang, Songlin Hu, Zhiyong Liu\",\"doi\":\"10.1109/CEC.2009.41\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract—Automatic service composition has been a hottopic in both academia and industry. It begins with syntacticcomposition, and then evolves semantic description. Recently, QoS of the composition comes into researchers’ mind, which aims at meeting the need of the overall qualities like service fee, response time, throughput, etc. In this paper, a novel QoSaware approach is presented. It adopts a forward filtering algorithm to reduce the number of service candidates, along with a modified dynamic programming approach to compute optimal values. Finally, a backward search is utilized to find out the optimal composition results efficiently.\",\"PeriodicalId\":384060,\"journal\":{\"name\":\"2009 IEEE Conference on Commerce and Enterprise Computing\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"61\",\"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.41\",\"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.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Effective Pruning Algorithm for QoS-Aware Service Composition
Abstract—Automatic service composition has been a hottopic in both academia and industry. It begins with syntacticcomposition, and then evolves semantic description. Recently, QoS of the composition comes into researchers’ mind, which aims at meeting the need of the overall qualities like service fee, response time, throughput, etc. In this paper, a novel QoSaware approach is presented. It adopts a forward filtering algorithm to reduce the number of service candidates, along with a modified dynamic programming approach to compute optimal values. Finally, a backward search is utilized to find out the optimal composition results efficiently.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
