An Efficient Failure Recovery Scheme for Service Composition in Pervasive Computing

Authors

Chengyuan Yu, Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240, Shanghai, P. R. ChinaFollow
Linpeng Huang, Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240, Shanghai, P. R. ChinaFollow

Author Country (or Countries)

P. R. China

Abstract

During the execution of service composition, if one component service fails, 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. In this paper, we propose an efficient failure recovery scheme for rapid reconstruction of services compositions. Sufficient conditions about substitution and keeping state-consistent between services are proposed. Further, the algorithm for keeping state-consistent between services is proposed. The innovation of this paper is that the failure service will be substituted and the failure service’ state will be transformed into the substituting service’ state to improve the performance of the failure recovery scheme. And the prototype system is implemented. Simulation experiments demonstrate the good performance of the proposed failure recovery scheme.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/100534

Recommended Citation

Yu, Chengyuan and Huang, Linpeng (2016) "An Efficient Failure Recovery Scheme for Service Composition in Pervasive Computing," Applied Mathematics & Information Sciences: Vol. 10: Iss. 5, Article 34.
DOI: http://dx.doi.org/10.18576/amis/100534
Available at: https://digitalcommons.aaru.edu.jo/amis/vol10/iss5/34