Wdm Network Load Balancing Routing Algorithm Used To Protect

With the development of information society and the explosive growth of Internet, the requirements of network capacity have increased dramatically, which are promoting the construction of broadband trunk network. Wavelength-division multiplexing (WDM) is a promising approach that can exploit the enormous bandwidth of the optical fiber. A single fiber can be employed for multiple data streams simultaneously. All-optical networks employing the concept of WDM and wavelength routing are considered as the transport networks for the future. With the development of OXC and OADM, the optical transmission network based on WDM is not confined to point-to-point transmission. So, there must be the assignment and optimization of network resource on demand. This means allocating network resource according to user's demand, configuring network resource as reasonable as possible, and decreasing the network blocking rate. After all, we must use traffic engineering to solve these questions.Traffic Engineering maps traffic into network's physical topology according to user's command, for optimizing network resource's allocating, avoiding network congestion and increasing network robustness. A traffic trunk can be characterized by administrator in optical Traffic Engineering with GMPLS, and an attribute of a traffic trunk is a parameter assigned to it which influences its routing and resource assignment.Load balancing algorithm researched in the paper is to implement traffic engineering in the WDM network which uses MPLS technology. The aim is to increase the resource utilization of network, reduce traffic block, enhance reliability of network.In chapter 2, we study resource assignment algorithms of load balancing of links. To analyze the factors of impacting load balancing of links, which is including the number of routes between source node and destination node, the number of routes through every link, the maximum flow between source node and destination node, the maximum flow through every link, the free bandwidth of every link and so on, we present the Fast Dynamic Routing Algorithm (FDRA) and the Critical Link Routing Algorithm (CLRA). Simulation results show presented algorithms in the paper are better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost.In chapter 3 we study application of traffic engineering in the protection of networks. To...