A scalable hash-based mobile agent location mechanism

In this paper, we propose a novel mobile agent tracking mechanism based on hashing. To allow our system to adapt to variable workloads, dynamic rehashing is supported The proposed mechanism scales well with both the number of agents and the number of moving and querying operations. We also report on its implementation in the Aglets platform and present performance results.

[1]  Fritz Hohl,et al.  Mole – Concepts of a mobile agent system , 1999, World Wide Web.

[2]  Farokh B. Bastani,et al.  EH/sup */-extendible hashing in a distributed environment , 1997, Proceedings Twenty-First Annual International Computer Software and Applications Conference (COMPSAC'97).

[3]  M. van Steen,et al.  On MAS Scalability , 2001 .

[4]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[5]  Amy L. Murphy,et al.  Reliable Communication for Highly Mobile Agents , 2004, Autonomous Agents and Multi-Agent Systems.

[6]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[7]  Luc Moreau,et al.  Distributed directory service and message routing for mobile agents , 2001, Sci. Comput. Program..

[8]  Danny B. Lange,et al.  Programming and Deploying Java¿ Mobile Agents with Aglets¿ , 1998 .

[9]  Anand R. Tripathi,et al.  Design of the Ajanta system for mobile agent programming , 2002, J. Syst. Softw..

[10]  A Scalable and Secure Global Tracking Service for Mobile Agents , 2001, Mobile Agents.

[11]  Anand R. Tripathi,et al.  Design issues in mobile agent programming systems , 1998, IEEE Concurr..

[12]  Evaggelia Pitoura,et al.  Locating Objects in Mobile Computing , 2001, IEEE Trans. Knowl. Data Eng..

[13]  Richard J. Enbody,et al.  Dynamic hashing schemes , 1988, CSUR.