The Research Of T-MPLS Routing Algorithms Based Traffic Engineering

The basic goal of transmission network is to reduce the cost of information in transmission. The time channel can not fit the increasing bandwidth in access network any more. Ethernet and IP/MPLS develop rapidly by their advantage, but their reliability, the ability of existence and OAM aren't good enough. So a kind of transmission technology based packet service is needed in telecom management, which can provide the reliable service as same as circuit service. As a result of both technology and market, T-MPLS(Transport MPLS) comes into being.T-MPLS is a technology of packet transmission based MPLS. So far there is not any official standard or protocal for the control plane of T-MPLS network. OSPF-TE is no doubt the best option for routing mechanism of T-MPLS network because of its abroad application and high standardization. It can apply in both IP network and ASON network. In addition, OSPF-TE can calculate the routing path with traffic restriction and provide reliable, fast and low cost transmission for the packets of traffic in order to support T-MPLS.This paper focuses on the routing mechanism based OSPF-TE. It proposes max bottleneck BW algorithm and link state update algorithm based service variation. It modeled and simulated the routing module with OPNET and collected the key parameters. It also tested the feasibility of max bottleneck BW algorithm with some traffic restriction and evaluated the performance of link state update algorithm based service variation as compared with conventional algorithm in order to research the routing algorithm of T-MPLS network.