direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

KBS Publikationen

QoS-aware Composition of Web Services: An Evaluation of Selection Algorithms
Zitatschlüssel JaMuGo:2005:QoSAwareComposition
Autor Michael C. Jaeger and Gero Mühl and Sebastian Golze
Buchtitel Confederated International Conferences CoopIS, DOA, and ODBASE 2005
Seiten 646–661
Jahr 2005
ISBN 3-540-29736-7
Adresse Agia Napa, Cyprus
Jahrgang 3760
Monat oct
Herausgeber Robert Meersman and Zahir Tari
Verlag Springer
Serie Lecture Notes in Computer Science (LNCS)
Zusammenfassung A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Then, a selection process chooses the optimal candidates. This paper discusses how the selection can consider different Quality-of-Service (QoS) categories as selection criteria to select the most suitable candidates for the composition. If more than one category is used for optimisation, a multidimensional optimisation problem arises which results in an exponential computation effort for computing an optimal solution. We explain the problem and point out similarities to other combinatorial problems – the knapsack problem and the resource constraint project scheduling problem (RCPSP). Based on this discussion, we describe possible heuristics for these problems and evaluate their efficiency when used for web service candidate selection.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe