An Optimal Migration Scheme for Mobile Agents Routing in a Data Communication Network
Keywords:
Mobile agent, Network routing, CPP, MigrationAbstract
Traffic analysis of a network is a critical issue in today’s fast changing network environment. A network-dependent itinerary is often needed for a mobile agent to travel to multiple hosts and/or destinations efficiently. In this paper, an optimal migration scheme for mobile agent routing in a data communication network was aimed. The routing model was presented as a Chinese Postman Problem (CPP). Combinatorial Optimization was applied to provide all possible itineraries and to compute an optimal path for mobile agents. Look-ahead algorithm was used to determine the link or node availability. The results showed that the proposed model minimizes the network latency and the throughput and thereby improves the mobility properties of mobile agents in a data communication network. It was concluded that the proposed migration scheme for mobile agents routing in a network can be adapted by the mobile agent software developers and network administrators for more effective network management.
References
Bui, M., Das K. S., Dutta A.K., and Nguyen D.T., “Randomized Mobile Agent Based Routing In Wireless Networks”. International Journal of Foundations of Computer Science. 12(3): 365-384, 2001.
Chen, T. W., and Gerlaet M., “Global State Routing: A New Routing Scheme for Ad-hoc Wireless Networks” in proceedings of IEEE. ICC. 1: 171-175, 1998.
Lu Shiyong and Xu Cheng-Chong, “A formal framework for agent itinerary specification, security reasoning and logic analysis, Distributed Computing Systems Workshops” 25th IEEE International Conference . 1( 6-10): 580 – 586, 2005.
Makki Shamila and Wunnava Subbarao V., “Application of Mobile Agents in Managing the Traffic in the Network and Improving the Reliability” IAENG ‘06 International Journal of Computer Science. 32(4): 479- 482, 2006.
Manvi Sunilkumar S., and Venkataram Pallapa, “An Agent-Based Best Effort Routing Technique for Load Balancing”. Institute of Mathematics and Informatics (Informatica) Lith. Acad. Sci., 17(3): 407-426, 2006.
Olajubu E.A., Aderounmu G.A., Adagunodo E.R, “Optimizing bandwidth Usage and response time using lightweight agents on data communication network”. Novel algorithms and techniques in telecommunications, Automation and Industrial Electronics, Springer Netherlands. 335-340, 2008.
Olofin, B.O., Adagunodo E.R., Aderounmu G.A. “A Conceptual Migration Scheme for Mobile Agent Routing in a Data Communication Network”. In proceedings of the 1st Faculty of Technology Conference (RETAV 2009), Obafemi Awolowo University, Ile-Ife. 335-340, 2009.
Pei G., Gerla M, Chen T. W., “Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks” in proceedings of International conference ICC. IEEE. 1: 70-74, 2000.
Qu Wenyu and Shen Hong, “Some analysis on mobile-agent based network routing” In proceedings of the 7th international symposium on Parallel Architectures, Algorithms and Networks (ISPAN) IEEE, 2004.
Qu Wenyu, Shen Hong and Jin Yingwei, ” Theoretical analysis on a traffic- based routing algorithm of mobile agents”. Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 520 - 526, 2005.
Seng Wai Loke, Heinz Schmidt and Arkady Zaslavysky, “Algebra for programming the agent itineraries” Asian Computing Science Conference. 1742: 214-226, 1999.
Shivanajay Marwaha, Tham Chen Khong, and Srinivasan Tham Dipti, “Mobile agents based routing protocol for mobile ad hoc networks”, in Proceedings of IEEE, Globecom, 2002
