DocumentCode
3393010
Title
Adaptive algorithms for finding replacement services in autonomic distributed business processes
Author
Yu, Tao ; Lin, Kwei-Jay
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA, USA
fYear
2005
fDate
4-8 April 2005
Firstpage
427
Lastpage
434
Abstract
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.
Keywords
Internet; adaptive systems; back-up procedures; business data processing; distributed processing; quality of service; QoS broker; Web service; adaptive algorithm; autonomic distributed business process; backup path; replacement path; Adaptive algorithm; Computational modeling; Computer industry; Computer science; Delay; Humans; Protocols; Software tools; Switches; Web services;
fLanguage
English
Publisher
ieee
Conference_Titel
Autonomous Decentralized Systems, 2005. ISADS 2005. Proceedings
Print_ISBN
0-7803-8963-8
Type
conf
DOI
10.1109/ISADS.2005.1452105
Filename
1452105
Link To Document