The complexity of using forwarding addresses for decentralized object finding
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Development of the domain name system
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A brief survey of systems providing process or object migration facilities
ACM SIGOPS Operating Systems Review
Programming languages for mobile code
ACM Computing Surveys (CSUR)
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agents
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Hands-On Look at Java Mobile Agents
IEEE Internet Computing
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Agent Tcl: a flexible and secure mobile-agent system
TCLTK'96 Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4
Mobile objects and agents (MOA)
COOTS'98 Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agents
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An adaptative mechanism for communicating with mobile objects
UbiMob '04 Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
Future Generation Computer Systems - Systems performance analysis and evaluation
A decentralized solution for locating mobile agents
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
This paper evaluates and compares the performance of two approaches for locating an agent in a mobile agent environment. The first approach dynamically creates a chain of forwarders to locate a moving agent, whereas the second one relies on a centralized server to perform this task. Based on a Markov chain analysis, we compute the performance of each scheme (time to reach an agent, number of forwarders) and compare them first with simulations and second with experimental results obtained by using ProActive, a Java library. Depending on the system parameters we identify the best scheme and observe that over a LAN the server yields the best performance, whereas the forwarders yield the best performance over a MAN.