An Improved Algorithm Research Based On Gmpls Traffic Engineering In Optical Network

With the dramatic increase in IP traffic, when the local optical network link is congested, the rest of the links are often idle. The situation in the rapid development of network hardware:high-speed switching and routing units and large capacity network link allows operators to a significant increase in hardware resources for the network. However, this approach is based on the bandwidth of the excess supply of low utilization of network resources for the price, and cannot effectively solve the hot link. In this situation, the automatic switched optical network (ASON, Automatic Switching Optical Network) came into being, for network management provides a more intelligent control and a new kind of management techniques.Generalized Multi-Protocol Label Switching (GMPLS, General Multi-Protocol Label Switch) technology is the core technology of ASON networks. It is a multi-label switching technologies (MPLS, Multi-Protocol Label Switch) expansion in optical networks. It inherits MPLS protocol almost in all advantages and features, and can support packet switching node. And also it can provide dynamic network resources to achieve automatic protection and recovery capabilities of the network. GMPLS traffic engineering techniques can be very good at the control of network traffic, and can improve the utilization of network resources.The main work and achievements of this paper are as follows:(1) Firstly, the key technology of GMPLS is being researched, and for traffic engineering routing algorithm paper presents an improvement idea. Using the link bandwidth utilization to simplify a complex optical network, and ultimately get the equivalent one of a simple network. This algorithm is based on the Traffic Distribution Based on Bandwidth (TDBB, Traffic Distribution Based on Bandwidth). This is an improved routing algorithm. Traditional routing algorithm is based on the cost of the network link, using the shortest path routing algorithm (SPF, Shortest Path First) conducted. Traditional routing algorithm idea is to find a shortest path in the network. All network traffic to reach the source of the shortest path must be through this transmission. When the network traffic reaches this shortest path transmission limit, because of network traffic diversion, network congestion will inevitably arise. Meanwhile, some of the link does not be chosen by the shortest path algorithm, the link idle condition will exist. This method wastes network resources, also increases the burden on certain paths, reducing the efficiency of the network. Unlike traditional algorithm, the improved algorithm TDBB’s traffic diversion and link bandwidth allocation are based on the traffic of different sizes. Thus, the new improved algorithm maintains the core principles of the algorithm without changing the SPF algorithm to improve the traditional drawbacks. And it can achieve a more balanced distribution of traffic.(2) Present an idea which a link cost function is set to the function of the new routing realization;(3) Using C language to program algorithm TDBB in static link and in the dynamic link. In single-source single-sink case, by using Matlab software simulation, compare the new algorithm and the traditional SPF algorithm in transmission efficiency and blocking rate on the performance difference; In the case of dynamic link and multiple sources and sinks, to achieve a new algorithm and SPF algorithm transmission efficiency, blocking rate, as well as a more balanced flow of nature. Finally, the paper tries to use OPNET to simulate GMPLS protocol for system-level simulation.