A Rapid Algorithm to Find the kMUPP Replacement Services Based on the QoS Constraints
Huaimin Wang · Computer Engineering and Science · 2008
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.