Optimization of Internet Protocol network design and routing

We consider network design and routing for Internet Protocol lIPr traffic. The design problem concerns capacity dimensioning of communication links, where the design cost consists of fixed charges and linear capacity expansion costs. The optimization problem also concerns determining the amount of traffic demand to be carried by the network and the metric used by a shortest path routing protocol. We present a novel linear mixed-integer mathematical formulation and two heuristic solution procedures. The first heuristic uses mixed-integer programming to generate a sequence of routing solutions. The second solution approach is a simulated annealing meta heuristic. Computational experiments for synthesized and real-life networks show that high-quality solutions can be obtained by both approaches. © 2003 Wiley Periodicals, Inc.

[1]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[2]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[3]  Bezalel Gavish,et al.  Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems , 1995, Oper. Res..

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

[5]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..

[6]  Athanasios Migdalas,et al.  A characterization of the uncapacitated network design polytope , 1992, Oper. Res. Lett..

[7]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[8]  Cynthia Barnhart,et al.  A column generation and partitioning approach for multi-commodity flow problems , 1994, Telecommun. Syst..

[9]  Ross W. Callon,et al.  Use of OSI IS-IS for routing in TCP/IP and dual environments , 1990, RFC.

[10]  J. Kennington.  Solving multicommodity transportation problems using a primal partitioning simplex technique , 1977 .

[11]  Kemal Altinkemer,et al.  Topological design of wide area communication networks , 1992, Ann. Oper. Res..

[12]  Bezalel Gavish,et al.  Telecommunications network topological design and capacity expansion: Formulations and algorithms , 1993, Telecommun. Syst..

[13]  John W. Mamer,et al.  Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm , 1997, INFORMS J. Comput..

[14]  Johan Hellstrand,et al.  Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound , 1998, Oper. Res..

[15]  Parviz Kermani,et al.  MENTOR: an algorithm for mesh network topological optimization and routing , 1991, IEEE Trans. Commun..

[16]  J. Mamer,et al.  A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem , 2000 .

[17]  Anantaram Balakrishnan,et al.  LP extreme points and cuts for the fixed-charge network design problem , 1987, Math. Program..

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

[19]  Bassam Halabi,et al.  Internet Routing Architectures , 1997 .

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

[21]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .

[22]  Hiroyuki Saito,et al.  Optimal design and evaluation of survivable WDM transport networks , 1998, IEEE J. Sel. Areas Commun..

[23]  C. Barnhart.  Dual‐ascent methods for large‐scale multicommodity flow problems , 1993 .

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

[25]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[26]  L. Wolsey,et al.  Designing Private Line Networks - Polyhedral Analysis and Computation , 1996 .

[27]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[28]  Giorgio Gallo,et al.  A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems , 1999, INFORMS J. Comput..

[29]  Warren B. Powell,et al.  Multicommodity network flows: The impact of formulation on decomposition , 1993, Math. Program..

[30]  R. Vidal.  Applied simulated annealing , 1993 .

[31]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[32]  David R. Oran,et al.  OSI IS-IS Intra-domain Routing Protocol , 1990, RFC.

[33]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[34]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[35]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.