首页> 外文期刊>IEEE Transactions on Systems, Man, and Cybernetics >A Transaction and QoS-Aware Service Selection Approach Based on Genetic Algorithm
【24h】

A Transaction and QoS-Aware Service Selection Approach Based on Genetic Algorithm

机译:基于遗传算法的事务和QoS感知服务选择方法

获取原文
获取原文并翻译 | 示例
           

摘要

As there are various risks of failure in its execution, a composite web service (CWS) requires a transactional mechanism to guarantee its reliable execution. Though the existing service selection methods have considered that its transactional properties may affect its quality of service (QoS) such as its execution time, some of these methods can just give the locally optimal transactional CWS while others can give globally optimal CWS only under a given fixed transactional workflow. This paper addresses the issue of selecting and composing web services via a genetic algorithm (GA) and gives a transaction and QoS-aware selection approach. First, it introduces transactional properties of a single web service and CWS and the transactional rules used to compose them. Next, it conducts the performance analysis of basic workflow patterns such as sequential, parallel, selectable, and loop patterns and develops an algorithm to compute the execution time of a complex CWS. Then, it presents a GA-based approach, which takes into account the execution time, price, transactional property, stability, and penalty-factor, to achieve globally optimal service selection. Finally, this paper reports experimental results that compare the proposed approach with the exhaustive search algorithm, transactional-QoS-driven selection algorithm, and transactional service selection algorithm. The experimental results show that the proposed algorithm is efficient and effective and can give a globally optimal transactional CWS.
机译:由于执行失败有各种风险,因此复合Web服务(CWS)需要一种事务处理机制来保证其可靠执行。尽管现有的服务选择方法已经考虑到其事务属性可能会影响其服务质量(QoS),例如执行时间,但其中一些方法只能给出局部最优的交易CWS,而其他方法只能在给定的条件下给出全局最优的CWS。固定的交易工作流程。本文解决了通过遗传算法(GA)选择和组合Web服务的问题,并提出了一种具有事务和QoS意识的选择方法。首先,它介绍了单个Web服务和CWS的事务属性以及用于构成它们的事务规则。接下来,它对基本工作流程模式(例如顺序模式,并行模式,可选模式和循环模式)进行性能分析,并开发一种算法来计算复杂CWS的执行时间。然后,它提出了一种基于GA的方法,该方法考虑了执行时间,价格,交易属性,稳定性和惩罚因素,以实现全局最优的服务选择。最后,本文报告了实验结果,将提出的方法与穷举搜索算法,事务性QoS驱动的选择算法和事务性服务选择算法进行了比较。实验结果表明,该算法是有效的,可以给出全局最优的交易CWS。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号