Routing and wavelength assignment in optical networks from maximum edge-disjoint paths

Chia Chun Hsu, Hsun-Jung Cho, Shu Cherng Fang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

The routing and wavelength assignment (RWA) problem is NP-hard and also an important issue in wavelength-division multiplexing (WDM) optical networks. We propose an algorithm which is based on the maximum number of edge-disjoint paths (MEDP) to solve the RWA problem. The performance of the proposed method has been verified by experiments on several realistic network topologies.

Original languageEnglish
Title of host publicationGenetic and Evolutionary Computing - 7th International Conference on Genetic and Evolutionary Computing, ICGEC 2013, Proceedings
EditorsJeng-Shyang Pan, Pavel Krömer, Václav Snášel
PublisherSpringer Verlag
Pages95-103
Number of pages9
ISBN (Electronic)9783319017808
DOIs
StatePublished - 1 Jan 2014
Event7th International Conference on Genetic and Evolutionary Computing, ICGEC 2013 - Prague, Czech Republic
Duration: 25 Aug 201327 Aug 2013

Publication series

NameAdvances in Intelligent Systems and Computing
Volume238
ISSN (Print)2194-5357

Conference

Conference7th International Conference on Genetic and Evolutionary Computing, ICGEC 2013
CountryCzech Republic
CityPrague
Period25/08/1327/08/13

Keywords

  • Edge-disjoint paths
  • MEDP
  • Routing and wavelength assignment problem
  • RWA

Fingerprint Dive into the research topics of 'Routing and wavelength assignment in optical networks from maximum edge-disjoint paths'. Together they form a unique fingerprint.

Cite this