基于概率流路径树的qos感知web服务组合算法

2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content Pub Date : 2010-12-03 DOI:10.1109/ICNIDC.2010.5657934

Desheng Li, Na Deng, Gang Tan, Chuanchang Liu, Junliang Chen

{"title":"基于概率流路径树的qos感知web服务组合算法","authors":"Desheng Li, Na Deng, Gang Tan, Chuanchang Liu, Junliang Chen","doi":"10.1109/ICNIDC.2010.5657934","DOIUrl":null,"url":null,"abstract":"This paper first presents a novel model for QoS-aware web services composition based on workflow patterns, and an executing path tree with probability. Then a discrete PSO algorithm is proposed to fit our model, which also requires some other preliminary algorithms, such as the generation of all reachable paths and executing path tree. The experiments show the performance of that algorithm and its advantages, compared with genetic algorithm. Finally, we suggest some drawbacks of it and future works.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Algorithm for QOS-aware web service composition based on flow path tree with probabilities\",\"authors\":\"Desheng Li, Na Deng, Gang Tan, Chuanchang Liu, Junliang Chen\",\"doi\":\"10.1109/ICNIDC.2010.5657934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper first presents a novel model for QoS-aware web services composition based on workflow patterns, and an executing path tree with probability. Then a discrete PSO algorithm is proposed to fit our model, which also requires some other preliminary algorithms, such as the generation of all reachable paths and executing path tree. The experiments show the performance of that algorithm and its advantages, compared with genetic algorithm. Finally, we suggest some drawbacks of it and future works.\",\"PeriodicalId\":348778,\"journal\":{\"name\":\"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNIDC.2010.5657934\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNIDC.2010.5657934","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文首先提出了一种基于工作流模式的基于qos感知的web服务组合模型，并给出了一种带有概率的执行路径树。然后提出了一种离散粒子群算法来拟合我们的模型，这还需要一些其他的初步算法，如所有可达路径的生成和执行路径树。实验证明了该算法的性能及其与遗传算法相比的优势。最后，提出了该方法的不足之处和今后的工作。

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

查看原文本刊更多论文

Algorithm for QOS-aware web service composition based on flow path tree with probabilities

This paper first presents a novel model for QoS-aware web services composition based on workflow patterns, and an executing path tree with probability. Then a discrete PSO algorithm is proposed to fit our model, which also requires some other preliminary algorithms, such as the generation of all reachable paths and executing path tree. The experiments show the performance of that algorithm and its advantages, compared with genetic algorithm. Finally, we suggest some drawbacks of it and future works.

求助全文

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

来源期刊

2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content

自引率

0.00%

发文量