Traffic grooming for minimizing wavelength usage in WDM networks

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review

20 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationProceedings - International Conference on Computer Communications and Networks, ICCCN
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages460-465
Volume2002-January
ISBN (Print)78037553
Publication statusPublished - 2002

Publication series

Name
Volume2002-January
ISSN (Print)1095-2055

Conference

Title11th International Conference on Computer Communications and Networks, ICCCN 2002
PlaceUnited States
CityMiami
Period14 - 16 October 2002

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.

Research Area(s)

  • Add-drop multiplexers, Bandwidth, Heuristic algorithms, Integer linear programming, Intelligent networks, Network topology, Telecommunication traffic, Wavelength assignment, Wavelength division multiplexing, WDM networks

Citation Format(s)

Traffic grooming for minimizing wavelength usage in WDM networks. / Li, Deying; Sun, Zhenqiang; Jia, Xiaohua; Makki, Sam.

Proceedings - International Conference on Computer Communications and Networks, ICCCN. Vol. 2002-January Institute of Electrical and Electronics Engineers Inc., 2002. p. 460-465 1043106.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review