Checkpointing strategies for database systems
CSC '87 Proceedings of the 15th annual conference on Computer Science
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
JXTA: A Network Programming Environment
IEEE Internet Computing
Fault-Tolerant Mobile Agents in Distributed Objects Systems
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Understanding Replication in Databases and Distributed Systems
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Mobile agent model for transaction processing on distributed objects
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Introduction to multimedia and mobile agents
Design and Implementation of Transactional Agents for Manipulating Distributed Objects
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Transactional Agent on Distributed Objects
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
A purpose-based synchronisation protocol of multiple transactions in multi-agent systems
International Journal of Business Intelligence and Data Mining
Energy-efficient Passive Replication of a Process in Mobile Environment
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
Hi-index | 0.00 |
In this paper, we discuss how to realize fault-tolerant applications on distributed objects. Servers supporting objects can be fault-tolerant by taking advantage of replication and checkpointing technologies. However, there is no discussion on how application programs being performed on clients are tolerant of clients faults. For example, servers might block in the two-phase commitment protocol due to the client fault. We newly discuss how to make application programs fault-tolerant by taking advantage of mobile agent technologies where a program can move from a computer to another computer in networks. An application program to be performed on a faulty computer can be performed on another operational computer by moving the program in the mobile agent model. In this paper, we discuss a transactional agent model where a reliable and efficient application for manipulating objects in multiple computers is realized in the mobile agent model. In the transactional agent model, only a small part of the application program named routing subagent moves around computers. A routing subagent autonomously finds a computer which to visit next. We discuss a hierarchical navigation map which computer should be visited price to another computer in a transactional agent. A routing subagent makes a decision on which computer visit for the hierarchical navigation map. Programs manipulating objects in a computer are loaded to the computer on arrival of the routing subagent in order to reduce the communication overhead. This part of the transactional agent is a manipulating subagent. The manipulation subagent still exists on the computer even after the routing subagent leaves the computer in order to hold objects until the commitment. We assume every computer may stop by fault while networks are reliable. There are kinds of faulty computers for a transactional agent; current, destination, and sibling computers where a transactional agent now exists, will move, and has visited, respectively. The types of faults are detected by neighbouring manipulation subagents by communicating with each other. If some of the manipulation subagents are faulty, the routing subagent has to be aborted. However, the routing subagent is still moving. We discuss how to efficiently deliver the abort message to the moving routing subagent. We evaluate the transactional agent model in terms of how long it takes to abort the routing subagent if some computer is faulty.