基于最小干擾路由的流量工程動態(tài)路由算法研究
Dynamic Routing with Minimum Interference for Traffic Engineering
-
摘要: 分析目前流量工程動態(tài)路由算法研究現(xiàn)狀,以提高網絡吞吐量為目標,提出一種改進的流量工程動態(tài)路由算法,綜合考慮了網絡拓撲和流量分布狀況,提出分級的鏈路關鍵度定義,將流量工程目標有效轉化為路徑約束。仿真結果表明所提算法性能比Kodialam算法及其它幾種典型的動態(tài)路由算法好。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. -
計量
- 文章訪問數: 2314
- HTML全文瀏覽量: 99
- PDF下載量: 1521
- 被引次數: 0
下載:
