[Data sorting] Michael C. Jaeger | QoS-Aware Web service composition

articles directory

• [1] QoS aggregation for Web service composition using workflow patterns (edoc, 2004)
• [2] QoS aggregation in Web Service compositions (EEE, 2005)
• [3] QoS-aware composition of Web Services: A look at selection algorithms (ICWs poster, 2005)
• [4] QoS-aware composition of Web Services: An Evaluation of selection algorithms (OTM, 2005)
• [5] simulation of algorithms for the selection of Web Services for compositions (TES, 2005)
• [6] model-driven methodology for building QoS-optimised Web Service compositions (dais, 2005)
• [7] Improving the QoS of WS compositions based on redundant services (nwesp, 2005)
• [8] modelling of service compositions: relations to business process and work under ow modelling (icsoc workshop, 2006)
• [9] QoS-based selection of services: the implementation of a genetic algorithm (kivs workshop, 2007)

[1] QoS aggregation for Web service composition using workflow patterns (edoc, 2004)

Here are the notes for this paper.

[2] QoS aggregation in Web Service compositions (EEE, 2005)

Michael C. Jaeger, Gregor rojec-Goldmann, Gero M ?, "QoS aggregation in Web Service Compositions, "Eee, pp.181-185,200 5 IEEE International Conference on E-technology, e-commerce and e-service (EEE '05), 2005
The difference with edoc04 adds the monitoring part. The historical data obtained through monitoring can be more accurately estimated aggregated QoS of the composition. For Conditional branches, actual distribution can be obtained.
(S3) mentioned the impact of dependency domain on estimation of reliability.

[3] QoS-aware composition of Web Services: A look at selection algorithms (ICWs poster, 2005)

Michael C. Jaeger, Gero muhl, Sebastian golze ,"QoS-aware composition of Web Services: A look at Selection Algorithms, "ICWs, pp.807-808, IEEE International Conference on Web Services (ICWs '05), 2005

Service Selection in a composition can be modeled:
1) 0/1-Knapsack Problem
(2) multi-mode RCPSP (resource constraint Project Scheduling Problem): which has non-regular objectives, specific precedence relation, and no preemption allowed
Describes and compares the four service optionsAlgorithm
Greedy selection, discarding subsets, bottom-up approximation, pattern-wise selection

[4] QoS-aware composition of Web Services: An Evaluation of selection algorithms (OTM, 2005)

Michael C. Jaeger, Gero mühl, Sebastian golze:QoS-aware composition of Web Services: An Evaluation of Selection Algorithms. OTM conferences (1) 2005: 646-661
This is a detailed version of ICWs poster 05.

[5] simulation of algorithms for the selection of Web Services for compositions (TES, 2005)

Michael C. Jaeger, Gregor rojec-Goldmann:Seneca-simulation of algorithms for the selection of Web Services for compositions. Tes 2005: 84-97
The six service selection methods are mentioned and compared:
Constraint Selection
Bottom-up approach
Global Selection
Discarding Subsets
Greedy Selection
Pattern-based selection

The simple additive weighting (SAW) Multiple Criteria demo-making (mcdm) method is used to rate web services with multiple attributes.

The simulated QoS value is mentioned in (S3) for reference. experiment parameters: the number of tasks in the workflow is 10 ~ 25.

[6] model-driven methodology for building QoS-optimised Web Service compositions (dais, 2005)

Roy gr ø NMO, Michael C. Jaeger:Model-driven methodology for building QoS-optimised Web Service Compositions. Dais 2005: 68-82
Use UML to model Web service composition, model-driven.

(S4) mentioned a situation when optimizing the concurrency structure: WS1 is very fast, and all alternative services of WS1 are faster than the fastest running WS2. Obviously, when selecting WS1, select the cheapest service. because the running time is determined by WS2.
Solution: recursively recursion to a basic structure (such as concurrent), and then group all the candidate service combinations in this structure to obtain the optimal solution, so as to complete service selection

[7] Improving the QoS of WS compositions based on redundant services (nwesp, 2005)

Michael C. Jaeger and Henderson Rik Ladner.Improving the QoS of WS compositions based on redundant services. In: Proceedings of the 2005 International Conference on next generation Web services practices (nwesp '05), pages 189--194, Seoul, South-Korea, August 2005. ieee cs press.
This article briefly discusses how to use redundant services to improve the QoS (response time, reliability) of composite services ). (S3) discusses how to find the weak point to be improved in the composite service, and proposes two methods: Brute-fource search and pattern-based search (which are not clear in this article. (S4) discusses how to use a method similar to n-Version Programming to improve QoS of a composite service.

[8] modelling of service compositions: relations to business process and work under ow modelling (icsoc workshop, 2006)

Michael C. Jaeger:Modelling of service compositions: relations to business process and workflow Modelling. Icsoc workshops 2006: 141-153
This article solves two problems:
(1) What are the differences between business processes and work under ow control below ages
(2) Why service compositions are used in this yield ELD

[9] QoS-based selection of services: the implementation of a genetic algorithm (kivs workshop, 2007)

Jaeger, M. C. and M? Uhl, G. 2007.QoS-based selection of services: the implementation of a genetic algorithm. In kivs 2007 Workshop: Service-Oriented ubuntures und service-oriented computing (SOA/SOC), Bern, Switzerland. 359-370.
A genetic algorithm is proposed for QoS-based service selection and compared with the Seneca algorithm.
The impact of various parameters on the algorithm is investigated. A simulated environment is implemented to randomly generate problem instances.