DocumentCode :
2732278
Title :
Tabu Search Algorithm for Two-Layer Networks Design Problem
Author :
Lenarski, Krzysztof ; Czajka, Bartosz ; Pozniak-Koszalka, Iwona ; Kasprzak, Andrzej
Author_Institution :
Dept. of Syst. & Comput. Networks, Wroclaw Univ. of Technol., Wroclaw
fYear :
2008
fDate :
19-21 Aug. 2008
Firstpage :
319
Lastpage :
324
Abstract :
This paper concerns tabu search approach for solving two-layer networks design problem. We present a modular case of two-layer network dimensioning in networks with non-bifurcated flows, what cause stated problem NP complete. Hardness of presented problem makes it impossible (for large networks) to attain optimal results with deterministic methods. An estimate solution may be reachable in satisfying time using heuristic methods. The main goal of this paper is to examine tabu search parameters and structures to achieve the best effect. To carry out researches we designed computer experimentation system. The created application allows to make simulations along with the complex experiments showing obtained results in convenient way utilizing presentation module. The results of research are shown on examples and discussed.
Keywords :
computational complexity; computer networks; search problems; NP complete; computer experimentation system; computer network; heuristic method; network dimensioning; nonbifurcated flows; tabu search; two-layer networks design; Algorithm design and analysis; Application software; Computational modeling; Computer network reliability; Computer networks; Design engineering; IP networks; Next generation networking; Sequences; Wavelength division multiplexing; computer network; experimentation system; optimization; tabu search;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems Engineering, 2008. ICSENG '08. 19th International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-0-7695-3331-5
Type :
conf
DOI :
10.1109/ICSEng.2008.34
Filename :
4616657
Link To Document :
بازگشت