Journal of South China University of Technology (Natural Science Edition) ›› 2008, Vol. 36 ›› Issue (4): 63-68.

• Computer Science & Technology • Previous Articles     Next Articles

Minimum Interference Routing Algorithm for MPLS Network Based on Channel Resistance

Liu Yong-guang  Ye Wu  Feng Sui-li   

  1. School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510640, Guangdong, China
  • Received:2007-04-26 Revised:2007-06-13 Online:2008-04-25 Published:2008-04-25
  • Contact: 刘永广（1972-），男，广东轻工职业技术学院高级工程师，博士生，主要从事QoS路由和流量控制研究． E-mail:liu．yongguang@gmail．com
  • About author:刘永广（1972-），男，广东轻工职业技术学院高级工程师，博士生，主要从事QoS路由和流量控制研究．
  • Supported by:

    广东省自然科学基金资助项目（31391）

PDF

716

Abstract:

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.

Key words: multi-protocol label switching, label switching path, routing algorithm, minimum interference, channel resistance, routing