Practical traffic engineering based on traditional IP routing

Traffic engineering (TE) based on traditional IP routing is easy-to-deploy and overly economical. In this paper we propose a new approach for TE based on traditional IP routing. We first calculate the link weights based on a given criterion and a given representative demand matrix. Then a modified open-shortest-path-first (OSPF) algorithm is proposed to calculate the paths for individual demand. Dynamic representative demand is also considered. A new method is proposed for adapting the link weights when the demand matrix changes, in which only partial link weights are changed. Simulation results show the proposed modified OSPF method has similar performance with the optimal traffic allocation method, and has acceptable performance when only partial link weights are changed.