The Community for Technology Leaders
2015 IEEE International Conference on Web Services (ICWS) (2015)
New York, NY, USA
June 27, 2015 to July 2, 2015
ISBN: 978-1-4673-7271-8
pp: 9-16
ABSTRACT
In recent times, automated business processes and web services have become ubiquitous in diverse application spaces. Efficient composition of web services in real time while providing necessary QoS guarantees is a computationally complex problem and several heuristic based approaches have been proposed to compose services optimally. In this paper, we present the design of a scalable but approximate QoS-aware service composition mechanism which balances the computational complexity of service composition with the QoS guarantees of the composed service and achieves scalability for dynamic service composition. We present experimental results to show the efficiency of our proposed mechanism.
INDEX TERMS
Quality of service, Web services, Time factors, Throughput, Tin, Scalability, Proposals
CITATION

S. Chattopadhyay, A. Banerjee and N. Banerjee, "A Scalable and Approximate Mechanism for Web Service Composition," 2015 IEEE International Conference on Web Services (ICWS), New York, NY, USA, 2015, pp. 9-16.
doi:10.1109/ICWS.2015.12
90 ms
(Ver 3.3 (11022016))