Abstract
The Service-Oriented Computing (SOC) paradigm envisions the composition of loosely coupled services to build complex applications. Most current selection algorithms assume that all services assigned to a certain task provide exactly the same functionality. However, in realistic settings larger groups of services exist that share the same purpose, yet provide a slightly different interface. Incorporating these services increases the number of potential solutions, but also includes functional invalid configurations, resulting in a sparse solution space. As a consequence, applying naïve heuristic algorithms leads to poor results by reason of the increased probability of local optima. For that purpose, we propose a functionality clustering in order to leverage background knowledge on the compatibility of the services. This enables heuristic algorithms to discover valid workflow configurations in shorter time. We integrate our approach into a genetic algorithm by performing repair operations on invalid genomes. In the evaluation we compare our approach with related heuristic algorithms that use the same guided target function but pick services in a random manner.
| Original language | English |
|---|---|
| Title of host publication | Service-Oriented Computing, ICSOC 2011 Workshops - ICSOC 2011 International Workshops, WESOA, NFPSLAM-SOC, and Satellite Events, Revised Selected Papers |
| Pages | 100-113 |
| Number of pages | 14 |
| DOIs | |
| Publication status | Published - 2012 Sep 3 |
| Externally published | Yes |
| Event | 2011 International Conference on Service-Oriented Computing, ICSOC 2011 - Paphos, Cyprus Duration: 2011 Dec 5 → 2011 Dec 8 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 7221 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 2011 International Conference on Service-Oriented Computing, ICSOC 2011 |
|---|---|
| Country | Cyprus |
| City | Paphos |
| Period | 11/12/5 → 11/12/8 |
Fingerprint
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
Applying QoS-aware service selection on functionally diverse services. / Wagner, Florian; Ishikawa, Fuyuki; Honiden, Shinichi.
Service-Oriented Computing, ICSOC 2011 Workshops - ICSOC 2011 International Workshops, WESOA, NFPSLAM-SOC, and Satellite Events, Revised Selected Papers. 2012. p. 100-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7221 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Applying QoS-aware service selection on functionally diverse services
AU - Wagner, Florian
AU - Ishikawa, Fuyuki
AU - Honiden, Shinichi
PY - 2012/9/3
Y1 - 2012/9/3
N2 - The Service-Oriented Computing (SOC) paradigm envisions the composition of loosely coupled services to build complex applications. Most current selection algorithms assume that all services assigned to a certain task provide exactly the same functionality. However, in realistic settings larger groups of services exist that share the same purpose, yet provide a slightly different interface. Incorporating these services increases the number of potential solutions, but also includes functional invalid configurations, resulting in a sparse solution space. As a consequence, applying naïve heuristic algorithms leads to poor results by reason of the increased probability of local optima. For that purpose, we propose a functionality clustering in order to leverage background knowledge on the compatibility of the services. This enables heuristic algorithms to discover valid workflow configurations in shorter time. We integrate our approach into a genetic algorithm by performing repair operations on invalid genomes. In the evaluation we compare our approach with related heuristic algorithms that use the same guided target function but pick services in a random manner.
AB - The Service-Oriented Computing (SOC) paradigm envisions the composition of loosely coupled services to build complex applications. Most current selection algorithms assume that all services assigned to a certain task provide exactly the same functionality. However, in realistic settings larger groups of services exist that share the same purpose, yet provide a slightly different interface. Incorporating these services increases the number of potential solutions, but also includes functional invalid configurations, resulting in a sparse solution space. As a consequence, applying naïve heuristic algorithms leads to poor results by reason of the increased probability of local optima. For that purpose, we propose a functionality clustering in order to leverage background knowledge on the compatibility of the services. This enables heuristic algorithms to discover valid workflow configurations in shorter time. We integrate our approach into a genetic algorithm by performing repair operations on invalid genomes. In the evaluation we compare our approach with related heuristic algorithms that use the same guided target function but pick services in a random manner.
UR - http://www.scopus.com/inward/record.url?scp=84865478892&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84865478892&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-31875-7_12
DO - 10.1007/978-3-642-31875-7_12
M3 - Conference contribution
AN - SCOPUS:84865478892
SN - 9783642318740
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 100
EP - 113
BT - Service-Oriented Computing, ICSOC 2011 Workshops - ICSOC 2011 International Workshops, WESOA, NFPSLAM-SOC, and Satellite Events, Revised Selected Papers
ER -