Achieving balanced traffic distribution in MPLS networks

Traffic Engineering (TE) [1] broadly relates to optimization of the performance of a network. The Overlay approach has been widely used by many service providers for Traffic Engineering in large Internet backbones. In this approach logical connections are set up between edge nodes to form a full mesh virtual network on top of the physical topology. Instead of overlaying IP routing over the logical virtual network, the Integrated approach runs shortest path IP routing natively over the physical topology. We investigate the quality of the routing in the Integrated approach with respect to link load, traffic distribution and link utilization. We propose a knapsack method to improve the quality of the routing. This method strikes a good balance between the conflicting objectives of link load and optimizing the QoS routing. Moreover we apply the knapsack method to the problem of minimizing the maximum link utilization given a traffic matrix. With the knapsack method, we can achieve almost the same maximum link utilization and improve the quality of routing.

[1]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[2]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Yueming Lu,et al.  Traffic Engineering-based Load Balancing Algorithm in GMPLS Networks , 2008, 2008 Fourth International Conference on Semantics, Knowledge and Grid.

[4]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[5]  William Lai,et al.  A Framework for Internet Traffic Engineering Measurement , 2001 .

[6]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[7]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[8]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[9]  Zheng Wang,et al.  Explicit routing algorithms for Internet traffic engineering , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).