MPLS的基于最小干涉的负载均衡算法研究

Research on algorithms of load balancing with minimal interference in MPLS

当MPLS网络中的业务流请求存在时间上的先后顺序时,选择一个高效的路由算法使得已存在的业务流的LSP对后续业务流的LSP路由影响最小变得很重要。在分析了常用的几种QoS保障的算法基础上,提出了一种基于最小干涉的负载均衡算法。该算法解决了MPLS网络中所有“入口/出口对”之间的业务流相互干扰的问题,为后续业务流路由预留了必要的“关键链路”。

Choose an efficient algorithm is significantly important when business flow＇s requirements exist the difference of creating time in MPLS networks, which minimizes the effect from the existed flow on the following flow. By analyzing some common QoS algorithms, load balancing routing algorithms with minimal interference is proposed. The interference-difficulty between all business flow belonged to the different ＂ingress/egress＂ in MPLS networks is solved. Some necessary ＂key paths＂ for next routing are reserved.