Composite Web Service selection is one of the most important issues in Web Service Composition. During the selection process,
while the decision making during the selection process is much easy in the term of the functional properties of Web Service,it is very difficult in terms of the non-functional properties. In this paper, we investigate the problem of composite WebService selection. We propose the utility function to be the evaluation standard as a whole by considering all QoS parametersof each component service based on the definition in 16. We map the multi-dimensional QoS composite Web Service to the multi-dimensionalmulti-choice knapsack (MMKP). And we propose a fast heuristic algorithm with O(nlm+nllgn) complexity for solving the problem.
%0 Journal Article
%1 keyhere
%A Wang, Rong
%A Chi, Chi-Hung
%A Deng, Jianming
%D 2009
%J Advances in Data and Web Management
%K algorithm composite fast heuristic imported web
%P 506--518
%T A Fast Heuristic Algorithm for the Composite Web Service Selection
%U http://dx.doi.org/10.1007/978-3-642-00672-2_44
%X Composite Web Service selection is one of the most important issues in Web Service Composition. During the selection process,
while the decision making during the selection process is much easy in the term of the functional properties of Web Service,it is very difficult in terms of the non-functional properties. In this paper, we investigate the problem of composite WebService selection. We propose the utility function to be the evaluation standard as a whole by considering all QoS parametersof each component service based on the definition in 16. We map the multi-dimensional QoS composite Web Service to the multi-dimensionalmulti-choice knapsack (MMKP). And we propose a fast heuristic algorithm with O(nlm+nllgn) complexity for solving the problem.
@article{keyhere,
abstract = {Composite Web Service selection is one of the most important issues in Web Service Composition. During the selection process,
while the decision making during the selection process is much easy in the term of the functional properties of Web Service,it is very difficult in terms of the non-functional properties. In this paper, we investigate the problem of composite WebService selection. We propose the utility function to be the evaluation standard as a whole by considering all QoS parametersof each component service based on the definition in [16]. We map the multi-dimensional QoS composite Web Service to the multi-dimensionalmulti-choice knapsack (MMKP). And we propose a fast heuristic algorithm with O(nlm+nllgn) complexity for solving the problem.},
added-at = {2009-06-08T13:38:38.000+0200},
author = {Wang, Rong and Chi, Chi-Hung and Deng, Jianming},
biburl = {https://www.bibsonomy.org/bibtex/28403a628fc987d1280c99d5baf1504f9/hennig},
description = {SpringerLink - Buchkapitel},
interhash = {c3d9d593bb5583e3b3027e9ca88287f7},
intrahash = {8403a628fc987d1280c99d5baf1504f9},
journal = {Advances in Data and Web Management},
keywords = {algorithm composite fast heuristic imported web},
pages = {506--518},
timestamp = {2009-06-08T13:38:39.000+0200},
title = {A Fast Heuristic Algorithm for the Composite Web Service Selection},
url = {http://dx.doi.org/10.1007/978-3-642-00672-2_44},
year = 2009
}