Telecommunications Network Design

Telecommunications networks are fundamental in any telecommunications system. The network has to meet a number of criteria for the performance to be satisfactory. Hence, when designing the network, one may pose a number of optimization problems whose solutions give networks that are, in some sense, optimally designed. As the networks have become increasingly complex, the aid of optimization techniques has also become increasingly important. This is a vast area, and this chapter considers an overview of the issues that arise as well as a number of specific optimization models and problems. Often the problems may be formulated as mixed-integer linear programs. Due to problem size and problem structure, in many cases specially tailored solution techniques need to be used in order to solve, or approximately solve, the problems.

[1]  Yaakov Kogan,et al.  Dimensioning bandwidth for elastic traffic in high-speed data networks , 2000, TNET.

[2]  Marc Boisseau,et al.  High-speed networks , 1994, Wiley series in communication and distributed systems.

[3]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[6]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

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

[8]  K. Kilkki.  Differentiated Services for the Internet , 1999 .

[9]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

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

[11]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

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

[13]  Elena Yudovina,et al.  Stochastic networks , 1995, Physics Subject Headings (PhySH).

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

[15]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[16]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[17]  Prakash Mirchandani.  Projections of the capacitated network loading problem , 2000, Eur. J. Oper. Res..

[18]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[19]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[20]  Kevin C. Almeroth,et al.  IP Multicast Applications: Challenges and Solutions , 2001, RFC.

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

[22]  William Stallings,et al.  High-Speed Networks: TCP/IP and ATM Design Principles , 1998 .

[23]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[24]  Di Yuan,et al.  A Lagrangean approach to network design problems , 1998 .

[25]  Geir Dahl,et al.  The design of survivable directed networks , 1993, Telecommun. Syst..

[26]  Beau Williamson,et al.  Developing IP multicast networks , 1999 .

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

[28]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

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

[30]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[31]  T. Magnanti,et al.  Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .

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

[33]  T. Magnanti,et al.  A Dual-Based Algorithm for Multi-Level Network Design , 1994 .

[34]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .

[35]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

[36]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[37]  Anders Forsgren,et al.  Dimensioning multicast-enabled communications networks , 2002, Networks.

[38]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[39]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[40]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[41]  Arie Segev,et al.  Analysis of a flow problem with fixed charges , 1989, Networks.

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

[43]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[44]  John Moy.  Request for Comments 2328 , 1998 .

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

[46]  Stephen E. Deering,et al.  Host extensions for IP multicasting , 1986, RFC.

[47]  Zvi Drezner,et al.  Telecommunication and location , 2002 .