Name
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 |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/ICPP.2003.1240594 | ICPP |
Keywords | Field | DocType |
message delivery,storage management,mobile agent communication,data compression,garbage collection algorithm,mailbox-based scheme,location registration,message passing,mobile agents,path compression,mobile agent,garbage collection,memory management,life cycle | Mobile computing,Algorithm design,Computer science,Mobile agent,Computer network,Memory management,Garbage collection,Data compression,Mobile telephony,Message passing,Distributed computing | Conference |
ISSN | ISBN | Citations |
0190-3918 | 0-7695-2017-0 | 2 |
PageRank | References | Authors |
0.41 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiannong Cao | 1 | 5226 | 425.12 |
| Liang Zhang | 2 | 28 | 4.64 |
| Xinyu Feng | 3 | 443 | 30.52 |
| Sajal K. Das | 4 | 8086 | 745.54 |