A Fast Heuristic Algorithm for the Composite Web Service Selection

  • Authors:
  • Rong Wang;Chi-Hung Chi;Jianming Deng

  • Affiliations:
  • School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China;College of Software Engineering, SouthEast University, Nanjing, China

  • Venue:
  • APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 Web Service selection. We propose the utility function to be the evaluation standard as a whole by considering all QoS parameters of each component service based on the definition in [16]. We map the multi-dimensional QoS composite Web Service to the multi-dimensional multi-choice knapsack (MMKP). And we propose a fast heuristic algorithm with O(nlm+nl lgn) complexity for solving the problem.