Efficient QoS-aware service composition with a probabilistic service selection policy

Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden

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

30 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. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic selection policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.

Original languageEnglish
Title of host publicationService-Oriented Computing - 8th International Conference, ICSOC 2010, Proceedings
Pages182-196
Number of pages15
DOIs
Publication statusPublished - 2010 Dec 1
Externally publishedYes
Event8th International Conference on Service Oriented Computing, ICSOC 2010 - San Francisco, CA, United States
Duration: 2010 Dec 72010 Dec 10

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6470 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Conference on Service Oriented Computing, ICSOC 2010
CountryUnited States
CitySan Francisco, CA
Period10/12/710/12/10

Fingerprint

Service Selection
Service Composition
Quality of Service
Quality of service
Chemical analysis
Service oriented architecture (SOA)
Linear programming
Work Flow
Polynomials
Service Levels
Service-oriented Architecture
Policy
Polynomial time
NP-complete problem
Choose
Attribute
Optimise
Evaluate

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Klein, A., Ishikawa, F., & Honiden, S. (2010). Efficient QoS-aware service composition with a probabilistic service selection policy. In Service-Oriented Computing - 8th International Conference, ICSOC 2010, Proceedings (pp. 182-196). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6470 LNCS). https://doi.org/10.1007/978-3-642-17358-5_13

Efficient QoS-aware service composition with a probabilistic service selection policy. / Klein, Adrian; Ishikawa, Fuyuki; Honiden, Shinichi.

Service-Oriented Computing - 8th International Conference, ICSOC 2010, Proceedings. 2010. p. 182-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6470 LNCS).

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

Klein, A, Ishikawa, F & Honiden, S 2010, Efficient QoS-aware service composition with a probabilistic service selection policy. in Service-Oriented Computing - 8th International Conference, ICSOC 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6470 LNCS, pp. 182-196, 8th International Conference on Service Oriented Computing, ICSOC 2010, San Francisco, CA, United States, 10/12/7. https://doi.org/10.1007/978-3-642-17358-5_13
Klein A, Ishikawa F, Honiden S. Efficient QoS-aware service composition with a probabilistic service selection policy. In Service-Oriented Computing - 8th International Conference, ICSOC 2010, Proceedings. 2010. p. 182-196. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-17358-5_13
Klein, Adrian ; Ishikawa, Fuyuki ; Honiden, Shinichi. / Efficient QoS-aware service composition with a probabilistic service selection policy. Service-Oriented Computing - 8th International Conference, ICSOC 2010, Proceedings. 2010. pp. 182-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ec6e928b03b740bfa8ca4448f37d67af,
title = "Efficient QoS-aware service composition with a probabilistic service selection policy",
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. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic selection policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.",
author = "Adrian Klein and Fuyuki Ishikawa and Shinichi Honiden",
year = "2010",
month = "12",
day = "1",
doi = "10.1007/978-3-642-17358-5_13",
language = "English",
isbn = "3642173578",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "182--196",
booktitle = "Service-Oriented Computing - 8th International Conference, ICSOC 2010, Proceedings",

}

TY - GEN

T1 - Efficient QoS-aware service composition with a probabilistic service selection policy

AU - Klein, Adrian

AU - Ishikawa, Fuyuki

AU - Honiden, Shinichi

PY - 2010/12/1

Y1 - 2010/12/1

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. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic selection policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.

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. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic selection policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.

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

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

U2 - 10.1007/978-3-642-17358-5_13

DO - 10.1007/978-3-642-17358-5_13

M3 - Conference contribution

AN - SCOPUS:78650787705

SN - 3642173578

SN - 9783642173578

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 182

EP - 196

BT - Service-Oriented Computing - 8th International Conference, ICSOC 2010, Proceedings

ER -