Path compression in forwarding-based reliable mobile agent communications

Jiannong Cao, Liang Zhang, Xinyu Feng, S. K. Das

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)


We concern with the design of efficient algorithms for mobile agent communications. We first describe a novel mailbox-based scheme for flexible and adaptive message delivery in mobile agent systems and a specific adaptive protocol derived from the scheme. Then we present the design and verification of a path compression and garbage collection algorithm for improving the performance of the proposed protocol. Simulation results showed that by properly setting some parameters, the algorithm can effectively reduce both the number of location registrations and the communication overhead of 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 of mobile agents cached by hosts in the network.
Original languageEnglish
Title of host publicationProceedings - 2003 International Conference on Parallel Processing, ICPP 2003
Number of pages8
ISBN (Electronic)0769520170
Publication statusPublished - 1 Jan 2003
Event2003 International Conference on Parallel Processing, ICPP 2003 - Kaohsiung, Taiwan
Duration: 6 Oct 20039 Oct 2003


Conference2003 International Conference on Parallel Processing, ICPP 2003


  • Algorithm design and analysis
  • Communication system security
  • Computer science
  • Costs
  • Information retrieval
  • Information security
  • Mobile agents
  • Mobile communication
  • Mobile computing
  • Protocols

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this