@techreport{oai:ipsj.ixsq.nii.ac.jp:00226773,
 author = {Shan, Gao and Kohei, Ichikawa and Hajimu, Iida and Shan, Gao and Kohei, Ichikawa and Hajimu, Iida},
 issue = {9},
 month = {Jun},
 note = {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., 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.},
 title = {A node selection algorithm for hybrid peer-to-peer services based on a modified dueling-DQN model},
 year = {2023}
}