Integer Programming Approaches to Access and Backbone IP Network Planning

In this article we study the problem of designing a nation-wide communication network. Such networks usually consist of an access layer, a backbone layer, and maybe several intermediate layers. The nodes of each layer must be connected to those of the next layer in a tree-like fashion. The backbone layer must satisfy survivability and IP-routing constraints.

[1]  George L. Nemhauser,et al.  Lifted cover facets of the 0-1 knapsack polytope with GUB constraints , 1994, Oper. Res. Lett..

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

[3]  M. Grötschel,et al.  Chapter 10 Design of survivable networks , 1995 .

[4]  Phuoc Tran-Gia,et al.  Fast heuristics for optimal routing in large IP networks , 2000 .

[5]  Walid Ben-Ameur,et al.  Internet Routing and Related Topology Issues , 2003, SIAM J. Discret. Math..

[6]  Mikael Prytz.  On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic , 2002 .

[7]  Mark S. Daskin,et al.  Capacitated facility location/network design problems , 2001, Eur. J. Oper. Res..

[8]  Dirk Staehle.  Towards an optimization of the routing parameters for IP networks , 2000 .

[9]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[10]  Thorsten Koch,et al.  Solving Steiner tree problems in graphs to optimality , 1998, Networks.

[11]  Alexander Martin.  Integer Programs with Block Structure , 1999 .

[12]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

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

[14]  Hervé Kerivin,et al.  Design of Survivable Networks: A survey , 2005 .

[15]  Jon Crowcroft,et al.  Analysis of shortest-path routing algorithms in a dynamic network environment , 1992, CCRV.

[16]  Thorsten Koch,et al.  Optimierung des G-WiN , 2000 .

[17]  Andreas Bley,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin a Lagrangian Approach for Integrated Network Design and Routing in Ip Networks a Lagrangian Approach for Integrated Network Design and Routing in Ip Networks * , 2022 .

[18]  R. Wessaly,et al.  Large-scale hierarchical networks: how to compute an optimal architecture? , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[19]  Kaj Holmberg,et al.  Optimization of Internet Protocol network design and routing , 2004 .

[20]  Martin Grötschel,et al.  Design of broadband virtual private networks: Model and heuristics for the B-WiN , 1998, Robust Communication Networks: Interconnection and Survivability.

[21]  Laurence A. Wolsey,et al.  Formulations and valid inequalities for the node capacitated graph partitioning problem , 1996, Math. Program..

[22]  Andreas Bley,et al.  Routing and Capacity Optimization for IP Networks , 2007, OR.

[23]  Karen Aardal,et al.  On the Two-Level Uncapacitated Facility Location Problem , 1996, INFORMS J. Comput..

[24]  Anja Feldmann,et al.  NetScope: traffic engineering for IP networks , 2000, IEEE Netw..

[25]  J. L. Wang,et al.  Minimax open shortest path first routing algorithms in networks supporting the SMDS service , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[26]  Roland Wunderling.  Paralleler und Objektorientierter Simplex , 1996 .

[27]  Mikkel Thorup,et al.  Survivable IP network design with OSPF routing , 2007 .

[28]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

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

[30]  E. Andrew Boyd,et al.  Polyhedral Results for the Precedence-Constrained Knapsack Problem , 1990, Discret. Appl. Math..

[31]  Andreas Bley,et al.  On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem , 2005, IPCO.

[32]  Wangsan-myun Yongin-gun,et al.  Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements , 2000 .

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

[34]  Leslie Hall,et al.  Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem , 1996, INFORMS J. Comput..

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

[36]  Celso C. Ribeiro,et al.  Design of Survivable Networks: A survey , 2005 .

[37]  Andreas Bley.  Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths , 2007 .

[38]  E. Balas,et al.  Facets of the Knapsack Polytope From Minimal Covers , 1978 .