MPLS网络中基于关键度的蚂蚁路由算法  

An Ant Routing Algorithm Based Criticality in MPLS Networks

作　　者：王鹏[1] 杨新宇[1] 曾明[1] 郑守淇[1] 

机构地区：[1]西安交通大学计算机科学与技术系,陕西西安710049

出　　处：《微电子学与计算机》2004年第3期61-64,105,共5页Microelectronics & Computer

基　　金：国家863资助项目(2001AA112111)

摘　　要：文章将MPLS网络中传统的路由集中计算与具有分布式特点的蚂蚁路由计算结合起来,并引入了关键链路的概念和提出了关键度的计算方法,定义了状态转移规则、信息素浓度局部刷新规则和信息素浓度全局刷新规则,在此基础上提出了MPLS网络中基于关键度的蚂蚁路由算法,并进行了NS2仿真。仿真结果表明:本算法具有较高的路由成功率(接受率),在网络处于拥塞的情况下,路由的成功率以及网络资源的利用率方面相对于普通的SWP算法优势更为明显。We combine the traditional router central computer and the distributing ant router computer, import the concept of critical link and propose the method of Criticality. We also define the rule of state shift, the rule of pheromone density local refreshment and the rule of pheromone density global refreshment. Based on these, we propose the ant routing algorithm based criticality in MPLS networks, and process the NS2 experimentation. The result is that this algorithm has better degree of router acceptation. And under congestion of network, success of router and utility of network resource are much better than SWP algorithm.

关 键 词：MPLS网络 蚂蚁路由算法 网络资源 网络带宽 计算机网络 

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