Proposal of a hierarchical heuristic algorithm for node assignment in bidirectional manhattan street networks

Masataka Yonezu, Nobuo Funabiki, Tomoya Kitani, Tokumi Yokohira, Toru Nakanishi, Teruo Higashino

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In wavelength division multiplexing (WDM) technology, high-speed large-capacity communication is realized by transmitting multiple optical signals with different wavelengths in parallel on an optical fiber. In WDM technology, the logical topology of the network can generally be modified by changing the wavelength assignment to the transmitters and receivers. Thus it is important to develop an algorithm that derives the wavelength assignment that maximizes the transmission efficiency of the network. This paper considers a bidirectional Manhattan street network which has a regular topology, and proposes a hierarchical two-stage heuristic algorithm. In the first stage, the initial solution is derived by hierarchical region division and node assignment to the regions. In the second stage, the solution is improved by simulated annealing (SA). The proposed algorithm is evaluated by simulations of random instances and instances for which optimal solutions are already known. The effectiveness of the proposed algorithm is demonstrated through comparisons to the existing one.

Original languageEnglish
Pages (from-to)74-83
Number of pages10
JournalSystems and Computers in Japan
Volume38
Issue number4
DOIs
Publication statusPublished - Apr 2007

Fingerprint

Heuristic algorithms
Wavelength Assignment
Heuristic algorithm
Division
Assignment
Wavelength
Multiplexing
Wavelength division multiplexing
Vertex of a graph
Topology
Simulated annealing
Simulated Annealing
Transmitter
Optical Fiber
Optical fibers
Transmitters
High Speed
Receiver
Optimal Solution
Maximise

Keywords

  • Heuristic algorithm
  • Hierarchical structure
  • Manhattan street network
  • Node assignment
  • Wavelength division multiplexing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Proposal of a hierarchical heuristic algorithm for node assignment in bidirectional manhattan street networks. / Yonezu, Masataka; Funabiki, Nobuo; Kitani, Tomoya; Yokohira, Tokumi; Nakanishi, Toru; Higashino, Teruo.

In: Systems and Computers in Japan, Vol. 38, No. 4, 04.2007, p. 74-83.

Research output: Contribution to journalArticle

@article{9ffdd0b67db3484991e6d6a123e4a85e,
title = "Proposal of a hierarchical heuristic algorithm for node assignment in bidirectional manhattan street networks",
abstract = "In wavelength division multiplexing (WDM) technology, high-speed large-capacity communication is realized by transmitting multiple optical signals with different wavelengths in parallel on an optical fiber. In WDM technology, the logical topology of the network can generally be modified by changing the wavelength assignment to the transmitters and receivers. Thus it is important to develop an algorithm that derives the wavelength assignment that maximizes the transmission efficiency of the network. This paper considers a bidirectional Manhattan street network which has a regular topology, and proposes a hierarchical two-stage heuristic algorithm. In the first stage, the initial solution is derived by hierarchical region division and node assignment to the regions. In the second stage, the solution is improved by simulated annealing (SA). The proposed algorithm is evaluated by simulations of random instances and instances for which optimal solutions are already known. The effectiveness of the proposed algorithm is demonstrated through comparisons to the existing one.",
keywords = "Heuristic algorithm, Hierarchical structure, Manhattan street network, Node assignment, Wavelength division multiplexing",
author = "Masataka Yonezu and Nobuo Funabiki and Tomoya Kitani and Tokumi Yokohira and Toru Nakanishi and Teruo Higashino",
year = "2007",
month = "4",
doi = "10.1002/scj.10534",
language = "English",
volume = "38",
pages = "74--83",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "4",

}

TY - JOUR

T1 - Proposal of a hierarchical heuristic algorithm for node assignment in bidirectional manhattan street networks

AU - Yonezu, Masataka

AU - Funabiki, Nobuo

AU - Kitani, Tomoya

AU - Yokohira, Tokumi

AU - Nakanishi, Toru

AU - Higashino, Teruo

PY - 2007/4

Y1 - 2007/4

N2 - In wavelength division multiplexing (WDM) technology, high-speed large-capacity communication is realized by transmitting multiple optical signals with different wavelengths in parallel on an optical fiber. In WDM technology, the logical topology of the network can generally be modified by changing the wavelength assignment to the transmitters and receivers. Thus it is important to develop an algorithm that derives the wavelength assignment that maximizes the transmission efficiency of the network. This paper considers a bidirectional Manhattan street network which has a regular topology, and proposes a hierarchical two-stage heuristic algorithm. In the first stage, the initial solution is derived by hierarchical region division and node assignment to the regions. In the second stage, the solution is improved by simulated annealing (SA). The proposed algorithm is evaluated by simulations of random instances and instances for which optimal solutions are already known. The effectiveness of the proposed algorithm is demonstrated through comparisons to the existing one.

AB - In wavelength division multiplexing (WDM) technology, high-speed large-capacity communication is realized by transmitting multiple optical signals with different wavelengths in parallel on an optical fiber. In WDM technology, the logical topology of the network can generally be modified by changing the wavelength assignment to the transmitters and receivers. Thus it is important to develop an algorithm that derives the wavelength assignment that maximizes the transmission efficiency of the network. This paper considers a bidirectional Manhattan street network which has a regular topology, and proposes a hierarchical two-stage heuristic algorithm. In the first stage, the initial solution is derived by hierarchical region division and node assignment to the regions. In the second stage, the solution is improved by simulated annealing (SA). The proposed algorithm is evaluated by simulations of random instances and instances for which optimal solutions are already known. The effectiveness of the proposed algorithm is demonstrated through comparisons to the existing one.

KW - Heuristic algorithm

KW - Hierarchical structure

KW - Manhattan street network

KW - Node assignment

KW - Wavelength division multiplexing

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

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

U2 - 10.1002/scj.10534

DO - 10.1002/scj.10534

M3 - Article

AN - SCOPUS:34247373912

VL - 38

SP - 74

EP - 83

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 4

ER -