Abstract
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 language | English |
---|---|
Title of host publication | Proceedings - 2003 International Conference on Parallel Processing, ICPP 2003 |
Publisher | IEEE |
Pages | 313-320 |
Number of pages | 8 |
Volume | 2003-January |
ISBN (Electronic) | 0769520170 |
DOIs | |
Publication status | Published - 1 Jan 2003 |
Event | 2003 International Conference on Parallel Processing, ICPP 2003 - Kaohsiung, Taiwan Duration: 6 Oct 2003 → 9 Oct 2003 |
Conference
Conference | 2003 International Conference on Parallel Processing, ICPP 2003 |
---|---|
Country | Taiwan |
City | Kaohsiung |
Period | 6/10/03 → 9/10/03 |
Keywords
- 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