DocumentCode :
312856
Title :
Heuristics for ring network design when several types of switches are available
Author :
Chamberland, Steven ; Sansó, Brunilde ; Marcotte, Odile
Author_Institution :
Math. & Ind. Eng. Dept., Ecole Polytech., Montreal, Que., Canada
Volume :
2
fYear :
1997
fDate :
8-12 Jun 1997
Firstpage :
570
Abstract :
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
Keywords :
integer programming; network topology; search problems; subscriber loops; telecommunication switching; access networks; backbone network; communications network design; greedy heuristic; integer programming; optimal location; ring network design; switch sites; tabu search; user sites; Communication networks; Communication switching; Computer science; Costs; Industrial engineering; Mathematical model; Mathematics; Spine; Switches; Telecommunication switching;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 1997. ICC '97 Montreal, Towards the Knowledge Millennium. 1997 IEEE International Conference on
Conference_Location :
Montreal, Que.
Print_ISBN :
0-7803-3925-8
Type :
conf
DOI :
10.1109/ICC.1997.609853
Filename :
609853
Link To Document :
بازگشت