关于Web Service Selection的阅读计划

service selection是service composition的一个研究方向。

[1] 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 可以被建模为:
(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
介绍和比较了4种服务选择的算法
Greedy Selection, Discarding Subsets, Bottom-Up Approximation, Pattern-wise Selection

[2] 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
这篇是ICWS poster 05的详细版本

[3] 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
提到了6种服务选择的方法并进行了比较：
    Constraint Selection
    Bottom-Up Approach
    Global Selection
    Discarding Subsets
    Greedy Selection
    Pattern-based Selection

使用了Simple Additive Weighting (SAW) Multiple Criteria Decision Making (MCDM)方法来对多属性的web 服务进行打分

(S3)里提到了模拟的QoS的值，可供参考; 实验参数: 工作流中的任务数为10~25个.