Research On Load Balance Based On MPLS Traffic Engineering

With the rapid growth of the network scale and traffic, there are more and more multimedia applications. Quality of service guarantees are required by the network. But the present IP network lacks of the means to manage network resource efficiently and cannot make full resource utilization, which always lead to the unbalanced traffic distribution, some links getting over-utilized, while others remaining under-utilized. This leads to the quality of services not guaranteed. So traffic engineering is proposed. Its purposes are to improve the network performance through optimizing resource utilization of the existing networks. MPLS has been regarded as a powerful tool to traffic engineering. In this paper, the traffic engineering in MPLS is studied and the routing problem is emphasized on. In order to overcome the limitations of traditional algorithms, some new algorithms are proposed. They provide new ideas to perfect MPLS application in this area.This dissertation surveys the state of the art of traffic engineering and reviews its history thoroughly. It investigates the limitations of traditional methods and analyzes the advantages of MPLS to traffic engineering. Then it introduces the components of MPLS traffic engineering: an enhanced link state IGP, constraint-based routing, and the LSP signaling protocol. Based on these, a king of MPLS traffic engineering model is presented.This dissertation proposes a Bandwidth-Hops Constrained Load Balance by Sideway algorithm. First the traditional algorithm, Dijkstra Algorithm, is used to search routes. In order to avoid bottleneck links, a new concept, Load Balance by Sideway, is defined, which is used to find a low load sideway for the overload link based on the link usage. Based on this definition, the algorithm takes bandwidth and hop-counts into accounts and finds the path with least weight. Compared to traditional algorithms, this algorithm avoids bottleneck links and balances the load of traffic in the network.