{"_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"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "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"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "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 \nlower 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_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": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "IEEE"}]}, "item_10_rights_12": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "Copyright \u00a9 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 \nIEEE endorsement of any of Nagoya University\u2019s 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 \ncreating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org."}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "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": "ISSN"}]}, "item_10_text_14": {"attribute_name": "\u30d5\u30a9\u30fc\u30de\u30c3\u30c8", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Yagyu, Isao"}], "nameIdentifiers": [{"nameIdentifier": "31081", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Hasegawa, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "31082", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sato, Ken-ichi"}], "nameIdentifiers": [{"nameIdentifier": "31083", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "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_free", "mimetype": "application/pdf", "size": 833800.0, "url": {"label": "J_SAC_v26_n6_2008.pdf", "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": "\u30ad\u30fc\u30ef\u30fc\u30c9", "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": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "An Efficient Hierarchical Optical Path Network\u3000Design Algorithm based on a Traffic Demand\u3000Expression in a Cartesian Product Space", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "An Efficient Hierarchical Optical Path Network\u3000Design Algorithm based on a Traffic Demand\u3000Expression in a Cartesian Product Space"}]}, "item_type_id": "10", "owner": "1", "path": ["320/321/322"], "permalink_uri": "http://hdl.handle.net/2237/12078", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "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\u3000Design Algorithm based on a Traffic Demand\u3000Expression in a Cartesian Product Space"], "weko_shared_id": null}