Efficient anytime algorithm for large-scale QoS-aware web service composition
- Authors
- Kil, Hyunyoung; Nam, Wonhong
- Issue Date
- 2013
- Publisher
- INDERSCIENCE ENTERPRISES LTD
- Keywords
- anytime algorithm; web service composition; QoS; quality of services; optimisation
- Citation
- INTERNATIONAL JOURNAL OF WEB AND GRID SERVICES, v.9, no.1, pp.82 - 106
- Indexed
- SCIE
SCOPUS
- Journal Title
- INTERNATIONAL JOURNAL OF WEB AND GRID SERVICES
- Volume
- 9
- Number
- 1
- Start Page
- 82
- End Page
- 106
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/106601
- DOI
- 10.1504/IJWGS.2013.052845
- ISSN
- 1741-1106
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.