摘要： 传统的路由算法在低流量环境中能满足一般的需求，但在复杂多变的网络环境中，它往往表现出流量波动大，不够稳定的特点，该文在分析了传统路由算法所存在的缺陷的基础上，提出了一种基于移动Agent的路由算法。通过仿真实验该算法表现出了良好的性能和健壮性。

关键词: 移动Agent, 最短路径, 路由算法, OSPF

Abstract: The traditional routing algorithms can meet general requirements in low traffic environments, but in the complex network environments, the algorithms usually show the features of great fluctuation in traffic, and unstability. Based on analyses of shortcomings of traditional routing algorithms, a mobile agent based routing algorithm is purposed. Simulation experiments show this algorithm is good and robust in functionality and performance.

Key words: Mobile agent, Shortest path, Routing algorithm, OSPF