基于流量工程的最小干扰路由算法的改进

Modified minimum interference routing algorithm based on traffic engineering

在研究多种流量工程动态路由算法的基础上,深入剖析了最小干扰路由算法并指出了该算法的不足,提出了一种改进的最小干扰路由算法。改进算法的基本思想是在考虑不包括当前节点对和其他入口出口节点对的关键链路和准关键链路的同时,综合考虑了当前节点对的Δ-关键链路,使网络中相应链路的重要程度以链路权值的方式表现出来。仿真结果表明,改进算法在满足标记交换路径(LSP)请求的同时,提高了整个网络总的最大流,增加了LSP请求接入的个数,进一步降低了LSP请求的拒绝率。

Based on the research of many traffic engineering dynamic routing algorithm, the limitations of the minimum interference routing algorithm are reviewed, and a modified algorithm is presented. This modified algorithm takes the critical links and near-critical links for those ingress-egress pairs into account except the current pair which routing an label switched path （LSP） request, and it also considers A critical links for this current pair itself. Then the approach is to determine appropriate weights for these links in the network. Simulation results show that the improved algorithm contents the requests of LSP, and it increases the total available bandwidth and total number of LSP set-up requests that access to the network to reduce the rejection rate.