Back to results list
Please use this identifier to cite or link to this item:
|Title:||Design of fault tolerant mobile agent systems||Authors:||Yang, Jin||Keywords:||Hong Kong Polytechnic University -- Dissertations
Mobile agents (Computer software)
|Issue Date:||2006||Publisher:||The Hong Kong Polytechnic University||Abstract:||Combining the characteristics of distributed computing and mobile computing, mobile agent (MA) becomes a new computing model and has a great potential of being used in many areas. For MA to be widely deployed, one of the primary concerns is fault tolerance. So far, there is a lack of a systematic approach to developing fault tolerant MA systems. In this research, we target at developing a framework and its associated algorithms for providing fault tolerance in an MA system. The framework is based on a hierarchical system architecture consisting of six layers: local fault tolerance support, reliable MA migration, reliable message delivery, fault tolerant MA execution, MA group, and application-level fault tolerance. For these layers, algorithms based on the following mechanisms are developed: (1) Failure detection, (2) Checkpointing, (3) Primary backup, (4) MA transaction. Failure detection caters for the local fault tolerance support layer. We identify the problems with the popular heartbeat failure detector (HBFD) and show that it is unfeasible for a large scale network environment. We then propose a new approach to implementing FD, called notification-based FD (NTFD). Instead of sending heartbeat messages periodically as HBFD does, NTFD sends failure notification messages only when the failure of a process is detected locally. Comparing with HBFD, NTFD achieves higher efficiency and scalability, guarantees 100% accuracy and provides a much lower probability of false detection. We also propose the design of a hybrid FD which combines the advantages of HBFD and NTFD. Checkpointing and primary-backup mechanisms provide support at the reliable MA migration and fault tolerant MA execution layers. With respect to the checkpointing-based approach, we first design three checkpoint placement algorithms for MA systems. We also design communication induced checkpointing (CIC) based algorithm for MA systems, which is well integrated with the independent checkpointing for reliable MA migration. For the primary-backup based approach, we propose efficient algorithms (RMAA and AMAA) for fault tolerant execution of MA by introducing parallel processing, which reduces the overhead and improves the execution speed dramatically. MA transaction enforces the tasks in an MA application to be executed in a transactional way, maintaining the system consistency during the abort process of a failed MA, the re-execution of non-idempotent operations, and the execution of a group of MAs. Different from most existing works, which are theoretical studies on how to model and implement MA transactions, we propose a realistic solution which integrates MA transactions with the real execution environment of MAs. We adopt a two-level nested transaction model for MA transactions. Based on this model, system architecture and algorithms for transactional execution of single MA and multiple MAs using different commitment models are designed. We also propose two path-pushing style deadlock detection algorithms to detect the possible deadlock in MA transactions. In summary, this thesis makes the following contributions: (1) A framework for providing fault tolerance in an MA system. (2) New approaches (NTFD and Hybrid FD) to implementing FD. (3) Checkpoint placement algorithms and CIC based algorithms for MA systems. (4) Efficient backup-based algorithms (RMAA and AMAA) for fault tolerant MA executions. (5) Models and mechanisms for MA transactions, with the support for deadlock prevention and deadlock detection.||Description:||xv, 177 p. : ill. ; 30 cm.
PolyU Library Call No.: [THS] LG51 .H577P COMP 2006 Yang
|URI:||http://hdl.handle.net/10397/2188||Rights:||All rights reserved.|
|Appears in Collections:||Thesis|
Show full item record
Files in This Item:
|E-thesis_Link.htm||For PolyU Users||162 B||HTML||View/Open|
|b20697089.pdf||For All Users (Non-printable)||2.35 MB||Adobe PDF||View/Open|
Citations as of Jun 11, 2018
Citations as of Jun 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.