CAJ | 학술논문

针对非结构化对等(P2P)网络中存在大量搭便车节点的问题，提出一种文件复制算法。将流行度较高的一些文件复制到包括搭便车节点在内的多个目标节点中，以增加文件的冗余度，复制文件操作完毕后，对所有目标节点执行更新贡献值操作。仿真实验结果表明，该算法可以迫使搭便车节点参与到网络资源共陟活动中，同时提高无结构 P2P 网络中文件的分布率和查询消息的命中率，达到抑制搭便车节点的目的。
침대비결구화대등(P2P)망락중존재대량탑편차절점적문제，제출일충문건복제산법。장류행도교고적일사문건복제도포괄탑편차절점재내적다개목표절점중，이증가문건적용여도，복제문건조작완필후，대소유목표절점집행경신공헌치조작。방진실험결과표명，해산법가이박사탑편차절점삼여도망락자원공척활동중，동시제고무결구 P2P 망락중문건적분포솔화사순소식적명중솔，체도억제탑편차절점적목적。
With the rapid development of unstructured Peer-to-Peer(P2P) network, there exists a lot of free-riding node problems. A kind of file replication algorithm is proposed. In this algorithm, many popular files are copied into nodes including the free-riders to increase the redundancy of files. When the operation of file replication is completed, all target nodes update their contribution values. The simulation experimental result shows that this algorithm not only can effectively force free-riders to take part in resource sharing, but also increase the distribution of the files and the hit rate of queries in unstructured P2P network. So it achieves the purpose of suppressing the free-riding.