期刊文献+

MPLS网络流量工程中的动态在线路由算法 被引量:2

Dynamic Online Routing Algorithm for Traffic Engineering in MPLS Network
下载PDF
导出
摘要 提出了一种用于MPLS网络流量工程中的动态在线路由算法NORA.该算法在网络拓扑结构基础上定义了链路关键度,根据链路的带宽利用率定义了链路繁忙度,利用链路关键度、链路当前可用带宽及链路繁忙度确定链路权重,并依据该权重运用最短路径优先算法思想为到达的LSP建立请求选择权重优化路径.该算法在动态建立有带宽保证路径的同时可以均衡网络负载,并降低LSP建立请求服务拒绝率.仿真实验表明,与SPF及MIRA算法相比,该算法在降低LSP建立请求服务拒绝率以及均衡网络负载等方面表现出更好的性能. Proposes a new online routing algorithm (NORA) for traffic engineering in MPLS network, where the link importance value (LIV) and link busy-degree (BD) are defined on the basis of topology of network and link' s bandwidth utilization rate, respectively. When an LSP (label switching path) setting-up request arrives, the algorithm will compute the link-weight for each and every link in accordance to its LIV, current available bandwidth and BD, then choose the optimal path of link-weight for the incoming request using the idea of SPF (shortest path first) algorithm for the computed link-weight. This algorithm can set up LSPs with guaranteed bandwidth dynamically to balance the network load and decrease the refusing rate for LSPs request. Compared with SPF and MIRA (minimum interference routing algorithm) via simulation, the algorithm shows better performance in either decreasing refusing rate or balancing network load.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2006年第9期976-978,共3页 Journal of Northeastern University(Natural Science)
基金 国家高技术研究发展计划项目(2002AA784030)
关键词 约束路由 流量工程 标记交换路径 链路关键度 链路繁忙度 constraint-based routing traffic engineering label switching path link importance value link busy degree
  • 相关文献

参考文献10

  • 1Juniper Networks.Traffic engineering for the new public network[EB/OL].Http:∥www.juniper.net,1999-12-28.
  • 2Xiao X,Hanna A,Bailey B,et al.Traffic engineering with MPLS in the Internet[J].IEEE Network Magazine,2000,14(2):28-33.
  • 3Awduche D O.MPLS and traffic engineering in IP networks[J].IEEE Communication Magazine,1999,37(12):42-47.
  • 4Guerin R A,Orda A,Williams D.QoS routing mechanisms and OSPF extensions[A].Proceedings of IEEE Global Communications Conference[C].New York,1997.1903-1908.
  • 5Ma Q,Steenkiste P.On path selection for traffic with bandwidth guarantees[A].Proceedings of International Conference on Network Protocols[C].Los Alamitos,1997.191-202.
  • 6Kamei S,Kimura T.Evaluation of routing algorithms and network topologies for MPLS traffic engineering[A].Proceedings of IEEE Global Communications Conference[C].Piscataway,2001.25-29.
  • 7Kodialam M,Lakshman T V.Minimum interference routing with applications to MPLS traffic engineering[A].Proceedings of IEEE Computer and Communications Societies[C].Piscataway,2000.884-893.
  • 8Kar K,Kodialam M,Lakshman T V.Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications[J].IEEE Journal on Selected Areas in Communications,2000,18(12):2566-2579.
  • 9杜荔,杨琳,李军.流量工程中一种权重配置动态路由选择算法[J].东北大学学报(自然科学版),2005,26(8):736-738. 被引量:1
  • 10Boutaba R,Szeto W,Iraqi Y.DORA efficient routing for MPLS traffic engineering[J].Journal of Network and Systems Management,Special Issue on Internet Traffic Engineering and Management,2002,10(3):309-325.

二级参考文献7

  • 1Awduche D O. MPLS and traffic engineering in IP networks[J]. IEEE Communications Magazine, 1999,12(37):42-47.
  • 2Hoebeke R, Aissaoui M, Nquyen T. MPLS: Adding value to networking[J]. Alcatel Telecommunications Review, 2003,(3):177-182.
  • 3Swallow G. Traffic engineering & MPLS,IW-MPLS 98[EB/OL]. http:∥info.uu.net/ads/techconf, 1998-11.
  • 4Boutaba R, Szeto W, Iraqi Y. DORA, efficient routing for MPLS traffic engineering[J]. Journal of Network and Systems Management, 2002,10(S3):309-325.
  • 5Dinan E, Oinan E, Awduche O, et al. Analytical framework for dynamic traffic partitioning in MPLS networks[A]. 2000 IEEE International Conference on Communications[C]. Piscataway: IEEE, 2000.1604-1608.
  • 6杜荔,陈忠根,王光兴.MPLS应用于ATM环境中的两个关键技术[J].东北大学学报(自然科学版),2001,22(1):17-20. 被引量:2
  • 7张中山,隆克平,程时端.MPLS业务量工程中负载均衡算法的研究[J].北京邮电大学学报,2001,24(3):46-50. 被引量:11

同被引文献18

  • 1郑志梅,崔勇.MPLS流量工程最小干扰选路算法研究[J].软件学报,2006,17(4):814-821. 被引量:12
  • 2唐治果,李乐民,虞红芳.针对MPLS网络流量工程的链路关键性路由算法[J].电子与信息学报,2007,29(5):1187-1190. 被引量:13
  • 3郑志梅,崔勇.MPLS流量工程最小冲突路径算法[J].计算机学报,2007,30(6):934-944. 被引量:11
  • 4Xiao X P, Hannan A, Bailey B, et al. Traffic engineering with MPLS in the Internet [J]. IEEE Network, 2001, 14 (2):28- 33.
  • 5Rosen E, Viswanathan A, Callon R. RFC3031. Muhiprotocol label switching architecture[S]. Fremont: IETF, 2001.
  • 6Awduche D, Malcolm J, Agogbua J, et al. RFC2702 Requirements for traffic engineering over MPLS [ S ]. Fremont: IETF, 1999.
  • 7Kodialam M, Lakshman T V. Minimum interference routing with applications to MPLS traffic cngineering[C ]//Proc of the 19th Annual Joint Conf of the IEEE Computer and Communications Societies. New York: IEEE, 2000:884- 893.
  • 8Suri S, Waldvogel M, Bauer D, et al. Profile-based routing and traffic engineering [ J ]. Computer Communications, 2003,26 (4) : 351 - 365.
  • 9Figueiredo G B, da Fonseca N L S, Monteiro J A S. A minimum interference routing algorithm [ C]//Proceedings of IEEE ICC 2004. Paris: IEEE, 2004:1942- 1947.
  • 10Boyle J, Gill V, Hannan A, et al, RFC3346. Applicability statement for traffic engineering with MPLS[S] IETF, 2002.

引证文献2

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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