基于改进蚁群算法的网络路由重组  

Network Route Reconfiguration Based on Improved Ant Algorithm

作　　者：成旭华[1] 赵知劲[1] 叶学义[1] 

机构地区：[1]杭州电子科技大学通信工程学院,杭州310018

出　　处：《计算机工程》2009年第13期90-92,共3页Computer Engineering

基　　金：电科院预研基金资助项目(513060401);浙江省科技计划基金资助重点项目(2008C21092)

摘　　要：针对不同的网络实际条件,提出一种改进的蚁群算法寻找网络中任意2个节点间的最优路由。在同时考虑路由中节点间链路上的耗费和延时的情况下,通过增强公式对影响因子的敏感程度加快收敛速度。仿真结果表明,即使在所构建的网络拓扑结构发生改变时,该方法也能够有效并较快地找到最优路由,实现网络的重组和路由。Aiming at different actual network environments, this paper discusses a new routing approach based on ant algorithm to obtain the optimum path between two nodes in network. Considering consumption and delay of link between route nodes, the speed of convergence is raised by increasing formulas＇ sensibility to impact factors. Simulation results shows that, especially having considered two factors of cost and delay, the proposed approach can be used to search the routing efficiently by the available nodes and paths provided with the reconstructed network topology even if the network changed.

关 键 词：路由 重组 蚁群算法 

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