首页 | 本学科首页   官方微博 | 高级检索  
     

基于启发信息的QoS路由蚁群算法
引用本文:周如旗,徐宁. 基于启发信息的QoS路由蚁群算法[J]. 现代计算机, 2008, 0(6)
作者姓名:周如旗  徐宁
作者单位:[1]广东教育学院计算机科学系,广州510303 [2]上海应用技术学院计算机与信息工程学院,上海200233
摘    要:提出一种改进的路由蚁群算法,算法采用了动态更新的概率替代传统的路由表,引入干扰系数作为启发信息,从而提高了算法收敛速度.通过验证,算法具有更快的收敛速度和较好的吞吐能力.在网络节点出现故障时,该算法能快速地更新节点上信息,使网络趋于平稳.

关 键 词:蚁群算法  QoS路由选择  干扰系数

An Ant Colony Optimization Algorithm for QoS Based on Heuristic Information
ZHOU Ru-qi,XU Ning. An Ant Colony Optimization Algorithm for QoS Based on Heuristic Information[J]. Modem Computer, 2008, 0(6)
Authors:ZHOU Ru-qi  XU Ning
Affiliation:ZHOU Ru-qi1,XU Ning1,2 (1. Department of Computer Science,Guangdong Institute of Education,Guangzhou 510303,2. Department of Computer Science , Information Engineering,Shanghai Institute of Technology,Shanghai 200233)
Abstract: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.
Keywords:Ant Colony Algorithm  QoS Routing  Interference Coefficient  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号