{"updated":"2025-01-19T12:24:19.058207+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00226773","sets":["1164:4088:11174:11292"]},"path":["11292"],"owner":"44499","recid":"226773","title":["A node selection algorithm for hybrid peer-to-peer services based on a modified dueling-DQN model"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-06-27"},"_buckets":{"deposit":"7d984a3f-6f0d-4661-9713-13f89ed91500"},"_deposit":{"id":"226773","pid":{"type":"depid","value":"226773","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"A node selection algorithm for hybrid peer-to-peer services based on a modified dueling-DQN model","author_link":["602898","602901","602900","602899","602902","602897"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A node selection algorithm for hybrid peer-to-peer services based on a modified dueling-DQN model"},{"subitem_title":"A node selection algorithm for hybrid peer-to-peer services based on a modified dueling-DQN model","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ネットワーク・トラフィック","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2023-06-27","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NARA Institute of Science and Technology"},{"subitem_text_value":"NARA Institute of Science and Technology"},{"subitem_text_value":"NARA Institute of Science and Technology"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NARA Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"NARA Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"NARA Institute of Science and Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/226773/files/IPSJ-IOT23062009.pdf","label":"IPSJ-IOT23062009.pdf"},"date":[{"dateType":"Available","dateValue":"2025-06-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IOT23062009.pdf","filesize":[{"value":"1.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"43"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"5bfa90a0-d551-45aa-a101-a88b1981f419","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shan, Gao"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kohei, Ichikawa"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hajimu, Iida"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shan, Gao","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kohei, Ichikawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hajimu, Iida","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"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":"Hybrid Peer to Peer (P2P) file sharing combines centralized and decentralized architectures, where a central server maintains the node list while data is transferred in a P2P manner. The hybrid P2P structure allows each node to decide from which node to download data, but this can result in slower and inefficient data exchange. To address this issue, some P2P file sharing networks like BitTorrent use the Tit-for-Tat (TFT) algorithm, which selects nodes based on their past interactions. However, TFT may not work effectively under rapidly changing network conditions. In this paper, we propose a modified node selection algorithm based on the dueling DQN model, which considers real-time states. The central server maintains node addresses and collects real-time status information such as CPU, memory utilization, and network latency. The modified dueling DQN model returns the node with the highest overall rating, and data is downloaded from the selected node. The results show that our proposed model is able to achieve almost the same download time as the TFT algorithm, while our model can adapt to the network environment faster than the TFT algorithm when the network latency fluctuates significantly.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Hybrid Peer to Peer (P2P) file sharing combines centralized and decentralized architectures, where a central server maintains the node list while data is transferred in a P2P manner. The hybrid P2P structure allows each node to decide from which node to download data, but this can result in slower and inefficient data exchange. To address this issue, some P2P file sharing networks like BitTorrent use the Tit-for-Tat (TFT) algorithm, which selects nodes based on their past interactions. However, TFT may not work effectively under rapidly changing network conditions. In this paper, we propose a modified node selection algorithm based on the dueling DQN model, which considers real-time states. The central server maintains node addresses and collects real-time status information such as CPU, memory utilization, and network latency. The modified dueling DQN model returns the node with the highest overall rating, and data is downloaded from the selected node. The results show that our proposed model is able to achieve almost the same download time as the TFT algorithm, while our model can adapt to the network environment faster than the TFT algorithm when the network latency fluctuates significantly.","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":"2023-06-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"2023-IOT-62"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:26:06.065617+00:00","id":226773,"links":{}}