Abstract
QoS-aware composition of web services is a business process to achieve functional goals by considering QoS criteria simultaneously. Although there are many composition algorithms taking either a single criterion or multiple criteria into account, a composite service can presumably consist of redundant services. Our proposed algorithm on Web service composition focuses on multiple QoS criteria as well as redundancy of component services at the time of composition. This work aims to reduce execution time, cost, and the number of component services in the composition process. To fulfill this functional goal, we use linked list and hash table data structures to provide the proposed algorithm with a better time complexity.
Sign-in/Register to access full text options 
Free) 
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
