一种基于QoS约束的kMUPP替换服务快速查找算法

A Rapid Algorithm to Find the kMUPP Replacement Services Based on the QoS Constraints

动态服务组合运行过程中,当发生服务失效时,失效恢复机制通过切换到替换路径来保证整个服务正常执行。本文提出一种WSC_KUPB算法利用k-Shortest路径问题来研究最大效用路径问题,以自定义的服务质量效用函数为依据,选取有最大总效用的优化路径作为替换路径。实验表明,该算法能够在时间和可用性上很好地折衷。

During the execution of the composite Web services, a failure recovery mechanism is needed to ensure the whole running business process to continue without interruption. In this paper, a WSC_KUPB algorithm is proposed to solve the k-Maximum Utility Path Problem （kMUPP） that is motivated by the recent interest in the k-Shortest path problem. The optimal path with the maximum total utility is chosen as the backup path based on the user-defined utility function. The test results show the algorithm strikes a good balance between time and availability compared to the relevant algorithms.