By Topic

Adaptive algorithms for finding replacement services in autonomic distributed business processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tao Yu ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA, USA ; Kwei-Jay Lin

Web service may be used to construct autonomic business processes, where several Web services interact with each other to carry out complex transactions or workflows. During the execution of an autonomic process, if one component service fails or becomes overloaded, a mechanism is needed to ensure that the running process is not interrupted and the failed service is quickly and efficiently replaced. In this paper, we present two algorithms to solve the problem. The first algorithm uses the backup path approach so that the predecessor of a failed service may quickly switch to a predefined backup path. The second algorithm uses the replacement path approach to re-construct a new process by skipping a failed service. All these dynamic adaptations can be done by business process itself or a QoS broker which is part of an autonomic system. The simulation result shows that, when producing the information needed for dynamic adaptation, the running time of business process composition increases only by a constant factor regardless of the system size.

Published in:

Autonomous Decentralized Systems, 2005. ISADS 2005. Proceedings

Date of Conference:

4-8 April 2005