An adaptive algorithm for failure recovery during dynamic service composition

Authors:
Xingzhi Feng;Huaimin Wang;Quanyuan Wu;Bin Zhou
Affiliations:
School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China
Venue:
PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
Year:
2007

Citing 5
Cited 1

Internet Topology Modeler Based on Map Sampling

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Vickrey Prices and Shortest Paths: What is an Edge Worth?

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Service Selection Algorithms for Web Services with End-to-End QoS Constraints

CEC '04 Proceedings of the IEEE International Conference on E-Commerce Technology
SpiderNet: An Integrated Peer-to-Peer Service Composition Framework

HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Software configuration management related to the management of distributed systems and service-oriented architectures

SCM'01/SCM'03 Proceedings of the 2001 ICSE Workshops on SCM 2001, and SCM 2003 conference on Software configuration management

An automatic subdigraph renovation plan for failure recovery of composite semantic Web services

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.