基于MPLS-DiffServ的LSP动态抢占算法研究

在支持具有不同优先级和不同QoS需求的多业务网络中,抢占是带宽分配和管理的有效策略,但同时也对网络造成了振荡。基于普通的LSP路由方案,提出了一个动态的LSP抢占算法——Min_Prec算法:总是首先抢占最低优先级的LSP;在同一个优先级别内最优化被抢占的带宽和LSP数目。最后,通过引入一个抢占策略对于路由过程的反馈机制,减少抢占引起的重路由,增强网络稳定性。仿真结果验证了算法的有效性、优越性。

Study on Dynamic LSP-Preemption Algorithm Supporting MPLS-DiffServ

Preemption is an efficient policy for bandwidth allocation and management in a multi-service network with different priorities and QoS requirements.But it also can break the load balancing.Propose a dynamic preemption algorithm-Min_Prec Algorithm based on generic LSP routing:First must preempt LSPs with lower priority;If having the same priority,consider to minimize the number of the reserved bandwidth and LSPs per preemption level.Finally,import a feedback from preemption to routing to reduce the rerouting caused by preemption and to increase network stability. Simulation results show that algorithm can achieve good performances.