By Topic

Traffic grooming on general topology WDM networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Li, D. ; Dept. of Comput. Sci., City Univ. of Hong Kong, China ; Sun, Z. ; Jia, X. ; Makki, K.

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.

Published in:

Communications, IEE Proceedings-  (Volume:150 ,  Issue: 3 )