WEKO3
アイテム
An Efficient Hierarchical Optical Path Network Design Algorithm based on a Traffic Demand Expression in a Cartesian Product Space
http://hdl.handle.net/2237/12078
http://hdl.handle.net/2237/120780d1522ae-aced-4d31-aea9-2806b4bd7c8b
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2009-08-24 | |||||
タイトル | ||||||
タイトル | An Efficient Hierarchical Optical Path Network Design Algorithm based on a Traffic Demand Expression in a Cartesian Product Space | |||||
言語 | en | |||||
著者 |
Yagyu, Isao
× Yagyu, Isao× Hasegawa, Hiroshi× Sato, Ken-ichi |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
権利 | ||||||
言語 | en | |||||
権利情報 | 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. | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Waveband | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | hierarchical optical path network | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Cartesian product space | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | network design algorithm | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 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. | |||||
言語 | en | |||||
内容記述タイプ | Abstract | |||||
出版者 | ||||||
言語 | en | |||||
出版者 | IEEE | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプresource | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
出版タイプ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
DOI | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1109/JSACOCN.2008.030907 | |||||
ISSN | ||||||
収録物識別子タイプ | PISSN | |||||
収録物識別子 | 0733-8716 | |||||
書誌情報 |
en : Selected Areas in Communications 巻 26, 号 6, p. 22-31, 発行日 2008-08 |
|||||
フォーマット | ||||||
application/pdf | ||||||
著者版フラグ | ||||||
値 | publisher | |||||
URI | ||||||
識別子 | http://dx.doi.org/10.1109/JSACOCN.2008.030907 | |||||
識別子タイプ | DOI | |||||
URI | ||||||
識別子 | http://hdl.handle.net/2237/12078 | |||||
識別子タイプ | HDL |