DS-TE网络环境中新的LSP抢占策略  

New LSP Preemption Policy for DS-TE Networks

作　　者：杜荔[1] 宋建铭 马新 党爱民[1] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110004 [2]北海舰队通信处,青岛266071

出　　处：《计算机工程》2008年第2期178-180,共3页Computer Engineering

基　　金：国家“863”计划基金资助项目(2002AA784030)

摘　　要：针对DS-TE的网络环境提出一种新LSP抢占策略,其基本思想是将避免级联抢占、减少受到影响的业务数量,以及避免因抢占带来的带宽浪费3个标准进行重要性排序,并依序优化抢占目标。其中,在避免带宽浪费方面,新策略使用一种层次逼近的规则,明显提高了对带宽抢占的约束程度。仿真实验的结果也表明对新策略的使用可以有效改善发生抢占时的网络性能。For DS-TE networks, a new preemption policy is proposed whose basic idea is sorting three criterions according to their importance. These criterions are avoiding cascading effect, decreasing the numbers of affected traffic, and avoiding waste of bandwidth. And the policy can optimize preemption objectives in turn. Especially for the third criterion, the policy uses a hierarchical approach, which can enhance restriction degree for bandwidth preemption. The experimental result shows the new policy can improve the performance of networks efficiently while occurring preemption.

关 键 词：区分服务感知的流量工程 未预留带宽 流量工程等级 抢占 

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