关键词: 服务组合 失效恢复 k-Shortest 效用函数

Abstract:

During the execution of the composite Web services, a failure recovery mechanism is needed to ensure the whole running business process to continue wi  thout interruption. In this paper, a WSC_KUPB algorithm is proposed to solve the k-Maximum Utility Path Problem （kMUPP） that is motivated by the recen nt 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 utili ty function. The test results show the algorithm strikes a good balance between time and availability compared to the relevant algorithms.

Key words: service composition;failure recovery;k-Shortest;utility function