Service selection algorithms for composing complex services with multiple qos constraints

  • Authors:

  • Tao Yu;Kwei-Jay Lin

  • Affiliations:

  • Dept. of Electrical Engineering and Computer Science, University of California, Irvine, California;Dept. of Electrical Engineering and Computer Science, University of California, Irvine, California

  • Venue:
  • ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

One of the promises of the service-oriented architecture (SOA) is that complex services can be composed using individual services. Individual services can be selected and integrated either statically or dynamically based on the service functionalities and performance constraints. For many distributed applications, the runtime performance (e.g. end-to-end delay, cost, reliability and availability) of complex services are very important. In our earlier work, we have studied the service selection problem for complex services with only one QoS constraint. This paper extends the service selection problem to multiple QoS constraints. The problem can be modelled in two ways: the combinatorial model and the graph model. The combinatorial model defines the problem as the multi-dimension multi-choice 0-1 knapsack problem (MMKP). The graph model defines the problem as the multi-constraint optimal path (MCOP) problem. We propose algorithms for both models and study their performances by test cases. We also compare the pros & cons between the two models.