Affine recourse for the robust network design problem: Between static and dynamic routing

Affinely Adjustable Robust Counterparts provide tractable alternatives to (two-stage) robust programs with arbitrary recourse. Following Ouorou and Vial, we apply them to robust network design with polyhedral demand uncertainty, introducing the notion of affine routing. We compare the new affine routing scheme to the well-studied static and dynamic routing schemes for robust network design. It is shown that affine routing can be seen as a generalization of the widely used static routing while still being tractable and providing cheaper solutions. We investigate properties of the demand polytope under which affine routings reduce to static routings and also develop conditions on the uncertainty set leading to dynamic routings being affine. We show however that affine routings suffer from the drawback that (even totally) dominated demand vectors are not necessarily supported by affine solutions. Uncertainty sets have to be designed accordingly. Finally, we present computational results on networks from SNDlib. We conclude that for these instances the optimal solutions based on affine routings tend to be as cheap as optimal network designs for dynamic routings. In this respect the affine routing principle can be used to approximate the cost for two-stage solutions with free recourse which are hard to compute

[1]  Geir Dahl,et al.  A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..

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

[3]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[4]  Alysson M. Costa.  A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..

[5]  Maria Grazia Scutellà.  Hardness of some optimal oblivious routing generalizations , 2010 .

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

[7]  Fernando Ordóñez,et al.  Robust capacity expansion of network flows , 2007, Networks.

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

[9]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[10]  Xin Chen,et al.  Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts , 2009, Oper. Res..

[11]  Gianpaolo Oriolo,et al.  Hardness of robust network design , 2007 .

[12]  Gianpaolo Oriolo,et al.  Domination Between Traffic Matrices , 2008, Math. Oper. Res..

[13]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[14]  Thorsten Koch,et al.  ZIMPL User Guide , 2001 .

[15]  Adam Ouorou.  Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications , 2011, INOC.

[16]  Arie M. C. A. Koster,et al.  Towards robust network design using integer linear programming techniques , 2010, 6th EURO-NGI Conference on Next Generation Internet.

[17]  F. Ordóñez,et al.  Robust capacity expansion of network flows , 2007 .

[18]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .

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

[20]  Maria Grazia Scutellí.  On improving optimal oblivious routing , 2009 .

[21]  M. Iri.  ON AN EXTENSION OF THE MAXIMUM-FLOW MINIMUM-CUT THEOREM TO MULTICOMMO))ITY FLOWS , 1971 .

[22]  Maria Grazia Scutellà,et al.  Static and dynamic routing under disjoint dominant extreme demands , 2011, Oper. Res. Lett..

[23]  Fernando Ordóñez,et al.  Robust solutions for network design under transportation cost and demand uncertainty , 2008, J. Oper. Res. Soc..

[24]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

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

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

[27]  Hande Yaman,et al.  A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem , 2011 .

[28]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[29]  Alper Atamtürk,et al.  On capacitated network design cut–set polyhedra , 2002, Math. Program..

[30]  Michael Poss,et al.  Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing , 2011, INOC.

[31]  J. Gondzio,et al.  Capacity Planning under Uncertain Demand in Telecommunication Networks , 1999 .

[32]  K. Onaga,et al.  On feasibility conditions of multicommodity flows in networks , 1971 .

[33]  Andreas Bley,et al.  Multi-layer Network Design - A Model-Based Optimization Approach , 2008 .

[34]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[35]  W. Ben-Ameur.  Between fully dynamic routing and robust stable routing , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.

[36]  ChenXin,et al.  Uncertain Linear Programs , 2009 .

[37]  Arie M. C. A. Koster,et al.  Cutset Inequalities for Robust Network Design , 2011, INOC.

[38]  Hande Yaman,et al.  The Robust Network Loading Problem under Polyhedral Demand Uncertainty : Formulation , Polyhedral Analysis and Computations ∗ , 2007 .

[39]  Jean-Philippe Vial,et al.  Robust Optimization , 2021, ICORES.

[40]  Edoardo Amaldi,et al.  Virtual Private Network Design Under Traffic Uncertainty , 2004, Electron. Notes Discret. Math..

[41]  Arie M. C. A. Koster,et al.  Robust network design: Formulations, valid inequalities, and computations , 2013, Networks.

[42]  Arie M. C. A. Koster,et al.  On cut‐based inequalities for capacitated network design polyhedra , 2011, Networks.

[43]  Walid Ben-Ameur,et al.  NEW ECONOMICAL VIRTUAL PRIVATE NETWORKS , 2003 .

[44]  Maria Grazia Scutellà.  On improving optimal oblivious routing , 2009, Oper. Res. Lett..

[45]  Navin Goyal,et al.  Dynamic vs. Oblivious Routing in Network Design , 2010, Algorithmica.

[46]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[47]  J. Vial,et al.  Robust capacity expansion solutions for telecommunication networks with uncertain demands , 2010 .

[48]  Sara Mattia,et al.  The robust network loading problem with dynamic routing , 2010, Comput. Optim. Appl..

[49]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[50]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[51]  J.-P. Vial,et al.  A model for robust capacity planning for telecommunications networks under demand uncertainty , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.

[52]  Dimitris Bertsimas,et al.  On the power and limitations of affine policies in two-stage adaptive optimization , 2012, Math. Program..

[53]  Walid Ben-Ameur,et al.  Networks new economical virtual private , 2003, CACM.

[54]  A. Dwivedi,et al.  Traffic model for USA long-distance optical network , 2000, Optical Fiber Communication Conference. Technical Digest Postconference Edition. Trends in Optics and Photonics Vol.37 (IEEE Cat. No. 00CH37079).

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

[56]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[57]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[58]  Chandra Chekuri.  Routing and network design with robustness to changing or uncertain traffic demands , 2007, SIGA.

[59]  Antonio Frangioni,et al.  0-1 Reformulations of the Multicommodity Capacitated Network Design Problem , 2009, Discret. Appl. Math..

[60]  Hande Yaman,et al.  The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations , 2011, INFORMS J. Comput..

[61]  Arkadi Nemirovski,et al.  Robust optimization – methodology and applications , 2002, Math. Program..