Efficient anytime algorithm for large-scale QoS-aware web service composition Online publication date: Mon, 29-Sep-2014
by Hyunyoung Kil; Wonhong Nam
International Journal of Web and Grid Services (IJWGS), Vol. 9, No. 1, 2013
Abstract: The QoS-aware web service composition (WSC) problem aims at the fully automatic construction of a composite web service with the optimal accumulated QoS value. It is, however, intractable to solve the QoS-aware WSC problem for large scale instances since the problem corresponds to a global optimisation problem. That is, in the real world, traditional algorithms can require significant amount of time to finally find the optimal solution, and such an unexpected long delay is unfavourable to users. In this paper, we propose a novel anytime algorithm using dynamic beam widths for the QoS-aware WSC problem. Our algorithm generates early sub-optimal solutions and keeps improving the quality of the solution along with the execution time, up to the optimal solution if a client allows enough time. We empirically validate that our algorithm can identify composite web services with high quality much earlier than an optimal algorithm and the beam stack search.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook