ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_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", "sets": ["322"]}, "author_link": ["54271", "54272", "54273"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "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", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "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_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.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": "出版者", "attribute_value_mlt": [{"subitem_publisher": "電子情報通信学会", "subitem_publisher_language": "ja"}]}, "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.1587/transcom.E96.B.956", "subitem_relation_type_select": "DOI"}}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://search.ieice.org/", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© 2013 IEICE", "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": "0916-8516", "subitem_source_identifier_type": "PISSN"}]}, "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": "SATO, Masakazu", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "54271", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "HASEGAWA, Hiroshi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "54272", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SATO, Ken-ichi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "54273", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "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_note", "mimetype": "application/pdf", "size": 4000000.0, "url": {"label": "e96-b_4_956.pdf", "objectType": "fulltext", "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": "キーワード", "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": "言語", "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": "Efficient Shared Protection Network Design Algorithm that Iterates Path Relocation with New Resource Utilization Metrics", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Efficient Shared Protection Network Design Algorithm that Iterates Path Relocation with New Resource Utilization Metrics", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["322"], "permalink_uri": "http://hdl.handle.net/2237/20747", "pubdate": {"attribute_name": "PubDate", "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": -1}
  1. B200 工学部/工学研究科
  2. B200a 雑誌掲載論文
  3. 学術雑誌

Efficient Shared Protection Network Design Algorithm that Iterates Path Relocation with New Resource Utilization Metrics

http://hdl.handle.net/2237/20747
http://hdl.handle.net/2237/20747
6e08fbaa-1f36-4f0e-aa1b-677c051ab19c
名前 / ファイル ライセンス アクション
e96-b_4_956.pdf e96-b_4_956.pdf (4.0 MB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2014-11-10
タイトル
タイトル Efficient Shared Protection Network Design Algorithm that Iterates Path Relocation with New Resource Utilization Metrics
言語 en
著者 SATO, Masakazu

× SATO, Masakazu

WEKO 54271

en SATO, Masakazu

Search repository
HASEGAWA, Hiroshi

× HASEGAWA, Hiroshi

WEKO 54272

en HASEGAWA, Hiroshi

Search repository
SATO, Ken-ichi

× SATO, Ken-ichi

WEKO 54273

en SATO, Ken-ichi

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 en
権利情報 © 2013 IEICE
キーワード
主題Scheme Other
主題 optical path network
キーワード
主題Scheme Other
主題 routing and wavelength assignment
キーワード
主題Scheme Other
主題 shared protection
キーワード
主題Scheme Other
主題 iterative re-optimization
抄録
内容記述 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.
言語 en
内容記述タイプ Abstract
出版者
言語 ja
出版者 電子情報通信学会
言語
言語 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.1587/transcom.E96.B.956
関連情報
関連タイプ isVersionOf
識別子タイプ URI
関連識別子 https://search.ieice.org/
ISSN
収録物識別子タイプ PISSN
収録物識別子 0916-8516
書誌情報 en : IEICE TRANSACTIONS on Communications

巻 E96B, 号 4, p. 956-966, 発行日 2013-04
著者版フラグ
値 publisher
URI
識別子 http://dx.doi.org/10.1587/transcom.E96.B.956
識別子タイプ DOI
URI
識別子 https://search.ieice.org/
識別子タイプ URI
URI
識別子 http://hdl.handle.net/2237/20747
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 16:34:32.629698
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