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

Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden

研究成果: Conference contribution

39 引用 (Scopus)

抜粋

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.

元の言語English
ホスト出版物のタイトルProceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011
ページ436-443
ページ数8
DOI
出版物ステータスPublished - 2011 9 29
外部発表Yes
イベント2011 IEEE 9th International Conference on Web Services, ICWS 2011 - Washington, DC, United States
継続期間: 2011 7 42011 7 9

Other

Other2011 IEEE 9th International Conference on Web Services, ICWS 2011
United States
Washington, DC
期間11/7/411/7/9

    フィンガープリント

ASJC Scopus subject areas

  • Computer Networks and Communications

これを引用

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