Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Various algorithms have been proposed for the problem of quality-driven service composition. They differ by the quality of the resulting executable processes and by their processing costs. In this paper, we study the problem of service composition from an economical point of view and adopt the perspective of a Composition as a Service provider. Our goal is to minimize composition costs while delivering executable workflows of a specified average quality. We propose to dynamically select different composition algorithms for different workflow templates based upon template structure and workflow priority. For evaluating our selection algorithm, we consider two classic approaches to quality-driven composition, genetic algorithms and integer linear programming with different parameter settings. An extensive experimental evaluation shows significant gains in efficiency when dynamically selecting between different composition algorithms instead of using only one algorithm.


Editor(s):
Kappel, G.
Maamar, Z.
Motaharinezhad, Hr
Published in:
Service-Oriented Computing, 7084, 513-522
Presented at:
9th International Conference on Service-Oriented Computing (ICSOC)
Year:
2011
Publisher:
Berlin, Springer-Verlag Berlin
ISSN:
0302-9743
ISBN:
978-3-642-25534-2
Keywords:
Laboratories:




 Record created 2013-02-27, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)