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

Adrian Klein*, Fuyuki Ishikawa, Shinichi Honiden

*この研究の対応する著者

研究成果: Conference contribution

47 被引用数 (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
外部発表はい
イベント2011 IEEE 9th International Conference on Web Services, ICWS 2011 - Washington, DC, United States
継続期間: 2011 7月 42011 7月 9

出版物シリーズ

名前Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011

Other

Other2011 IEEE 9th International Conference on Web Services, ICWS 2011
国/地域United States
CityWashington, DC
Period11/7/411/7/9

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信

フィンガープリント

「Efficient heuristic approach with improved time complexity for QoS-aware service composition」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル