MPLS流量工程K路径标号算法  

K Path Label Algorithm Based on MPLS Traffic Engineering

作　　者：林娜[1,2] 杨涛[1] 

机构地区：[1]沈阳航空工业学院计算机学院,辽宁沈阳110136 [2]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《小型微型计算机系统》2009年第12期2335-2338,共4页Journal of Chinese Computer Systems

基　　金：国家"八六三"高技术研究发展计划项目(863-701-2-4863-708-5-4);辽宁省教育厅科学研究计划资助;辽宁省企业博士后项目资助

摘　　要：针对多协议标签交换流量工程(MPLS-TE)提出一种有带宽保证的K路径标号算法(KPLA),该算法利用扩展标号算法计算出K条最短路径,综合考虑了链路关键度和链路最大剩余带宽的影响,进一步结合预计算和在线计算减少计算复杂度.该算法目的是避免忽视重要的非关键链路和避免选择过长的路径,提供有效的QoS保证.仿真结果表明该算法路由拒绝率低,延迟小,吞吐量大,计算速度快,是一种高效快捷的动态路由算法.K Path Label Algorithm（KPLA） is presented for MPLS-TE. The algorithm first uses extension label algorithm to calculate K-shortest Paths, then chooses the LSP in terms of the link criticality and the residual bandwidth, combines K value to give different links weight, and combines offline with online routing to reduce the computational complexity, simultaneously considers other QoS parameters. The main objective of KPLA is to prevent the neglect of non-critical link which is important, and to avoid choosing the overlong path,then provides an effective guarantee of QoS. The simulation shows the algorithm is improved greatly compared to both CSPF and MIRA in reject ratio,delay,throughput and computation time,is an efficient and quick routing algorithm.

关 键 词：MPLS-TE QOS 约束路由 K最短路径 扩展标号 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]