DS-TE网络中改进的LSP抢占算法  

Improved LSP Preemption Algorithm for DS-TE Networks

作　　者：邵海霞[1] 刘炯[2] 李智勇[1] 魏晋[1] 

机构地区：[1]西安通信学院研究生九队,西安710106 [2]西安通信学院一系,西安710106

出　　处：《计算机工程》2011年第18期106-108,共3页Computer Engineering

摘　　要：Min_BW算法在优化被抢占移动交换路径(LSP)的优先级时,存在被抢占LSP个数多和优先级高的问题。为此,提出DS-TE网络中改进的LSP抢占算法(I_Min_BW),全面考虑可能被抢占的LSP组中LSP的个数、LSP的最高优先级以及LSP的优先级总和。实验结果表明,该算法抢占的LSP组中最高优先级小于等于Min_BW算法,被抢占LSP的个数也有效减少。Because of the problem of preempting more Label Switched Path（LSP） with higher priority when Min_BW algorithm optimizes the priority of LSPs to be preempted,this paper proposes Improved_Min_BW（I_Min_BW） algorithm based on Min_BW algorithm.In order to optimize the priority of LSPs to be preempted,I_Min_BW algorithm considers the number of LSPs to be preempted and the highest priority of LSPs to be preempted and the sum of priority of LSPs to be preempted.It analyzes and compares two algorithms from the perspective of theory and simulation study and shows that the performance of I_Min_BW algorithm is better than Min_BW algorithm in optimizing the priority of LSPs to be preempted as well as the number of LSPs to be preempted.

关 键 词：区分服务 流量工程 多协议标记交换 区分服务感知的MPLS流量工程 服务质量 抢占算法 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]