scispace - formally typeset
Journal ArticleDOI

Topological Design of Two-Level Telecommunication Networks with Modular Switches

Steven Chamberland, +2 more
- 15 Sep 2000 - 
- Vol. 48, Iss: 5, pp 745-760
TLDR
This article proposes a mixed 0-1 linear programming model for the topological network design problem with modular switches such as the ones used in asynchronous transfer mode (ATM) frame relay and other broadband networks, and proposes a greedy heuristic that provides a good starting solution, and a tabu search heuristic to improve the solution.
Abstract
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 asynchronous transfer mode (ATM) 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). 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.

read more

Citations
More filters
Journal ArticleDOI

Integrated service network design for a cross-docking supply chain network

TL;DR: This paper considers an integrated service network design problem for a given set of freight demands that is concerned with integration of locating cross-docking (CD) centers and allocating vehicles for the associated direct (transportation) services from origin node to a CD centers or from a CD center to the destination node.
Journal ArticleDOI

Solving the hub location problem with modular link capacities

TL;DR: This paper deals with a capacitated hub location problem arising in the design of telecommunications networks and presents an exact and a heuristic method to investigate whether it is possible to improve the results within limited computational times.
Journal ArticleDOI

Solving the Hub location problem in telecommunication network design: A local search approach

TL;DR: In this article, a local search approach is proposed, and different metaheuristic algorithms, such as tabu search, iterated local search and random multistart, have been developed, based on such local search.
Journal ArticleDOI

Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation

TL;DR: Four variations of the ant colony optimisation meta-heuristic that explore different construction modelling choices are developed and reveal that each of the approaches can return optimal solution costs in a reasonable amount of computational time.
Journal ArticleDOI

Topological design and dimensioning of agile all-photonic networks

TL;DR: Key findings include the determination of near cost optimal designs for both metropolitan and Canadian wide area network networks, and the cost and topology sensitivity to the selector switch size and the preferred size in terms of port count and number of switches.
References
More filters
Book

Computers and Intractability: A Guide to the Theory of NP-Completeness

TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI

Tabu Search—Part II

TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Book

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

TL;DR: In this paper, Johnson and Papadimitriou proposed a performance guarantee for heuristics, based on the notion of well-solved special cases (P. Gilmore, et al.).
Journal ArticleDOI

Network Design and Transportation Planning: Models and Algorithms

TL;DR: It is shown that many of the most celebrated combinatorial problems that arise in transportation planning are specializations and variations of a generic design model, Consequently, the network design concepts described in this paper have great potential application in a wide range of problem settings.