Survivable network design with shared-protection routing

In this paper we study the problem of designing a survivable telecommunication network with shared-protection routing. We develop a heuristic algorithm to solve this problem. Recent results in the area of global re-routing have been used to obtain very tight lower bounds for the problem. Our results indicate that in a majority of problem instances, the average gap between the heuristic solutions and the lower bounds is within 5%. Computational experience is reported on randomly generated problem instances with up to 35 nodes, 80 edges and 595 demand pairs and also on the instances available in SNDlib database.

[1]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

[2]  Fumito Kubota,et al.  Joint capacity assignment to state-independent working and spare paths for enchanced network survivability , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[3]  Alper Atamtürk,et al.  Partition inequalities for capacitated survivable network design based on directed p-cycles , 2008, Discret. Optim..

[4]  Daniel Bienstock,et al.  Strong inequalities for capacitated survivable network design problems , 2000, Math. Program..

[5]  T. Cinkler,et al.  Efficient algorithms for physically-disjoint routing in survivable GMPLS/ASTN networks , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[6]  Yogesh K. Agarwal.  Polyhedral structure of the 4-node network design problem , 2009, Networks.

[7]  Kazutaka Murakami,et al.  Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration , 1998, TNET.

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

[9]  Simon Spoorendonk,et al.  Cut and Column Generation , 2015 .

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

[11]  Antonio Sassano,et al.  Metric Inequalities and the Network Loading Problem , 2004, IPCO.

[12]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[13]  Yogesh Agarwal.  Design of Survivable Networks Using Three- and Four-Partition Facets , 2013, Oper. Res..

[14]  Yogesh Kumar Agarwal.  Polyhedral structure of the 4-node network design problem , 2009 .

[15]  Martin Grötschel,et al.  Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..

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

[17]  Mateusz Zotkiewicz,et al.  Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks , 2010, IEEE Communications Letters.

[18]  Mateusz Zotkiewicz,et al.  Complexity of resilient network optimisation , 2009, Eur. Trans. Telecommun..

[19]  Shahram Manighalam.  Interconnection network simulator (INS) , 1989, AT&T Technical Journal.

[20]  Martin Grötschel,et al.  Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints , 1990, SIAM J. Discret. Math..

[21]  S. Orlowski,et al.  Comparing restoration concepts using optimal network configurations with integrated hardware and routing decisions , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[22]  Yogesh K. Agarwal.  An algorithm for designing survivable networks , 1989, AT&T Technical Journal.

[23]  Mark W. Lewis,et al.  The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis , 2001, INFORMS J. Comput..

[24]  Kasper Bonne,et al.  Optimal routing with single backup path protection , 2015 .

[25]  Clyde L. Monma,et al.  Minimum-weight two-connected spanning networks , 1990, Math. Program..

[26]  C. Monma,et al.  Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints , 1989, Oper. Res..

[27]  Prakash Mirchandani,et al.  Connectivity Upgrade Models for Survivable Network Design , 2009, Oper. Res..

[28]  Yogesh K. Agarwal,et al.  k‐Partition‐based facets of the network design problem , 2006, Networks.

[29]  Yi Wang,et al.  Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type , 2002, Oper. Res..

[30]  Sara Mattia,et al.  Solving survivable two-layer network design problems by metric inequalities , 2010, Comput. Optim. Appl..

[31]  Hideki Sakauchi,et al.  A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[32]  Jeffery L. Kennington,et al.  Basic mathematical programming models for capacity allocation in mesh-based survivable networks ☆ , 2007 .

[33]  M. Dzida,et al.  Path Generation for a Class of Survivable Network Design Problems , 2008, 2008 Next Generation Internet Networks.

[34]  Daniel Bienstock,et al.  Using mixed-integer programming to solve power grid blackout problems , 2007, Discret. Optim..

[35]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[36]  Michal Pióro,et al.  Complexity of column generation in network design with path‐based survivability mechanisms , 2012, Networks.

[37]  Claus G. Gruber,et al.  Optimization of Resilient Networks with Column Generation , 2005 .