Dynamic IGP Weight Optimization in IP Networks

With the explosive growth of the Internet and the incredible development of network applications, the variation in traffic volume has become one of the most important problems faced by network operators. Designing a network using a single ``busy hour'' traffic matrix strains credibility due to the high volatility of traffic patterns. Thus, there is a need for efficient dynamic reconfiguration methods allowing to adapt resource utilization to prevailing traffic. In this paper, we focus on the problem of link weight optimization in IP networks where the traffic is routed along shortest paths according to the link metrics (OSPF and IS-IS-based networks). We propose an online approach to handle time-varying traffic matrices that relies on online traffic monitoring and updates link weights, and thus the routing paths, adaptively as some changes are observed.

[1]  Ulrich Killat,et al.  Optimizing IP Networks for Uncertain Demands Using Outbound Traffic Constraints , 2005 .

[2]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[3]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

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

[5]  Bernard Fortz,et al.  Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty , 2009, Networks.

[6]  Didier Burton,et al.  On the Inverse Shortest Path Problem , 1993 .

[7]  Pietro Belotti,et al.  Optimal oblivious routing under statistical uncertainty , 2005 .

[8]  Olivier Brun,et al.  Metric Optimization in IP Networks , 2022 .

[9]  Walid Ben-Ameur,et al.  Routing of Uncertain Traffic Demands , 2005 .

[10]  P. Belotti,et al.  Optimal oblivious routing under linear and ellipsoidal uncertainty , 2008 .

[11]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[12]  Cheng-Huang Hung.  On the inverse shortest path length problem , 2003 .

[13]  Hakan Ümit.  A column generation approach for IGP weight setting problem , 2005, CoNEXT '05.

[14]  Chin-Tau Lea,et al.  Optimal Link Weights for IP-Based Networks Supporting Hose-Model VPNs , 2009, IEEE/ACM Transactions on Networking.

[15]  Edoardo Amaldi,et al.  Provisioning virtual private networks under traffic uncertainty , 2007 .

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

[17]  Albert G. Greenberg,et al.  Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.

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

[19]  Celso C. Ribeiro,et al.  A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing , 2005, Networks.

[20]  Konstantina Papagiannaki,et al.  Traffic matrices: balancing measurements, inference and modeling , 2005, SIGMETRICS '05.

[21]  Pietro Belotti,et al.  OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty , 2010 .

[22]  Bernard Fortz,et al.  Efficient techniques and tools for intra-domain traffic engineering , 2011, Int. Trans. Oper. Res..

[23]  Michael A. West,et al.  Bayesian Inference on Network Traffic Using Link Count Data , 1998 .

[24]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[25]  Thomas Erlebach,et al.  Optimal bandwidth reservation in hose-model VPNs with multi-path routing , 2004, IEEE INFOCOM 2004.

[26]  Edoardo Amaldi,et al.  Provisioning virtual private networks under traffic uncertainty , 2007, Networks.

[27]  Konstantina Papagiannaki,et al.  A distributed approach to measure IP traffic matrices , 2004, IMC '04.

[28]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[29]  Joel Sokol,et al.  An integer programming approach to the OSPF weight setting problem ∗ , 2006 .

[30]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[31]  Kavé Salamatian,et al.  Traffic matrix tracking using Kalman filters , 2005, PERV.

[32]  Christophe Diot,et al.  Design of IGP link weight changes for estimation of traffic matrices , 2004, IEEE INFOCOM 2004.

[33]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[34]  Haibo Wang,et al.  Multi-path routing versus tree routing for VPN bandwidth provisioning in the hose model , 2007, Comput. Networks.

[35]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM.

[36]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

[37]  Jorma T. Virtamo,et al.  Quick Traffic Matrix Estimation Based on Link Count Covariances , 2006, 2006 IEEE International Conference on Communications.

[38]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[39]  Y. Vardi.  Bayesian Inference on Network Traffic Using Link Count Data: Comment , 1998 .

[40]  Michal Pióro,et al.  On open shortest path first related network optimisation problems , 2002, Perform. Evaluation.

[41]  Walid Ben-Ameur,et al.  Calcul des métriques de routage pour Internet , 2001, Ann. des Télécommunications.

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

[43]  Mikkel Thorup,et al.  Intra-domain traffic engineering with shortest path routing protocols , 2009, 4OR.

[44]  Mikael Johansson,et al.  Traffic matrix estimation on a large IP backbone: a comparison on real data , 2004, IMC '04.

[45]  István Szabó,et al.  On bandwidth efficiency of the hose resource management model in virtual private networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[46]  B. Yu,et al.  Time-varying network tomography: router link data , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[47]  Olivier Brun,et al.  Fanout Inference from Link Count , 2007, Fourth European Conference on Universal Multiservice Networks (ECUMN'07).

[48]  P. Bermolen,et al.  Search for optimality in traffic matrix estimation: a rational approach by Cramer-Rao lower bounds , 2006, 2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06..

[49]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[50]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .