On the design problem of multitechnology networks

被引:12
作者
Chamberland, S
Sansò, B
机构
[1] CRT, Montreal, PQ H3C 3A7, Canada
[2] Ecole Polytech, Montreal, PQ H3C 3A7, Canada
[3] Gerad, Montreal, PQ H3C 3A7, Canada
关键词
network design; multitechnology networks; tabu search; access network; backbone network;
D O I
10.1287/ijoc.13.3.245.12633
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this article we propose a model for the topological design problem of multitechnology networks that includes the location of switches and their port configuration, the design of an access network (with single and double access links) and a backbone network. The model specifically takes into account different types of modular switches where each type is characterized by its cost, its capacity in terms of the number of slots, and by its switch fabric capacity. The mutitechnology qualifier stems from the fact that several technologies and rates can be used in the access network. The proposed model is of the integer-programming variety, and in order to find a good solution, we propose a starting heuristic that provides an initial solution and the tabu-search algorithm to improve the solution. Lower bounds are proposed and used to assess the performance of the tabu-based approach. Numerical results for randomly generated problems with up to 500 clients and 50 potential switch sites are presented. The tabu-search algorithm produced solutions that were, on average, within 2.11% of the best lower bound.
引用
收藏
页码:245 / 256
页数:12
相关论文
共 12 条
[1]  
[Anonymous], 1997, TABU SEARCH
[2]   Topological design of two-level telecommunication networks with modular switches [J].
Chamberland, S ;
Sansò, B ;
Marcotte, O .
OPERATIONS RESEARCH, 2000, 48 (05) :745-760
[3]  
Chamberland S, 2000, NETWORKS, V36, P210, DOI 10.1002/1097-0037(200012)36:4<210::AID-NET2>3.0.CO
[4]  
2-Z
[5]  
CHAMBERLAND S, 1996, P INT IFIP IEEE C BR, P525
[6]  
*CPLEX OPT INC, 1998, US CPLEX CALL LIB
[7]   NEW INSERTION AND POSTOPTIMIZATION PROCEDURES FOR THE TRAVELING SALESMAN PROBLEM [J].
GENDREAU, M ;
HERTZ, A ;
LAPORTE, G .
OPERATIONS RESEARCH, 1992, 40 (06) :1086-1094
[8]  
HANDEL R, 1994, ATM NETWORKS CONCEPT
[9]   A SHORTEST AUGMENTING PATH ALGORITHM FOR DENSE AND SPARSE LINEAR ASSIGNMENT PROBLEMS [J].
JONKER, R ;
VOLGENANT, A .
COMPUTING, 1987, 38 (04) :325-340
[10]  
Klincewicz J. G., 1998, Location Science, V6, P307, DOI 10.1016/S0966-8349(98)00042-4