<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kobayashi, M.</style></author><author><style face="normal" font="default" size="100%">Kageyama, J.</style></author><author><style face="normal" font="default" size="100%">Shibusawa, S.</style></author><author><style face="normal" font="default" size="100%">Yonekura, T.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">File replication method based on demand forecasting of file download in P2P networks</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Digital Information Management</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">P2P file sharing</style></keyword><keyword><style  face="normal" font="default" size="100%">P2P networks</style></keyword><keyword><style  face="normal" font="default" size="100%">Replication</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2010</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.scopus.com/inward/record.url?eid=2-s2.0-79960687658&amp;partnerID=40&amp;md5=3db4c30b2db7743416ab3f4cb69524b3</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">8</style></volume><pages><style face="normal" font="default" size="100%">247 - 253</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In peer-to-peer (P2P) networks that support file-sharing services, the level of access demand can vary widely between different files. Since fewer nodes store files for which there is a lower demand, these files are more likely to be lost from the P2P networks if users leave the network or delete the files. File loss can cause users to seek alternatives to P2P services, and lead to degradation in service quality. We propose and evaluate a replication method based on demand forecasting that aims to prevent the loss of low-demand files. In this method, the number of file replicas to be placed is determined based on the forecast demand for the file, so that the loss of low-demand files is likely prevented by placing replicas at nodes that frequently use P2P services. Based on simulation results, we compared our proposed method with basic replication methods in terms of the number of files and the amount of storage used. Our experimental results show that the proposed method prevents file loss by preserving lowdemand files over extended periods of time. We also confirmed that the node storage resources consumed by this method are efficiently used.</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue><notes><style face="normal" font="default" size="100%">Export Date: 10 July 2014</style></notes></record></records></xml>