基于最小干扰路由的流量工程动态路由算法研究
Dynamic Routing with Minimum Interference for Traffic Engineering
-
摘要: 分析目前流量工程动态路由算法研究现状,以提高网络吞吐量为目标,提出一种改进的流量工程动态路由算法,综合考虑了网络拓扑和流量分布状况,提出分级的链路关键度定义,将流量工程目标有效转化为路径约束。仿真结果表明所提算法性能比Kodialam算法及其它几种典型的动态路由算法好。Abstract: Research work on dynamic routing for traffic engineering is investigated. And an improved routing algorithm for optimizing network throughput is proposed. It is characterized by taking into account both network topology and traffic distribution condition, and putting forward graded link criticality with traffic engineering objectives translated into path constraints. Simulation results show the given algorithm outperforms Kodialams and the other several typical dynamic routing policies.
-
Awduche D, Malcolm J, Jagogbua J, et al.. Requirements for traffic engineering over MPLS[S]. RFC 2702: 1999.[2]Ma Q, Steenkiste P, Zhang H. On path selection for traffic with bandwidth guarantees[A]. IEEE International Conference on Network Protocols[C], Atlanta, Georgia, 1997:191 - 202.[3]Kodialam M, Lakshman T V. Minimum interferencerouting with applications to MPLS traffic engineering [A]. IEEE INF OCO M [C], Tel Aviv, Israel, 2000:884 - 893.[4]Aukia P, Kodialam M, Kopol P V N, et al.. RATES: a server for MPLS traffic engineering[J]. IEEE Net. Mag., 2000, 14(2): 34 -41.[5]Suri S, Waldvogel M, Warkhede P R. Profile-based routing: a new framework for MPLS traffic engineering [EB/OL]. http:∥marcel.wanda.ch/Publications/suri01 profilebased.pdf.[6]Kar K, Kodialam M, Lakshman T V. MPLS traffic engineering using enhanced minimum interference routing: an approach based on lexicographic max-flow[A]. International Workshop on QoS [C], Pittsburgh, 2000:105 - 114.[7]Xu Y X, Zhang G D. Models and algorithms of QoS-based routing with MPLS traffic engineering[A]. The 5th IEEE HSNMC [C], Jeju Islands, Korea, 2002:128 -132. -
计量
- 文章访问数: 2302
- HTML全文浏览量: 96
- PDF下载量: 1521
- 被引次数: 0
下载:
