Skip to main content

Research Repository

Advanced Search

Lightweight agents, intelligent mobile agent and RPC Schemes: A comparative analysis

Olajubu, Emmanuel A.; Aderounmu, Ganiyu A.; Aderounmu, Adesola; Ajayi, Anuoluwapo


Emmanuel A. Olajubu

Ganiyu A. Aderounmu

Adesola Aderounmu


This paper presents the performance comparison of Lightweight Agents, Single Mobile Intelligent Agents and Remote Procedure Call which are tools for implementing communication in a distributed computing environment. Routing algorithms for each scheme is modeled based on TSP. The performance comparison among the three schemes is based on bandwidth overhead with retransmission, system throughput and system latency. The mathematical model for each performance metric is presented, from which mathematical model is derived for each scheme for comparison. The simulation results show that the LWAs has better performance than the other two schemes in terms of small bandwidth retransmission overhead, high system throughput and low system latency. The Bernoulli random variable is used to model the failure rate of the simulated network which is assumed to have probability of success p = 85% and the probability of failure q = 15%. The network availability is realized by multiplicative pseudorandom number generator during the simulation. The results of simulation are presented.


Aderounmu, G. A., Olajubu, E. A., Aderounmu, A., & Ajayi, A. (2011). Lightweight agents, intelligent mobile agent and RPC Schemes: A comparative analysis. Journal of Computing and Information Technology, 19(2), 93-104.

Journal Article Type Article
Acceptance Date Feb 2, 2010
Publication Date Dec 1, 2011
Journal Journal of Computing and Information Technology
Print ISSN 1330-1136
Peer Reviewed Peer Reviewed
Volume 19
Issue 2
Pages 93-104
Keywords throughput, retransmission overhead, latency, Bernoulli random variable, distributed computing
Public URL
Publisher URL


You might also like

Downloadable Citations