Lightweight Agents, Intelligent Mobile Agent and RPC Schemes: A Comparative Analysis

Olajubu, Emmanuel A.; Aderounmu, Ganiyu A.; Ajayi, Anuoluwapo O.
June 2011
Journal of Computing & Information Technology;Jun2011, Vol. 19 Issue 2, p93
Academic Journal
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.


Related Articles

  • Survey on Routing Protocol in Wireless Sensor Network. Devika, R.; Santhi, B.; Sivasubramanian, T. // International Journal of Engineering Science & Technology;Feb2013, Vol. 5 Issue 2, p350 

    The Wireless Sensor Network (WSN) is a wireless network consisting of ten to thousand small nodes with sensing, computing and wireless communication capabilities. WSN are generally used to monitor activities and report events, such as fire, overheating etc. in a specific area or environment. It...

  • Impairment Aware RWA in Optical Networks: Over-provisioning or Cross Optimization?  // Journal of Networks;Nov2010, Vol. 5 Issue 11, p1271 

    No abstract available.

  • Reliable Routing and Wavelength Assignment Algorithm for Optical WDM Networks. Ramesh, G.; Sundaravadivelu, S. // European Journal of Scientific Research;Dec2010, Vol. 48 Issue 1, p85 

    In optical WDM networks, transmission of information along optical lines is advantageous since it has high transmission capacity, scalability, feasibility and also high reliability. But since large amount of information is being carried, any problem during transmission can lead to severe damage...

  • A CLUSTER ALLOCATION AND ROUTING ALGORITHM BASED ON NODE DENSITY FOR EXTENDING THE LIFETIME OF WIRELESS SENSOR NETWORKS. Wernhuar Tarng; Hao-Wei Lin; Kuo-Liang Ou // International Journal of Computer Science & Information Technolo;Feb2012, Vol. 4 Issue 1, p51 

    The electricity of sensor nodes in wireless sensor networks is very limited, so it is an important research topic to deploy the sensor nodes and cooperate with an efficient routing algorithm for extending the network lifetime. In the related research, LEACH routing algorithm randomly selects...

  • An Energy Equilibrium Routing Algorithm Based on Cluster-head Prediction for Wireless Sensor Networks. Lejiang Guo; Bingwen Wang; Zhuo Liu; Wei Wang // Information Technology Journal;2010, Vol. 9 Issue 7, p1403 

    No abstract available.

  • CONGESTION CONTROL OF TCP-WESTWOOD USING AQM-PI CONTROLLER. Abolmasoumi, Amirhossein; Delshad, Saleh Sayyad; Beheshti, Mohammadtaghi Hamidi // International Journal of Computer Networks & Communications;Mar2011, Vol. 3 Issue 2, p180 

    This paper concerns TCP Westwood (TCPW), a recently developed modification of TCP, in combination with random early detection (RED), PI and self-tuning PI queue management. Using the fluid-flow model of TCPW and separating the model dynamics through block diagram simplification, it is arrived at...

  • Route Reutilization Routing in Mobile Ad Hoc Networks. Park, Seungjin; Seong-Moo Yoo; Fan Qiu // KSII Transactions on Internet & Information Systems;Apr2010, Vol. 4 Issue 2, p78 

    Route discovery in wireless mobile networks requires a considerable amount of resources due to the mobility of the hosts. Therefore, it would be wise to utilize the effort already invested in existing paths. This paper proposes an efficient way to reuse, whenever possible, existing paths when a...

  • Enhanced Triple Umpiring System for Security and Performance Improvement in Wireless MANETS. Kathirvel, Ayyaswamy; Srinivasan, Rengaramanujam // International Journal of Communication Networks & Information Se;Jun2010, Vol. 2 Issue 2, p77 

    A mobile ad hoc network is a self-created, self-organized and self-administering set of nodes connected via wireless links without the aid of any fixed infrastructure or administrator. Protecting the network layer from malicious attacks is an important and challenging issue in both wired and...

  • A NOVEL SOLUTION TO THE DYNAMIC ROUTING AND WAVELENGTH ASSIGNMENT PROBLEM IN TRANSPARENT OPTICAL NETWORKS. Bhanja, Urmila; Mahapatra, Sudipta; Roy, Rajarshi // International Journal of Computer Science & Information Technolo;Mar2010, Vol. 2 Issue 2, p119 

    We present an evolutionary programming algorithm for solving the dynamic routing and wavelength assignment (DRWA) problem in optical wavelength-division multiplexing (WDM) networks under wavelength continuity constraint. We assume an ideal physical channel and therefore neglect the blocking of...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics