QoS感知的全局最优快速服务选择

针对已有的服务选择算法往往按业务流程中任务的执行顺序依次选择服务,使服务选择时间随着任务数和候选服务集规模的增大而变长,难以让用户接受,而且算法也并未考虑包含关键路径的组合结构QoS优化这一问题,设计了对等网络服务覆盖网,利用服务社区和任务代理,根据组合结构和关键路径将全局QoS约束分解为局部约束,支持并行化的服务选择.实验结果表明,该方法可以迅速有效地找到接近最优的服务组合方案.

QoS-Aware Efficient Service Selection Approach

Service selection is a key step to transform a user's request into an optimal composite service plan. Most existing approaches are influenced by the number of tasks and candidate services and have shortcomings of long response time for large size candidate services and without considering the critical path. To solve above problems, a peer-to-peer (p2p) service overlay was built up to simulate distributed applications. Considering the composite construction and critical path, the end-to-end QoS constraint could be decomposed into local ones by using the management of service community, which facilitates parallel service selection. Experimental results demonstrate that the composite service plan could be built up with great reduced response time and the tradeoff to a near-optimal result.