During the execution of Web Service Composition, if one component service fails or becomes overloaded not to be accessed, a failure recovery mechanism is needed to ensure that the running process is not interrupted and the failed service can be replaced quickly and efficiently. Recent researches on this problem have some disadvantages. They don't consider the influence of the number of service candidates or the connection state of the overlay network, so the algorithms are easily disabled. In this paper, we present an adaptive algorithm to find replacement path locally by virtue of the old path during dynamic service composition. We go backward along the execution path to find the branch node, and then construct the sub-graph by the predefined rules. Finally we choose the best path with the highest total utility to replace the failed one. The test's result shows the algorithm performs very well in the vigorousness and availability to dynamic adaptation. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Feng, X., Wang, H., Wu, Q., & Zhou, B. (2007). An adaptive algorithm for failure recovery during dynamic service composition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4815 LNCS, pp. 41–48). Springer Verlag. https://doi.org/10.1007/978-3-540-77046-6_6
Mendeley helps you to discover research relevant for your work.