MPLS TE中一种新的路径选择算法

New routing path selection algorithm in MPLS TE

目前,MPLS TE的实现多使用CSPF算法选择路径,然而此算法没有考虑建立LSP时的抢占特性,因此可能会导致其它业务不必要的中断。对CSPF算法的这种缺陷进行了研究,提出了COPF算法,该算法在选择路径时,尽量减少被抢占的LSP的数量,使已建立的LSP受影响程度最小,从而选择一条使业务中断最少的路径建立LSP。在网络空闲时,COPF算法也尽量选择合理的路径使业务流量均衡分布。

Now, CSPF algorithm is mostly utilized in realization ofMPLS TE, however this algorithm does not have the consideration to the preemption as a LSR establish a LSP to a destination node, therefore possibly this policy could needlessly cause the interruption of other traffic which is preempted by the new esablishing LSP. A new algorithm is proposed and the COPF algorithm how to minimize the affection to established LSP as far as possible is illustrated, the algorithm optimize a path by reducing the quantity of LSP which is preempted as far as possible When there is no congestion in network, the algorithm try it＇s best to balanced traffic within network.