Path pruning in mailbox-based mobile agent communications

Jiannong Cao, Lianq Zhang, Xinyu Feng, Sajal K. Das

Research output: Journal article publicationJournal articleAcademic researchpeer-review

10 Citations (Scopus)


This paper is concerned with the design of efficient algorithms for mobile agent communications. We first describe a novel mailbox-based framework for flexible and adaptive message delivery in mobile agent systems and a specific adaptive protocol derived from the framework. Then we present the design and verification of a path pruning and garbage collection algorithm for improving the performance of the proposed protocol. Simulation results show that by properly setting some parameters, the algorithm can effectively reduce both the number of location registrations and the communication overhead for each registration. Consequently, the total location registration overhead during the life cycle of a mobile agent is greatly reduced. The algorithm can also be used for clearing useless addresses cached by hosts in the network.
Original languageEnglish
Pages (from-to)405-424
Number of pages20
JournalJournal of Information Science and Engineering
Issue number3
Publication statusPublished - 1 May 2004


  • Communication protocol
  • Garbage collection
  • Mailbox
  • Mobile agent
  • Path pruning

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics


Dive into the research topics of 'Path pruning in mailbox-based mobile agent communications'. Together they form a unique fingerprint.

Cite this