Metric-base Traffic Engineering with Limited Area for TE Considering QoS Characteristics

Abstract

We propose traffic engineering which exists together with metric base QoS routing. In shortest paths routing, particular several links tends to be congested. TE in our proposal is adopted only to the specified area, TE area, consisting of congested links. So route of traffic which does not transmit through TE area have no change. We realize this TE routing with metric base, which means all routes are determined as shortest paths according to link costs. We formulate this as LP network problem (primary problem) and dual problem for derivation of link costs. Simulation results confirm that proposed method achieves metric base QoS routing without congestion.