基于DS-TE 技术的VPN 的LSP 抢占算法

针对BH-PREPT(Bandwidth Preemption)算法因只关心最小化带宽浪费, 而不考虑计算复杂度和当前光纤通信的带宽资源而引起的网络时延极大增加的问题, 提出了改进算法DH-PREPT(Delay and BandwidthPreemption)。将用户业务的优先级和网络时延放在首位, 通过采用多个LSP(Label Switching Paths)绑定转发等价类和快速转发客户常用优先级业务的方法提高算法的时延性能。实验结果表明, 该算法在保证带宽利用率的前提下, 极大地减少了网络中的时延。当网络中发生抢占时, 该算法在减少网络时延方面的性能优于BH-PREPT算法, 提高了网络的QoS(Quality of Service)保障能力。

Preempting Algorithm of LSP in VPN Based on DS-TE

The BH-PREPT ( Bandwidth Preemption) algorithm only concerns with minimizing the waste ofbandwidth without considering the computational complexity and the current development of optical fibercommunication, leading to excessive increase of delay in the networks. An algorithm greatly reducing the delay ofthe networks, named DH-PREPT(Delay and Bandwidth Preemption) is proposed. The DH-PREPT algorithmmakes the computational complexity lower under the premise of minimizing the utilization rate of bandwidth. Itconsiders the delay indicator by the bound of forwarding equivalence class and LSPs(Label Switching Paths) andfast forward the data of custom. Simulation results show that the proposed algorithm significantly outperforms the BH-PREPT algorithm when preemption occurs in the network.