Solving routing and wavelength assignment problem with maximum edge-disjoint paths

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

The routing and wavelength assignment (RWA) problem in wave-length-division multiplexing optical networks is critically important for increasing the efficiency of wavelength-routed all-optical networks. Given the physical network structure and a set of connection requests, the problem aims to establishing routes for the requests and assigning a wavelength to each of them, subject to the wavelength continuous and wavelength clash constraints. The objective is to minimize he number of required wavelengths to satisfy all requests. The RWA problem was proven to be NP-hard and has been investigated for decades. In this paper, an algorithm based on the maximum edge-disjoint paths is proposed to tackle the RWA problem. Its performance is verified by experiments on some realistic network topologies. Compared with the state- of-the-art bin-packing based methods and the particle swarm optimization algorithm, the proposed method can find the best solution among all testing instances in reasonable computing time.

Original languageEnglish
Pages (from-to)1065-1084
Number of pages20
JournalJournal of Industrial and Management Optimization
Volume13
Issue number2
DOIs
StatePublished - 1 Apr 2017

Keywords

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

Fingerprint Dive into the research topics of 'Solving routing and wavelength assignment problem with maximum edge-disjoint paths'. Together they form a unique fingerprint.

Cite this