Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

The desire for configuring well-managed open shortest path first (OSPF) routes to handle the communication needs in the contemporary business world with larger networks and changing service requirements has opened the way to use traffic engineering tools with the OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. We take these two crucial issues into consideration and study the weight setting problem for OSPF routing problem with polyhedral demands. Our motivation is to optimize the link weight metric such that the minimum cost routing uses shortest paths with equal cost multipath splitting and the routing decisions are robust to possible fluctuations in demands. In addition to a compact mixed integer programming model, we provide an algorithmic approach with two variations to tackle the problem. We present several test results for these two strategies and discuss whether we could make our weight-managed OSPF comparable to unconstrained routing under polyhedral demand uncertainty. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.

[1]  Kaj Holmberg,et al.  Valid cycles: A source of infeasibility in open shortest path first routing , 2008 .

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

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

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

[5]  M. Piórob,et al.  On OSPF Related Network Optimisation Problems , 2022 .

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

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

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

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

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

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

[12]  Thorsten Koch,et al.  Integer Programming Approaches to Access and Backbone IP Network Planning , 2006, HPSC.

[13]  Zheng Wang,et al.  Internet Traffic Engineering , 2001 .

[14]  Tim Roughgarden,et al.  Simpler and better approximation algorithms for network design , 2003, STOC '03.

[15]  Michal Pioro,et al.  Optimization of administrative weights in IP networks using branch-and-cut approach , 2005 .

[16]  Martin Skutella,et al.  New Approaches for Virtual Private Network Design , 2005, ICALP.

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

[18]  Kaj Holmberg,et al.  On the Extremal Structure of an OSPF Related Cone , 2007 .

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

[20]  Klara Nahrstedt,et al.  Edge-based traffic engineering for OSPF networks , 2005, Comput. Networks.

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

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

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

[24]  Subhash Suri,et al.  Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.

[25]  Peter Broström.  Optimization Models and Methods for Telecommunication Networks using OSPF , 2006 .

[26]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2002, TNET.

[27]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

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

[29]  Bernard Fortz,et al.  Fast heuristic techniques for intra-domain routing metric optimization , 2007 .

[30]  Martine Labbé,et al.  A Lower Bound for the Internet Protocol Network Design Problem , 2005 .

[31]  Kaj Holmberg,et al.  Determining the Non-Existence of Compatibel OSPF Weights , 2004 .

[32]  Jordi Domingo-Pascual,et al.  An open source traffic engineering toolbox , 2006, Comput. Commun..

[33]  Bernard Fortz,et al.  Applications of meta-heuristics to traffic engineering in IP networks , 2011, Int. Trans. Oper. Res..

[34]  Walid Ben-Ameur.  Multi-hour design of survivable classical IP networks , 2002, Int. J. Commun. Syst..

[35]  Doktor der Naturwissenschaften.  Routing and Capacity Optimization for IP Networks , 2007 .

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

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

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

[39]  Kaj Holmberg,et al.  Design of IP/OSPF Networks Using a Lagrangean Heuristic on an In-graph Based Model , 2005 .

[40]  Walid Ben-Ameur,et al.  Internet Routing and Related Topology Issues , 2003, SIAM J. Discret. Math..

[41]  J. L. Wang,et al.  Minimax open shortest path first routing algorithms in networks supporting the SMDS service , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

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

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

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

[45]  Rajeev Rastogi,et al.  Restoration algorithms for virtual private networks in the hose model , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[46]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..