WEKO3
アイテム
{"_buckets": {"deposit": "ee886528-d7d7-4849-8bff-b29b4a3398d1"}, "_deposit": {"id": "49348", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "49348"}, "status": "published"}, "_oai": {"id": "oai:tsukuba.repo.nii.ac.jp:00049348", "sets": ["1226", "2152", "7300"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2019-01", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "161", "bibliographicPageStart": "144", "bibliographicVolumeNumber": "31", "bibliographic_titles": [{"bibliographic_title": "Optical switching and networking"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Elastic optical networks with optical-orthogonal frequency division multiplexing have been addressed enthusiastically for communication networks in the last decade because they result in high bandwidth efficiency. Routing and spectrum allocation (RSA) problems need to be solved when we transmit demands in an elastic optical network. This research deals with static RSA models for anycast transmission, which is one-to-one-of-many transmission in inter-datacenter networks. Two static RSA optimization models are considered. One minimizes the maximum number of spectrum slots needed to allocate given demands. The other maximizes the traffic volume of demands served under a given spectrum slot number. For both models, lower and upper bounds are developed in order to obtain exact optimal solutions. One-side bounds of the problems are evaluated by relaxing spectrum continuity constraints. For the other side bounds, several greedy algorithms are investigated. We conducted computational experiments to confirm whether relaxation problems can give tight bounds and to determine greedy algorithmic behaviors by using each of route selection criterion and each of demand ordering policies. The results show that the solutions obtained by relaxing spectrum continuity constraints are almost optimal. They also indicate that exact optimal solutions are obtained efficiently by using these bounds.", "subitem_description_type": "Abstract"}]}, "item_5_publisher_27": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Elsevier"}]}, "item_5_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1016/j.osn.2018.10.008", "subitem_relation_type_select": "DOI"}}]}, "item_5_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/"}]}, "item_5_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_5_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "15734277", "subitem_source_identifier_type": "ISSN"}]}, "item_5_source_id_9": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA12017618", "subitem_source_identifier_type": "NCID"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "繁野, 麻衣子"}, {"creatorName": "シゲノ, マイコ", "creatorNameLang": "ja-Kana"}, {"creatorName": "SHIGENO, Maiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "457", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "40272687", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000040272687"}, {"nameIdentifier": "0000000846", "nameIdentifierScheme": "筑波大学研究者総覧", "nameIdentifierURI": "http://trios.tsukuba.ac.jp/researcher/0000000846"}]}, {"creatorNames": [{"creatorName": "吉瀬, 章子"}, {"creatorName": "ヨシセ, アキコ", "creatorNameLang": "ja-Kana"}, {"creatorName": "YOSHISE, Akiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "687", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "50234472", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000050234472"}, {"nameIdentifier": "0000000855", "nameIdentifierScheme": "筑波大学研究者総覧", "nameIdentifierURI": "http://trios.tsukuba.ac.jp/researcher/0000000855"}]}, {"creatorNames": [{"creatorName": "Miyagawa, Yasutaka", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "207004", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Watanabe, Yosuke", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "207005", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Ishii, Kiyo", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "207006", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Takefusa, Atsuko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "207007", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2021-02-01"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "OSN_31.pdf", "filesize": [{"value": "593.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_11", "mimetype": "application/pdf", "size": 593100.0, "url": {"label": "OSN_31", "url": "https://tsukuba.repo.nii.ac.jp/record/49348/files/OSN_31.pdf"}, "version_id": "fca13499-067b-494b-99b5-fd931b965332"}]}, "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": "Bounds for two static optimization problems on routing and spectrum allocation of anycasting", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Bounds for two static optimization problems on routing and spectrum allocation of anycasting"}]}, "item_type_id": "5", "owner": "1", "path": ["1226", "2152", "7300"], "permalink_uri": "http://hdl.handle.net/2241/00154819", "pubdate": {"attribute_name": "公開日", "attribute_value": "2019-03-11"}, "publish_date": "2019-03-11", "publish_status": "0", "recid": "49348", "relation": {}, "relation_version_is_last": true, "title": ["Bounds for two static optimization problems on routing and spectrum allocation of anycasting"], "weko_shared_id": 5}
Bounds for two static optimization problems on routing and spectrum allocation of anycasting
http://hdl.handle.net/2241/00154819
http://hdl.handle.net/2241/00154819bba25e80-c4ef-4290-b934-fce8312702cc
名前 / ファイル | ライセンス | アクション |
---|---|---|
OSN_31 (593.1 kB)
|
Item type | Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2019-03-11 | |||||
タイトル | ||||||
タイトル | Bounds for two static optimization problems on routing and spectrum allocation of anycasting | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
繁野, 麻衣子
× 繁野, 麻衣子× 吉瀬, 章子× Miyagawa, Yasutaka× Watanabe, Yosuke× Ishii, Kiyo× Takefusa, Atsuko |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | Elastic optical networks with optical-orthogonal frequency division multiplexing have been addressed enthusiastically for communication networks in the last decade because they result in high bandwidth efficiency. Routing and spectrum allocation (RSA) problems need to be solved when we transmit demands in an elastic optical network. This research deals with static RSA models for anycast transmission, which is one-to-one-of-many transmission in inter-datacenter networks. Two static RSA optimization models are considered. One minimizes the maximum number of spectrum slots needed to allocate given demands. The other maximizes the traffic volume of demands served under a given spectrum slot number. For both models, lower and upper bounds are developed in order to obtain exact optimal solutions. One-side bounds of the problems are evaluated by relaxing spectrum continuity constraints. For the other side bounds, several greedy algorithms are investigated. We conducted computational experiments to confirm whether relaxation problems can give tight bounds and to determine greedy algorithmic behaviors by using each of route selection criterion and each of demand ordering policies. The results show that the solutions obtained by relaxing spectrum continuity constraints are almost optimal. They also indicate that exact optimal solutions are obtained efficiently by using these bounds. | |||||
書誌情報 |
Optical switching and networking 巻 31, p. 144-161, 発行日 2019-01 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 15734277 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA12017618 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1016/j.osn.2018.10.008 | |||||
権利 | ||||||
権利情報 | © 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | |||||
著者版フラグ | ||||||
値 | author | |||||
出版者 | ||||||
出版者 | Elsevier |