An Adaptive Algorithm for Failure Recovery During Dynamic Service Composition

  • Xingzhi Feng
  • Huaimin Wang
  • Quanyuan Wu
  • Bin Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4815)


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 vigor-ousness and availability to dynamic adaptation.


Business Process Service Composition Component Service Composite Service Service Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Casati, F., Ilnicki, S., Jin, L., et al.: Adaptive and Dynamic Service Composition in eFlow. In: Wangler, B., Bergman, L.D. (eds.) CAiSE 2000. LNCS, vol. 1789, Springer, Heidelberg (2000)CrossRefGoogle Scholar
  2. 2.
    Tosic, V., Ma, W., Pagurek, B.: On the Dynamic Manipulation of Classes of Service for XML Web Services. In: Proceedings of the 10th Hewlett-Packard Open View University Association (HP-OVUA) Workshop, Geneva, Switzerland (July 2003)Google Scholar
  3. 3.
    H.G., C., Yu, T., Lin, K.-J.: QCWS: An implementation of QoS-capable multimedia web services. In: Proceedings of IEEE 5th International Symposium on Multimedia Software Engineering, Taiwan, pp. 38–45 (December 2003)Google Scholar
  4. 4.
    Tosic, V., Mennie, D., Pagurek, B.: Software Configuration Management Related to Management of Distributed Systems and Services and Advanced Service Creation. In: Westfechtel, B., van der Hoek, A. (eds.) SCM 2001 and SCM 2003. LNCS, vol. 2649, pp. 54–69. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Feng, N., Ao, G., White, T., et al.: Dynamic Evolution of Network Management Software by Software Hot-Swapping. In: Proceedings of the 7th IFIP/IEEE International Symposium on Integrated Network Management (IM 2001), Seattle, USA, pp. 63–76 (May 2001)Google Scholar
  6. 6.
    Tosic, V., Mennie, D., Pagurek, B.: On dynamic Service Composition and Its Applicability to E-business Software Systems. In: Proceedings of the WOOBS 2001 (Workshop on Object-Oriented Business Solutions) workshop (at ECOOP 2001), pp. 95–108 (2001)Google Scholar
  7. 7.
    Yu, T., Lin, K.J.: Service Selection Algorithms for Web Services with End-to-end QoS Constraints. In: Proceedings of the IEEE International Conference on E-Commerce Technology (CEC 2004), San Diego, California, pp. 129–136 (2004)Google Scholar
  8. 8.
    Gu, X., Nahrstedt, K., Yu, B.: SpiderNet: An Integrated Peer-to-Peer Service Composition Framework. In: Proceedings of 13th IEEE International Symposium on High performance Distributed Computing(HPDC 2004), Honolulu, Hawaii, pp. 110–119 (June 2004)Google Scholar
  9. 9.
    Yu, T., Lin, K.-J.: Adaptive Algorithms for Finding Replacement Services in Autonomic Distributed Business Processes. In: Proceedings of the 7th International Symposium on Autonomous Decentralized Systems (ISADS 2005), Chengdu, China, pp. 427–434 (April 2005)Google Scholar
  10. 10.
    Hershberger, J., Suri, S.: Vickrey Prices and Shortest Paths: What is an Edge Worth? In: FOCS 2001. Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, pp. 252–259. IEEE Computer Society, Los Alamitos (2001)Google Scholar
  11. 11.
    Magoni, D., Pansiot, J.-J.: Internet Topology Modeler Based on Map Sampling. In: ISCC 2002. Proceedings of the Seventh International Symposium on Computers and Communications, Taormina, 1-4 July 2002, pp. 1021–1027. IEEE Computer Society, Los Alamitos (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Xingzhi Feng
    • 1
  • Huaimin Wang
    • 1
  • Quanyuan Wu
    • 1
  • Bin Zhou
    • 1
  1. 1.School of Computer, National University of Defense Technology, 410073 ChangshaChina

Personalised recommendations