본문 바로가기
  • Home

Performance Evaluation of QoS-based Web Services Selection Models

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2007, 12(4), pp.43-52
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang Koo Seo 1

1광운대학교

Accredited

ABSTRACT

As the number of public Web Services increases, there will be many services with the same functionality. These services, however, will vary in their QoS properties, such as price, response time and availability, and it is very important to choose a best service while satisfying given QoS constraints. This paper brings parallel branching and response time constraint of business processes into focus and investigates several service selection plans based on multidimensional multiple choice Knapsack model. Specifically, proposed in the paper are a plan with response time constraints for each execution flow, a plan with a single constraint over the whole service types and a plan with a constraint on a particular execution path of a composite Web Services. Experiments are conducted to observe the performance of each plan with varying the number of services, the number of branches and the values of response time constraint. Experimental results show that reducing the number of candidate services using Pareto Dominance is very effective and the plan with a constraint over the whole service types is efficient in time and solution quality for small to medium size problems.

Citation status

* References for papers published after 2022 are currently being built.