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

37 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

Other

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

Fingerprint

Quality of service
Chemical analysis
Heuristic algorithms
Service oriented architecture (SOA)
Linear programming
Polynomials

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

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] https://doi.org/10.1109/ICWS.2011.60

Efficient heuristic approach with improved time complexity for QoS-aware service composition. / Klein, Adrian; Ishikawa, Fuyuki; Honiden, Shinichi.

Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011. 2011. p. 436-443 6009422.

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

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., 6009422, pp. 436-443, 2011 IEEE 9th International Conference on Web Services, ICWS 2011, Washington, DC, United States, 11/7/4. https://doi.org/10.1109/ICWS.2011.60
Klein A, Ishikawa F, Honiden S. Efficient heuristic approach with improved time complexity for QoS-aware service composition. In Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011. 2011. p. 436-443. 6009422 https://doi.org/10.1109/ICWS.2011.60
Klein, Adrian ; Ishikawa, Fuyuki ; Honiden, Shinichi. / Efficient heuristic approach with improved time complexity for QoS-aware service composition. Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011. 2011. pp. 436-443
@inproceedings{d8b344a136b34e1f969440c99ab54008,
title = "Efficient heuristic approach with improved time complexity for QoS-aware service composition",
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.",
keywords = "Heuristic algorithm, Hill-climbing, Initial bias, Linear programming, QoS, Quality of service, Service composition, Service-oriented architecture",
author = "Adrian Klein and Fuyuki Ishikawa and Shinichi Honiden",
year = "2011",
month = "9",
day = "29",
doi = "10.1109/ICWS.2011.60",
language = "English",
isbn = "9780769544632",
pages = "436--443",
booktitle = "Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011",

}

TY - GEN

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

AU - Klein, Adrian

AU - Ishikawa, Fuyuki

AU - Honiden, Shinichi

PY - 2011/9/29

Y1 - 2011/9/29

N2 - 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.

AB - 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.

KW - Heuristic algorithm

KW - Hill-climbing

KW - Initial bias

KW - Linear programming

KW - QoS

KW - Quality of service

KW - Service composition

KW - Service-oriented architecture

UR - http://www.scopus.com/inward/record.url?scp=80053145540&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80053145540&partnerID=8YFLogxK

U2 - 10.1109/ICWS.2011.60

DO - 10.1109/ICWS.2011.60

M3 - Conference contribution

AN - SCOPUS:80053145540

SN - 9780769544632

SP - 436

EP - 443

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

ER -