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

Preempting Algorithm of LSP in VPN Based on DS-TE

作　　者：陈登昭 于银辉[1] 黄金海[1] 李金明[1] 

机构地区：[1]吉林大学通信工程学院,长春130012

出　　处：《吉林大学学报（信息科学版）》2015年第6期615-619,共5页Journal of Jilin University（Information Science Edition）

基　　金：长春市重大科技攻关计划基金资助项目(3D5143485420)

摘　　要：针对BH-PREPT(Bandwidth Preemption)算法因只关心最小化带宽浪费,而不考虑计算复杂度和当前光纤通信的带宽资源而引起的网络时延极大增加的问题,提出了改进算法——DH-PREPT(Delay and Bandwidth Preemption)。将用户业务的优先级和网络时延放在首位,通过采用多个LSP(Label Switching Paths)绑定转发等价类和快速转发客户常用优先级业务的方法提高算法的时延性能。实验结果表明,该算法在保证带宽利用率的前提下,极大地减少了网络中的时延。当网络中发生抢占时,该算法在减少网络时延方面的性能优于BH-PREPT算法,提高了网络的Qo S(Quality of Service)保障能力。The BH-PREPT（ Bandwidth Preemption） algorithm only concerns with minimizing the waste of bandwidth without considering the computational complexity and the current development of optical fiber communication,leading to excessive increase of delay in the networks. An algorithm greatly reducing the delay of the networks,named DH-PREPT（ Delay and Bandwidth Preemption） is proposed. The DH-PREPT algorithm makes the computational complexity lower under the premise of minimizing the utilization rate of bandwidth. It considers the delay indicator by the bound of forwarding equivalence class and LSPs（ Label Switching Paths） and fast forward the data of custom. Simulation results show that the proposed algorithm significantly outperforms the BH-PREPT algorithm when preemption occurs in the network.

关 键 词：区分服务 流量工程 抢占算法 标签交换路径 

分 类 号：TN914[电子电信—通信与信息系统]