Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 48, No. 5, September-October 2000, pp. 745-760
DOI: 10.1287/opre.48.5.745.12412
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Chamberland, S.
Right arrow Articles by Marcotte, O.
Right arrow Search for Related Content

Topological Design of Two-Level Telecommunication Networks with Modular Switches

Steven Chamberland, Brunilde Sansò, Odile Marcotte

CRT and Department of Electrical Engineering, École de Technologie Supéerieure, 1100, Notre-Dame Ouest, Montréeal (Québec), Canada H3C 1K3
GERAD and Department of Electrical Engineering and Computer Engineering, École Polytechnique de Montréal, C.P. 6079 Succ. Centre-Ville, Montréal (Québec), Canada H3C 3A7
GERAD and Department of Computer Science, Université du Québec à Montréal, C.P. 8888 Succ. Centre-Ville, Montréal, (Québec), Canada H3C 3P8

steven{at}ele.etsmtl.ca
bruni{at}crt.umontreal.ca
odile{at}crt.umontreal.ca

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.

Subject classifications: Communications: topological network design.
History: Received May 1997; revision received July 1998; accepted January 1999.




This article has been cited by other articles:


Home page
INFORMS Journal on ComputingHome page
S. Chamberland and B. Sanso
On the Design Problem of Multitechnology Networks
INFORMS Journal on Computing, January 1, 2001; 13(3): 245 - 256.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2000 by INFORMS.