The multilayer capacitated survivable IP network design problem: valid inequalities and branch-and-cut

Telecommunication networks can be seen as the stacking of several layers like, for instance, IPover-Optical networks. This infrastructure has to be sufficiently survivable to restore the traffic in the event of a failure. Moreover, it should have adequate capacities so that the demands can be routed between the origin-destinations. In this paper we consider the Multilayer Capacitated Survivable IP Network Design problem. We study two variants of this problem with simple and multiple capacities. We give two multicommodity flow formulations for each variant of the problem and describe some valid inequalities. Using these we develop a Branch-and-Cut algorithm and a Branch-and-Cut-andPrice algorithm for each variant and present extensive computational results.

[1]  J. P. Ed,et al.  Transmission control protocol- darpa internet program protocol specification , 1981 .

[2]  Bogdan M. Wilamowski,et al.  The Transmission Control Protocol , 2005, The Industrial Information Technology Handbook.

[3]  Marie-Emilie Voge,et al.  Optimisation des réseaux de télécommunications : Réseaux multiniveaux, Tolérance aux pannes et Surveillance du trafic , 2006 .

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

[5]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[6]  Ali Ridha Mahjoub,et al.  Design of survivable IP-over-optical networks , 2006, Ann. Oper. Res..

[7]  Ali Ridha Mahjoub,et al.  On two-connected subgraph polytopes , 1995, Discret. Math..

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

[9]  Benoît Lardeux.  Conception de réseaux de télécommunications multicouche et évolutif , 2005 .

[10]  Sebastian Orlowski,et al.  An Integer Programming Model for Multi-Layer Network Design , 2004 .

[11]  Hervé Kerivin,et al.  Reseaux fiables et polyedres , 2000 .

[12]  Matteo Fischetti,et al.  A polyhedral approach to an integer multicommodity flow problem , 2000, Discret. Appl. Math..

[13]  Ali Ridha Mahjoub,et al.  Design of Survivable Networks: A survey , 2005, Networks.

[14]  Michael Jünger,et al.  Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS , 2000, Computational Combinatorial Optimization.

[15]  Luís Gouveia,et al.  MPLS over WDM network design with packet level QoS constraints based on ILP models , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[17]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..

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

[19]  Francisco Barahona,et al.  Network Design Using Cut Inequalities , 1996, SIAM J. Optim..

[20]  Amaro de Sousa,et al.  Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM , 2008 .

[21]  Ali Ridha Mahjoub,et al.  Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut , 2005 .

[22]  Arie M. C. A. Koster,et al.  Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics , 2006 .

[23]  Scott O. Bradner,et al.  The Recommendation for the IP Next Generation Protocol , 1995, RFC.

[24]  Geir Dahl,et al.  On the k edge-disjoint 2-hop-constrained paths polytope , 2006, Oper. Res. Lett..

[25]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[26]  Panos M. Pardalos,et al.  Design of survivable networks , 2006 .

[27]  Ali Ridha Mahjoub,et al.  Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut , 2006, Math. Program..

[28]  Arnaud Knippel,et al.  The multi-layered network design problem , 2007, Eur. J. Oper. Res..

[29]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[30]  Ali Ridha Mahjoub,et al.  Two-edge connected spanning subgraphs and polyhedra , 1994, Math. Program..

[31]  Sylvie Borne.  Sécurisation et dimensionnement de réseaux multicouches : modèles et polyèdres. (Survivability and capacity installation for multilayer networks : models and polyhedra) , 2006 .

[32]  Marco Listanti,et al.  Off-line configuration of a MPLS over WDM network under time-varying offered traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[34]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[35]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[36]  Stefan Thienel,et al.  ABACUS - a branch-and-CUt system , 1995 .

[37]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .