DocumentCode
1704439
Title
Robust Traffic Engineering Using Multi-Topology Routing
Author
Wang, Xiong ; Wang, Sheng ; Li, Lemin
Author_Institution
Key Lab. of Broadband Opt. Transm. & Commun. Networks, Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fYear
2009
Firstpage
1
Lastpage
6
Abstract
Intra-domain traffic engineering can significantly enhance the performance of large IP backbone networks. An important component of current methods for traffic engineering with link state routing protocols like OSPF is accurate knowledge of traffic matrix. However, the traffic matrix is unknown and varies with time. So it is important to obtain a traffic engineering method that is "robust" to variations in traffic matrix. In this paper, we use multi-topology routing (MTR) for providing robust traffic engineering in IP networks. We first formulate the problem of robust traffic engineering using MTR as a mixed integer programming problem (MIP). To make the problem solvable, we then decompose the problem into logical topologies design problem and traffic assignment problem, which are solved by a heuristic algorithm and a tractable linear programming (LP) model, respectively. Using simulation results on Rocketfuel topologies, we study and discuss effectiveness of the proposed robust traffic engineering approach. Simulation results show that robust traffic engineering based on MTR is promising.
Keywords
IP networks; telecommunication network routing; telecommunication traffic; IP backbone networks; MIP; MTR; OSPF; heuristic algorithm; link state routing protocols; mixed integer programming problem; multi-topology routing; robust traffic engineering; tractable linear programming model; traffic matrix; IP networks; Knowledge engineering; Linear programming; Matrix decomposition; Network topology; Robustness; Routing protocols; Spine; Telecommunication traffic; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE
Conference_Location
Honolulu, HI
ISSN
1930-529X
Print_ISBN
978-1-4244-4148-8
Type
conf
DOI
10.1109/GLOCOM.2009.5426258
Filename
5426258
Link To Document