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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
