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

The new LSP preemption strategy for DS-TE networks

作　　者：陈家益[1] 王文娟[2] 谢翠萍[1] 

机构地区：[1]广东医学院信息工程学院,广东湛江524023 [2]湛江师范学院信息科学与技术学院,广东湛江524048

出　　处：《暨南大学学报（自然科学与医学版）》2013年第1期31-34,共4页Journal of Jinan University(Natural Science & Medicine Edition)

摘　　要：抢占是DS-TE网络中带宽分配和管理的一个重要策略.引入目前主流的抢占算法:V-PREPT算法,分析了该算法的优缺点.针对V-PREPT算法的不足,提出了新的最优化带宽算法:Optim-Bandwidth算法.Optim-Band-width算法充分考虑了带宽资源,通过采用层次逼近规则来提高对带宽抢占的约束程度,有效地规避了V-PREPT算法近似最优化的误差问题,从而在保证高优先级业务的QoS的同时,优化发生抢占时网络的性能.Preemption is a significant strategy for allocation and management of bandwidth for DS-TE networks. This paper introduces the current mainstream preemption algorithm： V-PREPT algorithm, and analyzes the advantages and disadvantages of it. Against the disadvantages of V-PREPT algorithm, this paper proposes a new Bandwidth-Optimization algorithm： Optim-Bandwidth algorithm. Optim-Bandwidth algorithm takes full account of the bandwidth resources, increases the constraints of bandwidth-preemption through levels approaching rule, and avoids the deviation problem of approximate optimization of V- PREPT algorithm effectively, so that it guarantees the QoS of high-priority business, meanwhile, optimizes the network performance while preempting.

关 键 词：区分服务感知的流量工程 服务质量 建立优先级 抢占代价目标函数 抢占算法 

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