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 publicationIEEE International Conference on Networks, ICON
PublisherIEEE Computer Society
Pages419-424
Number of pages6
ISBN (Print)0780377885, 9780780377882
Publication statusPublished - 2003
Event11th IEEE International Conference on Networks, ICON 2003 - Sydney, NSW, Australia
Duration: Sep 28 2003Oct 1 2003

Other

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

Fingerprint

Wavelength division multiplexing
Wavelength
Broadband networks
Heuristic algorithms
Simulated annealing
Transceivers
Routers
Telecommunication networks
Optical fibers
Topology

Keywords

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

ASJC Scopus subject areas

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

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 IEEE International Conference on Networks, ICON (pp. 419-424). IEEE Computer Society.

A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks. / Kitani, Tomoya; Yonedu, Masataka; Funabiki, Nobuo; Nakanishi, Toru; Okayama, Kiyohiko; Higashino, Teruo.

IEEE International Conference on Networks, ICON. IEEE Computer Society, 2003. p. 419-424.

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

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 IEEE International Conference on Networks, ICON. IEEE Computer Society, pp. 419-424, 11th IEEE International Conference on Networks, ICON 2003, Sydney, NSW, Australia, 9/28/03.
Kitani T, Yonedu M, Funabiki N, Nakanishi T, Okayama K, Higashino T. A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks. In IEEE International Conference on Networks, ICON. IEEE Computer Society. 2003. p. 419-424
Kitani, Tomoya ; Yonedu, Masataka ; Funabiki, Nobuo ; Nakanishi, Toru ; Okayama, Kiyohiko ; Higashino, Teruo. / A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks. IEEE International Conference on Networks, ICON. IEEE Computer Society, 2003. pp. 419-424
@inproceedings{0b2062de149b4e2199e8970f9a22328a,
title = "A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks",
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.",
keywords = "BMSN, Heuristic algorithm, Hierarchical, NP-hard, Wavelength assignment, WDM",
author = "Tomoya Kitani and Masataka Yonedu and Nobuo Funabiki and Toru Nakanishi and Kiyohiko Okayama and Teruo Higashino",
year = "2003",
language = "English",
isbn = "0780377885",
pages = "419--424",
booktitle = "IEEE International Conference on Networks, ICON",
publisher = "IEEE Computer Society",
address = "United States",

}

TY - GEN

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

AU - Kitani, Tomoya

AU - Yonedu, Masataka

AU - Funabiki, Nobuo

AU - Nakanishi, Toru

AU - Okayama, Kiyohiko

AU - Higashino, Teruo

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - BMSN

KW - Heuristic algorithm

KW - Hierarchical

KW - NP-hard

KW - Wavelength assignment

KW - WDM

UR - http://www.scopus.com/inward/record.url?scp=9744229348&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=9744229348&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:9744229348

SN - 0780377885

SN - 9780780377882

SP - 419

EP - 424

BT - IEEE International Conference on Networks, ICON

PB - IEEE Computer Society

ER -