Duplicate copy method for unstructured peer-to-peer (P2P) network

Abstract

The invention relates to the technical field of peer-to-peer (P2P) networks, in particular to a duplicate copy method for an unstructured peer-to-peer (P2P) network, which comprises the following steps of: firstly, determining popular files to be copied in the searching process according to the visit frequency of files, then, calculating the average cost of a middle transfer node corresponding to an inquiry starting node according to the visit frequency difference of the inquiry starting node, and copying the popular files onto the nodes with the smallest cost under the condition of limited storage space of each node. The method provided by the invention solves the problem of too great visit consumption caused by the popular files in a P2P system, the searching delay of the popular files is reduced, and the network expense is reduced.

Description

technical field [0001] The present invention relates to the technical field of peer-to-peer network (Peer-to-Peer, P2P), in particular to a copy replication method of an unstructured P2P network. Background technique [0002] P2P technology has been proven to be an effective way to implement large-scale distributed applications. In the past ten years, P2P applications have attracted the interest of many research groups, and the most important P2P application deployed on the Internet——P2P file sharing system has also been widely used. In the P2P file sharing system, in order to exchange file information, nodes cooperate with each other to form a distributed system. The interaction between the user and the system is as follows: the user initiates a query to locate the file of interest. The node that owns the file initiates a download request. Therefore, file sharing applications consume most of the Internet bandwidth. Research shows that more than 75% of Internet traffic in l...

AI Technical Summary

Problems solved by technology

EAD (an Efficient and Adaptive Decentralized file replication algorithm) algorithm is an algorithm based on this goal. EAD is an effective adaptive distributed copy replication algorithm. Adaptively adjust the replication of files with equal properties, and dynamically select nodes in the concentration of query traffic as replication nodes based on the file query rate to ensure a high replication hit rate. However, EAD does not take into account the impact of different query rates of popular files on search delays. impact, and only by reducing the search delay of popular files with high search frequency as soon as possible can the overall search delay of the network be reduced faster, and the capacity of nodes in the network is limited and cannot be allocated indiscriminately. Only by optimizing resource allocation, according to the document The differences in access frequency copy files to those nodes that can hit as soon as possible and reduce the overall search delay of the system faster so that the system can obtain a shorter average search path

Images