A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks

Tomoya Kitani, Masataka Yonedu, Nobuo Funabiki, Toru Nakanishi, Kiyohiko Okayama, Teruo Higashino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Wavelength Division Multiplexing (WDM) technology provides a wideband communication networks by realizing multiple communication channels with different wavelengths on a single optical fiber. In this technology, each node (wavelength router) has a finite number of transmitters/receivers dealing with different wavelengths, where each wavelength is exclusively used for the communication channel between a specific pair of nodes. Thus, some transmission request may require multiple wavelengths going through several nodes before reaching its destination. As a result, the wavelength assignment to nodes is very important for efficient transmission in WDM-based networks. Among regular wavelength assignment topologies, Bidirectional Manhattan Street Network (BMSN) gives high performance to WDM-based networks. In this paper, we present a two-stage heuristic algorithm for the wavelength assignment in BMSN, called a HIWAS (HIerarchical Wavelength Assignment algorithm for BMSN). The first stage of HIWAS finds an initial wavelength assignment hierarchically, not only to avoid a local minimum as best as possible but also to reduce the time complexity. The second stage improves the wavelength assignment by adopting the simulated annealing. The performance of HIWAS is verified through solving two types of random instances, where HIWAS provides a better solution with a shorter time than the best-known existing algorithm.

Original languageEnglish
Title of host publicationICON 2003 - 11th IEEE International Conference on Networks
PublisherIEEE Computer Society
Pages419-424
Number of pages6
ISBN (Print)0780377885, 9780780377882
DOIs
Publication statusPublished - 2003
Event11th IEEE International Conference on Networks, ICON 2003 - Sydney, NSW, Australia
Duration: Sep 28 2003Oct 1 2003

Publication series

NameIEEE International Conference on Networks, ICON
ISSN (Print)1556-6463

Other

Other11th IEEE International Conference on Networks, ICON 2003
CountryAustralia
CitySydney, NSW
Period9/28/0310/1/03

Keywords

  • BMSN
  • Heuristic algorithm
  • Hierarchical
  • NP-hard
  • WDM
  • Wavelength assignment

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Electrical and Electronic Engineering
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks'. Together they form a unique fingerprint.

  • Cite this

    Kitani, T., Yonedu, M., Funabiki, N., Nakanishi, T., Okayama, K., & Higashino, T. (2003). A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks. In ICON 2003 - 11th IEEE International Conference on Networks (pp. 419-424). (IEEE International Conference on Networks, ICON). IEEE Computer Society. https://doi.org/10.1109/icon.2003.1266227