The multi-layered network design problem

Abstract We address the problem of designing a network built on several layers. This problem occurs in practical applications but has not been studied extensively from the point of view of global optimisation, since the problem of designing a single-layered network is complex. An example of an application is the design of a virtual network (Internet Protocol) built on a sparse optical transport network. We suggest a mathematical formulation without any flow variables or path variables, based on metric inequalities. We give numerical results for two-layered network instances obtained with a global method giving optimal solutions and we compare them with approximate results obtained by solving the problem in two steps.

[1]  T. C. Hu,et al.  An Application of Generalized Linear Programming to Network Flows , 1962 .

[2]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[3]  Michel Minoux,et al.  Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods , 2001, Ann. Oper. Res..

[4]  Monique Laurent,et al.  The Metric Polytope , 1992, Conference on Integer Programming and Combinatorial Optimization.

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

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

[7]  Masanori Sato,et al.  On the Skeleton of the Metric Polytope , 2000, JCDCG.

[8]  Geir Dahl,et al.  Routing Through Virtual Paths in Layered Telecommunication Networks , 1999, Oper. Res..

[9]  Michel Minoux,et al.  Exact solution of multicommodity network optimization problems with general step cost functions , 1999, Oper. Res. Lett..

[10]  Deep Medhi,et al.  Dimensioning and Computational Results for Wide-Area Broadband Networks with Two-Level Dynamic Routing (Special Issue on Telecommunications Network Planning and Design) , 1997 .

[11]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[12]  Michel Minoux,et al.  A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem , 2003, J. Heuristics.

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

[14]  Brunilde Sansò,et al.  A Typology for Multi-Technology, Multi-Service Broadband Network Synthesis , 2002, Telecommun. Syst..

[15]  Tibor Cinkler,et al.  Heuristic algorithms for joint configuration of the optical and electrical layer in multi-hop wavelength routing networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[17]  Chung-Kuan Cheng,et al.  Ancestor tree for arbitrary multi-terminal cut functions , 1990, IPCO.

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

[19]  M. Stoer.  Design of Survivable Networks , 1993 .

[20]  Prakash Mirchandani,et al.  Modeling and Solving the Capacitated Network Loading Problem , 1991 .

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

[22]  F. Barahona.  The max-cut problem on graphs not contractible to K5 , 1983 .

[23]  Arnaud Knippel.  Modeles et algorithmes de multiflots a cout discontinu pour l'optimisation de reseaux de telecommunications , 2001 .

[24]  Paul D. Seymour,et al.  Matroids and Multicommodity Flows , 1981, Eur. J. Comb..

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

[26]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..