We extend the Jinni mobile agent architecture with a multicast network transport layer, an agent-to-agent delegation mechanism and a reflection based Prolog-to-Java interface. To ensure that our agent infrastructure runs efficiently, independently of router-level multicast support, we describe a blackboard based algorithm for locating a randomly roaming agent. As part of the agent-to-agent delegation mechanism, we describe an alternative to code-fetching mechanism for stronger mobility of mobile agents with less network overhead. In the context of direct and reflection based extension mechanisms for Jinni, we describe the design and the implementation of a reflection based Prolog-to-Java interface. The presence of subtyping and method overloading makes finding the most specific method corresponding to a Prolog call pattern fairly difficult. We describe a run-time algorithm which provides accurate handling of overloaded methods beyond Java's reflection package's limitations.

The purpose of this thesis is to present a comprehensive colligation of applications of mobile agents in networks, and provide a baseline association of these systems. This work has been motivated by the fact that mobile agent systems have been deemed proficuous alternatives in system applications. Several mobile agent systems have been developed to provide scalable and cogent solutions in network-centric applications. This thesis examines some existing mobile agent systems in core networking areas, in particular, those of network and resource management, routing, and the provision of fault tolerance and security. The inherent features of these systems are discussed with respect to their specific functionalities. The applicability and efficacy of mobile agents are further considered in the specific areas mentioned above. Although an initial foray into a collation of this nature, the goal of this annotated bibliography is to provide a generic referential view of mobile agent systems in network applications.

by Chan Pui Chung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves [56]-[61]). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- The Trends --- p.1 / Chapter 1.2 --- What this Thesis Contains --- p.3 / Chapter 2 --- Background --- p.5 / Chapter 2.1 --- Computer Security --- p.5 / Chapter 2.2 --- Anti-intrusion Techniques --- p.6 / Chapter 2.3 --- The Need for Intrusion Detection System --- p.7 / Chapter 2.4 --- Intrusion Detection System Categorization --- p.8 / Chapter 2.4.1 --- Network-based vs. Host-based --- p.8 / Chapter 2.4.2 --- Anomaly Detection vs. Misuse Detection --- p.10 / Chapter 2.4.3 --- Centralized vs. Distributed --- p.11 / Chapter 2.5 --- Agent-based IDS --- p.12 / Chapter 2.6 --- Mobile agent-based IDS --- p.12 / Chapter 3 --- Survey on Intrusion Step --- p.14 / Chapter 3.1 --- Introduction --- p.14 / Chapter 3.2 --- Getting information before break in --- p.14 / Chapter 3.2.1 --- Port scanning --- p.14 / Chapter 3.2.2 --- Sniffing --- p.16 / Chapter 3.2.3 --- Fingerprinting --- p.17 / Chapter 3.3 --- Intrusion method --- p.17 / Chapter 3.3.1 --- DOS and DDOS --- p.17 / Chapter 3.3.2 --- Password cracking --- p.18 / Chapter 3.3.3 --- Buffer overflows --- p.19 / Chapter 3.3.4 --- Race Condition --- p.20 / Chapter 3.3.5 --- Session Hijacking --- p.20 / Chapter 3.3.6 --- Computer Virus --- p.21 / Chapter 3.3.7 --- Worms --- p.21 / Chapter 3.3.8 --- Trojan Horse --- p.22 / Chapter 3.3.9 --- Social Engineering --- p.22 / Chapter 3.3.10 --- Physical Attack --- p.23 / Chapter 3.4 --- After intrusion --- p.23 / Chapter 3.4.1 --- Covering Tracks --- p.23 / Chapter 3.4.2 --- Back-doors --- p.23 / Chapter 3.4.3 --- Rootkits --- p.23 / Chapter 3.5 --- Conclusion --- p.24 / Chapter 4 --- A Survey on Intrusion Detection System --- p.25 / Chapter 4.1 --- Introduction --- p.25 / Chapter 4.2 --- Information Source --- p.25 / Chapter 4.2.1 --- Host-based Source --- p.25 / Chapter 4.2.2 --- Network-based Source --- p.26 / Chapter 4.2.3 --- Out-of-band Source --- p.27 / Chapter 4.2.4 --- Data Fusion from multiple sources --- p.27 / Chapter 4.3 --- Detection Technology --- p.28 / Chapter 4.3.1 --- Intrusion signature --- p.28 / Chapter 4.3.2 --- Threshold Detection --- p.31 / Chapter 4.3.3 --- Statistical Analysis --- p.31 / Chapter 4.3.4 --- Neural Network --- p.32 / Chapter 4.3.5 --- Artificial Immune System --- p.33 / Chapter 4.3.6 --- Data Mining --- p.33 / Chapter 4.3.7 --- Traffic Analysis --- p.34 / Chapter 4.4 --- False Alarm Rate --- p.35 / Chapter 4.5 --- Response --- p.35 / Chapter 4.6 --- Difficulties in IDS --- p.36 / Chapter 4.6.1 --- Base Rate Fallacy --- p.36 / Chapter 4.6.2 --- Denial of Service Attack against IDS --- p.37 / Chapter 4.6.3 --- Insertion and Evasion attack against the Network-Based IDS . --- p.37 / Chapter 4.7 --- Conclusion --- p.38 / Chapter 5 --- Preemptive Distributed Intrusion Detection using Mobile Agents --- p.39 / Chapter 5.1 --- Introduction --- p.39 / Chapter 5.2 --- Architecture Design --- p.40 / Chapter 5.2.1 --- Overview --- p.40 / Chapter 5.2.2 --- Agents involved --- p.40 / Chapter 5.2.3 --- Clustering --- p.42 / Chapter 5.3 --- How it works --- p.44 / Chapter 5.3.1 --- Pseudo codes of operations --- p.48 / Chapter 5.4 --- Advantages --- p.49 / Chapter 5.5 --- Drawbacks & Possible Solutions --- p.49 / Chapter 5.6 --- Other Possible Mode of Operation --- p.50 / Chapter 5.7 --- Conclusion --- p.51 / Chapter 6 --- Conclusion --- p.52 / A Paper Derived from this Thesis --- p.54 / Bibliography --- p.55

