{"created":"2021-03-01T06:17:04.411162+00:00","id":10258,"links":{},"metadata":{"_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":["320:321: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 '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.","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 <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.","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","filename":"J_SAC_v26_n6_2008.pdf","filesize":[{"value":"833.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","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"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2009-08-24"},"publish_date":"2009-08-24","publish_status":"0","recid":"10258","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_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T03:56:06.160005+00:00"}