Emmanuel A. Olajubu
Lightweight agents, intelligent mobile agent and RPC Schemes: A comparative analysis
Olajubu, Emmanuel A.; Aderounmu, Ganiyu A.; Aderounmu, Adesola; Ajayi, Anuoluwapo
Authors
Ganiyu A. Aderounmu
Adesola Aderounmu
Anuoluwapo Ajayi Anuoluwapo.Ajayi@uwe.ac.uk
Associate Professor - Big Data Application
Abstract
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.
Citation
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. https://doi.org/10.2498/cit.1001375
Journal Article Type | Article |
---|---|
Acceptance Date | Feb 2, 2010 |
Publication Date | Dec 1, 2011 |
Deposit Date | Apr 23, 2018 |
Publicly Available Date | Apr 23, 2018 |
Journal | Journal of Computing and Information Technology |
Print ISSN | 1330-1136 |
Peer Reviewed | Peer Reviewed |
Volume | 19 |
Issue | 2 |
Pages | 93-104 |
DOI | https://doi.org/10.2498/cit.1001375 |
Keywords | throughput, retransmission overhead, latency, Bernoulli random variable, distributed computing |
Public URL | https://uwe-repository.worktribe.com/output/960276 |
Publisher URL | http://dx.doi.org/10.2498/cit.1001375 |
Files
OJS_file.pdf
(433 Kb)
PDF
You might also like
Deep learning-based multi-target regression for traffic-related air pollution forecasting
(2023)
Journal Article
SegCrop: Segmentation-based dynamic cropping of endoscopic videos to address label leakage in surgical tool detection
(2023)
Presentation / Conference
A deep learning approach to concrete water-cement ratio prediction
(2022)
Journal Article
Deep learning and boosted trees for injuries prediction in power infrastructure projects
(2021)
Journal Article
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search