Efficient heuristic approach with improved time complexity for QoS-aware service composition

Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden

Research output: Chapter in Book/Report/Conference proceedingConference contribution

40 Citations (Scopus)

Abstract

Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Therefore, heuristic algorithms are widely used, finding acceptable solutions in polynomial time. Still the time complexity of such algorithms can be prohibitive for real-time use, especially if the algorithms are required to run until they find near-optimal solutions. Thus, we propose a heuristic approach based on Hill-Climbing that makes effective use of an initial bias computed with Linear Programming, and works on a reduced search space. In our evaluation, we show that our approach finds near-optimal solutions and achieves a low time complexity.

Original languageEnglish
Title of host publicationProceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011
Pages436-443
Number of pages8
DOIs
Publication statusPublished - 2011 Sep 29
Externally publishedYes
Event2011 IEEE 9th International Conference on Web Services, ICWS 2011 - Washington, DC, United States
Duration: 2011 Jul 42011 Jul 9

Publication series

NameProceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011

Other

Other2011 IEEE 9th International Conference on Web Services, ICWS 2011
CountryUnited States
CityWashington, DC
Period11/7/411/7/9

Keywords

  • Heuristic algorithm
  • Hill-climbing
  • Initial bias
  • Linear programming
  • QoS
  • Quality of service
  • Service composition
  • Service-oriented architecture

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Efficient heuristic approach with improved time complexity for QoS-aware service composition'. Together they form a unique fingerprint.

  • Cite this

    Klein, A., Ishikawa, F., & Honiden, S. (2011). Efficient heuristic approach with improved time complexity for QoS-aware service composition. In Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011 (pp. 436-443). [6009422] (Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011). https://doi.org/10.1109/ICWS.2011.60