Two large-scale network design problems

Two Large-Scale Network Design Problems In this work we consider two large-scale network design problems arising in network routing and provisioning. The first problem combines long-term business and design decisions on large-scale telecommunication networks. The problem integrates different elements of network business planning such as capacity expansion, routing and protection and equipment maintenance as well as a complicated pricing model; which altogether make the optimization particularly hard. We propose a scalable optimization algorithm that exploits the structure of the model and produces a fast, high-quality solution. In the second part of this work we consider the maximum concurrent flow problem and analyze one of the first special-purpose approaches, proposed in 1971 by Fratta, Gerla and Kleinrock, and show that it yields a fully polynomial-time approximation scheme.

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

[2]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[3]  S. Ramamurthy,et al.  Survivable WDM Mesh Networks, Part II-Restoration , 1999 .

[4]  Itzhak Gilboa,et al.  Source Sink Flows with Capacity Installation in Batches , 1998, Discret. Appl. Math..

[5]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[6]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[7]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

[9]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[10]  Martin Grötschel,et al.  Cost-efficient network synthesis from leased lines , 1998, Ann. Oper. Res..

[11]  J. Cockcroft.  Investment in Science , 1962, Nature.

[12]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[13]  H. P. Williams.  THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[14]  D. Bienstock.  Approximately solving large-scale linear programs. I. Strengthening lower bounds and accelerating co , 1999 .

[15]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[16]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

[17]  Murti V. Salapaka,et al.  Operating mesh-survivable WDM transport networks , 2000, SPIE Optics East.

[18]  John Darzentas,et al.  Problem Complexity and Method Efficiency in Optimization , 1983 .

[19]  Thomas L. Magnanti,et al.  Shortest paths, single origin-destination network design, and associated polyhedra , 1993, Networks.

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

[21]  Willi Hock,et al.  Lecture Notes in Economics and Mathematical Systems , 1981 .

[22]  Leonid Khachiyan,et al.  Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..

[23]  Tomasz Radzik.  Fast deterministic approximation for the multicommodity flow problem , 1995, SODA '95.

[24]  I. P. Schagen,et al.  Statistics and operations research , 1986 .

[25]  David R. Karger,et al.  Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows , 1995, STOC '95.

[26]  Åke Björck,et al.  Numerical Methods , 1995, Handbook of Marine Craft Hydrodynamics and Motion Control.

[27]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

[28]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[29]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[30]  Qiong Wang,et al.  Optimal planning for optical transport networks , 2000, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[31]  Andrew V. Goldberg,et al.  An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow , 1998, IPCO.

[32]  Michael D. Grigoriadis,et al.  Approximate Lagrangian Decomposition with a Modified Karmarkar Logarithmic Potential , 1997 .

[33]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[34]  Iraj Saniee,et al.  Optimal Routing Designs in Self-healing Communications Networks , 1996 .

[35]  Martin Grötschel,et al.  Survivable mobile phone network architectures: models and solution methods , 1998 .

[36]  Laurence A. Wolsey,et al.  Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation , 1995, Discret. Appl. Math..

[37]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[38]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..

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

[40]  Gang Liu,et al.  SPIDER: A simple and flexible tool for design and provisioning of protected lightpaths in optical networks , 2001, Bell Labs Technical Journal.

[41]  S. Venkatesan,et al.  Spare capacity assignment in telecom networks using path restoration , 1995, MASCOTS '95. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[42]  R. Courant.  Variational methods for the solution of problems of equilibrium and vibrations , 1943 .

[43]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[44]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[45]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[46]  Murti V. Salapaka,et al.  Approaches for capacity and revenue optimization in survivable WDM networks , 2001, J. High Speed Networks.

[47]  Leonid Khachiyan,et al.  An exponential-function reduction method for block-angular convex programs , 1995, Networks.

[48]  C. Siva Ram Murthy,et al.  Efficient algorithms for routing dependable connections in WDM optical networks , 2001, TNET.

[49]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[50]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[51]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[52]  Karel Segeth,et al.  Numerical Methods in Linear Algebra , 1994 .

[53]  Philip N. Klein,et al.  On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms , 1999, SIAM J. Comput..

[54]  G. Dantzig,et al.  The decomposition algorithm for linear programming: notes on linear programming and extensions-part 57. , 1961 .

[55]  Martin Grötschel,et al.  Capacity and Survivability Models for Telecommunication Networks , 1997 .

[56]  W. Greub.  Linear Algebra , 1981 .

[57]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

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

[59]  Daniel Bienstock,et al.  Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .

[60]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[61]  Philip E. Gill,et al.  Numerical Linear Algebra and Optimization , 1991 .

[62]  Fillia Makedon,et al.  Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..

[63]  Krzysztof C. Kiwiel,et al.  An aggregate subgradient method for nonsmooth convex minimization , 1983, Math. Program..