In this article we propose a mixed 0-1 linear programming model for the topological network design problem with modular switches such as the ones that will be used in ATM (Asynchronous Transfer Mode), Frame Relay and other broadband networks. The model includes the location of switches, their configuration with respect to ports and multiplexers, the design of an access network with a star topology and a backbone network with a fixed topology (ring or tree). In order to obtain a solution, we propose a greedy heuristic that provides a good starting solution and a tabu search heuristic to improve the solution. Finally, we present an example of the application of the heuristics and results for a set of randomly generated problems with up to 500 users and 30 potential switch sites. For the hundreds of problems generated, the tabu algorithm produced solutions that were, on average, within 1.5% of the optimal solution, and in the worst case within 4.95% of the optimal solution.
Published May 1997 , 35 pages
This cahier was revised in May 1999