期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于最小干扰路由的流量工程动态路由算法研究 被引量：4

Dynamic Routing with Minimum Interference for Traffic Engineering
下载PDF
导出
摘要 分析目前流量工程动态路由算法研究现状,以提高网络吞吐量为目标,提出一种改进的流量工程动态路由算法,综合考虑了网络拓扑和流量分布状况,提出分级的链路关键度定义,将流量工程目标有效转化为路径约束。仿真结果表明所提算法性能比Kodialam算法及其它几种典型的动态路由算法好。 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 Kodialam's and the other several typical dynamic routing policies.
作者 刘红 白栋 丁炜
机构地区 北京邮电大学宽带通信网络实验室 北京大学卫星通信实验室
出处 《电子与信息学报》 EI CSCD 北大核心 2005年第1期127-130,共4页 Journal of Electronics & Information Technology
基金 教育部学科点专项科研基金(20020013011)资助项目
关键词 流量工程 多协议标签交换 最小干扰路由 最大网络流 Traffic engineering, MPLS, Minimum interference routing, Maximum network flow
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献7

  • 1Awduche D, Malcolm J, Jagogbua J, et al.. Requirements fort raffic engineering over MPLS[S]. RFC 2702: 1999.
  • 2Ma 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.
  • 3Kodialam M, Lakshman T V. Minimum interference routing with applications to MPLS traffic engineering [A]. IEEE INF OCO M[C], Tel Aviv, Israel, 2000:884 - 893.
  • 4Aukia P, Kodialam M, Kopol P V N, et al.. RATES: a server for MPLS traffic engineerlng[J]. IEEE Net. Mag., 2000, 14(2): 34-41.
  • 5Surl S, Waldvogel M, Warkhede P R. Profile-based routing: a new framework for MPLS traffic enginccring [EB/OL]. http://marcel.wanda.ch/Publications/suri01profilebased.pdf.
  • 6Kar 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.
  • 7Xu 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.

同被引文献25

  • 1郑志梅,崔勇.MPLS流量工程最小干扰选路算法研究[J].软件学报,2006,17(4):814-821. 被引量：12
  • 2[1]AWDUCHE D.Overview and Principles of Internet Traffic Engineering[EB/OL] (2002-03-10)[2006-08-20].http://www.ietf.org/rfc/rfc3272.txt.
  • 3[2]XIAO X,HARMAN A,BAILEY B,et al.Traffic Engineering with MPLS in the Internet[J].IEEE Network magazine,2000,14(2):28-33.
  • 4[3]KODIALAM M,LAKSHMAN T V.Minimum interference routing with applications to MPLS traffic engineering (2000)[EB/OL].(2000-02-14)[2006-08-20].http://citeseer.ist.psu.edu/Rodialam oo minimum.html.
  • 5[4]KAR K,KODIALAM M,LAKSHMAN T V.MPLS traffic engineering using enhanced minimum interference routing:An approach based on lexicographic max-flow[EB/OL].(2002-08-06)[2006-08-20].http://ieeexplore.ieee.org/xpls/abs_all.jsp? arnumber=847943.
  • 6[5]WANG Bin,SU Xu,CHEN PHILIP C L.A new bandwidth guaranteed routing algorithm for MPLS traffic engineering[EB/OL].(2002-02-14)[2006-08-20].http://ieeexplore.ieee.org/ie15/7828/21515/00997005.pdf.
  • 7KODIALAM M,LAKSHMAN TV.Minimum interference routing with applications to MPLS traffic engineering[A].Proceedings of the Conference on Computer Communications(IEEE Infocom)[C].2000.884-893.
  • 8KAR K,KODIALAM M,LAKSHMAN TV.MPLS traffic engineering using enhanced minimum interference routing:an approach based on lexicographic max-flow[A].Proceedings of International Workshop on QoS[C].2000.105-114.
  • 9SURI S,WALDVOGEL M,WARKHEDE PR.Profile-based routing:a new framework for MPLS traffic engineering[R].Washington University Computer Science Technical Report WUCS-00-21,2000.
  • 10XU YX,ZHANG GD.Models and Algorithms of QoS-based Routing with MPLS Traffic Engineering[A].The 5th IEEE HSNMC[C].Jeju Islands,Korea,2002.128-132.

引证文献4

二级引证文献3

电子与信息学报
2005年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部