基于流量特征的动态最小干扰流量工程选路算法  

Dynamic Minimum Interference Routing Algorithm Based on Profile in Traffic Engineering

作　　者：杜荔[1] 郭康[1] 于军相[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2009年第12期1723-1726,1750,共5页Journal of Northeastern University(Natural Science)

基　　金：国家高技术研究发展计划项目(2003AA781011);辽宁省科学技术基金资助项目(20072022)

摘　　要：提出一种新的MPLS流量工程选路算法——P-DMIR算法.该算法分为离线和在线两个阶段.离线阶段确定每条链路的关键度,将网络流量特征信息引入链路关键度的计算,在时间复杂度不增加的前提下使离线阶段对信息的处理更加具体、丰富.在线动态路由选路部分,首先根据到达业务的类型计算链路代价函数系数,然后根据链路上可用带宽倒数与链路关键度来计算链路权重,在实现最小干扰目的的同时降低在线阶段算法的时间复杂度.采用链路关键度定期修正机制,以确保流量特征信息即时准确地反映在关键度的计算上.仿真结果表明,P-DMIR算法能够将流量合理分担到不同路径上,有效地避免了网络拥塞,并在拒绝率和网络吞吐量方面的性能优于传统算法.A new minimum interference routing algorithm P-DMIR （profile-dynamic minimum interference routing） was proposed, which is divided into offline and online stages. In the offline stage the critical values of all links are determined with both the topology information and traffic profile introduced to make the algorithm available to process more information concretely without increased complexity. In the online stage the cost function coefficient of every link is calculated according to the types of the services on arrival, then the weights of links are calculated according to the reciprocal of available bandwidth and the critical value of every link so as to minimize the interference with the algorithm complexity reduced. Furthermore, the updating mechanism is provided regularly via the critical values of links, thus making the traffic profile instant and accurate. The simulation results showed that P-DMIR can allocate the different traffic flows to different paths rationally and avoid the network congestion effectively, and that it is superior to conventional algorithms in respect to the reject rate of requests and throughput of network.

关 键 词：流量工程 多协议标记交换 基于约束的路由 最小干扰 流量特征 

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