An optimal location update and searching algorithm for tracking mobile agent
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Programming and Deploying Java Mobile Agents Aglets
Programming and Deploying Java Mobile Agents Aglets
Grasshopper - A Mobile Agent Platform for Active Telecommunication
IATA '99 Proceedings of the Third International Workshop on Intelligent Agents for Telecommunication Applications
An Efficient Control Mechanism of Mobile Agents
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
nem: A Software for Network Topology Analysis and Modeling
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
A Naming Service Architecture and Optimal Periodical Update Scheme for a Multi Mobile Agent System
CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-1 (CIMCA-IAWTIC'06) - Volume 01
Agent-based approaches to managing fault-tolerant networks of distributed multi-agent systems
Multiagent and Grid Systems - Agent Based Computing: From Model to Implementation
Hi-index | 0.00 |
A location management scheme is critical for a mobile agent system to trace mobile agents and support on-the-go communications between peer agents. For the time being, most mobile agent location management schemes consist of both a tracking phase and a message delivery phase, and dutifully create or incur plenty of update messages and interaction messages in order to guarantee the effectiveness of the schemes. Excessive transmission of messages not only downgrades the overall performance of mobile agent location management scheme, but also causes network overhead. This paper proposes a ratio-based update scheme that can minimize the overall transmission costs of produced messages by intelligently adjusting the ratio between update messages and forwarding pointers. Experiments are conducted to evaluate the proposed scheme, which reveal that this scheme is general, adaptable, and possessed of higher granularity in the network latency. Moreover, the results also indicate that this scheme is better than previous schemes in optimizing the overall performance.