东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2009, Vol. 30 ›› Issue (11): 1578-1581.DOI: -

• 论著 • 上一篇    下一篇

新型最小干扰选路算法及仿真研究

杜荔;黄俊;林晓;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2009-11-15 发布日期:2013-06-22
  • 通讯作者: Du, L.
  • 作者简介:-
  • 基金资助:
    国家高技术研究发展计划项目(2003AA781011);;

On the new minimum interference routing algorithm (NMIRA) and its simulation

Du, Li (1); Huang, Jun (1); Lin, Xiao (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-11-15 Published:2013-06-22
  • Contact: Du, L.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

557

摘要： 以离线阶段+在线阶段为框架,提出了一种处理不同类型业务请求的最小干扰选路算法NMIRA.该算法的离线阶段通过对网络进行优化实现带宽预分配,为在线路由部分建立可选路径库;在线阶段利用最短最窄选路方法定位多条关键链路,根据链路上各业务类型的已用与可用带宽比值来计算链路权重,达到最小干扰目的的同时降低了算法的复杂度.通过对不同网络拓扑进行的仿真实验结果表明,该算法实现了在请求拒绝率和总的可用带宽等性能方面上的改进.

关键词: 多协议标记交换, 流量工程, 服务质量, LSP, 链路权重

Abstract: Based on the framework of offline phase in combination with online phase, a new minimum interference routing algorithm (NMIRA) was proposed to deal with different types of service requests. In the offline phase the pre-distributed bandwidth is implemented via optimizing the network to build the selectable path library for online routing phase, while in the online phase the critical links are selected using the shortest/narrowest routing algorithm to compute the link weight in accordance to the ratio of used bandwidths to usable bandwidths in various types of services, thus attaining the target of minimum interference with the algorithm complexity reduced. The simulation results of different network topologies showed that the algorithm proposed significantly improves the reject rate of requests and the total usable bandwidth.

中图分类号: