一种基于移动Agent的最短路径算法  

A Mobile Agent Based Shortest Path Routing Algorithm

作　　者：胡建理[1] 王嘉祯[1] 杨素敏[1] 徐波[1] 

机构地区：[1]军械工程学院计算机工程系,石家庄050003

出　　处：《计算机工程与应用》2006年第13期116-118,126,共4页Computer Engineering and Applications

基　　金：国家863高技术研究发展计划资助项目(编号:2004AA1Z2450);河北省科技攻关计划资助项目(编号:WM05G13)

摘　　要：路由算法是决定网络整体性能的重要因素,传统的最短路径算法在低流量环境中能满足一般的需求,但在复杂多变的网络环境中,它往往表现出流量波动大,不够稳定的特点,论文提出了一种基于移动Agent的路由算法,起源于仿生学中著名的蚁群算法。我们通过一个数据报网络,在不同的网络条件下将其与传统的OSPF算法作对比实验分析。与OSPF相比,在各种条件下,该算法表现出了良好的性能和健壮性。The routing algorithm is the important factor deciding the overall performances of the network.The traditional shortest path 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.In the paper,we have proposed a mobile agent based routing algorithm derived from the famous ant colony algorithm.The experiments in a datagram network show that the algorithm can offer good performances and robustness under all the experimental conditions with respect to its competitors.

关 键 词：移动AGENT 最短路径 路由算法 OSPF 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]