CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

Development of a Bi-directed Routing Model for Mobile Agents in Distributed Systems

by Oladejo Oluseyi O., Akinyemi Bodunde O., Amoo Adekemi O.
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 9 - Number 8
Year of Publication: 2015
Authors: Oladejo Oluseyi O., Akinyemi Bodunde O., Amoo Adekemi O.
10.5120/ijais2015451449

Oladejo Oluseyi O., Akinyemi Bodunde O., Amoo Adekemi O. . Development of a Bi-directed Routing Model for Mobile Agents in Distributed Systems. International Journal of Applied Information Systems. 9, 8 ( October 2015), 29-37. DOI=10.5120/ijais2015451449

@article{ 10.5120/ijais2015451449,
author = { Oladejo Oluseyi O., Akinyemi Bodunde O., Amoo Adekemi O. },
title = { Development of a Bi-directed Routing Model for Mobile Agents in Distributed Systems },
journal = { International Journal of Applied Information Systems },
issue_date = { October 2015 },
volume = { 9 },
number = { 8 },
month = { October },
year = { 2015 },
issn = { 2249-0868 },
pages = { 29-37 },
numpages = {9},
url = { https://www.ijais.org/archives/volume9/number8/827-2015451449/ },
doi = { 10.5120/ijais2015451449 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T19:00:41.838760+05:30
%A Oladejo Oluseyi O.
%A Akinyemi Bodunde O.
%A Amoo Adekemi O.
%T Development of a Bi-directed Routing Model for Mobile Agents in Distributed Systems
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 9
%N 8
%P 29-37
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Routing in a distributed system is a critical issue due to its complexity. Existing routing model (undirected) for mobile agent lacks provable efficient algorithm which consumes response time and bandwidth. This study planned, simulated and accessed a best migration scheme for mobile agents dynamic routing in a distributed computing environment. This was with a perspective to eradicating issues such as congestion, time consumption and packet loss connected with mobile agent framework method of handling distributed systems. The routing model was exhibited as a Bi-directed Chinese Postman Problem (BCPP). Linear Optimization was used to provide all conceivable itineraries and to calculate the optimal path for mobile agents. Backtracking algorithm was engaged to decide the availability of the link or node. Simulation of the model was carried out for a single mobile agent migration. MATLAB Simulink tools were used to simulate the formulated model. The proposed routing model performance was benchmarked with the existing Chinese Postman Problem (CPP) routing scheme using Network bandwidth, Response Time and the Network throughput as performance parameters. The simulation result showed that the proposed model optimizes network bandwidth, minimizes the network latency and throughput, thereby improved the mobility properties of mobile agents in distributed systems. It was concluded that the proposed migration scheme for mobile agents routing in a network reduced congestion, minimized time and expense of resources as compared to CPP.

References
  1. Korba, L., Song, R. and Yee, G. 2002. Anonymous Communication for Mobile Agents. Mobile Agents for Telecommunication Applications, Springer Berlin/ Heidelberg, 2521:171-181.
  2. Andrews G. R. 2000. Foundations of Multithreaded, Parallel, and Distributed Programming. Addison–Wesley, ISBN 0-201-35752-6. 430 -500
  3. Tanenbaum, A.S. 2002. Computer networks. 4th edition, Pearson Education Inc; Prentice Hall PTR Upper Saddle River, New Jersey 07458, 350-380.
  4. Ghosh, S. 2007. Distributed Systems – An Algorithmic Approach. Chapman & Hall/CRC, ISBN 978-1-58488-564-1. 96-130
  5. Peleg, D. 2000. Distributed Computing: A Locality-Sensitive Approach, SIAM, ISBN 0-89871-464-8. 200-300.
  6. González-Valenzuela, S., and Leung, V. 2002. QoS Routing for MPLS Networks Employing Mobile Agents. IEEE Network, 16(3):16-21.
  7. Qu, W., Shen, H., Sum, J. (2005). New Analysis on Mobile Agents Based Network Routing. Applied Soft Computing. 6(1):108-118.
  8. Bandyopadhyay, S., and Krishna P. 1999. Evaluating the performance of mobile agent-based message communication among mobile hosts in large adhoc wireless network. In Proceedings of the Second ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems. 69-73.
  9. Baschieri F., Paolo B., and Antonio C. 2002. Mobile agents for QoS tailoring, control and adaptation over the Internet: The ubiQoS video on demand service. IEEE 2002 Symposium on Applications and the Internet: 109-118.
  10. Strasser, M and Schwehm, M. 2000. A Performance Model for Mobile Agent Systems. In Proceedings of the Autonomous Agents. Vol. 97, 1132-1140
  11. Marwaha, S., Tham, C.K. and Srinivasan, D. 2002. Mobile Agents Based Routing Protocol for Mobile Ad Hoc Networks, In Proceedings of IEEE, Globecom 2002.
  12. Manvi, S.S. and Venkataram, P. 2006. An Agent-Based Best Effort Routing Technique for Load Balancing. Institute of Mathematics and Informatics (Informatica) Lith. Academic Science, 17(3):407-426.
  13. Olofin, B.O, Adagunodo E.R, Aderounmu G.A. 2010. An Optimal Migration Scheme for Mobile Agents Routing in a Data Communication Network. Ife Journal of Technology, Vol. 19(2), 27-32.
Index Terms

Computer Science
Information Sciences

Keywords

Chinese Postman Problem Bi-directed Chinese Postman Problem

Powered by PhDFocusTM