K Highest Label Path Algorithm Based on MPLS Traffic Engineering
K Highest Label Path Algorithm (KHLP) is presented for MPLS-TE. The algorithm first uses generalization of highest-label pre-flow-push 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, further combines offline with online routing to reduce the computational complexity, simultaneously considers other QoS parameters. The main objective of KHLP 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 constraint based routing Kshortest Paths
Na Lin Tao Yang
Dept. of Computer Shenyang Institute of Aeronautical Engineering Dept. of Information Science and En Dept. Of Computer Shenyang Institute of Aeronautical Engineering
国际会议
武汉
英文
1258-1261
2009-11-18（万方平台首次上网日期，不代表论文的发表时间）