计算机应用 ›› 2011, Vol. 31 ›› Issue (04): 928-930.DOI: 10.3724/SP.J.1087.2011.00928

• 网络与通信 • 上一篇    下一篇

用于MPLS流量工程的最小延时和最小干扰路由算法

付晓,李兴明   

  1. 电子科技大学 通信与信息工程学院,成都 611731
  • 收稿日期:2010-10-09 修回日期:2010-12-01 发布日期:2011-04-08 出版日期:2011-04-01
  • 通讯作者: 付晓
  • 作者简介:付晓(1986-),男,重庆涪陵人,硕士研究生,主要研究方向:宽带网络;
    李兴明(1956-),男,云南昆明人,教授,博士,主要研究方向:光纤通信、光交换与自动光网络。

Minimum delay and minimum interference routing algorithm for multi-protocol label switch traffic engineering

Xiao FU,Xing-ming LI   

  1. School of Communication and Information Engineering, University of Electronic Science and Tecchnology of China, Chengdu Sichuan 611731, China
  • Received:2010-10-09 Revised:2010-12-01 Online:2011-04-08 Published:2011-04-01
  • Contact: Xiao FU

摘要: 借鉴最小干扰路由算法(MIRA)的思想,提出一种最小延时和最小干扰路由算法MDMI,以实现用于多协议标签交换(MPLS)流量工程的服务质量(QoS)路由方案。该算法首先选择k条最小时延备选路由,然后通过网络流计算避开关键链路选路。该算法在实现负载均衡、提高网络资源利用效率的同时提供了一种延时控制方式。仿真结果表明,该算法以k倍时间复杂度提升为代价,在满足标签转发路径(LSP)请求和资源利用率方面能达到较好的性能。

关键词: 多协议标签交换, 流量工程, 服务质量, 路由, 网络流

Abstract: Based on the idea of Minimum Interference Routing Algorithm (MIRA), a Minimum Delay Minimum Interference (MDMI) routing algorithm was proposed to implement QoS-based routing scheme for Multi-Protocol Label Switch (MPLS) traffic engineering. The algorithm firstly calculated k minimum-delay candidate routes, selected optimal route and avoided critical resource through computing network flow. The algorithm can balance overall load, improve resource utilization efficiency and offer a delay-constrained routing mechanism at the same time. The simulation results show that the new algorithm works better at decreasing Label Switched Path (LSP) rejection rate and increase network throughput, however at the cost of k times multiplication of time complexity.

Key words: Multi-Protocol Label Switch (MPLS), traffic engineering, Quality of Service (QoS), routing, network flow

中图分类号: