Abstract

In this paper we present web service composition problem as search problem in AND/OR Service Dependency Graph (SDG). In general web services take multiple inputs and produce single output. For this reason we concentrated on Multi-input, Single output web services composition. We proposed two algorithms for finding the composition given a service request. First algorithm finds the composition by generating all the paths from input nodes to output node and merging the paths. In Second algorithm we have incorporated cost parameters for web services and algorithm finds the minimal composition for the given request. We have evaluated our algorithms experimentally and results are shown.

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 call

Disclaimer: 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.