{"links":{},"id":2009653,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:02009653","sets":["1164:4088:1771221559804:1777431367596"]},"path":["1777431367596"],"owner":"80578","recid":"2009653","title":["マルチプロバイダ光ネットワークにおけるパス計算のための経路選択の逐次最適化手法の検討"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2026-05-21"},"_buckets":{"deposit":"3fbf986d-4bd3-47b1-8a60-3ecd265d046c"},"_deposit":{"id":"2009653","pid":{"type":"depid","value":"2009653","revision_id":0},"owners":[80578],"status":"published","created_by":80578},"item_title":"マルチプロバイダ光ネットワークにおけるパス計算のための経路選択の逐次最適化手法の検討","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"マルチプロバイダ光ネットワークにおけるパス計算のための経路選択の逐次最適化手法の検討","subitem_title_language":"ja"},{"subitem_title":"A Study on Sequential Optimization Method for Route Selection in Path Computation in Multi-Provider Optical Networks","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ICM","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2026-05-21","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"株式会社KDDI総合研究所"},{"subitem_text_value":"株式会社KDDI総合研究所"},{"subitem_text_value":"株式会社KDDI総合研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"KDDI Research, Inc.","subitem_text_language":"en"},{"subitem_text_value":"KDDI Research, Inc.","subitem_text_language":"en"},{"subitem_text_value":"KDDI Research, Inc.","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/2009653/files/IPSJ-IOT26073008.pdf","label":"IPSJ-IOT26073008.pdf"},"date":[{"dateType":"Available","dateValue":"9999-01-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IOT26073008.pdf","filesize":[{"value":"822.4 KB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"43"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"46529667-2aed-4f75-a970-5ed0de25a578","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2026 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"今田,丈雅"}]},{"creatorNames":[{"creatorName":"福元,徳広"}]},{"creatorNames":[{"creatorName":"宮坂,拓也"}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takemasa Imada","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Norihiro Fukumoto","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Takuya Miyasaka","creatorNameLang":"en"}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12326962","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8787","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"複数事業者が連携するマルチドメイン光ネットワークでは，機密性の観点から各事業者ドメインの資源可用性情報の共有が制限される場合があり，パス計算効率の低下が課題となる．本研究では，抽象トポロジに基づいて生成された候補経路群に対し，光パスの開通成否のみを観測対象として候補探索順序を逐次学習する，パス単位トンプソンサンプリング（P-TS）方式を検討する．要求到着数を100,000件，呼量を100-160 Erlangとしたシミュレーション評価において，P-TSが代表的なヒューリスティック手法であるKSP-FFよりブロッキング確率が低く，最大で10.62%のブロッキング確率の改善が得られることを確認した．また，平均試行回数についても，上記の要求到着数と負荷条件において，P-TSがKSP-FFよりも回数が抑えられることを確認した．以上より，事業者ドメインがオーケストレータに資源可用性情報を共有しない条件でも，十分な観測データがあればパス単位の逐次学習によるブロッキング確率と平均試行回数の改善が可能であることを示した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In multi-domain optical networks involving multiple collaborating operators, confidentiality constraints may limit the sharing of intra-domain resource availability, which in turn degrades path computation efficiency. In this study, we investigate a path-based Thompson Sampling (P-TS) approach that sequentially learns the order in which to attempt candidate paths derived from abstract topologies, using only the success or failure of optical path establishment as observable feedback. Simulation results show that, with 100,000 connection requests, P-TS achieves a lower blocking probability than the representative heuristic KSP-FF for offered loads between 100 and 160 Erlang, with a maximum blocking probability reduction of 10.62%. We also confirm that, under the same request volume and load conditions, P-TS requires fewer path setup attempts on average than KSP-FF. These results indicate that, even when operator domains do not expose resource availability information to the orchestrator and only limited feedback is observable, sequential path-based learning can reduce both blocking probability and the average number of setup attempts, provided that a sufficient number of samples are available.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告インターネットと運用技術（IOT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2026-05-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"2026-IOT-73"}]},"relation_version_is_last":true,"weko_creator_id":"80578"},"created":"2026-05-14T07:16:36.511555+00:00","updated":"2026-05-14T07:16:44.436069+00:00"}