http://repository.iitr.ac.in/handle/123456789/15872
Title: | New approaches for service composition based on graph models |
Authors: | Guluru P. Niyogi, Rajdeep Parashar M. Madhu Kumar S.D. Madduri K. Narendra N.C. Krishnan M. Prasad S.K. Chandran P. Chandra Sekhar C. Li X. Valera C. Chaudhary S. Bellur U. Arya K. |
Published in: | Proceedings of 2014 7th International Conference on Contemporary Computing, IC3 2014 |
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. © 2014 IEEE. |
Citation: | Proceedings of 2014 7th International Conference on Contemporary Computing, IC3 2014, (2014), 507- 512 |
URI: | https://doi.org/10.1109/IC3.2014.6897225 http://repository.iitr.ac.in/handle/123456789/15872 |
Issue Date: | 2014 |
Publisher: | Institute of Electrical and Electronics Engineers Inc. |
Keywords: | AND/OR Service Dependency Graph Service Composition |
ISBN: | 9.78148E+12 |
Author Scopus IDs: | 56405529800 35100732400 |
Author Affiliations: | Guluru, P., Department of Computer Science and Engineering, Indian Institute of Technology, Roorkee, 247667, India Niyogi, R., Department of Computer Science and Engineering, Indian Institute of Technology, Roorkee, 247667, India |
Corresponding Author: | Guluru, P.; Department of Computer Science and Engineering, Indian Institute of TechnologyIndia |
Appears in Collections: | Conference Publications [CS] |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.