Routing Optimization in IP Networks Utilizing Additive and Concave Link Metrics

Routing optimization provides network operators with a powerful method for traffic engineering. Its general objective is to distribute traffic flows evenly across available network resources in order to avoid network congestion and quality of service degradation. In this paper we consider routing optimization based on conventional routing protocols where packets are forwarded hop-by-hop in a destination-based manner. Unlike other work in this area, we consider routing protocols, which are able to take into account concave routing metrics in addition to additive ones. The concave link metric introduces an additional degree of freedom for routing optimization, thus, increasing its optimization potential. We present and evaluate a mixed-integer programming model, which works on these metrics. This model unifies the optimization for single-metric and dual-metric routing concepts and also includes the consideration of multipath routing. Furthermore, we propose a heuristic algorithm usable for larger network instances. Numerical results indicate that employment of both the dual-metric concept and multipath routing can achieve considerably better utilization results than default-configured single-metric routing. A significant finding is that metric-based routing optimization with two link metrics often comes close to the results obtainable by optimization of arbitrarily configurable routing.

[1]  Anton Riedl.  A Versatile Genetic Algorithm for Network Planning , 1998 .

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[4]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

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

[6]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005, IEEE/ACM Transactions on Networking.

[7]  Anton Riedl,et al.  A hybrid genetic algorithm for routing optimization in IP networks utilizing bandwidth and delay metrics , 2002, IEEE Workshop on IP Operations and Management.

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  Jon Crowcroft,et al.  Analysis of shortest-path routing algorithms in a dynamic network environment , 1992, CCRV.

[10]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

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

[12]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[13]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[14]  Dirk Staehle,et al.  Optimization of IP Routing by Link Cost Specification , 2000 .

[15]  M.J. O'Mahony,et al.  Results from the COST 239 project. Ultra-High Capacity Optical Transmission Networks , 1996, Proceedings of European Conference on Optical Communication.

[16]  K. G. Ramakrishnan,et al.  Optimal routing in shortest-path data networks , 2001, Bell Labs Technical Journal.

[17]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[18]  Jens Milbrandt,et al.  Decomposition of Large IP Networks for Routing Optimization , 2002 .

[19]  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).

[20]  Di Yuan,et al.  Optimization of Internet Protocol network design and routing , 2004, Networks.

[21]  Ulrich Killat,et al.  An Alternative Genetic Algorithm to Optimize OSPF Weights , 2002 .

[22]  Martin Grötschel,et al.  Design of broadband virtual private networks: Model and heuristics for the B-WiN , 1998, Robust Communication Networks: Interconnection and Survivability.

[23]  Celso C. Ribeiro,et al.  A Memetic Algorithm for OSPF Routing , 2002 .

[24]  Andreas Binzenhöfer,et al.  MPLS traffic engineering in OSPF networks—A combined approach , 2003 .

[25]  Dirk Staehle.  Towards an optimization of the routing parameters for IP networks , 2000 .