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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
