基于启发信息的QoS路由蚁群算法  

An Ant Colony Optimization Algorithm for QoS Based on Heuristic Information

作　　者：周如旗[1] 徐宁[1] 

机构地区：[1]广东教育学院计算机科学系,广州510303

出　　处：《现代计算机》2008年第6期14-16,27,共4页Modern Computer

基　　金：广东省自然科学基金资助项目(No.06301299)

摘　　要：提出一种改进的路由蚁群算法,算法采用了动态更新的概率替代传统的路由表,引入干扰系数作为启发信息,从而提高了算法收敛速度。通过验证,算法具有更快的收敛速度和较好的吞吐能力。在网络节点出现故障时,该算法能快速地更新节点上信息,使网络趋于平稳。Proposes an ant colony optimization algorithm, adopts a dynamic updating probability would instead of traditional route table record, employs a interference coefficient as heuristic information to achieve high convergence speed. The experimental results show that the optimization algorithm can improve the performance of the known learning algorithms and make them converge faster. When a fault occurs ,the new algorithm can update the information of the net node quickly and stabilize network traffic.

关 键 词：蚁群算法 QOS路由选择 干扰系数 

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