Yu Chiu-Man. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 93-96). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgements --- p.ii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Advantages of mobile agents --- p.2 / Chapter 1.2 --- Security --- p.3 / Chapter 1.3 --- Contributions --- p.3 / Chapter 1.4 --- Structure --- p.4 / Chapter 2 --- The Problem of Execution Tampering Attack --- p.5 / Chapter 2.1 --- Mobile agent execution model --- p.5 / Chapter 2.2 --- Tampering attack from malicious hosts --- p.5 / Chapter 2.3 --- Open network environment --- p.6 / Chapter 2.4 --- Conclusion --- p.6 / Chapter 3 --- Existing Approaches to Solve the Execution Tampering Prob- lem --- p.8 / Chapter 3.1 --- Introduction --- p.8 / Chapter 3.2 --- Trusted execution environment --- p.9 / Chapter 3.2.1 --- Closed system --- p.9 / Chapter 3.2.2 --- Trusted hardware --- p.9 / Chapter 3.3 --- Tamper-detection --- p.11 / Chapter 3.3.1 --- Execution tracing --- p.11 / Chapter 3.4 --- Tamper-prevention --- p.12 / Chapter 3.4.1 --- Blackbox security --- p.12 / Chapter 3.4.2 --- Time limited blackbox --- p.13 / Chapter 3.4.3 --- Agent mess-up --- p.15 / Chapter 3.4.4 --- Addition of noisy code --- p.15 / Chapter 3.4.5 --- Co-operating agents --- p.16 / Chapter 3.5 --- Conclusion --- p.17 / Chapter 4 --- Tamper-Detection Mechanism of Our Protocol --- p.18 / Chapter 4.1 --- Introduction --- p.18 / Chapter 4.2 --- Execution tracing --- p.18 / Chapter 4.3 --- Code obfuscation --- p.21 / Chapter 4.3.1 --- Resilience of obfuscating transformation --- p.22 / Chapter 4.4 --- Execution tracing with obfuscated program --- p.23 / Chapter 4.5 --- Conclusion --- p.27 / Chapter 5 --- A Flexible Tamper-Detection Protocol by Using Cooperating Agents --- p.28 / Chapter 5.1 --- Introduction --- p.28 / Chapter 5.1.1 --- Agent model --- p.29 / Chapter 5.1.2 --- Execution model --- p.30 / Chapter 5.1.3 --- System model --- p.30 / Chapter 5.1.4 --- Failure model --- p.30 / Chapter 5.2 --- The tamper-detection protocol --- p.30 / Chapter 5.3 --- Fault-tolerance policy --- p.38 / Chapter 5.4 --- Costs of the protocol --- p.38 / Chapter 5.5 --- Discussion --- p.40 / Chapter 5.6 --- Conclusion --- p.42 / Chapter 6 --- Verification of the Protocol by BAN Logic --- p.43 / Chapter 6.1 --- Introduction --- p.43 / Chapter 6.2 --- Modifications to BAN logic --- p.44 / Chapter 6.3 --- Term definitions --- p.45 / Chapter 6.4 --- Modeling of our tamper-detection protocol --- p.46 / Chapter 6.5 --- Goals --- p.47 / Chapter 6.6 --- Sub-goals --- p.48 / Chapter 6.7 --- Assumptions --- p.48 / Chapter 6.8 --- Verification --- p.49 / Chapter 6.9 --- Conclusion --- p.53 / Chapter 7 --- Experimental Results Related to the Protocol --- p.54 / Chapter 7.1 --- Introduction --- p.54 / Chapter 7.2 --- Experiment environment --- p.54 / Chapter 7.3 --- Experiment procedures --- p.55 / Chapter 7.4 --- Experiment implementation --- p.56 / Chapter 7.5 --- Experimental results --- p.61 / Chapter 7.6 --- Conclusion --- p.65 / Chapter 8 --- Extension to Solve the ´حFake Honest Host´ح Problem --- p.68 / Chapter 8.1 --- Introduction --- p.68 / Chapter 8.2 --- "The method to solve the ""fake honest host"" problem" --- p.69 / Chapter 8.2.1 --- Basic idea --- p.69 / Chapter 8.2.2 --- Description of the method --- p.69 / Chapter 8.3 --- Conclusion --- p.71 / Chapter 9 --- Performance Improvement by Program Slicing --- p.73 / Chapter 9.1 --- Introduction --- p.73 / Chapter 9.2 --- Deployment of program slicing --- p.73 / Chapter 9.3 --- Conclusion --- p.75 / Chapter 10 --- Increase Scalability by Supporting Multiple Mobile Agents --- p.76 / Chapter 10.1 --- Introduction --- p.76 / Chapter 10.2 --- Supporting multiple mobile agents --- p.76 / Chapter 10.3 --- Conclusion --- p.78 / Chapter 11 --- Deployment of Trust Relationship in the Protocol --- p.79 / Chapter 11.1 --- Introduction --- p.79 / Chapter 11.2 --- Deployment of trust relationship --- p.79 / Chapter 11.3 --- Conclusion --- p.82 / Chapter 12 --- Conclusions and Future Work --- p.83 / A Data of Experimental Results --- p.86 / Publication --- p.92 / Bibliography --- p.93

