ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "faf15fdb-001d-4b69-bc32-be19b6780f00"}, "_deposit": {"id": "10258", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "10258"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00010258", "sets": ["322"]}, "author_link": ["31081", "31082", "31083"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2008-08", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "6", "bibliographicPageEnd": "31", "bibliographicPageStart": "22", "bibliographicVolumeNumber": "26", "bibliographic_titles": [{"bibliographic_title": "Selected Areas in Communications", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "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 \u0027closeness\u0027 among wavelength paths to be assessed. By grouping \u0027close\u0027 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.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "DOI", "subitem_identifier_uri": "http://dx.doi.org/10.1109/JSACOCN.2008.030907"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/12078"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "IEEE", "subitem_publisher_language": "en"}]}, "item_10_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1109/JSACOCN.2008.030907", "subitem_relation_type_select": "DOI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "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 \u003cbr/\u003eIEEE 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 \u003cbr/\u003ecreating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0733-8716", "subitem_source_identifier_type": "PISSN"}]}, "item_10_text_14": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Yagyu, Isao", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "31081", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Hasegawa, Hiroshi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "31082", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sato, Ken-ichi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "31083", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "J_SAC_v26_n6_2008.pdf", "filesize": [{"value": "833.8 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 833800.0, "url": {"label": "J_SAC_v26_n6_2008.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/10258/files/J_SAC_v26_n6_2008.pdf"}, "version_id": "ae5d7819-b779-4824-9546-03a53bb127af"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Waveband", "subitem_subject_scheme": "Other"}, {"subitem_subject": "hierarchical optical path network", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Cartesian product space", "subitem_subject_scheme": "Other"}, {"subitem_subject": "network design algorithm", "subitem_subject_scheme": "Other"}, {"subitem_subject": "routing and wavelength assignment", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "An Efficient Hierarchical Optical Path Network Design Algorithm based on a Traffic Demand Expression in a Cartesian Product Space", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "An Efficient Hierarchical Optical Path Network Design Algorithm based on a Traffic Demand Expression in a Cartesian Product Space", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["322"], "permalink_uri": "http://hdl.handle.net/2237/12078", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2009-08-24"}, "publish_date": "2009-08-24", "publish_status": "0", "recid": "10258", "relation": {}, "relation_version_is_last": true, "title": ["An Efficient Hierarchical Optical Path Network Design Algorithm based on a Traffic Demand Expression in a Cartesian Product Space"], "weko_shared_id": -1}
  1. B200 工学部/工学研究科
  2. B200a 雑誌掲載論文
  3. 学術雑誌

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/12078
0d1522ae-aced-4d31-aea9-2806b4bd7c8b
名前 / ファイル ライセンス アクション
J_SAC_v26_n6_2008.pdf J_SAC_v26_n6_2008.pdf (833.8 kB)
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

WEKO 31081

en Yagyu, Isao

Search repository
Hasegawa, Hiroshi

× Hasegawa, Hiroshi

WEKO 31082

en Hasegawa, Hiroshi

Search repository
Sato, Ken-ichi

× Sato, Ken-ichi

WEKO 31083

en Sato, Ken-ichi

Search repository
アクセス権
アクセス権 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
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 19:32:51.786814
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3