A Fully Distributed Mechanism for Locating Mobile Agents

Abstract

In this paper we propose a method based on distributed hashing to locate mobile agents in a system. The strategy is fully distributed, and transparent to the client that is performing the locating request; moreover, it is scalable and efficient. The idea is to treat mobile agents and hosts similarly to the way peers are treated in a Peer-to-peer system, and to implement a lookup protocol that is based on that principle, while taking care of the mobile nature of the agents. We also introduce the notion of Agent Pool, which allows us to reuse mobile agents that might be idle in the system instead of creating new ones at each request.

Cost-Effective Location Management for Mobile Agents on the Internet

“…Flocchini and Xie [40] devised a unique mobile agent location management scheme based on a P2P-like location management architecture. In this scheme, the hosts and the mobile agents in the mobile agent system are viewed separately as peers and objects in the well-known peer-to-peer system chord.…”

Location Monitoring In Mobile Agents System: A Survey

“…The second solution consists of leaving at each node the indication of the node where the agent has moved. This has to be done for each agent possibly incurring in a high space complexity to store all the information [7]. There have been many methods to keep track of the location of the mobile agents in its itinerary.…”

“…In [7] the authors have proposed fully distributed mechanism for locating mobile agents. The method is based on distributed hashing to locate mobile agents in a system.…”