Traffic grooming for minimizing wavelength usage in WDM networks

Author

Li, Deying ; Sun, Zhenqiang ; Jia, Xiaohua ; Makki, Sam

Author_Institution

Dept. of Comput. Sci., City Univ. of Hong Kong, China

fYear

2002

fDate

14-16 Oct. 2002

Firstpage

460

Lastpage

465

Abstract

We consider the traffic grooming problem on general topology WDM networks. The problem is: given a set of t connections and their routes, and the grooming factor g, to find an optimal wavelength assignment and grooming such that the number of wavelengths required in the network is minimized. We first formulate this problem as an integer linear programming problem, and then propose a heuristics method to solve it. Our simulation results show that an increase of 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 traffic; wavelength division multiplexing; WDM networks; general topology; grooming factor; heuristics method; integer linear programming problem; integer programming problem; traffic grooming; wavelength assignment; wavelength usage minimization; Add-drop multiplexers; Bandwidth; Heuristic algorithms; Integer linear programming; Intelligent networks; Network topology; Telecommunication traffic; WDM networks; Wavelength assignment; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 2002. Proceedings. Eleventh International Conference on

ISSN

1095-2055

Print_ISBN

0-7803-7553-X

Type

conf

DOI

10.1109/ICCCN.2002.1043106

Filename

1043106