Advertisement

Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints

  • Tao Yu
  • Kwei-Jay Lin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3826)

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.

Keywords

Service Composition Service Selection Service Class Service Candidate Complex Service 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Aggarwal, R., et al.: Constraint driven Web service composition in METEOR-S. In: Proc. of IEEE Conf on Service Computing (SCC 2004), Shanghai, China (Sepember 2004)Google Scholar
  2. 2.
    BPMI.org.: Business Process Modeling Language (BPML), Version 1.0 (November 2002), http://www.bpmi.org/bpml.esp
  3. 3.
    Casati, F., Ilnicki, S., Jin, L., Krishnamoorthy, V., Shan, M.: Adaptive and dynamic service composition in eflow. Technical Report, HPL-200039, Software Tech Lab (March 2000)Google Scholar
  4. 4.
    Curbera, F., Goland, Y., Klein, J., Leymann, F., Roller, D., Thatte, S., Weerawarana, S.: Business Process Execution Language for Web services, Version 1.1 (May 2003), http://www-106.ibm.com/developerworks/webservices/library/ws-bpel
  5. 5.
    Dan, A., et al.: Web services on demand: WSLA-driven automated management. IBM Systems Journal 43(1), 136–158 (2004)CrossRefGoogle Scholar
  6. 6.
    Fu, X., Shi, W., Akkerman, A., Karamcheti, V.: CANS: Composable, Adaptive Network Services Infrastructure. In: Proceeding of 3rd USENIX symposium on Internet Technologies and Systems (March 2001)Google Scholar
  7. 7.
    Khan, S.: Quality Adaptation in a Multisession Multimedia System: Model, Algorithms and Architecture, Ph.D. Dissertation, Department of ECE, University of Victoria, Canada (May 1998)Google Scholar
  8. 8.
    Khan, S., Li, K.F., Manning, E.G., Akbar, M.: Solving the knapsack problem for adaptive multimedia systems. Studia Informatica Universalis 2(1), 157–178 (2002)Google Scholar
  9. 9.
    Korkmaz, T., Krunz, M.: Multi-Constrained Optimal Path Selection. In: Proceeding of 20th Joint Conf. IEEE Computer & Communications (INFOCOM 2001), pp. 834–843 (2001)Google Scholar
  10. 10.
    Ludwig, H., Keller, A., Dan, A., King, R.P., Franck, R.: Web Service Level Agreement (WSLA) Language Specification (January 2003), http://www.research.ibm.com/wsla/WSLASpecV1-20030128.pdf
  11. 11.
    Maros, I.: Computational Techniques of the Simplex Method. Springer, Heidelberg (2002)Google Scholar
  12. 12.
    Martello, S., Toth, P.: Algorithms for Knapsack Problems. Annals of Discrete Mathematics 31, 70–79 (1987)Google Scholar
  13. 13.
    Ponnekanti, S.R., Fox, A.: Sword: A developer toolkit for Web service composition. In: 11th World Wide Web Conference, Honolulu, Hawaii (May 2002)Google Scholar
  14. 14.
    Winick, J., Jamin, S.: Inet 3.0: Internet Topology Generator. Tech Report UM-CSE-TR-456-02, University of Michigan (2002), http://irl.eecs.umich.edu/jamin/
  15. 15.
    Yu, T., Lin, K.J.: Service Selection Algorithms for Web Services with End-to-end QoS Constraints. Journal of Information Systems and E-Business Management 3(2) (July 2005)Google Scholar
  16. 16.
    Yu, T., Lin, K.J.: A Broker-based Framework for QoS-Aware Web Service Composition. In: Proceeding of IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE 2005), Hong Kong, China (March 2005)Google Scholar
  17. 17.
    Zeng, L., Benatallah, B., Dumas, M., Kalagnanam, J., Sheng, Q.Z.: Quality Driven Web Service Composition. In: Proceeding of 12th International World Wide Web Conference, WWW (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Tao Yu
    • 1
  • Kwei-Jay Lin
    • 1
  1. 1.Dept. of Electrical Engineering and Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations