A node configuration algorithm with bandwidth bottleneck resolution for WDM ring networks

Megumi Isogai, Nobuo Funabiki, Toru Nakanishi, Yosuke Isshiki

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The wavelength-division multiplexing (WDM) technology has been extensively studied and actually deployed as a key technology to solve global information explosions by multiplexing plural signal paths using different wavelengths into one optical fiber. Among WDM-based network architectures, this article focuses on a double-ring one for a next-generation metropolitan area network (MAN), where each node is normally equipped with two pairs of fast-tunable transmitters and wavelength-fixed receivers (TT-FR) as interface to two fibers. To enhance the network performance, additional transmitters/receivers at nodes and receiver wavelengths should be assigned optimally, so that the bandwidth bottleneck can be resolved both on nodes and fiber links. This article formulates this node configuration problem with bandwidth bottleneck resolution as a combinatorial optimization problem, and proves the NP-completeness of its decision version. Then, it presents the two-phase heuristic algorithm composed of a greedy method and a variable depth search (VDS) method. Our algorithm is evaluated through extensive network simulations, where the results support the effectiveness of this joint assignment approach.

Original languageEnglish
Pages (from-to)218-226
Number of pages9
JournalPhotonic Network Communications
Volume18
Issue number2
DOIs
Publication statusPublished - Oct 1 2009

    Fingerprint

Keywords

  • Bandwidth bottleneck resolution
  • NP-complete
  • Node configuration
  • Simulation
  • VDS algorithm
  • WDM ring network
  • Wavelength assignment

ASJC Scopus subject areas

  • Software
  • Atomic and Molecular Physics, and Optics
  • Hardware and Architecture
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this