Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A Fast Heuristic Algorithm for the Composite Web Service Selection

  • Conference paper
Advances in Data and Web Management (APWeb 2009, WAIM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5446))

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+nllgn) complexity for solving the problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Drexel, A.: A simulated annealing approach to the multi-constraint zero-one knapsack problem. Annuals of Computing 40, 1–8 (1988)

    Article  Google Scholar 

  2. Ardagna, D., Pernici, B.: Global and local qoS guarantee in web service selection. In: Bussler, C.J., Haller, A. (eds.) BPM 2005. LNCS, vol. 3812, pp. 32–46. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Lee, C.: On QoS management, PhD dissertation. School of Computer Science, Carnegie Mellon University (August 1999)

    Google Scholar 

  4. Casati, F., Shan, M.C.: Dynamic and Adaptive Composition of EServices. Information Systems 26(3), 143–162 (2001)

    Article  MATH  Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2002)

    MATH  Google Scholar 

  6. Georgakopoulos, D., Schuster, H., Cichocki, A., Baker, D.: Managing Process and Service Fusion in Virtual Enterprises. Information System, Special Issue on Information System Support for Electronic Commerce 24(6), 429–456 (1999)

    Google Scholar 

  7. Issa, H., Assi, C., Debbabi, M.: QoS-aware middleware for Web services composition - A qualitative approach. In: Proceedings - International Symposium on Computers and Communications, Proceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006, pp. 359–364 (2006)

    Google Scholar 

  8. Jang, J.-H., Shin, D.-H., Lee, K.-H.: Fast Quality Driven Selection of composite Web services. In: Proceedings of ECOWS 2006: Fourth European Conference on Web Services, pp. 87–96 (2006)

    Google Scholar 

  9. Clabby, J.: Web Services Explained: Solutions and Applications for the Real World. Prentice Hall PTR, Englewood Cliffs (2002)

    Google Scholar 

  10. Zeng, L., Benatallah, B., Ngu, A.H.H., Dumas, M., Kalagnanam, J., Chang, H.: QoS-Aware Middleware for Web Services Composition. IEEE Transactions on Software Engineering 30(5), 311–327 (2004)

    Article  Google Scholar 

  11. Akbar, M.M., Manning, E.G., Shoja, G.C., Khan, S.: Heuristic solutions for the multiple-choice multi-dimension knapsack problem. In: Alexandrov, V.N., Dongarra, J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds.) ICCS-ComputSci 2001. LNCS, vol. 2074, p. 659. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Mostofa, A.M., Sohel, R.M., Kaykobad, M., Manning, E.G., Shoja, G.C.: Solving the Multidimensional Multiple-Choice Knapsack Problem by Constructing Convex Hulls. Computers and Operations Research 33(5), 1259–1273 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Magazine, M., Oguz, O.: A Heuristic Algorithm for Multi-Dimensional Zero-One Knapsack Problem. European Journal of Operational Research 16(3), 319–326 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  14. Khan, S.: Quality Adaptation in a Multi-Session Adaptive Multimedia System: Model and Architecture. PhD Dissertation. Department of Electrical and Computer Engineering, University of Victoria (1998)

    Google Scholar 

  15. Liu, S.-L., Liu, Y.-X., Zhang, F.: Dynamic Web Services Selection Algorithm with QoS Global Optimal in Web Services Composition. Journal of Software 18(3), 646–656 (2007)

    Article  MATH  Google Scholar 

  16. Yu, T., Zhang, Y., Lin, K.-J.: Efficient algorithms for Web services selection with end-to-end QoS constraints. ACM Transactions on the Web 1(1), 6 (2007)

    Article  Google Scholar 

  17. Yu, T.: Quality of Service (QoS) in Web Services Model, Architecture and Algorithms, lsdis.cs.uga.edu/lib/download/CSM+QoS-WebSemantics.pdf

  18. Tsesmetzis, D., Roussaki, I., Sykas, E.: QoS-Aware Service Evaluation and Selection. European Journal of Operational Research 191(3), 1101–1112 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  19. Gao, Y., Na, J., Zhang, B., Yang, L., Gong, Q.: Optimal Web Services Selection Using Dynamic Programming. In: Proceedings of 11th IEEE Symposium on Computers and Communications, pp. 365–370 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Software, Tsinghua University, Beijing, China

    Rong Wang & Chi-Hung Chi

  2. College of Software Engineering, SouthEast University, Nanjing, China

    Jianming Deng

Authors
  1. Rong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chi-Hung Chi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianming Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, China

    Qing Li

  2. Department of Computer Science & Technology, Tsinghua University, Beijing, China

    Ling Feng

  3. School of Computing Science, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby BC, Canada

    Jian Pei

  4. Department of Computer Science, University of Vermont, VT 05405, Burlington, USA

    Sean X. Wang

  5. School of Information Technology and Electrical Engineering, The University of Queensland, QLD 4072, Brisbane, Australia

    Xiaofang Zhou

  6. Jiangsu Provincial Key Lab of Computer Information Processing Technology School of Computer Science & Technology, Soochow University China, 1 shizi Street Suzhou, 215006, Jiangsu, China

    Qiao-Ming Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, R., Chi, CH., Deng, J. (2009). A Fast Heuristic Algorithm for the Composite Web Service Selection. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, QM. (eds) Advances in Data and Web Management. APWeb WAIM 2009 2009. Lecture Notes in Computer Science, vol 5446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00672-2_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00672-2_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00671-5

  • Online ISBN: 978-3-642-00672-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation