基于时序约束分解的QoS感知的Web服务组合

发布时间：2018-03-10 06:52

本文选题：时序约束　切入点：约束分解　出处：《电子学报》2017年05期 　论文类型：期刊论文

【摘要】：基于时序约束的QoS感知的Web服务组合(TC-QSC)问题是在考虑时序约束的基础上寻找满足QoS约束或效用最大化的Web服务组合问题,受到了越来越多的关注.本文提出了一种时序约束分解方法,把施加于整个或部分工作流的时序约束分解为施加于每个活动的局部时序约束,从而将TC-QSC问题转换为一般的QoS感知的Web服务组合(QSC)问题,并通过过滤不满足局部时序约束的候选服务,一定程度上减小原问题的规模.这种时序约束分解过程主要依赖于工作流及其涉及的活动,而与各活动的候选服务关联不大,复杂度较低.实验测试了该方法的效果与时间开销,验证了其对于局部优选算法的必要性.
[Abstract]:The problem of QoS aware Web service composition based on temporal constraint is to find a Web service composition problem that satisfies QoS constraints or maximizes utility based on the consideration of temporal constraints. More and more attention has been paid to it. In this paper, a method of temporal constraint decomposition is proposed, which decomposes the temporal constraints imposed on the whole or part of the workflow into local temporal constraints imposed on each activity. Thus, the TC-QSC problem is transformed into a general QoS aware Web service composition problem, and candidate services that do not satisfy the local temporal constraints are filtered. This process of temporal constraint decomposition mainly depends on the workflow and the activities involved, but is not related to the candidate services of each activity. The experimental results show that the proposed method is necessary for local optimal selection.
【作者单位】：广西大学电气工程学院;桂林理工大学信息科学与工程学院;广西大学信息与工程学院;
【基金】：国家自然科学基金(No.51365010) 广西自然科学基金(No.2014GXNSFBA118269)
【分类号】：TP393.09

【相似文献】