基于信道阻力的MPLS网络最小干扰选路算法

Minimum Interference Routing Algorithm for MPLS Network Based on Channel Resistance

目前的多协议标签交换(MPLS)网络中的标签交换路径(LSP)选路算法,存在所选路径相互干扰、网络资源利用率低等问题.文中针对这些问题,提出了一种基于信道阻力的LSP选路最小干扰算法.新算法中定义了信道阻力的概念,通过对通信网中不同源和目的节点对间的链路阻力求解,来获得各条边的阻力分布,并以干扰后的链路阻力为权值采用Dijkstra算法求得节点对之间具有最小干扰的路径.仿真结果表明,新算法有更好的抗干扰性能和均衡利用网络资源的能力.

The current routing algorithms of label switching path （LSP） used in multi-protocol label switching （MPLS） networks may result in the interference between different selected LSPs and in a low utilization rate of network resources. In order to solve these problems, a novel minimum interference routing algorithm based on the channel resistance is presented. In this algorithm, the channel resistance is defined and calculated for each link be- tween different source-destination pairs, thus obtaining the resistance distribution on each edge. Moreover, the link resistance is considered as the weight to find the minimum interference path via the Dijkstra algorithm. Simulated results show that the proposed algorithm has better anti-interference and network resource balancing performances.