使用和/或有向图的自动动态Web服务组合

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

International Journal of Web Services Research Pub Date : 2019-07-01 DOI:10.4018/IJWSR.2019070102

Hajar Elmaghraoui, Laila Benhlima, D. Chiadmi

{"title":"使用和/或有向图的自动动态Web服务组合","authors":"Hajar Elmaghraoui, Laila Benhlima, D. Chiadmi","doi":"10.4018/IJWSR.2019070102","DOIUrl":null,"url":null,"abstract":"In this article, the authors propose a dynamic web service composition approach based on representing the semantic relationship between web services using a weighted directed AND/OR graph. The nodes in this graph represent available services while the arcs represent the semantic input/output dependencies among them. The novelty of this work consists of constructing the graph and computing offline the shortest paths between each pair of its nodes to disconnect this tedious task from the composition query process. A set of dynamic optimization techniques has been included to reduce the size of the graph and thus improve the scalability and performance of this approach. In addition to the sequence and fork relations between services, this solution also supports the parallel relation. Furthermore, a recovery mechanism is integrated to ensure the continuity of the execution of the composition.","PeriodicalId":54936,"journal":{"name":"International Journal of Web Services Research","volume":"25 1","pages":"29-43"},"PeriodicalIF":0.8000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Automatic Dynamic Web Service Composition Using AND/OR Directed Graphs\",\"authors\":\"Hajar Elmaghraoui, Laila Benhlima, D. Chiadmi\",\"doi\":\"10.4018/IJWSR.2019070102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, the authors propose a dynamic web service composition approach based on representing the semantic relationship between web services using a weighted directed AND/OR graph. The nodes in this graph represent available services while the arcs represent the semantic input/output dependencies among them. The novelty of this work consists of constructing the graph and computing offline the shortest paths between each pair of its nodes to disconnect this tedious task from the composition query process. A set of dynamic optimization techniques has been included to reduce the size of the graph and thus improve the scalability and performance of this approach. In addition to the sequence and fork relations between services, this solution also supports the parallel relation. Furthermore, a recovery mechanism is integrated to ensure the continuity of the execution of the composition.\",\"PeriodicalId\":54936,\"journal\":{\"name\":\"International Journal of Web Services Research\",\"volume\":\"25 1\",\"pages\":\"29-43\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Web Services Research\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.4018/IJWSR.2019070102\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web Services Research","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.4018/IJWSR.2019070102","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 1

摘要

在本文中，作者提出了一种动态web服务组合方法，该方法基于使用加权有向AND/OR图来表示web服务之间的语义关系。此图中的节点表示可用的服务，而弧表示它们之间的语义输入/输出依赖关系。这项工作的新颖之处在于构建图并离线计算每对节点之间的最短路径，从而将这项繁琐的任务从组合查询过程中分离出来。包含了一组动态优化技术来减少图的大小，从而提高该方法的可伸缩性和性能。除了服务之间的序列和分支关系外，该解决方案还支持并行关系。此外，还集成了恢复机制，以确保组合物执行的连续性。

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

查看原文本刊更多论文

Automatic Dynamic Web Service Composition Using AND/OR Directed Graphs

In this article, the authors propose a dynamic web service composition approach based on representing the semantic relationship between web services using a weighted directed AND/OR graph. The nodes in this graph represent available services while the arcs represent the semantic input/output dependencies among them. The novelty of this work consists of constructing the graph and computing offline the shortest paths between each pair of its nodes to disconnect this tedious task from the composition query process. A set of dynamic optimization techniques has been included to reduce the size of the graph and thus improve the scalability and performance of this approach. In addition to the sequence and fork relations between services, this solution also supports the parallel relation. Furthermore, a recovery mechanism is integrated to ensure the continuity of the execution of the composition.

求助全文

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

来源期刊

International Journal of Web Services Research 工程技术-计算机：软件工程

CiteScore

2.40

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The International Journal of Web Services Research (IJWSR) is the first refereed, international publication featuring the latest research findings and industry solutions involving all aspects of Web services technology. This journal covers advancements, standards, and practices of Web services, as well as identifies emerging research topics and defines the future of Web services on grid computing, multimedia, and communication. IJWSR provides an open, formal publication for high quality articles developed by theoreticians, educators, developers, researchers, and practitioners for those desiring to stay abreast of challenges in Web services technology.