一种基于动态负载均衡的路由算法

传统IGP仅基于最短路径算法来为数据流选择传输通路，对数据流的需求以及网络资源的动态变化未加以考虑，因此不具备均衡网络负载的能力。文中通过分析IGP的局限性，提出基于动态负载均衡的DLB-OSPF路由算法。该算法依据数据流的带宽需求和网络资源的使用状况来进行路由选择，并通过有效手段将数据流更合理地分配到能满足传输需求的链路上。经过示例分析表明，该算法不仅能减少网络拥塞，并且提高了网络资源利用率。

A Routing Algorithm Based on Dynamic Load Balancing

The traditional IGPs are routing over shortest paths. Moreover, they do not take current data flows and present utilization of network resource into account. As a result, they can not balance the load on network and distribute the traffic optimally. After analyzing the limitations of traditional routing protocols, propose a new routing algorithm named DLB-OSPF, which is based on dynamic load balancing. It is capable of realizing dynamic and optimal traffic distribution with effectiveness. The case studies show that it can reduce the congestion probability and promote the utilization ratio of network resource when compared with traditional routing protocols.