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

  • Authors:

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

  • Affiliations:

  • Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Toyonaka, 560-8531 Japan;Department of Communication Network Engineering, Okayama University, Okayama, 700-8530 Japan;Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Toyonaka, 560-8531 Japan;Department of Communication Network Engineering, Okayama University, Okayama, 700-8530 Japan;Department of Communication Network Engineering, Okayama University, Okayama, 700-8530 Japan;Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Toyonaka, 560-8531 Japan

  • Venue:
  • Systems and Computers in Japan
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(4): 74–83, 2007; Published online in Wiley InterScience (). DOI 10.1002/scj.10534