2024-03-28T18:27:22Z
https://nagoya.repo.nii.ac.jp/oai
oai:nagoya.repo.nii.ac.jp:00010258
2023-01-16T03:56:06Z
320:321:322
An Efficient Hierarchical Optical Path Network Design Algorithm based on a Traffic Demand Expression in a Cartesian Product Space
Yagyu, Isao
Hasegawa, Hiroshi
Sato, Ken-ichi
open access
Copyright © 2008 IEEE. Reprinted from Selected Areas in Communications. v.26, n.6, Supplement, 2008, p. 22-31. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply <br/>IEEE endorsement of any of Nagoya University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for <br/>creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.
Waveband
hierarchical optical path network
Cartesian product space
network design algorithm
routing and wavelength assignment
We propose a hierarchical optical path network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesian product space that allows the 'closeness' among wavelength paths to be assessed. By grouping 'close' wavelength paths, found by searching for clusters in the space, we iteratively create waveband paths that efficiently accommodate the wavelength paths. Numerical experiments demonstrate that the proposed algorithm offers lower total network cost than the conventional algorithms. The results also show that the hierarchical optical path network is effective even when traffic demand is relatively small.
IEEE
2008-08
eng
journal article
VoR
http://hdl.handle.net/2237/12078
https://nagoya.repo.nii.ac.jp/records/10258
https://doi.org/10.1109/JSACOCN.2008.030907
0733-8716
Selected Areas in Communications
26
6
22
31
https://nagoya.repo.nii.ac.jp/record/10258/files/J_SAC_v26_n6_2008.pdf
application/pdf
833.8 kB
2018-02-20