DocumentCode :
1748549
Title :
Traffic grooming and light-path routing in WDM ring networks with hop-count constraint
Author :
Yoon, Moon-Gil
Author_Institution :
Hankuk Aviation Univ., Kyunggi-do, South Korea
Volume :
3
fYear :
2001
fDate :
2001
Firstpage :
731
Abstract :
This paper deals with a traffic grooming and light-path routing problem in WDM-ring networks, where the number of light-paths to be used for each traffic demand is restricted. With a network augmentation by adding a dummy node and a set of dummy arcs, we formulate the comprehensive problem as a mixed integer programming problem. Owing to the computational complexity, it is hard to find an optimal solution for a large-scale network within a reasonable computation time. Hence, we develop a heuristic algorithm to solve it with ease. Our heuristic generates good feasible solutions within a few seconds in computation time even for large-scale networks. The computational experiments show that the performance of the proposed heuristic is satisfactory in both the speed and the quality of the solutions generated
Keywords :
computational complexity; integer programming; optical fibre networks; telecommunication network routing; telecommunication traffic; wavelength division multiplexing; WDM-ring networks; computational complexity; dummy arcs; dummy node; heuristic algorithm; hop-count constraint; large-scale network; light-path routing; mixed integer programming problem; network augmentation; optical fiber networks; traffic demand; traffic grooming; Computer networks; High speed optical techniques; Intelligent networks; Large-scale systems; Optical fiber devices; Optical fibers; Routing; Telecommunication traffic; WDM networks; Wavelength division multiplexing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2001. ICC 2001. IEEE International Conference on
Conference_Location :
Helsinki
Print_ISBN :
0-7803-7097-1
Type :
conf
DOI :
10.1109/ICC.2001.937336
Filename :
937336
Link To Document :
بازگشت