{"_buckets": {"deposit": "c839fb04-5669-414c-a2a7-59b1bc65e2ec"}, "_deposit": {"id": "18650", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "18650"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00018650"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2013-04", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "4", "bibliographicPageEnd": "966", "bibliographicPageStart": "956", "bibliographicVolumeNumber": "E96B", "bibliographic_titles": [{"bibliographic_title": "IEICE TRANSACTIONS on Communications"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "We propose an efficient network design algorithm that realizes shared protection. The algorithm iteratively improves the degree of wavelength resource usage and fiber utilization. To achieve this, we newly define two metrics to evaluate the degree of wavelength resource usage of a pair of working/backup paths and the fiber utilization efficiency. The proposed method iteratively redesigns groups of paths that are selected in the order determined by the metrics. A numerical analysis verifies that the proposed algorithm can substantially reduce the required wavelength resources and hence fiber cost. It is also verified that the computational complexity of the proposed algorithm is small enough to terminate within practicable time.", "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.1587/transcom.E96.B.956"}, {"subitem_identifier_type": "URI", "subitem_identifier_uri": "https://search.ieice.org/"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/20747"}]}, "item_10_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "\u96fb\u5b50\u60c5\u5831\u901a\u4fe1\u5b66\u4f1a"}]}, "item_10_rights_12": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "\u00a9 2013 IEICE"}]}, "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": "0916-8516", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "SATO, Masakazu"}], "nameIdentifiers": [{"nameIdentifier": "54271", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "HASEGAWA, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "54272", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SATO, Ken-ichi"}], "nameIdentifiers": [{"nameIdentifier": "54273", "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-21"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "e96-b_4_956.pdf", "filesize": [{"value": "4.0 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 4000000.0, "url": {"label": "e96-b_4_956.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/18650/files/e96-b_4_956.pdf"}, "version_id": "5b34def0-eb3e-48cc-abc4-d5c9dd6965c8"}]}, "item_keyword": {"attribute_name": "\u30ad\u30fc\u30ef\u30fc\u30c9", "attribute_value_mlt": [{"subitem_subject": "optical path network", "subitem_subject_scheme": "Other"}, {"subitem_subject": "routing and wavelength assignment", "subitem_subject_scheme": "Other"}, {"subitem_subject": "shared protection", "subitem_subject_scheme": "Other"}, {"subitem_subject": "iterative re-optimization", "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": "Efficient Shared Protection Network Design Algorithm that Iterates Path Relocation with New Resource Utilization Metrics", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Efficient Shared Protection Network Design Algorithm that Iterates Path Relocation with New Resource Utilization Metrics"}]}, "item_type_id": "10", "owner": "1", "path": ["320/321/322"], "permalink_uri": "http://hdl.handle.net/2237/20747", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_name_i18n": "\u516c\u958b\u65e5", "attribute_value": "2014-11-10"}, "publish_date": "2014-11-10", "publish_status": "0", "recid": "18650", "relation": {}, "relation_version_is_last": true, "title": ["Efficient Shared Protection Network Design Algorithm that Iterates Path Relocation with New Resource Utilization Metrics"], "weko_shared_id": null}