Leung Kwai Ki. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 152-161). / Abstracts in English and Chinese. / Abstract --- p.i / 論文摘要 --- p.iii / Acknowledgements --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Contributions of this thesis --- p.3 / Chapter 1.2 --- Thesis structure --- p.3 / Chapter 2 --- Mobile Agent Paradigm --- p.6 / Chapter 3 --- Analysis on Fault-tolerant Mechanisms --- p.9 / Chapter 3.1 --- Design considerations --- p.9 / Chapter 3.1.1 --- Infrastructure failure --- p.10 / Chapter 3.1.2 --- Unfavorable outcomes --- p.10 / Chapter 3.1.3 --- Exactly-once property --- p.11 / Chapter 3.1.4 --- Blocking --- p.13 / Chapter 3.1.5 --- Network partitioning --- p.14 / Chapter 3.1.6 --- Domino effect --- p.15 / Chapter 3.1.7 --- Inter-agent communications and global consistency --- p.16 / Chapter 3.1.8 --- Platform dependent and platform independent approaches . . --- p.17 / Chapter 3.1.9 --- ACID in mobile agent systems --- p.17 / Chapter 3.2 --- Basic Mechanisms --- p.18 / Chapter 3.2.1 --- Replication mechanisms --- p.19 / Chapter 3.2.2 --- Checkpointing and logging --- p.22 / Chapter 3.2.3 --- Comparison between the replication and checkpointing mechanisms --- p.25 / Chapter 3.2.4 --- Rollback --- p.26 / Chapter 3.2.5 --- Diagnosis and planning --- p.26 / Chapter 3.3 --- Analysis of current approaches --- p.27 / Chapter 3.3.1 --- Infrastructure failure handling --- p.27 / Chapter 3.3.2 --- Unfavorable outcomes prevention --- p.38 / Chapter 3.3.3 --- Diagnosis and planning --- p.40 / Chapter 3.3.4 --- Summary --- p.42 / Chapter 3.4 --- Related work of analysing fault-tolerant mechanisms --- p.43 / Chapter 3.5 --- Summary --- p.43 / Chapter 4 --- Flexible Monitor Chain --- p.45 / Chapter 4.1 --- Overview --- p.45 / Chapter 4.2 --- Assumptions --- p.47 / Chapter 4.3 --- Protocol --- p.48 / Chapter 4.4 --- Different scenarios of failure --- p.51 / Chapter 4.5 --- Performance evaluation --- p.53 / Chapter 4.5.1 --- Simulation model --- p.53 / Chapter 4.5.2 --- Results and discussions --- p.55 / Chapter 4.6 --- Discussions --- p.58 / Chapter 4.6.1 --- Preservation of the exactly-once property --- p.58 / Chapter 4.6.2 --- High flexibility in the management of monitors --- p.59 / Chapter 4.6.3 --- High stability --- p.59 / Chapter 4.6.4 --- Feasibility to be applied in an open environment --- p.60 / Chapter 4.6.5 --- Overcoming the problem of network partitioning --- p.60 / Chapter 4.6.6 --- Lightweightedness --- p.60 / Chapter 4.6.7 --- Global consistency and domino effect --- p.61 / Chapter 4.7 --- Summary --- p.61 / Chapter 5 --- Transaction and Rollback Models --- p.62 / Chapter 5.1 --- Simple E-Marketplace --- p.64 / Chapter 5.2 --- Transaction and rollback models --- p.66 / Chapter 5.2.1 --- Distributed transaction without rollback (Ml) --- p.67 / Chapter 5.2.2 --- A chained-transaction (M2) --- p.67 / Chapter 5.2.3 --- A chained-transaction with flexible rollback scheme (M3) . --- p.69 / Chapter 5.3 --- Performance evaluation --- p.71 / Chapter 5.3.1 --- Experimental setup --- p.71 / Chapter 5.3.2 --- Results and discussions --- p.73 / Chapter 5.4 --- Summary --- p.77 / Chapter 6 --- Dependent Partial Rollback --- p.79 / Chapter 6.1 --- Overview --- p.80 / Chapter 6.2 --- Formal representation --- p.83 / Chapter 6.3 --- Assumptions --- p.85 / Chapter 6.4 --- Protocol --- p.86 / Chapter 6.5 --- Discussions --- p.89 / Chapter 6.5.1 --- Assumption: Weak migration and the effect of a stage --- p.90 / Chapter 6.5.2 --- Assumption: Failure free environment --- p.92 / Chapter 6.5.3 --- Assumption: guarantee of rollback --- p.92 / Chapter 6.5.4 --- Assumption: Domino effect --- p.93 / Chapter 6.5.5 --- Platform independence --- p.94 / Chapter 6.5.6 --- High efficiency --- p.94 / Chapter 6.5.7 --- Stage-based design --- p.94 / Chapter 6.5.8 --- Autonomy --- p.95 / Chapter 6.5.9 --- High flexibility --- p.95 / Chapter 6.6 --- Related Works --- p.96 / Chapter 6.7 --- Implementation of SEMP with dependent partial rollback --- p.97 / Chapter 6.8 --- Summary --- p.99 / Chapter 7 --- Analysis on Security Mechanisms --- p.100 / Chapter 7.1 --- Classifications of security issues --- p.100 / Chapter 7.2 --- Analysis of current approaches --- p.103 / Chapter 7.2.1 --- Encrypting functions and data --- p.103 / Chapter 7.2.2 --- Computing with encrypted functions --- p.106 / Chapter 7.2.3 --- Trusted environment --- p.107 / Chapter 7.2.4 --- Limitation of execution time --- p.109 / Chapter 7.2.5 --- Execution tracing --- p.110 / Chapter 7.3 --- Execution tracing --- p.111 / Chapter 7.4 --- Summary --- p.116 / Chapter 8 --- Execution Tracing with Randomly-Selected Hosts --- p.117 / Chapter 8.1 --- Overview --- p.117 / Chapter 8.2 --- Assumptions --- p.119 / Chapter 8.3 --- Protocol --- p.120 / Chapter 8.4 --- Performance evaluation --- p.121 / Chapter 8.4.1 --- Simple sgent system --- p.121 / Chapter 8.4.2 --- Experimental setup --- p.123 / Chapter 8.4.3 --- Results and discussions --- p.123 / Chapter 8.5 --- Discussions --- p.124 / Chapter 8.5.1 --- Detect the modifications of the code and data --- p.124 / Chapter 8.5.2 --- Against masquerade --- p.125 / Chapter 8.5.3 --- Against skip from re-execution --- p.125 / Chapter 8.5.4 --- Against collaboration --- p.125 / Chapter 8.5.5 --- Higher privacy --- p.126 / Chapter 8.5.6 --- Low workload on the trusted host --- p.126 / Chapter 8.5.7 --- Feasible to be used in the open environment --- p.126 / Chapter 8.5.8 --- Secure data collection --- p.126 / Chapter 8.5.9 --- Comparison with the existing approaches --- p.127 / Chapter 8.5.10 --- Weaknesses --- p.128 / Chapter 8.6 --- Optimizations --- p.128 / Chapter 8.6.1 --- Sampling --- p.128 / Chapter 8.6.2 --- Inserting sub-state and request on demand --- p.129 / Chapter 8.7 --- Summary --- p.129 / Chapter 9 --- FTS Framework --- p.131 / Chapter 9.1 --- Assumptions --- p.132 / Chapter 9.2 --- Abstract framework --- p.132 / Chapter 9.2.1 --- Different agents and their duties --- p.132 / Chapter 9.2.2 --- Messaging --- p.135 / Chapter 9.3 --- Implementation in Jade --- p.135 / Chapter 9.3.1 --- Characteristics of Jade --- p.137 / Chapter 9.3.2 --- Core implementation details --- p.138 / Chapter 9.4 --- Performance Evaluation --- p.144 / Chapter 9.4.1 --- Experimental Setup --- p.144 / Chapter 9.4.2 --- Experimental Results --- p.145 / Chapter 9.5 --- Discussions --- p.147 / Chapter 9.5.1 --- High worker survivability --- p.148 / Chapter 9.5.2 --- Low blocking chance --- p.148 / Chapter 9.5.3 --- Trusted Third Party Hosts --- p.149 / Chapter 9.6 --- Summary --- p.149 / Chapter 10 --- Conclusions and Future Works --- p.150 / Bibliography --- p.152 / Publications --- p.161

Thesis (M.S.)--West Virginia University, 2001. / Title from document title page. Document formatted into pages; contains vii, 61 p. : ill. Includes abstract. Includes bibliographical references (p. 50-52).

Thesis (M.C.S.) - Carleton University, 2006. / Includes bibliographical references (p. 115-122). Also available in electronic format on the Internet.

Thesis (M. Sc.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references (p. 104-111). Also available via the World Wide Web.

Thesis (Ph. D.)--University of Cambridge, 2000. / Cover title. "June 2000." Includes bibliographical references.

This study deals with the Distributed Buying Problem, that is, the problem faced by geographically distributed businesses when it comes to optimising buyer time and global businesses resources. It adopts a software agent-based approach to the problem. A literature survey was carried out to review the relatively new field of software agents and mobile agents in particular. The role of agents in electronic commerce was also studied. A mobile agent system was then designed and implemented to serve as a proof-ofconcept system for an agent-based solution to the problem. The design and implementation are then discussed. / Thesis (M.Sc.)-University of Natal, Durban, 2002.