An Ant Algorithm Based Dynamic Routing Strategy for Mobile Agents
- 490 Downloads
Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing strategies, which don’t consider dynamic network status and host status. This is a hinder to the performance and autonomy of mobile agents. Ant Algorithm is good at solving such kind of problems. After analyzing existing routing strategies of typical mobile agent systems, this paper summarizes factors that may affect routing strategy of mobile agents, proposes an Ant Algorithm based dynamic routing strategy by using both experience and network environment such as resource information, network traffic, host workload, presents an acquiring and storing method of routing parameters and decision rules according to the major characteristics of mobile agent migration. The simulation experiment is implemented and the results show our dynamic routing strategy can effectively improve the performance and autonomy of mobile agents.
KeywordsResource Information Mobile Agent Travel Salesman Problem Host Status Load Information
Unable to display preview. Download preview PDF.
- 2.M. Strasser, K. Rothermel. Reliability Concepts for Mobile Agents. Int. Journal of Cooperative Information Systems. 1998. pp. 355–82Google Scholar
- 3.D, Marco., D.C. Gianni,. Mobile Agents for Adaptive Routing. In Proc. of 31st Hawaii International Conference on Systems Sciences, Jan. 1998.Google Scholar
- 4.D B. Lange Java Aglet Application Programming Interface. IBM Tokyo Research Lab. http://www.trl.ibm.co.jp/ Aglets. 1997.
- 5.Wong, N. Paciorek, T. Walsh, et al. Concordia: an infrastructure for collaborating mobile agents. In Proc. of the 1st Int. Workshop on Mobile Agents(MA’97), Apr. 1997.Google Scholar
- 6.K. Moizumi, G. Cybenko. The Travelling Agent Problem. Mathematics of Control, Signals and Systems, Jan. 1998.Google Scholar
- 7.J. Baek, J. Yeo, G. Kim et al, Cost Effective Mobile Agent Planning for Distributed Information Retrieval. In Proc. of Distributed Computing Systems, Apr. 2001.Google Scholar
- 8.T. Chia, S. Kannapan. Strategically Mobile Agents. In First International Workshop on Mobile Agents MA97, Springer Verlag, 1997.Google Scholar
- 9.M. Ashraf, J. Baumann, M. Strasser. Efficient Algorithms to Find Optimal Agent Migration Strategies. Technical Report of Fakultaet Informatik, University of Stuttgart, May 1998.Google Scholar
- 11.Colorni, M. Dorigo, V. Maniezzo. Distributed Optimization by Ant Colonies. In Proc. of ECAL91 — European Conference on Artificial Life, Paris, France, ELSEVIER Publishing, pp. 134–142.Google Scholar
- 12.C. Alberto, M. Dorigo, V. Maniezzo. An Investigation of Some Properties of an Ant Algorithm. In Proc. of the Parallel Problem Solving from Nature Conference (PPSN92), Brussels, Belgium, 1992. pp. 509–520.Google Scholar
- 13.Dorigo, V. Maniezzo, A. Colorni, The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, 1996.26, pp. 29–41.Google Scholar