Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/15701
Title: Analyzing genetic algorithm for web service selection
Authors: Purohit L.
Kumar, Sandeep
Kshirsagar D.
Bisht S.
Singh B.
AlindShukla S.
Pandey P.
Sethi J.
Prakash G.L.
Kumar A.
Prasad A.
Published in: Proceedings on 2015 1st International Conference on Next Generation Computing Technologies, NGCT 2015
Abstract: Many service providers are offering web services having similar functionality and differing in non-functional aspects. Selection of appropriate web service meeting the functional requirement and satisfying the non-functional (QoS) constraints is an important and difficult task. This process of web services selection also determines the performance of web service based system. Similarly, for execution of composite web-service, the web service selection process becomes the dominant factor for determining system performance. In this paper, the usage of genetic algorithm for the web service selection approach is analyzed. © 2015 IEEE.
Citation: Proceedings on 2015 1st International Conference on Next Generation Computing Technologies, NGCT 2015, (2016), 999- 1003
URI: https://doi.org/10.1109/NGCT.2015.7375271
http://repository.iitr.ac.in/handle/123456789/15701
Issue Date: 2016
Publisher: Institute of Electrical and Electronics Engineers Inc.
Keywords: Genetic Algorithm
Ontology
Web Service
Web Service Selection
ISBN: 9.78147E+12
Author Scopus IDs: 55516006200
57201873447
46161349100
Author Affiliations: Purohit, L., Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, Roorkee, India
Kumar, S., Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, Roorkee, India
Kshirsagar, D., Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, Roorkee, India
Appears in Collections:Conference Publications [CS]

Files in This Item:
There are no files associated with this item.
Show full item record


Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.