Welcome to the InfoSci Platform
Reference Hub2
Automatic Dynamic Web Service Composition Using AND/OR Directed Graphs

Automatic Dynamic Web Service Composition Using AND/OR Directed Graphs

Hajar Elmaghraoui, Laila Benhlima, Dalila Chiadmi
Copyright: © 2019 |Volume: 16 |Issue: 3 |Pages: 15
ISSN: 1545-7362|EISSN: 1546-5004|EISBN13: 9781522564003|DOI: 10.4018/IJWSR.2019070102
Cite Article Cite Article

MLA

Elmaghraoui, Hajar, et al. "Automatic Dynamic Web Service Composition Using AND/OR Directed Graphs." IJWSR vol.16, no.3 2019: pp.29-43. http://doi.org/10.4018/IJWSR.2019070102

APA

Elmaghraoui, H., Benhlima, L., & Chiadmi, D. (2019). Automatic Dynamic Web Service Composition Using AND/OR Directed Graphs. International Journal of Web Services Research (IJWSR), 16(3), 29-43. http://doi.org/10.4018/IJWSR.2019070102

Chicago

Elmaghraoui, Hajar, Laila Benhlima, and Dalila Chiadmi. "Automatic Dynamic Web Service Composition Using AND/OR Directed Graphs," International Journal of Web Services Research (IJWSR) 16, no.3: 29-43. http://doi.org/10.4018/IJWSR.2019070102

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.