CN116095092B - Peer node selection method and device - Google Patents
Peer node selection method and device Download PDFInfo
- Publication number
- CN116095092B CN116095092B CN202310379388.XA CN202310379388A CN116095092B CN 116095092 B CN116095092 B CN 116095092B CN 202310379388 A CN202310379388 A CN 202310379388A CN 116095092 B CN116095092 B CN 116095092B
- Authority
- CN
- China
- Prior art keywords
- slice
- node
- peer node
- target peer
- serviceable
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
- H04L67/108—Resource delivery mechanisms characterised by resources being split in blocks or fragments
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
Abstract
The application provides a peer node selection method and a peer node selection device. When the method is executed, determining a peer node for downloading the file to be downloaded from a peer-to-peer network; slicing the file to be downloaded based on a preset slicing rule to obtain a slicing sequence corresponding to the file to be downloaded, determining a slicing bitmap of the current downloading node according to the first slicing sequence number, and determining the slicing bitmap of each target peer node according to a plurality of second slicing sequence numbers; determining a service score corresponding to each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node; and selecting a target downloading node for downloading the file to be downloaded from a plurality of target peer nodes according to the service score corresponding to each target peer node. In this way, by calculating the service score corresponding to each target peer node, the node with the front resource richness can be selected from a large number of peer nodes, and the utilization rate of the peer nodes is improved.
Description
Technical Field
The present disclosure relates to the field of communications networks, and in particular, to a peer node selection method and apparatus.
Background
Peer-to-Peer networks are a distributed application architecture that distributes tasks and workloads among peers (peers), a form of networking or networking in which Peer-to-Peer computing models are formed at the application layer. One essential difference with the Client/Server architecture (i.e., the architecture employed by the WWW) that is currently dominant in the network is that there is no central node (or central Server) in the overall network architecture. In the P2P (Peer to Peer) architecture, each node (peer) has three functions of information consumer, information provider and information communication. The status of each node in the network is peer-to-peer. Each node acts as a server to provide services to other nodes while also enjoying the services provided by other nodes.
Because the peer nodes in the peer-to-peer network cannot store the natural attribute of the full data, the resource distribution on the peer nodes is uneven, and how to select the node with the front resource richness from the massive peer nodes, so that the improvement of the utilization rate of the peer nodes becomes a problem to be solved in the field.
Disclosure of Invention
In view of this, the application provides a peer node selection method and device, by calculating the resource richness score of peer nodes, the node with the front resource richness can be selected from a huge number of peer nodes, so that the utilization rate of the peer nodes is improved.
In a first aspect, the present application provides a peer node selection method, the method comprising:
determining a peer node for downloading a file to be downloaded from a peer-to-peer network, wherein the peer node comprises a current downloading node and a plurality of target peer nodes, and the target peer nodes are nodes except the current downloading node in the peer-to-peer network;
slicing the file to be downloaded based on a preset slicing rule to obtain a slicing sequence corresponding to the file to be downloaded, wherein the slicing sequence comprises the following steps: the first slice sequence number corresponding to the slice downloaded by the current downloading node and the second slice sequence numbers corresponding to the slice downloaded by each target peer node in the target peer nodes;
determining a slice bitmap of the current downloading node according to the first slice sequence numbers, and determining the slice bitmap of each target peer node according to the second slice sequence numbers; the bit number of the slice bit map of the current downloading node is the same as the bit number of the slice bit map of the target peer node;
determining a service score corresponding to each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node;
And selecting a target downloading node for downloading the file to be downloaded from the target peer nodes according to the service score corresponding to each target peer node.
Optionally, the determining the service score corresponding to each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node includes:
determining a first slice identifier corresponding to a slice bitmap of the current downloading node, wherein the first slice identifier is used for indicating slice service capability of the current downloading node;
determining a second slice state identifier corresponding to the slice bitmap of each target peer node, wherein the second slice state identifier is used for indicating slice service capability of each target peer node;
determining a first serviceable score and a continuous serviceable score corresponding to each target peer node based on the slice bitmap of the current downloading node and a second slice state identifier corresponding to the slice bitmap of each target peer node respectively;
determining a maximum serviceable score corresponding to each target peer node based on a first slice identifier corresponding to the slice bitmap of the current download node and a second slice identifier corresponding to the slice bitmap of each target peer node;
And determining the service score corresponding to each target peer node according to the first service score, the continuous service score and the maximum service score corresponding to each target peer node.
Optionally, the second slice state identifier includes a slice present identifier and a slice absent identifier; the determining the first serviceable score corresponding to each target peer node based on the slice bitmap of the current download node and the second slice status identifier corresponding to the slice bitmap of each target peer node respectively includes:
determining that a second slice sequence number in the slice bitmap of each target peer node corresponding to the first slice sequence number corresponding to the slice being downloaded is a starting sequence number according to the first slice sequence number corresponding to the slice being downloaded in the slice bitmap of the current downloading node;
traversing the slice sequence number of the first slice existence mark in the second slice state mark of the slice bitmap of each target peer node according to the initial sequence number, and taking the slice sequence number of the first slice existence mark as a first serviceable sequence number;
calculating the difference between the initial sequence number and the first serviceable sequence number to obtain the first serviceable offset of each target peer node;
And calculating the ratio between the first serviceable offset and a preset base reference value to obtain the first serviceable score corresponding to each target peer node.
Optionally, the determining, based on the slice bitmap of the current download node and the second slice status identifier corresponding to the slice bitmap of each target peer node, the continuous serviceable score corresponding to each target peer node includes:
obtaining the continuous serviceable digit of each target peer node according to the number of serial numbers of the slice existence identifiers from the first serviceable serial number to the first slice missing identifier in the slice bitmap of each target peer node;
and calculating the ratio between the continuous serviceable digit and a preset base reference value to obtain the continuous serviceable score corresponding to each target peer node.
Optionally, the first slice identifier includes a slice presence identifier and a slice absence identifier;
the determining, based on the first slice identifier corresponding to the slice bitmap of the current download node and the second slice identifier corresponding to the slice bitmap of each target peer node, the maximum serviceable score corresponding to each target peer node includes:
Obtaining the maximum serviceable digit of each target peer node according to the number of serial numbers with marks of the slices from the first serviceable serial number to the tail slice serial number in the slice bitmap of each target peer node;
and calculating the ratio of the maximum serviceable digit of each target peer node to the missing slice digit of the current download node to obtain the maximum serviceable score corresponding to each target peer node, wherein the missing slice digit of the current download node is the number of the slice missing identification sequence numbers from the first slice sequence number corresponding to the slice being downloaded to the tail slice sequence number in the slice bitmap of the current download node.
Optionally, the determining the service score corresponding to each target peer node according to the first serviceable score, the continuous serviceable score and the maximum serviceable score corresponding to each target peer node includes:
respectively calculating a first weight corresponding to the first serviceable score, a second weight corresponding to the continuous serviceable score and a third weight corresponding to the maximum serviceable score of each target peer node by using a preset weight algorithm;
And determining the service score corresponding to each target peer node according to the product between the first serviceable score and the first weight, the product between the continuous serviceable score and the second weight and the product between the maximum serviceable score and the third weight.
In a second aspect, an embodiment of the present application provides a peer node selection apparatus, including: the device comprises a determining module, a slicing module and a selecting module;
the determining module is used for determining peer nodes for downloading files to be downloaded from a peer-to-peer network, the peer nodes comprise a current downloading node and a plurality of target peer nodes, and the target peer nodes are nodes except the current downloading node in the peer-to-peer network;
the slicing module is configured to slice the file to be downloaded based on a preset slicing rule, to obtain a slicing sequence corresponding to the file to be downloaded, where the slicing sequence includes: the current download node downloads a first slice sequence number corresponding to the slice and a plurality of second slice sequence numbers corresponding to the slice downloaded by each target peer node;
the determining module is configured to determine a slice bitmap of the current download node according to the first slice sequence number, and determine a slice bitmap of each target peer node according to the plurality of second slice sequence numbers; the bit number of the slice bit map of the current downloading node is the same as the bit number of the slice bit map of the target peer node;
The determining module is further configured to determine a service score corresponding to each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node;
and the selection module is used for selecting a target downloading node for downloading the file to be downloaded from the target peer nodes according to the service score corresponding to each target peer node.
Optionally, the determining module is specifically configured to:
determining a first slice state identifier corresponding to a slice bitmap of the current downloading node, wherein the first slice state identifier is used for indicating slice service capability of the current downloading node;
determining a second slice state identifier corresponding to the slice bitmap of each target peer node, wherein the second slice state identifier is used for indicating slice service capability of each target peer node;
determining a first serviceable score and a continuous serviceable score corresponding to each target peer node based on the slice bitmap of the current downloading node and a second slice state identifier corresponding to the slice bitmap of each target peer node respectively;
determining a maximum serviceable score corresponding to each target peer node based on a first slice identifier corresponding to the slice bitmap of the current download node and a second slice identifier corresponding to the slice bitmap of each target peer node;
And determining the service score corresponding to each target peer node according to the first service score, the continuous service score and the maximum service score corresponding to each target peer node.
Optionally, the second slice state identifier includes a slice present identifier and a slice absent identifier; the determining module is specifically configured to determine, according to a first slice sequence number corresponding to a slice being downloaded in a slice bitmap of the current downloading node, that a second slice sequence number in the slice bitmap of each target peer node corresponding to the first slice sequence number corresponding to the slice being downloaded is a starting sequence number;
traversing the slice sequence number of the first slice existence mark in the second slice state mark of the slice bitmap of each target peer node according to the initial sequence number, and taking the slice sequence number of the first slice existence mark as a first serviceable sequence number;
calculating the difference between the initial sequence number and the first serviceable sequence number to obtain the first serviceable offset of each target peer node;
and calculating the ratio between the first serviceable offset and a preset base reference value to obtain the first serviceable score corresponding to each target peer node.
In a third aspect, the present application provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs any of the methods described above.
The technical scheme has the following beneficial effects:
the application provides a peer node selection method and a peer node selection device. When the method is executed, firstly, determining peer nodes for downloading files to be downloaded from a peer-to-peer network, wherein the peer nodes comprise a current downloading node and a plurality of target peer nodes, and the target peer nodes are nodes except the current downloading node in the peer-to-peer network; then, slicing the file to be downloaded based on a preset slicing rule to obtain a slicing sequence corresponding to the file to be downloaded, wherein the slicing sequence comprises the following steps: the first slice sequence number corresponding to the slice downloaded by the current downloading node and the second slice sequence numbers corresponding to the slice downloaded by each target peer node in the target peer nodes; then determining a slice bitmap of the current downloading node according to the first slice sequence numbers, and determining a slice bitmap of each target peer node according to the second slice sequence numbers; the number of bits of the slice bitmap of the current downloading node is the same as the number of bits of the slice bitmap of the target peer node, and the service score corresponding to each target peer node is determined based on the slice bitmap of the current downloading node and the slice bitmap of each target peer node; and finally, selecting a target downloading node for downloading the file to be downloaded from the target peer nodes according to the service score corresponding to each target peer node. In this way, the service score corresponding to each target peer node is calculated through the slice bitmap of the current download node and the slice bitmap of each target peer node, so that the nodes with the front resource richness can be selected from a large number of peer nodes, and the utilization rate of the peer nodes is further improved.
Drawings
In order to more clearly illustrate the present embodiments or the technical solutions in the prior art, the drawings that are required for the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a method of peer node selection method according to an embodiment of the present application;
FIG. 2 is an exemplary diagram of a peer node slice bitmap provided by an embodiment of the present application;
fig. 3 is a flowchart of another method of peer node selection method according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a peer node selection device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
In order to facilitate understanding of the technical solutions provided in the present application, the following description will first explain the background art related to the present application.
In the prior art, when a peer node corresponding to a file to be downloaded is selected from a peer-to-peer network, the peer node is selected only by using the network state of the peer node, the utilization rate of the peer node is low, and the peer node needs to be frequently interacted with a scheduling service to acquire the peer node, so that bandwidth is wasted.
In order to overcome the above technical problems, the embodiments of the present application provide a peer node selection method, which may be performed by a peer node selection method and apparatus, and the apparatus may be implemented by software and/or hardware, and may be generally integrated in a server or a terminal device.
Referring to fig. 1, fig. 1 is a flowchart of a method for peer node selection according to an embodiment of the present application, where the method may include:
step S101: and determining the peer nodes for downloading the files to be downloaded from the peer-to-peer network, wherein the peer nodes comprise a current downloading node and a plurality of target peer nodes, and the target peer nodes are nodes except the current downloading node in the peer-to-peer network.
In the embodiment of the application, first, a peer node for downloading a file to be downloaded is determined from a peer-to-peer network, where the peer-to-peer network includes a plurality of peer nodes, and the peer node includes a current downloading node of the file to be downloaded and a plurality of target peer nodes. The target peer node is a remote peer node in the peer-to-peer network, and it can be understood that a plurality of target peer nodes are also used for downloading the file to be downloaded, and the target peer node is a node in the peer-to-peer network except the current downloading node.
Step S102: slicing the file to be downloaded based on a preset slicing rule to obtain a slicing sequence corresponding to the file to be downloaded, wherein the slicing sequence comprises the following steps: the current download node downloads the first slice sequence number corresponding to the slice and the second slice sequence numbers corresponding to the slice downloaded by each target peer node in the target peer nodes.
In the embodiment of the present application, after determining a peer node for downloading a file to be downloaded from a peer-to-peer network, slicing the file to be downloaded based on a preset slicing rule, so as to obtain a slicing sequence corresponding to the file to be downloaded. The slice sequence corresponding to the file to be downloaded comprises a first slice sequence number corresponding to the slice downloaded by the current downloading node and a plurality of second slice sequence numbers corresponding to the slice downloaded by each target peer node.
Fig. 2 is an exemplary diagram of a peer node slice bitmap according to an embodiment of the present application, where in fig. 2, slice numbers are 0-15, and slice numbers of slice missing are 1, 5, 6, 10, 13, and 15, respectively.
It should be noted that the foregoing is merely an example of slicing a file to be downloaded, and in practical application, slices with a fixed duration may be used, for example, one slice for every 10 seconds of audio/video data, which is not limited in this application.
It should be noted that, after obtaining the slice sequence corresponding to the file to be downloaded, the present application establishes the fast index information to obtain the first slice sequence number corresponding to the slice downloaded by the current downloading node and the plurality of second slice sequence numbers corresponding to the slices downloaded by each target peer node.
Step S103: determining a slice bitmap of the current downloading node according to the first slice sequence numbers, and determining the slice bitmap of each target peer node according to the second slice sequence numbers; and the bit number of the slice bitmap of the current downloading node is the same as the bit number of the slice bitmap of the target peer node.
Specifically, the present application may determine a slice bitmap of the current download node according to the first slice sequence number, and determine a slice bitmap of each target peer node according to the plurality of second slice sequence numbers, where the number of bits of the slice bitmap of the current download node is the same as the number of bits of the slice bitmap of the target peer node.
For example: taking the example of the slice status identifier that indicates that the current download node is not downloaded and the slice status identifier that indicates that the current download node is downloaded as 1, in fig. 2, the slice numbers of the missing slices are 1, 5, 6, 10, 13, and 15, respectively.
Step S104: and determining a service score corresponding to each target peer node based on the slice bitmap of the current downloading node and the slice bitmap of each target peer node.
In the embodiment of the present application, the service score corresponding to each target peer node may be determined according to the slice bitmap of the current download node and the slice bitmap of each target peer node.
In one possible implementation, as shown in fig. 3, another exemplary schematic diagram of the peer node selection method provided in the present application is shown. Step S104 may include:
step S1041: and determining a first slice state identifier corresponding to the slice bitmap of the current downloading node, wherein the first slice state identifier is used for indicating the slice service capability of the current downloading node.
By establishing the bitmap index for the slice sequence, the slice state identification in the peer node can be identified by using a shorter field string, so that the subsequent resource scoring for the peer node is facilitated, the node with the front resource richness can be selected from massive peer nodes, and the utilization rate of the peer node is further improved.
Step S1042: and determining a second slice state identifier corresponding to the slice bitmap of each target peer node, wherein the second slice state identifier is used for indicating the slice service capability of each target peer node.
For example: in fig. 2, if a slice status identifier that is not downloaded by the current download node is indicated by 0 and a slice status identifier that is already downloaded by the current download node is indicated by 1, the slice bitmap of the target peer node is 1011100111011010.
By establishing the bitmap index for the slice sequence, the slice state identification in the peer node can be identified by using a shorter field string, so that the resource scoring of the peer node can be conveniently carried out later, and the utilization rate of the peer node can be improved.
Step S1043: and determining a first serviceable score and a continuous serviceable score corresponding to each target peer node based on the slice bitmap of the current downloading node and the second slice state identifiers respectively corresponding to the slice bitmap of each target peer node.
In one possible implementation, step S1043 may include:
the second slice state identifier comprises a slice existence identifier and a slice deletion identifier; the determining the first serviceable score corresponding to each target peer node based on the slice bitmap of the current download node and the second slice status identifier corresponding to the slice bitmap of each target peer node respectively includes:
Determining that a second slice sequence number in the slice bitmap of each target peer node corresponding to the first slice sequence number corresponding to the slice being downloaded is a starting sequence number according to the first slice sequence number corresponding to the slice being downloaded in the slice bitmap of the current downloading node;
traversing the slice sequence number of the first slice existence mark in the second slice state mark of the slice bitmap of each target peer node according to the initial sequence number, and taking the slice sequence number of the first slice existence mark as a first serviceable sequence number;
calculating the difference between the initial sequence number and the first serviceable sequence number to obtain the first serviceable offset of each target peer node;
and calculating the ratio between the first serviceable offset and a preset base reference value to obtain the first serviceable score corresponding to each target peer node.
Specifically, according to the first slice sequence number corresponding to the slice being downloaded in the slice bitmap of the current downloading node, the second slice sequence number in the slice bitmap of each target peer node corresponding to the first slice sequence number corresponding to the slice being downloaded is determined as the starting sequence number.
It will be appreciated that, since the number of bits of the slice bitmap of the current download node is the same as the number of bits of the slice bitmap of the target peer node, it is assumed that the first slice number corresponding to the slice being downloaded in the slice bitmap of the current download node is 3, and correspondingly, the start number of the second slice number in the slice bitmap of each target peer node is also 3.
And traversing the slice sequence number of the first slice existence identifier in the second slice state identifier of the slice bitmap of each target peer node from the initial sequence number, taking the slice sequence number of the first slice existence identifier as a first serviceable sequence number, calculating the difference between the initial sequence number and the first serviceable sequence number to obtain the first serviceable offset of each target peer node, and calculating the ratio between the first serviceable offset and a preset reference value to obtain the first serviceable score corresponding to each target peer node.
As shown in fig. 2, assuming that the starting sequence number is 5, the first serviceable sequence number is 7.
It should be noted that the preset reference value may be set according to actual requirements, which is not limited herein.
On this basis, in one possible implementation manner, the determining, based on the slice bitmap of the current download node and the second slice state identifier corresponding to the slice bitmap of each target peer node, the continuous serviceable score corresponding to each target peer node includes:
obtaining the continuous serviceable digit of each target peer node according to the number of serial numbers of the slice existence identifiers from the first serviceable serial number to the first slice missing identifier in the slice bitmap of each target peer node;
and calculating the ratio between the continuous serviceable digit and a preset base reference value to obtain the continuous serviceable score corresponding to each target peer node.
Specifically, starting with the first serviceable sequence number in the slice bitmap of each target peer node, traversing the slice bitmap of each target peer node backwards until the first slice missing identifier finishes traversing, calculating the number of sequence numbers of slice existence identifiers from the first serviceable sequence number to the slice sequence number of the first slice missing identifier to obtain the continuous serviceable bit number of each target peer node, and then calculating the ratio between the continuous serviceable bit number and a preset reference value to obtain the continuous serviceable score corresponding to each target peer node.
As shown in fig. 2, assuming a start sequence number of 6, traversing to slice sequence number 10 stops, and the number of consecutive serviceable bits is 3.
It should be noted that the preset reference value may be set according to actual requirements, which is not limited herein.
Step S1044: and determining the maximum serviceable score corresponding to each target peer node based on the first slice state identifier corresponding to the slice bitmap of the current downloading node and the second slice state identifier corresponding to the slice bitmap of each target peer node.
In one possible implementation, the first slice identifier includes a slice present identifier and a slice absent identifier; step S1044 may include:
obtaining the maximum serviceable digit of each target peer node according to the number of serial numbers with marks of the slices from the first serviceable serial number to the tail slice serial number in the slice bitmap of each target peer node;
and calculating the ratio of the maximum serviceable digit of each target peer node to the missing slice digit of the current download node to obtain the maximum serviceable score corresponding to each target peer node, wherein the missing slice digit of the current download node is the number of the slice missing identification sequence numbers from the first slice sequence number corresponding to the slice being downloaded to the tail slice sequence number in the slice bitmap of the current download node.
Specifically, starting with the first serviceable sequence number in the slice bitmap of each target peer node, traversing the slice bitmap of each target peer node backwards until the end, and recording the number of sequence numbers with marks in the slices from the first serviceable sequence number to the end slice sequence number in the slice bitmap of each target peer node, thereby obtaining the maximum serviceable bit number of each target peer node.
Assuming a starting sequence number of 1, the number of sequences present in the traversing to the ending is 9, the maximum serviceable sequence number is 9, as shown in fig. 2.
And then, calculating the ratio between the maximum serviceable digit of each target peer node and the missing slice digit of the current download node to obtain the maximum serviceable score corresponding to each target peer node. The number of missing slice bits of the current download node is the number of sequence numbers of slice missing marks from the first slice sequence number corresponding to the slice being downloaded to the tail slice sequence number in the slice bitmap of the current download node.
Step S1045: and determining the service score corresponding to each target peer node according to the first service score, the continuous service score and the maximum service score corresponding to each target peer node.
According to the method and the device for determining the service score, the first serviceable score, the continuous serviceable score and the maximum serviceable score corresponding to each target peer node are calculated, so that the service score corresponding to each target peer node is determined, the nodes with the front resource richness can be selected from massive peer nodes, and the utilization rate of the peer nodes is improved.
Step S105: and selecting a target downloading node for downloading the file to be downloaded from the target peer nodes according to the service score corresponding to each target peer node.
In this embodiment of the present application, a target downloading node for downloading the file to be downloaded may be selected from the plurality of target peer nodes according to a service score corresponding to each target peer node, where the target downloading node is used for downloading the file to be downloaded. It can be understood that the resource richness score of the peer node can be calculated, and the node with the front resource richness can be selected from massive peer nodes, so that the utilization rate of the peer node is improved.
According to the technical scheme, the peer node for downloading the file to be downloaded is firstly determined from the peer-to-peer network, the peer node comprises a current downloading node and a plurality of target peer nodes, and the target peer nodes are nodes except the current downloading node in the peer-to-peer network; then, slicing the file to be downloaded based on a preset slicing rule to obtain a slicing sequence corresponding to the file to be downloaded, wherein the slicing sequence comprises the following steps: the current download node downloads a first slice sequence number corresponding to the slice and a plurality of second slice sequence numbers corresponding to the slice downloaded by each target peer node; then determining a slice bitmap of the current downloading node according to the first slice sequence numbers, and determining a slice bitmap of each target peer node according to the second slice sequence numbers; the number of bits of the slice bitmap of the current downloading node is the same as the number of bits of the slice bitmap of the target peer node, and the service score corresponding to each target peer node is determined based on the slice bitmap of the current downloading node and the slice bitmap of each target peer node; and finally, selecting a target downloading node for downloading the file to be downloaded from the target peer nodes according to the service score corresponding to each target peer node. In this way, the service score corresponding to each target peer node is calculated through the slice bitmap of the current download node and the slice bitmap of each target peer node, so that the node with the front resource richness can be selected from massive peer nodes, the utilization rate of the peer nodes is further improved, and the peer nodes do not need to be frequently interacted with scheduling service to obtain the peer nodes, so that the bandwidth is saved.
In one possible implementation, step S1045 may include:
respectively calculating a first weight corresponding to the first serviceable score, a second weight corresponding to the continuous serviceable score and a third weight corresponding to the maximum serviceable score of each target peer node by using a preset weight algorithm;
and determining the service score corresponding to each target peer node according to the product between the first serviceable score and the first weight, the product between the continuous serviceable score and the second weight and the product between the maximum serviceable score and the third weight.
Specifically, in practical application, considering that the two factors of the first service and the continuous service of the target peer node can more truly reflect the continuous service capability of the peer node, the weight of the two scores of the first service and the continuous service of the target peer node should be higher, the weight of the two scores is regarded as a whole, and is recorded as resgrouppwt, and the weight is combined for the first serviceable and the continuous serviceable. It will be appreciated that resgrouppt may be set according to the actual situation, and the application is not limited herein.
The weight wt_a= (fabs (FirstSvrScore-serialsvrcore)/(100.0 x 0.5) +0.5) resgrouppt of the higher scoring of the first and consecutive serviceable is calculated as a function of the absolute value.
The weight wt_b=resgrouppt-wt_a of the lower scoring of the first and consecutive serviceable services is calculated.
Calculating a maximum serviceable score weight: wt_c=1.0-wt_a-wt_b.
The service score corresponding to the target peer node is remoresscore=fmax (FirstSvrScore, serialSvrScore) ×wt_a+fmin (FirstSvrScore, serialSvrScore) ×wt_b+maxsvrscore×wt_c, the fmax function is a function for the maximum value of the two, the fmin function is a function for the minimum value of the two, wherein firstsvrcscore is the first serviceable score of the target peer node, serialSvrScore is the continuous serviceable score of the target peer node, and MaxSvrScore is the maximum serviceable score of the target peer node.
As can be seen, in the embodiment of the present application, the first weight corresponding to the first serviceable score, the second weight corresponding to the continuous serviceable score, and the third weight corresponding to the maximum serviceable score of each target peer node are calculated by using a preset weight algorithm, so that the relative importance degrees of the first serviceable score, the continuous serviceable score, and the maximum serviceable score in the service score are determined, so that the calculated service score corresponding to the target peer node is more accurate, and the utilization rate of the peer node is further improved.
Next, embodiments of the present application will be described in detail with a specific scenario example.
Step 1: acquiring a file to be downloaded; and slicing the file to be downloaded by using a slicing rule to obtain a slicing sequence corresponding to the file to be downloaded.
Step 2: and obtaining peer nodes in the peer-to-peer network according to the file to be downloaded, wherein the peer nodes comprise current downloading nodes and target peer nodes.
And determining the slice bitmap of the current downloading node and the slice bitmap of the target peer node according to the slice serial number downloaded by the current downloading node and the slice serial number downloaded by the target peer node.
Step 3: a service score for the target peer node is calculated.
3.1 calculating a first serviceable score of the target peer node, firstsvrccore=100.0 (1.0-min (1.0, firstSvrOffset/resbitref), firstSvrOffset being a first serviceable offset and resbitref being a preset base reference value.
The first svrOffset=first svrPos-localPos, where first svrPos is a sequence number of a first slice in a slice bitmap of the target peer node, and localPos is a slice sequence number corresponding to a slice being downloaded in slice bitmap information according to the current downloading node.
It should be noted that, in the present application, the slice states of the slice bitmap may be represented by 0 and 1, where 0 represents the slice missing state, i.e., the state of the slice that is not downloaded, and 1 represents the slice present state. Correspondingly, the first svrpos is the sequence number of the first 1 in the slice bitmap of the target peer node.
It should be noted that the preset reference value may be set according to the requirement, which is not limited in this application.
3.2, calculating a continuous serviceable score of the target peer node, serialsvrscore=100.0 (1.0-min (1.0, serialSvrLen/ResBitRefer)), the SerialSvrLen being a continuous serviceable number of bits of a slice existence identifier between a serial number of the first slice deletion identifier and a serial number of the first slice deletion identifier in a slice bitmap of the target peer node.
Still, the slice state identifiers 0 and 1 are used to indicate the slice missing state, and 0 indicates the slice present state as an example. SerialSvrLen is the number of bits in the slice bitmap of the target peer node that have a slice state of 1 from the first serviceable sequence number to the first sequence number that appears 0. Resbitrefer is a preset base reference value. For example: and traversing backward bit by bit on a slice bitmap of the remote peer node by taking a first serviceable sequence number (first svrpos) of the target peer node as a starting sequence number, ending traversing until a bit with a value of 0 is first encountered, and recording the number of all bits with the value of not 0, namely, the number of continuous serviceable bits, namely, marking the number as the SerialSvrLen.
3.3, calculating a maximum serviceable score MaxSvrScore of the target peer node= =100.0 (1.0-min (1.0, maxSvrLen/locallacklin)), wherein MaxSvrLen is the maximum number of slices that can serve the current node from first svrpos for the slice bitmap of the target peer node, and locallacklin is the number of slices from LocalPos to the last co-missing for the slice bitmap of the current download node.
Still, the slice states 0 and 1 are represented, 0 represents a slice missing state, and 1 represents a slice present state. The MaxSvrLen is the number of bits of the maximum serviceable number, which is the number of bits of the maximum serviceable number, from the first serviceable sequence number to the end after traversing bit by bit in the slice bitmap of the target peer node.
The LocalLackLen is the number of bits of which all values are 0, namely the number of slices still missing from the current download node, traversing bit by bit from the serial number of the slice being downloaded (LocalPos) to the end in the slice bitmap of the current download node.
Step 4: considering that the two factors of the first service and the continuous service of the remote peer node can more truly reflect the continuous service capability of the peer node, the weights of the two scores should be higher, so that the weights of the two scores are regarded as a whole and are recorded as ResGroupWT, and are combined weights of the first serviceable service and the continuous serviceable service. It will be appreciated that resgrouppt may be set according to the actual situation, and the application is not limited herein.
4.1, calculate the weight wt_a= (fabs (FirstSvrScore-SerialSvrScore)/(100.0 x 0.5) +0.5) of the higher scoring of the first and consecutive serviceable sets resgrouppt, the fabs function being a function of absolute value.
4.2, calculate the weight wt_b=resgrouppwt-wt_a of the lower scoring of the first and consecutive serviceable.
4.3, calculating the maximum serviceable score weight: wt_c=1.0-wt_a-wt_b.
4.4, peer resource richness score remoteresscore=fmax (FirstSvrScore, serialSvrScore) ×wt_a+fmin (FirstSvrScore, serialSvrScore) ×wt_b+maxsvrscore×wt_c, fmax function is a function of the maximum value of the two, and fmin function is a function of the minimum value of the two.
For the foregoing method embodiments, for simplicity of explanation, the methodologies are shown as a series of acts, but one of ordinary skill in the art will appreciate that the present invention is not limited by the order of acts, as some steps may, in accordance with the present invention, occur in other orders or concurrently. Further, those skilled in the art will also appreciate that the embodiments described in the specification are all preferred embodiments, and that the acts and modules referred to are not necessarily required for the present invention.
The above is some specific implementation manners of the peer node selection method provided in the embodiments of the present application, and based on this, the present application further provides a corresponding apparatus. The apparatus provided in the embodiments of the present application will be described from the viewpoint of functional modularization.
Referring to a schematic diagram of a peer selection device shown in fig. 4, the device may include: a determining module 100, a slicing module 200, a selecting module 300;
the determining module 100 is configured to determine, from a peer-to-peer network, a peer node for downloading a file to be downloaded, where the peer node includes a current downloading node and a plurality of target peer nodes, and the target peer nodes are nodes in the peer-to-peer network except for the current downloading node;
the slicing module 200 is configured to slice the file to be downloaded based on a preset slicing rule, to obtain a slicing sequence corresponding to the file to be downloaded, where the slicing sequence includes: the current download node downloads a first slice sequence number corresponding to the slice and a plurality of second slice sequence numbers corresponding to the slice downloaded by each target peer node;
the determining module 100 is configured to determine a slice bitmap of the current download node according to the first slice sequence number, and determine a slice bitmap of each target peer node according to the plurality of second slice sequence numbers; the bit number of the slice bit map of the current downloading node is the same as the bit number of the slice bit map of the target peer node;
The determining module 100 is further configured to determine a service score corresponding to each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node;
the selecting module 300 is configured to select, from the plurality of target peer nodes, a target download node for downloading the file to be downloaded according to the service score corresponding to each target peer node.
Optionally, the determining module 100 is specifically configured to:
determining a first slice state identifier corresponding to a slice bitmap of the current downloading node, wherein the first slice state identifier is used for indicating slice service capability of the current downloading node;
determining a second slice state identifier corresponding to the slice bitmap of each target peer node, wherein the second slice state identifier is used for indicating slice service capability of each target peer node;
determining a first serviceable score and a continuous serviceable score corresponding to each target peer node based on the slice bitmap of the current downloading node and a second slice state identifier corresponding to the slice bitmap of each target peer node respectively;
determining a maximum serviceable score corresponding to each target peer node based on a first slice identifier corresponding to the slice bitmap of the current download node and a second slice identifier corresponding to the slice bitmap of each target peer node;
And determining the service score corresponding to each target peer node according to the first service score, the continuous service score and the maximum service score corresponding to each target peer node.
Optionally, the second slice state identifier includes a slice present identifier and a slice absent identifier; the determining module is specifically configured to determine, according to a first slice sequence number corresponding to a slice being downloaded in a slice bitmap of the current downloading node, that a second slice sequence number in the slice bitmap of each target peer node corresponding to the first slice sequence number corresponding to the slice being downloaded is a starting sequence number;
traversing the slice sequence number of the first slice existence mark in the second slice state mark of the slice bitmap of each target peer node according to the initial sequence number, and taking the slice sequence number of the first slice existence mark as a first serviceable sequence number;
calculating the difference between the initial sequence number and the first serviceable sequence number to obtain the first serviceable offset of each target peer node;
and calculating the ratio between the first serviceable offset and a preset base reference value to obtain the first serviceable score corresponding to each target peer node.
According to the technical scheme, the peer node for downloading the file to be downloaded is firstly determined from the peer-to-peer network, the peer node comprises a current downloading node and a plurality of target peer nodes, and the target peer nodes are nodes except the current downloading node in the peer-to-peer network; then, slicing the file to be downloaded based on a preset slicing rule to obtain a slicing sequence corresponding to the file to be downloaded, wherein the slicing sequence comprises the following steps: the current download node downloads a first slice sequence number corresponding to the slice and a plurality of second slice sequence numbers corresponding to the slice downloaded by each target peer node; then determining a slice bitmap of the current downloading node according to the first slice sequence numbers, and determining a slice bitmap of each target peer node according to the second slice sequence numbers; the number of bits of the slice bitmap of the current downloading node is the same as the number of bits of the slice bitmap of the target peer node, and the service score corresponding to each target peer node is determined based on the slice bitmap of the current downloading node and the slice bitmap of each target peer node; and finally, selecting a target downloading node for downloading the file to be downloaded from the target peer nodes according to the service score corresponding to each target peer node. In this way, the service score corresponding to each target peer node is calculated through the slice bitmap of the current download node and the slice bitmap of each target peer node, so that the nodes with the front resource richness can be selected from a large number of peer nodes, the utilization rate of the peer nodes is improved, and the bandwidth is saved.
The present embodiment also provides a storage medium having a program stored thereon, which when executed by a processor, implements a peer node selection method as described in the above embodiments.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other.
Those skilled in the art will appreciate that the flow chart shown in the figures is only one example in which embodiments of the present application may be implemented, and the scope of applicability of embodiments of the present application is not limited in any way by the flow chart.
In the several embodiments provided in the present application, it should be understood that the disclosed methods, apparatuses, and devices may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment. In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (8)
1. A method of peer node selection, the method comprising:
determining a peer node for downloading a file to be downloaded from a peer-to-peer network, wherein the peer node comprises a current downloading node and a plurality of target peer nodes, and the target peer nodes are nodes except the current downloading node in the peer-to-peer network;
slicing the file to be downloaded based on a preset slicing rule to obtain a slicing sequence corresponding to the file to be downloaded, wherein the slicing sequence comprises the following steps: the first slice sequence number corresponding to the slice downloaded by the current downloading node and the second slice sequence numbers corresponding to the slice downloaded by each target peer node in the target peer nodes;
determining a slice bitmap of the current downloading node according to the first slice sequence numbers, and determining the slice bitmap of each target peer node according to the second slice sequence numbers; the bit number of the slice bit map of the current downloading node is the same as the bit number of the slice bit map of the target peer node;
determining a service score corresponding to each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node;
Selecting a target downloading node for downloading the file to be downloaded from the target peer nodes according to the service score corresponding to each target peer node;
the determining a service score corresponding to each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node includes:
determining a first serviceable score, a continuous serviceable score and a maximum serviceable score corresponding to each target peer node based on the slice bitmap of the current downloading node and the slice bitmap of each target peer node;
determining a service score corresponding to each target peer node according to the first service score, the continuous service score and the maximum service score corresponding to each target peer node;
the determining, based on the slice bitmap of the current download node and the slice bitmap of each target peer node, a first serviceable score corresponding to each target peer node includes:
determining a first slice identifier corresponding to a slice bitmap of the current downloading node, wherein the first slice identifier is used for indicating slice service capability of the current downloading node;
Determining a second slice state identifier corresponding to the slice bitmap of each target peer node, wherein the second slice state identifier is used for indicating slice service capability of each target peer node; the second slice state identifier comprises a slice existence identifier and a slice deletion identifier;
determining that a second slice sequence number in the slice bitmap of each target peer node corresponding to the first slice sequence number corresponding to the slice being downloaded is a starting sequence number according to the first slice sequence number corresponding to the slice being downloaded in the slice bitmap of the current downloading node;
traversing the slice sequence number of the first slice existence mark in the second slice state mark of the slice bitmap of each target peer node according to the initial sequence number, and taking the slice sequence number of the first slice existence mark as a first serviceable sequence number;
calculating the difference between the initial sequence number and the first serviceable sequence number to obtain the first serviceable offset of each target peer node;
and calculating the ratio between the first serviceable offset and a preset base reference value to obtain the first serviceable score corresponding to each target peer node.
2. The method of claim 1, wherein determining the continuous serviceable score and the maximum serviceable score for each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node comprises:
determining a continuous serviceable score corresponding to each target peer node based on a slice bitmap of the current downloading node and a second slice state identifier corresponding to the slice bitmap of each target peer node respectively;
and determining the maximum serviceable score corresponding to each target peer node based on the first slice state identifier corresponding to the slice bitmap of the current downloading node and the second slice state identifier corresponding to the slice bitmap of each target peer node.
3. The method of claim 2, wherein the determining the continuous serviceable score corresponding to each target peer node based on the second slice state identifiers respectively corresponding to the slice bitmap of the current download node and the slice bitmap of each target peer node comprises:
obtaining the continuous serviceable digit of each target peer node according to the number of serial numbers of the slice existence identifiers from the first serviceable serial number to the first slice missing identifier in the slice bitmap of each target peer node;
And calculating the ratio between the continuous serviceable digit and a preset base reference value to obtain the continuous serviceable score corresponding to each target peer node.
4. The method of claim 2, wherein the first slice identity comprises a slice present identity and a slice absent identity;
the determining, based on the first slice identifier corresponding to the slice bitmap of the current download node and the second slice identifier corresponding to the slice bitmap of each target peer node, the maximum serviceable score corresponding to each target peer node includes:
obtaining the maximum serviceable digit of each target peer node according to the number of serial numbers with marks of the slices from the first serviceable serial number to the tail slice serial number in the slice bitmap of each target peer node;
and calculating the ratio of the maximum serviceable digit of each target peer node to the missing slice digit of the current download node to obtain the maximum serviceable score corresponding to each target peer node, wherein the missing slice digit of the current download node is the number of the slice missing identification sequence numbers from the first slice sequence number corresponding to the slice being downloaded to the tail slice sequence number in the slice bitmap of the current download node.
5. The method of claim 1, wherein said determining the service score for each target peer node based on the first serviceable score, the continuous serviceable score, and the maximum serviceable score for each target peer node comprises:
respectively calculating a first weight corresponding to the first serviceable score, a second weight corresponding to the continuous serviceable score and a third weight corresponding to the maximum serviceable score of each target peer node by using a preset weight algorithm;
and determining the service score corresponding to each target peer node according to the product between the first serviceable score and the first weight, the product between the continuous serviceable score and the second weight and the product between the maximum serviceable score and the third weight.
6. A peer node selection apparatus, the apparatus comprising: the device comprises a determining module, a slicing module and a selecting module;
the determining module is used for determining a peer node for downloading the file to be downloaded from a peer-to-peer network, wherein the peer node comprises a current downloading node and a plurality of target peer nodes, and the target peer nodes are nodes except the current downloading node in the peer-to-peer network;
The slicing module is configured to slice the file to be downloaded based on a preset slicing rule, to obtain a slicing sequence corresponding to the file to be downloaded, where the slicing sequence includes: the first slice sequence number corresponding to the slice downloaded by the current downloading node and the second slice sequence numbers corresponding to the slice downloaded by each target peer node in the target peer nodes;
the determining module is configured to determine a slice bitmap of the current download node according to the first slice sequence number, and determine slice bitmaps of the target peer nodes according to the plurality of second slice sequence numbers respectively; the bit number of the slice bit map of the current downloading node is the same as the bit number of the slice bit map of the target peer node;
the determining module is further configured to determine a service score corresponding to each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node;
the selection module is used for selecting a target downloading node for downloading the file to be downloaded from the target peer nodes according to the service score corresponding to each target peer node;
The determining module is specifically configured to determine a first serviceable score, a continuous serviceable score and a maximum serviceable score corresponding to each target peer node based on the slice bitmap of the current download node and the slice bitmap of each target peer node;
determining a service score corresponding to each target peer node according to the first service score, the continuous service score and the maximum service score corresponding to each target peer node;
the determining, based on the slice bitmap of the current download node and the slice bitmap of each target peer node, a first serviceable score corresponding to each target peer node includes:
determining a first slice identifier corresponding to a slice bitmap of the current downloading node, wherein the first slice identifier is used for indicating slice service capability of the current downloading node;
determining a second slice state identifier corresponding to the slice bitmap of each target peer node, wherein the second slice state identifier is used for indicating slice service capability of each target peer node; the second slice state identifier comprises a slice existence identifier and a slice deletion identifier;
Determining that a second slice sequence number in the slice bitmap of each target peer node corresponding to the first slice sequence number corresponding to the slice being downloaded is a starting sequence number according to the first slice sequence number corresponding to the slice being downloaded in the slice bitmap of the current downloading node;
traversing the slice sequence number of the first slice existence mark in the second slice state mark of the slice bitmap of each target peer node according to the initial sequence number, and taking the slice sequence number of the first slice existence mark as a first serviceable sequence number;
calculating the difference between the initial sequence number and the first serviceable sequence number to obtain the first serviceable offset of each target peer node;
and calculating the ratio between the first serviceable offset and a preset base reference value to obtain the first serviceable score corresponding to each target peer node.
7. The apparatus of claim 6, wherein the determining module is further specifically configured to:
determining a continuous serviceable score corresponding to each target peer node based on a slice bitmap of the current downloading node and a second slice state identifier corresponding to the slice bitmap of each target peer node respectively;
And determining the maximum serviceable score corresponding to each target peer node based on the first slice state identifier corresponding to the slice bitmap of the current downloading node and the second slice state identifier corresponding to the slice bitmap of each target peer node.
8. A computer readable storage medium, characterized in that it has stored thereon a computer program which, when executed by a processor, implements the method according to any of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310379388.XA CN116095092B (en) | 2023-04-11 | 2023-04-11 | Peer node selection method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310379388.XA CN116095092B (en) | 2023-04-11 | 2023-04-11 | Peer node selection method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116095092A CN116095092A (en) | 2023-05-09 |
| CN116095092B true CN116095092B (en) | 2023-06-23 |
Family
ID=86204937
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310379388.XA Active CN116095092B (en) | 2023-04-11 | 2023-04-11 | Peer node selection method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116095092B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109491758A (en) * | 2018-10-11 | 2019-03-19 | 深圳市网心科技有限公司 | Docker mirror image distribution method, system, data gateway and computer readable storage medium |
| CN112330283A (en) * | 2020-11-05 | 2021-02-05 | 中国联合网络通信集团有限公司 | Intelligent management method based on block chain and intelligent management node |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8868772B2 (en) * | 2004-04-30 | 2014-10-21 | Echostar Technologies L.L.C. | Apparatus, system, and method for adaptive-rate shifting of streaming content |
| CN101437044B (en) * | 2008-11-28 | 2012-05-09 | 中兴通讯股份有限公司 | Method and system for downloading file by point-to-point network technique based on sliced sheet |
| CN101997901B (en) * | 2009-08-28 | 2014-04-30 | 国际商业机器公司 | P2P file transfer management method and system |
| CN102244665B (en) * | 2010-05-13 | 2014-11-05 | 中国移动通信集团公司 | Bitmap management and node collection inquiry method, node and index server |
| CN102394899B (en) * | 2011-04-07 | 2014-05-07 | 北京奇艺世纪科技有限公司 | On-demand system and method for improving file downloading speed |
| CN103327046B (en) * | 2012-03-21 | 2017-12-15 | 腾讯科技（深圳）有限公司 | P2SP system scheduling methods, equipment and system based on node serve ability |
| CN103281382B (en) * | 2013-05-31 | 2016-04-20 | 合一网络技术(北京)有限公司 | A kind of document transmission method based on p2p and node |
| CN103327121A (en) * | 2013-07-10 | 2013-09-25 | 亿览在线网络技术（北京）有限公司 | P2P (Peer-to-Peer Network) network resource transmission method and device for same |
| CN104506537B (en) * | 2014-12-26 | 2019-03-29 | 电子科技大学 | P2P system node selection method |
| CN107682415A (en) * | 2017-09-20 | 2018-02-09 | 郑州云海信息技术有限公司 | A kind of method and system of peer-to-peer network transmission neighbor node selection |
| CN114390338A (en) * | 2022-01-26 | 2022-04-22 | 湖南快乐阳光互动娱乐传媒有限公司 | Method and device for rapidly acquiring p2p video and electronic equipment |
-
2023
- 2023-04-11 CN CN202310379388.XA patent/CN116095092B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109491758A (en) * | 2018-10-11 | 2019-03-19 | 深圳市网心科技有限公司 | Docker mirror image distribution method, system, data gateway and computer readable storage medium |
| CN112330283A (en) * | 2020-11-05 | 2021-02-05 | 中国联合网络通信集团有限公司 | Intelligent management method based on block chain and intelligent management node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116095092A (en) | 2023-05-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhou et al. | A simple model for chunk-scheduling strategies in P2P streaming | |
| Zhou et al. | A simple model for analyzing P2P streaming protocols | |
| EP3439239B1 (en) | Data transmission method and system based on peer-to-peer network | |
| US9635107B2 (en) | System and method for managing data delivery in a peer-to-peer network | |
| CN104052803A (en) | Decentralized distributed rendering method and system | |
| CN102882985A (en) | File sharing method based on cloud storage | |
| CN108881354A (en) | A kind of pushed information storage method, device, server and computer storage medium | |
| CN101909077A (en) | Method and device for identifying peer-to-peer services and access network | |
| US20210344971A1 (en) | A method and system for downloading a data resource | |
| CN105868251A (en) | Cache data updating method and device | |
| CN104378234A (en) | Cross-data-center data transmission processing method and system | |
| TW201737107A (en) | Data synchronization method and apparatus | |
| US20230107093A1 (en) | Data download method and apparatus, computer device, and storage medium | |
| JP2010157016A (en) | P2p distribution system and distribution method | |
| CN101150593A (en) | A method and system for data upload | |
| CN111935242A (en) | Data transmission method, device, server and storage medium | |
| US20140156809A1 (en) | Data downloading method, terminal, server, and system | |
| CN116095092B (en) | Peer node selection method and device | |
| KR101600717B1 (en) | Method and apparatus for download virtual machine operating system image | |
| CN115706741A (en) | Method and device for returning slice file | |
| CN116684416A (en) | Mirror image distribution method, device and system in network element cluster | |
| CN111200623B (en) | Method and system for realizing terminal data synchronization based on distributed storage | |
| CN104602047A (en) | Share method of EPG (error pattern generator) data, server, terminal and system | |
| CN102098339A (en) | Audio file transmission method and system | |
| CN113315801A (en) | Method and system for storing blockchain data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |