DocumentCode
747664
Title
Traffic grooming on general topology WDM networks
Author
Li, D. ; Sun, Z. ; Jia, X. ; Makki, K.
Author_Institution
Dept. of Comput. Sci., City Univ. of Hong Kong, China
Volume
150
Issue
3
fYear
2003
fDate
6/1/2003 12:00:00 AM
Firstpage
197
Lastpage
201
Abstract
The authors consider the traffic grooming problem on general topology WDM networks. The problem is: given a set of t connections, their routes and the grooming factor g, find an optimal wavelength assignment and grooming such that the number of wavelengths required in the network is minimised. This problem is first formulated as an integer linear programming problem, and then a heuristic is proposed to solve it. The simulation results show that increasing the grooming factor can considerably decrease the number of wavelengths required in the system.
Keywords
integer programming; linear programming; network topology; optical fibre networks; telecommunication network routing; telecommunication traffic; wavelength division multiplexing; bandwidth management; general topology WDM networks; integer linear programming; network routing; optimal wavelength assignment; simulation results; traffic grooming; undirected graph; wavelength-division multiplexing;
fLanguage
English
Journal_Title
Communications, IEE Proceedings-
Publisher
iet
ISSN
1350-2425
Type
jour
DOI
10.1049/ip-com:20030272
Filename
1214611
Link To Document