Authors: Youhei Tanaka, Tomoya Enokido, Makoto Takizawa
Addresses: Graduate School of Science and Engineering, Tokyo Denki University at Ishizaka, Hatoyama, Hiki-gun, Saitama 350-0394, Japan. ' Faculty of Business Administration, Rissho University, 2-16 Osaki 4 Chome, Shinagawa-ku, Tokyo 141-8602, Japan. ' Department of Computers and Information Science, Faculty of Science and Technology, Seikei University, 3-3-1 Kichijoji-kitamachi, Musashino-shi, Tokyo 180-8633, Japan
Abstract: A Transactional Agent (TA) is a mobile agent to manipulate objects with some type of commitment condition. For example, a transactional agent commits only if at least one object could be successfully manipulated in the at-least-one condition. Computers may stop by fault while networks are assumed to be reliable. In the Client-Server (CS) model, servers can be fault-tolerant according to traditional replication and checkpointing technologies. However, an application program cannot be performed if a client computer is faulty. An application program can be performed on another operational computer even if a computer is faulty in the transactional agent model. There are kinds of faulty computers for a transactional agent, current, destination, and sibling computers where a transactional agent now exist, will move, and has visited, respectively. We discuss how the transactional agent can be tolerant of the types of computer faults.
Keywords: distributed systems; mobile agent modelling; distributed databases; transactional agents; commitment condition; multi-agent systems; agent-based systems; computer faults; fault tolerance.
International Journal of Wireless and Mobile Computing, 2010 Vol.4 No.2, pp.126 - 135
Available online: 07 May 2010 *Full-text access for editors Access for subscribers Purchase this article Comment on this article