Efficient anytime algorithm for large-scale QoS-aware web service composition

  • Authors:

  • Hyunyoung Kil;Wonhong Nam

  • Affiliations:

  • The Research Institute of Computer Information and Communication, Korea University, Seoul 136-701, Korea;Department of Internet & Multimedia Engineering, Konkuk University, Seoul 143-701, Korea

  • Venue:
  • International Journal of Web and Grid Services
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.