Heuristics for ring network design when several types of switches are available

We consider a model for communications network design that includes the optimal location of switches (of which there are several types) and the design of the access and backbone networks. The model is of the integer programming variety, and in order to find its solution, we propose a greedy heuristic that yields a good starting solution and a more sophisticated heuristic based on tabu search. Finally we present numerical results for problems including as much as 200 user sites and 20 potential switch sites.

[1]  Thomas L. Magnanti,et al.  Designing satellite communication networks by zero - one quadratic programming , 1989, Networks.

[2]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

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

[4]  G. Anandalingam,et al.  Optimization of resource location in hierarchical computer networks , 1990, Comput. Oper. Res..

[5]  Steven Chamberland,et al.  On the joint topological, dimensioning and location problem for broadband networks , 1996 .

[6]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[7]  Chang-ho Lee,et al.  Topological design of a two-level network with ring-star configuration , 1993, Comput. Oper. Res..

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

[9]  Steve Y. Chiu,et al.  A Branch and Cut Algorithm for a Steiner Tree-Star Problem , 1996, INFORMS J. Comput..

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

[11]  Andranik Mirzaian,et al.  Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds , 1985, Networks.

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

[13]  Jeffery L. Kennington,et al.  An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations , 1991, INFORMS J. Comput..

[14]  Kemal Altinkemer,et al.  Topological design of ring networks , 1994, Comput. Oper. Res..

[15]  Roshan Lal Sharma.  Network Topology Optimization , 1990 .

[16]  Sridhar Narashimhan.  Topological Design of Computer Communication Networks , 1987, Data Base.

[17]  Dong-Wan Tcha,et al.  Optimal design of a two-level hierarchical network with tree-star configuration , 1992 .

[18]  Hasan Pirkul,et al.  Computer and Database Location in Distributed Computer Systems , 1986, IEEE Transactions on Computers.

[19]  차동완,et al.  Optimal Design of a Distributed Network with a Two-Level Hierarchical Structure , 1990 .

[20]  B. Gavish.  Topological design of computer communication networks — The overall design problem , 1992 .

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