DS-TE网络中自适应抢占算法研究  

On the Adaptive Preemption Algorithm in DS-TE Networks

作　　者：杜荔[1] 李海涛[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2010年第2期193-196,共4页Journal of Northeastern University(Natural Science)

基　　金：国家高技术研究发展计划项目(2003AA781011);辽宁省自然科学基金资助项目(20072022)

摘　　要：在DS-TE网络中,抢占为高优先级业务提供可靠的服务质量,尤其是当网络过载或者网络节点、链路发生故障时更加有效,为此提出了自适应抢占算法.该算法是通过增强链路上节点LSR对LSP的资源控制能力,来适应新LSP的带宽需求.为了避免对参数的设置,本文将自适应抢占算法区分为自适应最小中断抢占算法(A-minconn)和自适应最小优先级抢占算法(A-minpri).仿真结果表明,自适应抢占算法在抢占带宽、抢占优先级、抢占数目方面的性能明显优于传统算法.In the DS-TE networks the preemption provides the high priority business with reliable service quality, and it will be more effective especially when a network overload or node and link failure occurs. An adaptive preemption algorithm is therefore proposed to adapt to the bandwidth demand for new LSP by strengthening the control of the LSR over LSP resources. To avoid the setting of parameters, the adaptive preemption algorithm is divided into A-minconn and A-minpri. Simulation results showed that the adaptive preemption algorithm is obviously superior to the conventional algorithm in the preemption performance including bandwidth, priority and the numbers required.

关 键 词：区分服务 流量工程 抢占算法 CR-LDP LSP 

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