Abstract:
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.
Key words:
unstructured Peer-to-Peer(P2P) network,
free-riding,
file replication,
contribution values,
profit values,
load balancing
摘要： 针对非结构化对等(P2P)网络中存在大量搭便车节点的问题，提出一种文件复制算法。将流行度较高的一些文件复制到包括搭便车节点在内的多个目标节点中，以增加文件的冗余度，复制文件操作完毕后，对所有目标节点执行更新贡献值操作。仿真实验结果表明，该算法可以迫使搭便车节点参与到网络资源共享活动中，同时提高无结构P2P网络中文件的分布率和查询消息的命中率，达到抑制搭便车节点的目的。
关键词:
非结构化对等网络,
搭便车,
文件复制,
贡献值,
收益值,
负载均衡
CLC Number: