摘要
对具有NP完全难度的网络状态动态变化下的路由问题,提出了一种基于蚁群网络(A n tnet)的蚁群优化分布式Q oS路由算法.算法的主要特点是:(1)采用了动态更新的概率表替代传统的路由表;(2)采用了智能的初始化方法;(3)采用了一种新颖的信息素更新机制;(4)采用一种新的节点选择机制;(5)引入蚂蚁相遇机制.与标准的A n tN et相比,该算法具有更快的收敛速度和较好的吞吐能力.另外,算法同时考虑了满足Q oS度量和负载平衡等问题.
An ant colony optimization distributed algorithm, a variant of AntNet, is proposed for solving the QoS routing with the dynamic changing of the network state. The algorithm has the following features : A) A dynamic updating probability table is used as the routing table; B) intelligent initialization of the AntNet; C) A novel pheromone updates; D) A nodes selection strategy; E) Ant encounter scheme. Compare with the standard AntNet algorithm, this algorithm is better than the standard AntNet algorithm in terms of faster convergence and higher throughput. And besides, this algorithm takes into consideration both the QoS metrics and the load-balancing problem.
出处
《小型微型计算机系统》
CSCD
北大核心
2006年第7期1169-1174,共6页
Journal of Chinese Computer Systems
关键词
蚁群优化算法
服务质量
路由算法
蚁群网络
ant colony optimization algorithm
quality of service
routing algorithm
antnet