WO2024036889A1

WO2024036889A1 - Mirror image distribution method, system, and device

Info

Publication number: WO2024036889A1
Application number: PCT/CN2023/074444
Authority: WO
Inventors: 林鸿清
Original assignee: 网易（杭州）网络有限公司
Priority date: 2022-08-18
Filing date: 2023-02-03
Publication date: 2024-02-22
Also published as: CN115567547A

Abstract

The present application discloses a mirror image distribution method, system, and device. The method comprises: a first peer node receiving N first query messages sent by N second peer nodes; according to the N first query messages, the first peer node determining to send to the N second peer nodes N different mirror image fragments included in a mirror image file queried by the N first query messages; the first peer node using N network channels for sending to the N second peer nodes the N mirror image fragments and also N different hash values corresponding to the N mirror image fragments, so that an ith second peer node interacts with other second peer nodes to obtain a mirror image file, an ith network channel being a network channel for transmitting between the first peer node and an ith second peer node the ith mirror image fragment and the hash value corresponding to the ith mirror image fragment, N being a positive integer greater than or equal to 2, and i = 1, 2, ... , N. The method can improve mirror image distribution efficiency.

Description

Image distribution method, system and device

Cross-references to related applications

This disclosure claims priority to the Chinese patent application with application number 202210994948.8 and titled "An Image Distribution Method, System and Equipment" submitted on August 18, 2022. The entire content of this Chinese patent application is incorporated herein by reference. Public.

Technical field

The present disclosure relates to the field of network technology, and in particular, to an image distribution method, system and device.

Background technique

With the development of cloud technology, more and more application scenarios are based on cloud technology to realize resource sharing within the network. For example, in cloud gaming application scenarios, it is necessary to provide users with a variety of games to play, and at the same time, it is necessary to meet the gaming needs of users in different regions. In order to meet users' needs for low latency and high image quality, cloud gaming systems need to be deployed everywhere, including cloud gaming storage devices. Therefore, it is necessary to maintain game storage in multiple local areas at the same time, and real-time update of game resources becomes a problem.

In the traditional solution, the Qcow2 image is mainly used to save game data. The above method mounts the game data to the cloud game system, and the Qcow2 images in each region remain consistent. When sharing game image files, the node that stores the game image file first transmits the complete game image file to the child nodes of the node. After the child node obtains the complete game image file, the child node then transmits the complete game image file to its child nodes. After all communicating nodes in the network obtain the complete game image file, the game image file sharing stops. process. In the above technology, there is a problem of low image file distribution efficiency.

Therefore, an image distribution method is urgently needed, through which the efficiency of image distribution can be improved.

Contents of the invention

A first aspect of an embodiment of the present disclosure provides an image distribution method, applied to a peer-to-peer network including a first peer node and N second peer nodes, wherein the first peer node stores and applies The image file associated with the program, N is a positive integer greater than or equal to 2, includes: the first peer node receives N first query messages sent by the N second peer nodes, and the N first queries The message corresponds to the N second peer nodes one-to-one; the first peer node determines to send the N first peer nodes to the N second peer nodes based on the N first query messages. The image file queried by the query message includes N different image fragments; the first peer node passes through N networks The channel sends the N mirror fragments and N different hash values corresponding to the N mirror fragments to the N second peer nodes, so that the i-th second peer node is consistent with other Two peer nodes interact to obtain the image file, wherein the i-th network channel transmits the i-th image fragment and the i-th image fragment to the i-th second peer node. The network channel of the hash value corresponding to the i-th mirror fragment, i=1,2,…,N.

The second aspect of the embodiment of the present disclosure provides an image distribution method, applied to a peer-to-peer network including a control node, a first peer node managed by the control node, and N second peer nodes, wherein the A peer node stores an image file associated with an application, and N is a positive integer greater than or equal to 2, including: the i-th second peer node determines to download the image based on the received download instruction sent by the control node. The download order of the N image fragments included in the file, the download instruction is used to instruct to start downloading the image file, the N second peer nodes all receive the download instruction, and the N second peer nodes There is a one-to-one correspondence between equal nodes and N download orders, and the N download orders are different, i=1,2,...,N; the i-th second peer node is based on the i-th second peer node The i-th download sequence corresponding to the node determines to send a first query message to the first peer node, and to send a second query message to other second peer nodes; the first query message is used to query the image The i-th image fragment included in the file, and the i-th image fragment is the first image fragment downloaded as indicated by the i-th download sequence; the second query message is used to query the image The file includes an image fragment other than the i-th image fragment, and the image fragment queried by the second query message is the j-th image fragment downloaded as indicated by the i-th download sequence. , j=2,3,...,N; the i-th second peer node sends the first query message to the first peer node, and sends the second query message to other second peer nodes. Query the message to obtain the image file.

The third aspect of the embodiment of the present disclosure provides an image distribution device, applied to a peer-to-peer network including a first peer node and N second peer nodes, wherein the first peer node stores information associated with an application mirror file, N is a positive integer greater than or equal to 2, including: a transceiver unit, used to receive N first query messages sent by the N second peer nodes, the N first query messages are the same as the There is a one-to-one correspondence between N second peer nodes; a processing unit configured to determine, based on the N first query messages, to send all the information queried by the N first query messages to the N second peer nodes. The image file includes N different image fragments; the transceiver unit is also configured to send the N image fragments and the N images to the N second peer nodes through N network channels. N different hash values corresponding to the fragments, so that the i-th second peer node interacts with other second peer nodes to obtain the image file, where the i-th network channel is the first pair The network channel through which the peer node and the i-th second peer node transmit the i-th mirror fragment and the hash value corresponding to the i-th mirror fragment, i=1, 2,...,N.

The fourth aspect of the embodiment of the present disclosure provides an image distribution device, applied to a peer-to-peer network including a control node, a first peer node managed by the control node, and N second peer nodes, wherein the A peer node stores a The image file associated with the application program, where N is a positive integer greater than or equal to 2, includes: a processing unit, configured to determine the number of times to download N image fragments included in the image file according to the received download instruction sent by the control node. Download sequence, the download instruction is used to instruct to start downloading the image file, the N second peer nodes all receive the download instruction, the N second peer nodes and the N download sequences are one by one corresponding, and the N downloading orders are different, i=1,2,...,N; the processing unit is also used to determine the direction to the i-th second peer node according to the i-th downloading order corresponding to the i-th second peer node. The first peer node sends a first query message, and sends a second query message to other second peer nodes; the first query message is used to query the i-th image fragment included in the image file, and The i-th image fragment is the first image fragment downloaded as indicated by the i-th download sequence; the second query message is used to query the image fragments included in the image file except the i-th image fragment. An image fragment other than the image fragment, and the image fragment queried by the second query message is the j-th image fragment downloaded indicated by the i-th download sequence, j=2,3,...,N; A transceiver unit configured to send the first query message to the first peer node and the second query message to other second peer nodes to obtain the image file.

The fifth aspect of the embodiment of the present disclosure provides an image distribution device, which has the above-mentioned first aspect or any possible implementation manner of the first aspect, and the third aspect or any one of the third aspects. Possible implementations describe the functions of the image distribution device. This function can be implemented based on hardware, or corresponding software implementation can be executed based on hardware. The hardware or software includes one or more modules corresponding to the above functions.

In a possible implementation, the structure of the image distribution device includes a processor, and the processor is configured to support the image distribution device to perform corresponding functions in the above method.

The image distribution device may further include a memory, which is coupled to the processor and stores necessary program instructions and data for the image distribution device.

In another possible implementation, the image distribution device includes: a processor, a transmitter, a receiver, a random access memory, a read-only memory, and a bus. The processor is respectively coupled to the transmitter, receiver, random access memory and read-only memory through the bus. When it is necessary to run the image distribution device, it is started through the basic input/output system solidified in the read-only memory or the bootloader boot system in the embedded system, and the image distribution device is guided into a normal operating state. After the image distribution device enters the normal operating state, the application program and the operating system are run in the random access memory, so that the processor executes the image distribution method in the first aspect or any possible implementation of the first aspect.

The sixth aspect of the embodiment of the present disclosure provides an image distribution device, which has the above second aspect or any possible implementation manner of the second aspect, and the fourth aspect or any one of the fourth aspect. Possible implementations describe the functions of the image distribution device. This function can be implemented based on hardware or executed based on hardware Corresponding software implementation. The hardware or software includes one or more modules corresponding to the above functions.

In another possible implementation, the image distribution device includes: a processor, a transmitter, a receiver, a random access memory, a read-only memory, and a bus. The processor is respectively coupled to the transmitter, receiver, random access memory and read-only memory through the bus. When it is necessary to run the image distribution device, it is started through the basic input/output system solidified in the read-only memory or the bootloader boot system in the embedded system, and the image distribution device is guided into a normal operating state. After the image distribution device enters the normal operating state, the application program and the operating system are run in the random access memory, so that the processor executes the image distribution method in the second aspect or any possible implementation of the second aspect.

The seventh aspect of the embodiment of the present disclosure also provides a computer-readable storage medium on which one or more computer instructions are stored, wherein the instructions are executed by a processor to implement the method described in any of the above technical solutions.

It should be understood that the content described in this section is not intended to identify key or important features of the embodiments of the disclosure, nor is it intended to limit the scope of the disclosure. Other features disclosed in the present disclosure will become readily understood from the following description.

Description of the drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings needed to be used in the description of the embodiments of the present disclosure will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present disclosure. , for those of ordinary skill in the art, other drawings can also be obtained based on these drawings without exerting creative labor.

Figure 1 is a schematic diagram of an application scenario suitable for the image distribution method provided by an embodiment of the present disclosure.

Figure 2 is a schematic diagram of the transmission process of an image distribution method provided by traditional technology.

FIG. 3A is a schematic diagram of a network architecture suitable for embodiments of the present disclosure.

Figure 3B is a schematic diagram of another network architecture suitable for embodiments of the present disclosure.

FIG. 4 is a schematic structural diagram of a control node 100 provided by an embodiment of the present disclosure.

FIG. 5 is a schematic structural diagram of a peer node 200 provided by an embodiment of the present disclosure.

Figure 6 is a schematic diagram of an image distribution method provided by an embodiment of the present disclosure.

Figure 7 is a schematic diagram of the relationship between image files and image layers provided by an embodiment of the present disclosure.

Figure 8 is a schematic diagram of the relationship between the image layer and image sharding provided by an embodiment of the present disclosure.

Figure 9A is a schematic diagram of another image distribution method provided by an embodiment of the present disclosure.

Figure 9B is a schematic diagram of another image distribution method provided by an embodiment of the present disclosure.

Figure 10 is a schematic diagram of a network bandwidth adjustment method provided by an embodiment of the present disclosure.

Figure 11 is a schematic structural diagram of an image distribution device provided by an embodiment of the present disclosure.

Figure 12 is a schematic structural diagram of an image distribution system provided by an embodiment of the present disclosure.

Figure 13 is a schematic structural diagram of an image distribution device provided by an embodiment of the present disclosure.

Detailed ways

In order to enable those skilled in the art to better understand the technical solutions of the present disclosure, the present disclosure is clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present disclosure. However, the present disclosure can be implemented in many other ways different from the above description. Therefore, based on the embodiments provided by the present disclosure, all other embodiments obtained by those of ordinary skill in the art without creative work should be belong to the scope of protection of this disclosure.

It should be noted that the terms “first”, “second”, “third”, etc. in the claims, description and drawings of this disclosure are used to distinguish similar objects and are not used to describe a specific sequence or sequence. Sequence. Data so used are interchangeable under appropriate circumstances so that the embodiments of the disclosure described herein can be practiced in sequences other than those illustrated or described herein. In addition, the terms "including", "having" and their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units and need not be limited to those explicitly listed. Those steps or elements may instead include other steps or elements not expressly listed or inherent to the process, method, product or apparatus.

To facilitate understanding, technical terms that may be involved in the embodiments of the present disclosure are first briefly introduced.

1. Cloud technology

Cloud technology refers to a hosting technology that unifies a series of resources such as hardware, software, and networks within a wide area network or local area network to realize data calculation, storage, processing, and sharing.

2. Cloud gaming

Cloud gaming is a gaming method based on cloud computing. In the operating mode of cloud gaming, all games are run on the server side, and the rendered game images are compressed and transmitted to users through the network.

3. Cloud computer

Similar to cloud gaming, it is a gaming method based on cloud computing. The difference is that this scenario provides users with a completely open environment and does not restrict users to just playing games. Users can perform a series of operations such as video editing and machine learning through cloud computers.

4. Peer-to-peer (P2P) network

Peer-to-peer network, also known as peer-to-peer network or peer-to-peer computer network. A peer-to-peer network is a distributed application architecture that distributes tasks and workloads among peer nodes. It is a networking or network form formed by the peer-to-peer computing model at the application layer. Specifically, in a peer-to-peer network, network participants share a portion of the hardware resources they own (for example, computing resources, storage resources, network connection resources, printer resources, etc.), and these shared resources provide services and content through the network. Can be accessed directly by other peer nodes without going through intermediate entities. In other words, participants in a peer-to-peer network are both providers (servers) of resources, services, and content, and at the same time, acquirers (clients) of resources, services, and content.

5. Mirror

Mirror is also called an image file. Mirroring is a form of file storage, and a mirror can be thought of as a copy of the original file.

6. Mirror layer

Mirrors are usually stored in a hierarchical structure, and the mirror structure corresponding to each layer is the mirror layer.

7. Mirror sharding

Mirror sharding is a logical sharding for the mirroring layer. In other words, a mirror layer can be logically divided into multiple mirror shards. For example, if an image layer is 40 megabytes (MB), the image layer can be logically divided into 10 image shards, and the size of each image shard is 4MB.

8. Tree network

Tree network is a network topology shape. All nodes in the tree network are organized in a tree. The tree network includes root nodes and leaf nodes. In a tree network, data flows in one direction along the branches, that is, it can only flow from the root node to the leaf nodes, but cannot flow from the leaf nodes to the root node.

9. Mesh network

Mesh network is a network topology shape. In this structure, all nodes are interconnected irregularly and there is no absolute parent-child relationship. That is, node A can flow resources to node B, and node B can also flow resources to node A.

10. File format of Qcow2 disk image file

Qcow2 is the file format for disk image files used by QEMU.

Below, the application scenarios, network architecture, and image distribution method applicable to the image distribution method in the embodiments of the present disclosure will be described in detail with reference to the accompanying drawings. It can be understood that, as long as there is no conflict between the embodiments provided by the present disclosure, the following embodiments and features in the embodiments can be combined with each other. In addition, the sequence of steps in the following method embodiments is only an example and is not strictly limited.

First, the application scenarios of the image distribution method applicable to the embodiments of the present disclosure are introduced with reference to the accompanying drawings.

Figure 1 is a schematic diagram of an application scenario suitable for the image distribution method provided by an embodiment of the present disclosure. For example, as shown in Figure 1, the application scenario includes a network, multiple nodes i and multiple terminals i, i=1, 2, 3, 4. Among them, any two nodes among multiple nodes i can communicate through the network to realize data transmission, and the i-th node communicates with the i-th terminal to realize data transmission. Optionally, the application scenario may also include a larger number (for example, 10, etc.) of nodes that communicate through the network to realize data transmission. Optionally, any node i in this application scenario can also communicate with a larger (for example, 2 or 3, etc.) number of terminals to achieve data transmission. The network shown in Figure 1 may be a wired network or a wireless network, which is not specifically limited in this disclosure. The node i and the terminal i may be connected through a wired method or a wireless method (for example, Bluetooth or wireless communication technology (WIFI)), which is not specifically limited in this disclosure.

Node i may be a server with storage capabilities (for example, storing cloud game update image files) and computing capabilities. In the application scenario shown in Figure 1, an application (for example, a game application) installed in terminal i can run in node i. That is, node i can perform operations related to running the calculations and processing of the application. After node i runs the application, it will transmit the data generated by the application to terminal i, so that terminal i can obtain the data associated with the application. This method can effectively reduce the calculation amount of terminal i. For example, in a cloud gaming scenario, the game application installed in terminal i can be run on node i. After running the game application, node i can also render and compress the obtained application data. After that, node i can undergo the above processing. The final data is transmitted to terminal i to meet the needs of terminal i. Node i can also send resources stored in node i (for example, image files generated by applications running in node i) to other nodes in Figure 1 through the network, or obtain other nodes from other nodes in Figure 1 through the network. stored resources. Optionally, node i may have a memory and a processor. The processor of node i can be a central processing unit (CPU). Optionally, node i can also have one or more of a graphics processing unit (GPU), a neural network processing unit (NPU), and a field programmable gate array (FPGA). The node The memory of i can be random access memory (RAM) or solid-state drive (SSD) or other devices or memory instances with storage capabilities. A solid-state drive may also be called a solid-state drive (SSD). The form of node i is not specifically limited. Node i can be hardware or software. When node i is hardware, it can be implemented as a distributed server cluster composed of multiple servers or as a single server. When the node i is software, it can be implemented as multiple software or software modules (for example, software or software modules used to provide distributed services), or it can be implemented as a single software or software module. The embodiments of the present disclosure do not specifically limit this.

Applications can be installed and run on the terminal i, and the running results of the applications can be displayed. For example, terminal i The game application installed in can be run in node i. After running the game application, node i can render and compress the generated game data, and send the processed data to terminal i, and terminal i receives the data. The game data can then be displayed to the user through the display interface. The form of terminal i is not specifically limited. For example, the terminal i may be, but is not limited to, a personal computer, a smartphone, a tablet, a desktop computer, or a wearable device (eg, a smart watch).

Optionally, the above wireless network or wired network uses standard communication technologies and/or protocols. The network is usually the Internet, but can be any network, including but not limited to local area network (LAN), metropolitan area network (MAN), wide area network (WAN), mobile, wired or wireless network, private network, or virtual private network). In some embodiments, data exchanged over the network is represented using technologies and/or formats including hypertext mark-up language (HTML), extensible markup language (XML), etc. In addition, you can also use services such as secure socket layer (SSL), transport layer security (TLS), virtual private network (VPN), and Internet protocol security (IPsec). Wait for conventional encryption techniques to encrypt all or some links. In other embodiments, customized and/or dedicated data communication technologies can also be used in place of or in addition to the data communication technologies described above.

It should be understood that the application scenarios shown in FIG. 1 are only illustrative and do not constitute any limitation to the application scenarios applicable to the image distribution method provided by the embodiments of the present disclosure. Optionally, the above application scenario may also include a larger number of nodes or terminals. Optionally, any node in the above application scenario can also communicate with a larger number of terminals to realize data transmission.

When the application scenario shown in Figure 1 is a cloud game application scenario, multiple nodes in the cloud game application scenario can share a game update image file stored or generated by one node to achieve the purpose of game update image file sharing. For example, node 1 stores a game update image file generated by running a game application. Node 1 communicates with node 2, node 3, and node 4 by transmitting the game update image file stored in node 1 to node 2 and node 1. 3 and node 4 to realize the sharing of game update image files. In practical applications, when there are a large number of nodes in the network that do not own resources, node 1 that owns resources transmits the game update image file to a large number of nodes that do not own resources (for example, the game update image file includes 2 Qcow2 image files) , will not only increase the overhead of node 1 uploading files, but also cause high transmission delays when node 1 transmits the locally stored game update image files to node 2, node 3 and node 4 respectively. In some cases, during the above-mentioned process of transmitting the image file from node 1 to node 2, node 3 and node 4, the image file may be attacked or tampered with. In this way, node 2, node 3 and node 4 will receive The image file received is incomplete.

In order to solve the problems existing in the above cloud game application scenarios, traditional technology provides an image distribution method. In traditional technology, Qcow2 images are mainly used to save game data. This method mounts the game data to the cloud game system. The Qcow2 images stored in the nodes in each region are consistent, and the game images existing in the nodes in each region cannot be separately processed. configuration. Figure 2 shows a schematic diagram of the transmission process of the image distribution method provided by this traditional technology. Referring to Figure 2, the network architecture shown in Figure 2 is a tree structure, and the seven nodes included in the tree structure can be nodes included in the application scenario shown in Figure 1. Node 1 in Figure 2 can be a node that stores a cloud game update image file. When the image file needs to be shared with other nodes shown in Figure 2, Node 1 will first match the image file with the image file. The hash value 1 is transmitted to node 2 and node 3 respectively. After node 2 or node 3 receives the image file and hash value 1, it first performs a hash operation on the image file to obtain a hash value 2. By comparing hash value 1 and hash value 2, it is determined that node 2 or node 3 is the same. Node 3 has successfully received the image file. After that, node 2 or node 3 will send the image file and hash value 2 to their respective child nodes, and so on until all nodes receive the image file, where the child nodes of node 2 are node 4 and node 5. The child nodes of node 3 are node 6 and node 7. In this implementation, if a node discovers that it has failed to receive a complete image file, the node needs to send a request to retransmit the image file to the upstream node to regain the image file. Usually the image file has a large amount of data (for example, an image file ranging from tens of gigabytes (Gigabyte, GB or G) to hundreds of GB). In the above implementation, the node performs processing on the received image file. Integrity verification takes a long time (for example, it usually takes tens of minutes), which causes a high delay in the transmission of the image file. The above transmission image file is transmitted in a tree network, and as the number of nodes in the network increases The increase in purpose will inevitably lead to an increase in the total transmission time for transmitting the image file. When transmitting image files based on a tree network, it is executed serially in layers. In other words, the node at this layer must wait for the node at the upper layer to finish transmitting the image file. After mirroring the file, the node in this layer can transmit the image file to its child nodes. In this way, the non-vertex nodes (nodes other than node 1) in the tree network have a higher transmission rate when receiving the image file. Delay. When a node (for example, node 2) in the above-mentioned tree network fails during the transmission of the image file, it will also cause the failed child node to be unable to successfully receive the image file.

Therefore, embodiments of the present disclosure provide an image distribution method, device and system to solve the above existing problems.

Next, the network architecture suitable for the image distribution method provided by the embodiment of the present disclosure is introduced with reference to FIGS. 3A to 5 .

FIG. 3A is a schematic diagram of a network architecture suitable for embodiments of the present disclosure. As shown in Figure 3A, the network architecture includes a control node and multiple peer nodes. For example, FIG. 3A shows that the plurality of peer nodes are peer node 1, peer node 2 and peer node 3 respectively. Any two nodes among all nodes included in the network architecture (ie, control nodes and multiple peer nodes) can communicate with each other to achieve data interaction. This network architecture can be understood as a P2P network architecture. Any two nodes in this architecture can communicate based on the P2P network communication protocol. It is proposed to realize communication and data interaction. For example, the P2P network communication protocol may be a TCP/UDP-based P2P network communication protocol. Optionally, the network architecture may also include a larger number of peer nodes, which is not specifically limited in this disclosure. When the network architecture includes a larger number of peer nodes, any two nodes in the network architecture can communicate with each other to achieve data interaction. Exemplarily, FIG. 3B shows another network architecture suitable for the embodiment of the present disclosure. The network architecture includes 5 peer nodes and 1 control node, and between any two nodes included in the network architecture Communication can be carried out to realize the transmission of data.

Control node, used to manage multiple peer nodes in the network architecture. For example, FIG. 4 shows a schematic structural diagram of a control node 100 provided by an embodiment of the present disclosure. It can be understood that the control node 100 may be a control node in the network architecture shown in FIG. 3A , that is, the control node in FIG. 3A has the same or similar functions as the control node 100 in FIG. 4 . Referring to Figure 4, the control node 100 includes the following functional modules: service registration and discovery 210, network topology center 220, network service (web server), and dynamic control center 240. Among them, service registration and discovery 210 is used to ensure the multi-activity of multiple peer nodes in the network architecture shown in Figure 3A. The network topology center 220 is configured to construct a P2P network including the plurality of peer nodes according to the network status obtained from the plurality of peer nodes shown in FIG. 3A. Network server 230 is used to provide network services. The dynamic control center 240 is used to adjust the bandwidth of the network channel (for example, network channel 1 or network channel 2) in the network based on the network status information obtained from the peer node shown in Figure 3A to ensure that the P2P network includes Wait until the node is in normal working condition.

The peer node is configured to send network resources (for example, image file resources) stored by the peer node to other peer nodes in the network according to instructions sent by the control node. Peer nodes can also receive network resources sent by other peer nodes in the network. A peer node may also send the network status obtained by the peer node to the control node. For example, FIG. 5 shows a schematic structural diagram of a peer node 200 provided by an embodiment of the present disclosure. It can be understood that the peer node 200 can be any peer node in the network architecture shown in Figure 3A, that is, any peer node in Figure 3A has the same or similar information as the peer node 200 in Figure 5. Function. Referring to FIG. 5 , the peer node 200 includes the following functional modules: an image fragment transmitter 210 , a network analysis model 220 , a dynamic control client 230 , and a file storage server 240 . Among them, the image fragment transmitter 210 is used to transmit the image fragments stored in the file storage service 240 to other peer nodes in the network except the peer node 200. The network analysis module 220 is used to perform inter-node speed measurement and maintain network conditions of the peer node 100 and other peer nodes communicating with the peer node 100 . For example, the network analysis module 220 can perform inter-node speed measurement based on raw-socket technology. The dynamic control client 230 is responsible for analyzing the channel traffic status of data transmission by the peer node 200 and reporting the network conditions obtained by the network analysis module 220 to the dynamic control center 140 in the control node 100 .

In this disclosure, there is no specific limitation on the form of the control node and the plurality of peer nodes shown in FIG. 3A. For example, control A node and multiple peer nodes can be servers. Servers can be hardware or software. When the server is hardware, it can be implemented as a distributed server cluster composed of multiple servers, or it can be implemented as a single server. When the server is software, it can be implemented as multiple software or software modules (for example, software or software modules used to provide distributed services), or it can be implemented as a single software or software module. The embodiments of the present disclosure do not specifically limit this.

It should be noted that the control node shown in Figure 3A is a network node independent of peer node 1, peer node 2 and peer node 3. It can be understood that in this implementation, the network architecture applicable to the embodiment of the present disclosure may include at least 4 nodes, namely the control node, peer node 1, peer node 2 and peer node 3. Optionally, in other implementations, the control node may also be any peer node among peer node 1, peer node 2, or peer node 3. In this case, any peer node also has the configuration shown in Figure 3A The functions of the control nodes shown in . It can be understood that in this implementation, the network architecture suitable for the embodiments of the present disclosure may include at least three nodes, namely peer node 1, peer node 2 and peer node 3, and these three peers One of the peer nodes also has the function of a control node as shown in Figure 3A.

It should be understood that the above-mentioned Figures 3A to 5 are only illustrations and do not constitute any limitation on the network architecture applicable to the image distribution method provided by the embodiment of the present disclosure. For example, the network architecture shown in FIG. 3A may also include a greater number of peer nodes and a greater number of network channels.

Hereinafter, the image distribution method provided by the embodiment of the present disclosure will be introduced with reference to FIGS. 6 to 9 .

Figure 6 is a schematic diagram of an image distribution method provided by an embodiment of the present disclosure. The image distribution method provided by the embodiment of the present disclosure can be applied to a peer-to-peer network including a control node and a first peer node managed by the control node and N second peer nodes, where N is a positive integer greater than or equal to 2. For example, the control node shown in Figure 6 may be the control node shown in Figure 3, and the first peer node and the N second peer nodes shown in Figure 6 may be the control node shown in Figure 6. 3 shows multiple peer nodes. As shown in Figure 6, the image distribution method provided by the embodiment of the present disclosure includes S601 to S606. Before introducing S601 to S606, the control node, the first peer node and the N second peer nodes involved in the implementation of the present disclosure are introduced in detail.

In the embodiment of the present disclosure, the control node in the peer-to-peer network is used to manage the first peer node and N second peer nodes. For example, the control node is used to manage the network bandwidth of the first peer node and the N second peer nodes, the network topology between the first peer node and the N second peer nodes, and so on. In some embodiments, the control node is any one of the following peer nodes: a first peer node, or N second peer nodes. It can be understood that when the control node is a first peer node or a second peer node among the N second peer nodes, the first peer node or the second peer node also has a control node function. In other embodiments, the control node may also be a node independent of the first peer node and the N second peer nodes, in which case any of the first peer node or the N second peer nodes one A peer node may not have the function of a control node. It can be understood that any two nodes in the peer-to-peer network transmit data through different network channels, and any two nodes are any two nodes among the following nodes: a control node, a first peer node, and N second pairs. Wait for nodes. Illustratively, taking Figure 3A as an example for introduction, when the control node is the control node shown in Figure 3A, the first peer node is peer node 1, and the plurality of second peer nodes are peer nodes 2 respectively. When communicating with peer node 3, the control node and peer node 1 communicate with each other through network channel 5, the control node and peer node 2 communicate with each other through network channel 4, and the control node and peer node 3 communicate with each other through network channel 5. Channel 6 communicates with each other, peer node 1 and peer node 3 communicate with each other through network channel 3, peer node 1 and peer node 2 communicate with each other through network channel 1, peer node 2 and peer node 3 They communicate with each other through network channel 2. And any two network channels among the above-mentioned network channel 1 to network channel 6 are different.

In the embodiment of the present disclosure, the first peer node stores an image file associated with the application program. That is to say, the first peer node is the node that owns the image file in the peer-to-peer network. The image file includes N different image slices, where N is a positive integer greater than or equal to 2. That is to say, the image file includes at least two different image slices. N different image fragments, that is, the N image fragments have different identifiers, but the information associated with the application carried by the N different image fragments may be the same or different. It can be understood that the identifier of a mirror fragment can be used to uniquely identify the mirror fragment. In some implementations, when the image file is stored in an image layer structure, the one image file may include at least one image layer, and the at least one image layer may include the N different image slices. For example, Figure 7 shows a schematic diagram of the relationship between image files and image layers. In Figure 7, an image file can be divided into P image layers, where P is a positive integer greater than or equal to 1. Figure 8 shows a schematic diagram of the relationship between the mirror layer and the mirror shards. In Figure 8, the mirror layer P can be divided into m mirror shards, where m is a positive integer greater than or equal to 2. The type of application is not specifically limited. In some implementations, the application is a cloud gaming application, and the image file associated with the application is an updated image file generated by the cloud gaming application. In other implementations, the application program may also be a video application program, and the image file associated with the application program is an image file generated by the video application program.

In this embodiment of the present disclosure, the N second peer nodes are N peer nodes in the peer-to-peer network that do not store image files associated with the application. That is to say, before executing the image distribution method provided by the present disclosure, each second peer node included in the peer-to-peer network does not own at least one image shard included in the image file.

Next, S601 to S606 are introduced in detail.

S601. The control node sends a download instruction to N second peer nodes. The download instruction is used to instruct to start downloading the image file, and N is a positive integer greater than or equal to 2.

Optionally, the download command can carry the identifier of the image file. The identifier of the image file is used to uniquely identify the image file. pieces. After the control node executes the above S601, all N second peer nodes receive the download instruction. Each second peer node may determine the image file that needs to be downloaded according to the identification of the image file included in the download instruction.

Optionally, in some embodiments, before the above S601, the control node may also perform the following steps: receive a request sent by the user terminal, which request indicates that the N second peer nodes in the peer-to-peer network need to obtain the image file. Optionally, the N second peer nodes may provide network services (for example, data stored locally by the N second peer nodes) for the user terminal. Among them, the type of user terminal is not specifically limited. For example, the user terminal may be, but is limited to, any of the following: a smartphone, a tablet computer, a desktop computer, or a wearable smart device (for example, a smart watch), etc.

The above S601 is executed, that is, the control node sends an instruction to start downloading the image file associated with the application program to the N second peer nodes.

S602. The i-th second peer node determines the download order of N image fragments included in the download image file according to the received download instruction sent by the control node, i=1, 2,...,N.

The above S602 is executed, that is, each second peer node among the N second peer nodes (i.e., the i-th second peer node) will determine the N included in the downloaded image file of each second peer node. The download order of the mirror shards, the N second peer nodes correspond to the N download orders one-to-one, and the N download orders are different.

In some implementations, the N downloading orders are different, which can be understood as any two downloading orders among the N downloading orders are completely different. For example, when the image file includes 2 image shards (ie, image shard 1 and image shard 2), and the N second peer nodes include 2 second peer nodes, one of the second peer nodes The download order determined by the second peer node may be to download image fragment 1 first, and then image fragment 2; the download order determined by the other second peer node may be to download image fragment 2 first, and then download image fragment 1. . In this implementation, the download sequences corresponding to the two second peer nodes are completely different.

In other implementations, the N downloading orders are different, which can be understood to mean that any two downloading orders among the N downloading orders are not exactly the same. Wherein, any two downloading orders are not exactly the same, which means that the image fragments of the first download indicated by any two downloading orders are different, and the image fragments indicated by any two downloading orders except the first downloaded The download order of other image fragments after the image fragment is not specifically limited. For example, when the image file includes 3 image shards (ie, image shard 1, image shard 2, and image shard 3), the N second peer nodes include 2 second peer nodes. When , one of the second peer nodes determines the order of downloading the image fragments in order: image fragment 1, image fragment 2, and image fragment 3; the other second peer node determines the order of downloading the image fragments. The order is: mirror shard 3, mirror shard 2 and mirror shard 1; or the order determined by another second peer node to download the mirror shards is: mirror shard 2, mirror shard 1 and mirror shard. 3. In this implementation, the two second pairs The download order corresponding to other nodes is not exactly the same.

S603. The i-th second peer node determines to send the first query message to the first peer node and sends the first query message to other second peer nodes according to the i-th download sequence corresponding to the i-th second peer node. 2. Query news.

The first query message is used to query the i-th image fragment included in the image file, and the i-th image fragment is the first image fragment downloaded as indicated by the i-th download sequence. In some implementations, when the download order corresponding to each of the N second peer nodes indicates that the first image fragment to be downloaded is different, the above S603 is executed, that is, each second peer node The query messages sent by the two peer nodes to the first peer node query different mirror shards.

The second query message is used to query an image fragment other than the i-th image fragment included in the image file, and the image fragment queried by the second query message is the j-th image fragment downloaded indicated by the i-th download sequence. mirror shards, j=2,3,…,N. It can be understood that when N is specifically a positive integer greater than or equal to 3, if the second query message is the first second query message sent by the i-th second peer node, then j=2; When the second query message is the second second query message sent by the i-th second peer node, then j=3; and so on. For example, when the image file includes 3 image shards (ie, image shard 1, image shard 2, and image shard 3), the N second peer nodes include 2 second peer nodes. When , one of the second peer nodes determines the order of downloading the image fragments in order: image fragment 1, image fragment 2, and image fragment 3; the other second peer node determines the order of downloading the image fragments. The order is: mirror shard 3, mirror shard 2 and mirror shard 1. In this implementation, the first query message sent by the second peer node is used to query the mirror shard 1. The first query message sent by the other second peer node is used to query the mirror shard 2. The first second query message sent by the second peer node is used to query the mirror shard 2, and the second second query message sent by the second peer node is used to query the mirror shard 3. The first second query message sent by the other second peer node is used to query the mirror shard 2, and the second second query message sent by the other second peer node is used to query the mirror shard 2. 1.

Other second peer nodes refer to the N-1 second peer nodes other than the i-th second peer node among the N second peer nodes.

S604. The i-th second peer node sends a first query message to the first peer node, and sends a second query message to other second peer nodes to obtain the image file.

In some implementations, the i-th second peer node sends a first query message to the first peer node, and sends a second query message to other second peer nodes to obtain the image file, including the following steps: The i second peer node sends a first query message to the first peer node; the i second peer node receives the i-th mirror fragment sent by the first peer node and the i-th mirror fragment corresponding to Hash value, and the hash value corresponding to each image fragment is different; when it is determined that the i-th image fragment received passes the integrity check, the i-th second peer node saves the i-th image shards, and sends a second query message to other second peer nodes; the i-th second peer node receives the mirror shard and the queried mirror queried by the second query message sent by other second peer nodes. The hash value corresponding to the fragment, the number of mirror fragments sent by other second peer nodes does not exceed the preset threshold; when it is determined that the mirror fragment queried by the received second query message passes the integrity check , the i-th second peer node saves the mirror shard queried by the second query message. It can be understood that after performing the above steps, the i-th second peer node can obtain all image fragments (ie, N image fragments) included in the image files sent by the first peer node and other second peer nodes. ). In this implementation, N second peer nodes with N different image shards in the peer-to-peer network can interact with each other to share the image shards stored with each other, which can alleviate the problem of having a complete image file. The transmission burden on a peer node improves the speed and efficiency of node downloads. In this implementation, each second peer node does not need to wait to receive the complete image file before sending the image file to other second peer nodes that do not store the image file, which can improve the efficiency of image distribution. efficiency.

Optionally, in other implementations, the i-th second peer node may also send a second query message to the first peer node. In this implementation, it is possible that the number of image fragments being uploaded by the first peer node exceeds the preset threshold. Even if the first peer node receives the second query message and the first peer node locally stores the second In the case of the mirror shard queried by the query message, the first peer node will not send the mirror shard queried by the second query message to the i-th second peer node. That is to say, in this implementation, after the first peer node receives the second query message, the query result of the second query message sent to the i-th second peer node is failure, and the query result does not include the i-th second peer node. 2. The mirror shard queried by the query message.

In the above implementation, the image fragment queried by the second query message is the j-th image fragment downloaded as indicated by the i-th download sequence, j=2,3,...,N. That is to say, the i-th second peer node will send N-1 second query messages to obtain N-1 different mirror shards queried by the N-1 second query messages. Optionally, in some implementations, after the i-th second peer node determines that a currently received mirror fragment passes the integrity check, the i-th second peer node can continue to send a new query. information. In other words, when the i-th second peer node determines that a mirror fragment currently received does not pass the integrity check, the i-th second peer node will retransmit the message to request a retransmission. Get the complete image shard. The i-th second peer node sends the second query message to other second peer nodes, and may send the second query message to all the N-1 second peer nodes at the same time. Based on this, in some possible implementations, the i-th second peer node sends a second query message to other second peer nodes, including: the i-th second peer node sends a second query message to N second peer nodes All second peer nodes except the i-th second peer node send the first second query message, and the mirror fragment queried by the first second query message is downloaded as indicated by the i-th download sequence. The second mirror fragment (j=2); when the i-th second peer node determines that it has successfully received the first second In the case of querying the mirror shard queried by the message, the i-th second peer node sends the second second peer node to all N second peer nodes except the i-th second peer node. The second query message, the mirror fragment queried by the second second query message is the third mirror fragment (j=3) downloaded indicated by the i-th download sequence,..., and so on, until the i-th The second peer node obtains the mirror fragment queried by the N-1th query message, and the i-th second peer node stops sending the second query message.

Optionally, in the above implementation, each second peer node that receives the mirror fragments can also perform an integrity check on the received mirror fragments to confirm that each second peer node has received Whether the image shards are complete or have been tampered with. Based on this, the image distribution method provided by the embodiment of the present disclosure may also include the following steps: the i-th second peer node performs integrity verification on the received image fragments, and the i-th second peer node receives The mirror fragment includes the i-th mirror fragment and the mirror fragment queried by the second query message; if it is determined that the i-th mirror fragment received does not pass the integrity check, the i-th second peer node sends a request to the i-th second peer node. A peer node sends a first retransmission message, and the first retransmission message is used to instruct the first peer node to send the i-th mirror fragment; if it is determined that the mirror fragment queried by the received second query message has not passed the complete For verification, the i-th second peer node sends a second retransmission message to other second peer nodes. The second retransmission message is used to instruct other second peer nodes to send the mirror segment queried by the second query message. piece.

Optionally, in some implementations, the i-th second peer node performs integrity verification on each image fragment based on each received image fragment and the hash value corresponding to each image fragment. The verification includes: the i-th second peer node performs hash calculation on each received image fragment and obtains the hashed value; the i-th second peer node compares the hashed value The hash value corresponding to each mirror fragment determines whether each mirror fragment passes the integrity check; among them, if the calculated hash value is the same as the hash value corresponding to each mirror fragment, then it is determined Each mirror fragment passes the integrity check; if the calculated hash value is different from the hash value corresponding to each mirror fragment, it is determined that each mirror fragment fails the integrity check. The type of hash algorithm used for hash calculation is not specifically limited. For example, the hash algorithm may be, but is not limited to, a hash algorithm or a message digest algorithm.

Optionally, in some scenarios, other second peer nodes in the above implementation do not locally store the mirror shards queried by the second query message. In this way, even if the other second peer nodes receive the second query message Afterwards, the mirror shards queried by the second query message and the corresponding hash values cannot be sent to the i-th second peer node. In this implementation, other second peer nodes send requests to the i-th second peer node. The query result of the second query message sent by the peer node is failure. Based on this, that is, if the i-th second peer node in the above implementation does not receive the mirror shard queried by the second query message sent by other second peer nodes and the hash corresponding to the queried mirror shard. value, the image distribution method provided by the embodiment of the present disclosure may also include the following steps: the i-th second peer node sends a second query message to the first peer node; the i-th second peer node receives the first peer The mirror shard queried by the second query message sent by the node and the queried The hash value corresponding to the image shard. For example, when the image file includes 3 image shards (ie, image shard 1, image shard 2, and image shard 3), the N second peer nodes include 2 second peer nodes. When , one of the second peer nodes determines the order of downloading the image fragments in order: image fragment 1, image fragment 2, and image fragment 3; the other second peer node determines the order of downloading the image fragments. The order is: mirror shard 3, mirror shard 2 and mirror shard 1. In this scenario, if the one second peer node and the other second peer node simultaneously download the second image fragment (ie, image fragment 2) indicated by the corresponding download sequence, the The other second peer node and the one second peer node send query messages to each other to query the mirror shard 2. Since neither of the above two second peer nodes locally stores the mirror shard 2, the above two second peer nodes do not store the mirror shard 2 locally. The two peers cannot interact with each other to obtain mirror shard 2. Thereafter, the one second peer node and the other second peer node may send a query message querying the mirror shard 2 to the first peer node. Alternatively, the second peer node may send a query message for querying the mirror fragment 2 to the first peer node to save the obtained mirror fragment 2 locally; the other second peer node may then send a query message to the first peer node to save the obtained mirror fragment 2 locally; The one second peer node sends a message querying the mirror fragment 2 to obtain the mirror fragment 2.

S605: The first peer node determines, based on the N first query messages, N different image fragments included in the image file queried by sending the N first query messages to the N second peer nodes.

S606: The first peer node sends N mirror fragments and N different hash values corresponding to the N mirror fragments to the N second peer nodes through N network channels, so that the i-th second pair The peer node interacts with other second peer nodes to obtain the image file.

There is no specific limitation on the method in which the first peer node sends the image fragments and the hash values corresponding to the image fragments. For example, the first peer node may encapsulate the image fragment and the hash value corresponding to the image fragment in the same data packet, and send the encapsulated data packet to the corresponding second peer node . The second peer node can obtain the image fragment and the hash value corresponding to the image fragment after parsing the received data packet. For another example, the first peer node can encapsulate the image fragment and the hash value corresponding to the image fragment in two different data packets, and send the two encapsulated data packets to the corresponding node at the same time. the second peer node.

In this embodiment of the disclosure, the i-th second peer node interacts with other second peer nodes to obtain the image file, including: the i-th second peer node sends a first query message to the first peer node, and sending a second query message to other second peer nodes to obtain the image file. The process of this implementation method is described in detail in S604 above. For content not described in detail here, please refer to the relevant description in S604 above.

After executing "the first peer node sends N mirror fragments and N different hash values corresponding to the N mirror fragments to N second peer nodes through N network channels" in the above S606, the peer node Each of the N second peer nodes included in the network that do not store the image file can successfully obtain one of the image files included in the network. Image shards, and each second peer node obtains different image shards. Based on this, N second peer nodes in the peer-to-peer network can interact with each other to obtain the image shards stored by each other, which can reduce the transmission burden of the first peer node that owns the complete image file 1 and improve the efficiency of node downloading. Speed and efficiency. In addition, when N second peer nodes share the image shards owned by each other, each second peer node is downloading the image shards stored by other second peer nodes and at the same time, it is also sending data to other second peer nodes. Peer nodes upload their own stored image shards, which can improve the transmission efficiency of image shards.

Optionally, after performing the above S601 to S606, the i-th second peer node in the peer-to-peer network may receive the N image fragments included in the image file. In order to verify whether the i-th second peer node successfully receives the complete image file, the integrity of all image fragments received by the i-th second peer node can be further verified to determine the i-th second peer node. Whether the peer node successfully received the image file. In some implementations, the above integrity verification can be performed in the following manner: the i-th second peer node hashes all received image shards, obtains hash value #2, and converts the hash value #2 is sent to the control node; the first peer node hashes the image file to obtain hash value #3, and sends hash value #3 to the control node; the control node performs hash value #2 and Compare hash value #3 to obtain verification information. The verification information is used to indicate whether the i-th second peer node successfully received the complete image file; among them, if hash value #2 and hash value #3 The same, the verification information is used to indicate that the i-th second peer node successfully received the complete image file; or, if the hash value #2 and the hash value #3 are not the same, the verification information is used to indicate that the i-th The second peer did not successfully receive the complete image file. In other implementations, the above integrity verification can be performed in the following manner: the i-th second peer node hashes all received image fragments and obtains hash value #2; the first peer node The node hashes the image file to obtain hash value #3, and sends hash value #3 to the i-th second peer node; the i-th second peer node processes hash value #2 and hash Compare with value #3 to obtain verification information. The verification information is used to indicate whether the i-th second peer node successfully received the complete image file; among them, if hash value #2 and hash value #3 are the same, The verification information is used to indicate that the i-th second peer node successfully received the complete image file; or, if hash value #2 and hash value #3 are not the same, the verification information is used to indicate that the i-th second peer node The peer node did not successfully receive the complete image file. In this implementation, the i-th second peer node may also send a retransmission message to obtain at least one image fragment included in the unowned image file.

Optionally, in the process described in the image distribution method shown above, peer nodes in the P2P network can also communicate with other peer nodes to obtain the current network status of the other peer nodes. The network status of a peer node may include the speed at which the peer node uploads data to other peer nodes, and the speed at which the peer node downloads data from other peer nodes. In the P2P network, if any peer node discovers that the speed of data uploaded by any peer node to other peer nodes does not meet the preset upload speed, or that any peer node transfers data from other peer nodes to If the download speed of the peer node does not meet the preset download speed, any peer node can also send the obtained network status information to the control node, so that the control node reallocates the peer nodes in the P2P network based on the network status information. network bandwidth, thereby solving the problem that the upload speed or download speed of any peer node does not meet the preset speed, which is beneficial to ensuring that the network is in a stable working state. Based on this, the image distribution method provided by the embodiment of the present disclosure may also include the following steps: the i-th second peer node sends N detection messages to the first peer node and other second peer nodes to obtain N networks The network quality corresponding to the channel. N second peer nodes correspond to N detection messages one-to-one. The network quality corresponding to the i-th network channel does not meet the preset requirements. The i-th network channel is the i-th second peer. A network channel for data transmission between the node and the first peer node, or a network channel for data transmission between the i-th second peer node and one of the other second peer nodes; the i-th second peer node The two peer nodes send the network quality corresponding to the N network channels to the control node, so that the control node evaluates the N network channels except the i-th network channel according to the network quality corresponding to the N network channels. Adjust the bandwidth value corresponding to other network channels. For example, Figure 10 below is a network bandwidth adjustment method provided by an embodiment of the present disclosure. For content not described in detail here, please refer to the relevant description in Figure 10 below.

It should be understood that the image distribution method shown in FIG. 6 is only for illustration and does not constitute any limitation on the image distribution method provided by the embodiment of the present disclosure.

In the embodiment of the present disclosure, the first peer node in the peer-to-peer network that stores the image file sends the image fragments included in the image file to the second peer node in the peer-to-peer network that does not store the image file through different network channels, and The image shards received by each second peer are different. After receiving the image fragments included in the image file, the second peer node in the peer-to-peer network that does not store the image file can serve as a resource node in the peer-to-peer network and send data to other nodes in the peer-to-peer network that do not store the image fragments. The second peer node provides upload functionality. In the above implementation process, after receiving the image fragments included in the image file, the second peer node that does not store the image file can distribute the image fragments included in the image file to the network without waiting to receive the complete image file. The other second peer nodes in the network can improve network bandwidth utilization and reduce the total time spent on distributing image files on the network, thereby achieving the purpose of quickly distributing image files on the network. During the above image distribution process, the integrity of the image fragments associated with the image file received by the peer node is verified to determine whether the second peer node in the network that does not store the image file has successfully received the image file. When distributing image files on the network, image fragmentation is used as the minimum transmission granularity, which can improve the flexibility of image distribution. In the scenario where image fragment transmission fails, only the abnormal image fragments need to be retransmitted, avoiding the problem of retransmitting the entire image file in related technologies, and helping to reduce the retransmission rate.

Next, taking the network architecture shown in Figure 3A above as an example, another image distribution method provided by the present disclosure will be introduced in conjunction with Figures 9A and 9B. For ease of description, the network architecture shown in Figure 3A is referred to as a P2P network in the following. Reasonable It should be understood that the image distribution method described in FIG. 9A and FIG. 9B is a specific example of the image distribution method described in FIG. 6. The method described in FIG. 9A and FIG. 9B is only for illustration and does not apply to the embodiments of the present disclosure. The provided image distribution method constitutes no limitation. Specifically, in Figures 9A and 9B, the peer-to-peer network in the method described in Figure 6 includes a control node, peer node 1, peer node 2 and peer node 3. The application scenario in Figure 6 is a cloud game. The scenario is introduced as an example, as well as the game update image file 1 stored in peer node 1 to be shared. Among them, peer node 1 can be understood as the first peer node shown in Figure 6 above, peer node 2 and peer node 3 can be understood as the N second peer nodes shown in Figure 6 above, N =2.

Figure 9A is a schematic diagram of another image distribution method provided by an embodiment of the present disclosure. It should be understood that the example in FIG. 9A is only to help those skilled in the art understand the embodiments of the present disclosure, but is not intended to limit the application embodiments to the specific numerical values or specific scenarios illustrated. Those skilled in the art can obviously make various equivalent modifications or changes based on the example of FIG. 9A given below, and such modifications and changes also fall within the scope of the embodiments of the present disclosure. As shown in Figure 9A, the method includes S901 to S911. Next, S901 to S911 are introduced in detail.

S901, the control node obtains request 1.

The control node is a node in the peer-to-peer network used to manage peer node 1, peer node 2 and peer node 3. In the embodiment of the present disclosure, the control node may be a node independent of peer node 1, peer node 2, and peer node 3.

Request 1 is used to request image file 1 generated by running application 1. Application 1 may be a cloud game application, and image file 1 may be a game update image file, and the specific type of application 1 is not limited. Image file 1 may include an image layer, which includes image slice 1 and image slice 2, that is, image file 1 includes image slice 1 and image slice 2, and the identifier of image slice 1 It is different from the identifier of mirror shard 2. The identity of image slice 1 is different from the identity of image slice 2, which means that image slice 1 and image slice 2 are two different image slices included in image file 1. For example, Figure 7 shows a schematic diagram of the relationship between image files and image layers. In Figure 7, an image file can be divided into P image layers, where P is a positive integer greater than or equal to 1. Figure 8 shows a schematic diagram of the relationship between the mirror layer and the mirror shards. In Figure 8, the mirror layer P can be divided into m mirror shards. m is a positive integer greater than or equal to 2. Mirror shard 1 and mirror shard 2 are Image N consists of two different image shards. There is no specific limitation on the presentation form of the identifier of the image fragment in the image file. For example, the identifier of the mirror fragment m is (T1, T2), T1 identifies the mirror layer P where the mirror fragment m is located, and T2 identifies the specific location in the mirror layer P where the mirror fragment m is located.

In practical applications, the control node may actively obtain the request 1 from the user terminal, or the user terminal may actively send the request 1 to the control node. This disclosure does not specifically limit this.

It can be understood that in the embodiment of the present disclosure, all image slices included in the image file 1 are stored in the following order: image slice 1, image slice 2.

S902: The control node sends instruction 1 to peer node 2 and peer node 3 respectively. Instruction 1 is used to instruct to download the image file requested by request 1. Correspondingly, peer node 2 and peer node 3 receive instruction 1 respectively.

Request 1 in the above S901 is used to request to obtain the image file 1. Based on this, the instruction 1 is specifically used to instruct to start downloading the image file 1 requested by the request 1.

S903: According to instruction 1, peer node 2 determines that all image fragments included in the image file requested by request 1 need to be downloaded in the first download order.

The first download order is the order in which all image fragments included in image file 1 are downloaded. Among them, the first download sequence is to download image fragment 1 first, and then download image fragment 2.

Among them, the peer node 2 determines that it needs to download all the image fragments included in the image file requested by the request 1 in the first download order according to the instruction 1, including: the peer node 2 determines that it needs to download the image file 1 including the image according to the instruction 1. Slice 1 and image slice 2; Peer node 2 randomly sorts the order of the image slices included in image file 1 to obtain the first download order.

S904: According to the instruction 1, the peer node 3 determines that all the image fragments included in the image file requested by the request 1 need to be downloaded in the second download sequence.

The second download order is the order in which all image fragments included in the image file 1 are downloaded, and the second download order is different from the first download order. Among them, the second download sequence is to download image fragment 2 first, and then download image fragment 1.

Among them, the peer node 3 determines that it needs to download all the image fragments included in the image file requested by the request 1 in the second download order according to the instruction 1, including: the peer node 3 determines that it needs to download the image file 1 including the image according to the instruction 1. Slice 1 and image slice 2; peer node 3 randomly sorts the order of the image slices included in image file 1 to obtain the second download order.

S905: Peer node 2 sends query message 1 to the node in the P2P network to query mirror shard 1.

Query message 1 is associated with the first download sequence. Query message 1 is specifically used to query the first image fragment that needs to be downloaded in the sequence of downloading image fragments indicated by the first download sequence. That is, query message 1 is used to query the image. Shard 1.

Among them, the peer node 2 sends a query message 1 to the node in the network, including: the peer node 2 determines according to the instruction 1 that the peer node 2 does not store all the image fragments included in the image file 1 locally; the peer node 2 determines according to the instruction 1; A download sequence generates query message 1.

S906: Peer node 3 sends query message 2 to the node in the network to query mirror shard 2.

Query message 2 is associated with the second download sequence. Query message 2 is specifically used to query the second image fragment that needs to be downloaded in the sequence of downloading image fragments indicated by the first download sequence. That is, query message 2 is used to query the image. Shard 2.

Among them, the peer node 3 sends a query message 2 to the node in the network, including: the peer node 3 confirms according to the instruction 1 It is determined that the peer node 3 does not store all the image fragments included in the image file 1 locally; the peer node 3 generates the query message 2 according to the second download sequence.

S907: Peer node 1 determines that mirror fragment 1 is stored locally according to query message 1; and determines that mirror fragment 2 is stored locally according to query message 2.

Among them, the peer node 1 determines that the mirror fragment 1 is stored locally according to the query message 1, including: the peer node 1 queries the locally stored mirror fragment 1 according to the identification of the mirror fragment 1 carried in the query message 1, and determines the local storage of the mirror fragment 1. Mirror shard 1 is stored.

Among them, the peer node 1 determines that the mirror fragment 2 is stored locally according to the query message 2, including: the peer node 1 queries the locally stored mirror fragment 2 according to the identifier of the mirror fragment 2 carried in the query message 2, and determines the local storage of the mirror fragment 2. Mirror shard 2 is stored.

S908, in response to satisfying condition 1, peer node 1 sends mirror fragment 1 and hash value 1 to peer node 2 through network channel 1.

Satisfying condition 1 includes: satisfying that the number of mirror shards uploaded by peer node 1 does not exceed the preset upload number. There is no specific limit on the preset upload data amount, and the preset upload amount can be determined based on the current network status of peer node 1. That is to say, when the current network status of peer node 1 is relatively good, the preset upload quantity can be larger; when the current network status of peer node 1 is not very good, the preset upload quantity can be smaller. For example, the preset upload number may be, but is not limited to, equal to 1 or 2, etc.

Network channel 1 is a network channel for data transmission between peer node 1 and peer node 2.

Optionally, before the above-mentioned S908, the peer node 1 can also perform hash calculation on the mirror fragment 1 to obtain the hash value 1, and the hash value 1 is used to implement the integrity check of the mirror fragment 1. The type of hash algorithm is not specifically limited. For example, the hash algorithm may be, but is not limited to, a hash algorithm or a message digest algorithm.

The form in which the peer node 1 sends the image fragment 1 and the hash value 1 to the peer node 2 through the network channel 1 is not limited. For example, peer node 1 can encapsulate image fragment 1 and hash value 1 in a data packet, and then send the encapsulated data packet to peer node 2. For another example, peer node 1 can also encapsulate image fragment 1 and hash value 1 in two data packets respectively, and then send the two encapsulated data packets together to peer node 2.

S909, in response to satisfying condition 1, peer node 1 sends mirror fragment 2 and hash value 2 to peer node 3 through network channel 3.

The satisfaction condition 1 in the above S909 is the same as the satisfaction condition 1 in the above S908. When satisfying condition 1 in the above S908 includes: satisfying that the number of mirror fragments uploaded by the peer node 1 does not exceed 1 mirror fragment, the peer node 1 can first execute the above S908 and then execute the above S909, or the peer node 1 You can first execute the above S909 Then execute the above S908.

Network channel 3 is a network channel for data transmission between peer node 1 and peer node 3, and network channel 3 and network channel 1 are not the same network channel. In other words, peer 1 transmits different image shards over different network channels.

Optionally, before the above S909, peer node 1 can also perform hash calculation on mirror shard 2 to obtain hash value 2.

S910: Peer node 2 performs an integrity check on the image fragment 1 based on the image fragment 1 and the hash value 1, and determines that the received image fragment 1 is complete.

Among them, the peer node 2 performs an integrity check on the image fragment 1 based on the image fragment 1 and the hash value 1 to determine that the received image fragment 1 is complete, including: the peer node 2 uses a hash algorithm to verify the integrity of the image fragment 1. Image fragment 1 is processed and hash value #1 is obtained; by comparing hash value 1 and hash value #1, it is determined that the received image fragment 1 is complete, that is, there is no Been attacked or tampered with. It can be understood that the hash algorithm used by peer node 1 to determine hash value 1 based on mirror shard 1 is the same as the hash algorithm used by peer node 2 to determine hash value #1 based on mirror shard 1.

For example, when peer node 1 encapsulates image fragment 1 and hash value 1 in the same data packet, and sends the encapsulated data packet to peer node 2, peer node 2 is executing The above-mentioned S910 can also perform the following operations: parse this data packet and obtain image fragment 1 and hash value 1.

S911. Peer node 3 performs an integrity check on image fragment 2 based on image fragment 2 and hash value 2, and determines that the received image fragment 2 is complete.

The principle for peer node 3 to perform the above S911 is the same as the principle for peer node 2 to perform the above S910. For content not described in detail here, please refer to the above related description of S910.

It can be understood that after the above-mentioned S901 to the above-mentioned S911 are executed, the first round of distribution of the image slices included in the image file 1 is completed. During the first round of distribution, peer nodes in the P2P network that do not own the image file (i.e., peer node 2 and peer node 3) can obtain an image file included in the image file from peer node 1 that owns the image file. Mirror sharding. Specifically, peer node 2 obtains mirror fragment 1 from peer node 1 through network channel 1, and peer node 3 obtains mirror fragment 2 from peer node 1 through network channel 3. Network channel 1 is different from network channel 3. Mirror shard 1 is different from mirror shard 2. That is to say, after the first round of image shard distribution is completed, peer node 2 and peer node 3 in the P2P network respectively have different image shards included in the image file 1. After that, peer node 2 and peer node 3 in the P2P network can obtain the mirror shards owned by each other through resource sharing. Next, the second round of distribution process will be introduced in detail with reference to S912 to S922 shown in FIG. 9B.

S912: Peer node 2 generates query message 3 according to instruction 1 and the first download sequence.

After the first round of distribution is performed, the local storage of peer node 2 has the image slice 1 included in the image file 1. Based on this, the peer node 2 generates a query message 3 according to the instruction 1 and the first download sequence. The query message 3 is specifically used to query the second image that needs to be downloaded in the sequence of downloading image fragments indicated by the first download sequence. Sharding, that is, query message 3 is used to query mirror shard 2. Optionally, the query message 3 can carry the identity of the mirror shard 2 and the identity of the peer node 2. The identity of the mirror shard 2 is used to uniquely identify the mirror shard 2, and the identity of the peer node 2 is used to uniquely identify the peer. Node 2.

S913: Peer node 3 generates query message 4 according to instruction 1 and the second download sequence.

After the first round of distribution is performed, the local storage of peer node 3 contains image slice 2 included in image file 1. Based on this, the peer node 3 generates a query message 4 according to the instruction 1 and the second download sequence. The query message 4 is specifically used to query the second image that needs to be downloaded in the sequence of downloading image fragments indicated by the first download sequence. Sharding, that is, query message 4 is used to query mirror shard 1. Optionally, the query message 4 can carry the identifier of mirror fragment 1 and the identifier of peer node 3. The identifier of mirror fragment 1 is used to uniquely identify mirror fragment 1, and the identifier of peer node 3 is used to uniquely identify the peer. Node 3.

S914. Peer node 2 sends query message 3 to the node in the P2P network to query mirror shard 2. Correspondingly, the node in the P2P network receives query message 3.

Among them, the peer node 2 sends the query message 3 to the nodes in the P2P network, including: the peer node 2 sends the query message 3 to the peer node 1 through the network channel 1, and sends the query message 3 to the peer node 3 through the network channel 2. , and send query message 3 to the control node through network channel 4.

S915. Peer node 3 sends query message 4 to the node in the P2P network to query mirror shard 1. Correspondingly, the node in the P2P network receives the query message 4.

Among them, the peer node 4 sends the query message 4 to the nodes in the P2P network, including: the peer node 4 sends the query message 4 to the peer node 1 through the network channel 3, and sends the query message 4 to the peer node 2 through the network channel 2. , and send query message 4 to the control node through network channel 6.

S916: Peer node 3 determines that mirror fragment 2 is stored locally according to query message 3 and conditions 2 are met.

Satisfying condition 2 includes: satisfying that the peer node does not store all the image fragments included in the image file 1 locally, and the number of image fragments uploaded by the peer node does not exceed the preset upload number. That is to say, the peer node that meets condition 2 is not the peer node that owns the complete image file 1, and the number of image fragments uploaded by the peer node does not exceed the preset upload number.

There is no specific limit on the preset upload quantity, and it can be set according to the network status of a peer node or user needs. The preset upload number corresponding to each peer node in the P2P network can be the same or different.

Among them, the peer node 3 determines that the mirror shard 2 is stored locally according to the query message 3, including: the peer node 3 queries the locally stored data according to the identifier of the mirror shard 2 carried in the query message 3, and determines that the mirror is stored locally. The identifier of shard 2 corresponds to the mirror shard 2.

S917: Peer node 2 determines that mirror fragment 1 is stored locally according to query message 4 and conditions 2 are met.

The satisfying condition 2 described in the above S917 is the same as the satisfying condition 2 described in the above S916. For content not described in detail here, please refer to the relevant description in the above S916.

Among them, the peer node 2 determines that the mirror fragment 1 is stored locally according to the query message 4, including: the peer node 2 queries the locally stored data according to the identifier of the mirror fragment 1 carried in the query message 4, and determines that the mirror is stored locally. The identifier of fragment 1 corresponds to the mirror fragment 1.

S918: Peer node 1 determines that mirror fragment 2 is stored locally according to query message 3, and determines that mirror fragment 1 is stored locally according to query message 4, and conditions 3 are met.

Meeting condition 3 includes: the peer node locally stores all the image fragments included in the image file 1, and the number of image fragments uploaded by the peer node exceeds the preset upload number. It can be understood that when peer node 1 satisfies condition 3, even if peer node 1 locally stores mirror fragment 2 corresponding to query message 3, and mirror fragment 1 corresponding to query message 4, peer node 1 Nor will mirror shard 2 be sent to peer 2, nor will mirror shard 1 be sent to peer 3.

S919, in response to satisfying condition 2, peer node 3 sends mirror fragment 2 and hash value 2 to peer node 2 through network channel 2.

S920, in response to satisfying condition 2, peer node 2 sends mirror fragment 1 and hash value 1 to peer node 3 through network channel 2.

It can be understood that the above S919 and S920 can be executed at the same time. At this time, the peer node 2 that owns part of the image fragments of the image file 1 (ie, the image fragment 1) not only downloads the peer node 3 from the peer node 3 Node 3 owns part of the image shards of image file 1 (i.e., image shard 2). At the same time, peer node 2 also acts as a resource provider and uploads locally stored image shard 1 to peer node 3. This This method can improve the transmission efficiency of image fragmentation.

S921. Peer node 2 performs an integrity check on image fragment 2 based on image fragment 2 and hash value 2, and determines that the received image fragment 2 is complete.

The principle of the integrity check performed by the peer node 2 in the above S921 is similar to the principle of the integrity check performed by the peer node 2 in the above S910. For content not described in detail here, please refer to the relevant description in the above S910.

S922: Peer node 3 performs an integrity check on image fragment 1 based on image fragment 1 and hash value 1, and determines that the received image fragment 1 is complete.

The principle of the integrity check performed by the peer node 3 in the above S922 is similar to the principle of the integrity check performed by the peer node 2 in the above S910. For content not described in detail here, please refer to the relevant description in the above S910.

It should be noted that when the peer node 3 does not satisfy condition 2 in the above S919 and the peer node 2 does not satisfy the condition 2 in the above S917, after executing the above S917, the peer node 1 can also send a message to the peer node 2. Mirror fragment 2 and hash value 2, send mirror fragment 1 and hash value 1 to peer node 3.

It can be understood that after the above S912 to S922 are executed, the second round of distribution process is completed. During the second round of distribution, peer node 2 and peer node 3 that do not store the complete image file 1 exchange the image shards owned by each other, which can reduce the transmission burden of peer node 1 that owns the complete image file 1 and improve Node download speed and efficiency. Specifically, the peer node (for example, peer node 2 or peer node 3) that owns part of the image shards of image file 1 is also uploading the image shards to other peer nodes while downloading the image shards, which can improve The transmission efficiency of mirror sharding.

After executing the above S922, it may also be determined based on the image fragments received by the peer node 2 and/or the peer node 3 whether the peer node 2 and/or the peer node 3 successfully received the complete image file 1.

In one example, peer node 2 or peer node 3 can perform hash calculation on multiple received image fragments to obtain hash value A; peer node 2 or peer node 3 can also obtain hash value A from the peer node Obtain the hash value B corresponding to the image file 1 at 1; by comparing the hash value A and the hash value B, peer node 2 or peer node 3 can determine that peer node 2 or peer node 3 has successfully received the Complete image file 1.

In another example, peer node 2 or peer node 3 can perform hash calculation on multiple received mirror shards, obtain hash value A, and send message 1 to the control node, message 1 is used to indicate the The hash values of multiple image fragments received by peer node 2 or peer node 3 are hash values A; the control node can also obtain the hash value B corresponding to image file 1 from peer node 1; the control node passes Comparing the hash value A and the hash value B are the same, it can be determined that peer node 2 or peer node 3 has successfully received the complete image file 1; the control node sends message 2 to peer node 2 or peer node 3, message 2 is used to indicate that peer node 2 or peer node 3 has successfully received the complete image file 1.

After executing the above-mentioned first-round distribution and second-round distribution processes and verifying the integrity of the image file, peer node 2 and peer node 3 that did not originally own image file 1 in the P2P network already own the complete image file 1. This ends the entire image distribution process.

It should be understood that the methods shown in the above-mentioned FIG. 9A and the above-mentioned FIG. 9B are only illustrative and do not constitute any limitation on the image distribution method provided by the embodiment of the present disclosure. For example, the execution order of the steps shown in FIG. 9A and FIG. 9B is only illustrative and not limiting. For example, in other possible implementations, the above-mentioned image file 1 may also include a larger number of image slices. For example, the image file 1 includes image slice 1, image slice 2, and image slice 3. In this implementation, The first download order is different from the second download order. The first download order may be: mirror fragment 1, mirror fragment 3 and mirror fragment 2. The second download order may be mirror fragment 3, mirror fragment 1 and mirror. Shard 2. For example, when the peer node 2 performs the above S921 to determine that the received image fragment 2 is incomplete, the peer node 2 may also request the peer node 3 to retransmit the image fragment 2.

In this disclosed embodiment, all multiple peer nodes in the P2P network that do not store the image file 1 (ie, peer node 2 and peer node 3) first download the complete image file 1 from the node that stores the complete image file 1 according to the download instructions sent by the control node. Peer node 1 obtains one image fragment included in image file 1, and the plurality of peer nodes obtain multiple different image fragments through multiple different network channels (ie, network channel 1 and network channel 3) (i.e. mirror shard 1 and mirror shard 2). During the subsequent image shard distribution process, the peer nodes in the P2P network that have obtained some of the image shards included in the image file 1 (i.e., peer node 2 and peer node 3) can share the image shards owned by each other with each other. , which can reduce the transmission burden of peer node 1 with complete image file 1, and improve the speed and efficiency of node downloading. In addition, when peer node 2 and peer node 3 share the image shards owned by each other, the peer node (for example, peer node 2 or peer node 3) that owns part of the image shards of image file 1 is in While downloading the image fragments, the image fragments are also uploaded to other peer nodes, which can improve the transmission efficiency of the image fragments. During the above image distribution process, the integrity of the image fragments associated with image file 1 received by the peer node is verified to determine whether the peer node that does not store image file 1 in the P2P network has successfully received image file 1. . When distributing image file 1 in a P2P network, image fragmentation is used as the minimum transmission granularity, which can improve the flexibility of image distribution. While the image is being distributed, the integrity of the image fragments is verified. Since image distribution and integrity verification of image shards are performed at the same time, it does not affect the efficiency of distributing each image shard.

The above-mentioned FIG. 9A and FIG. 9B illustrate an image distribution method provided by an embodiment of the present disclosure. Optionally, in the process described in the image distribution method shown above, peer nodes in the P2P network can also communicate with other peer nodes to obtain the current network status of the other peer nodes. The network status of a peer node may include the speed at which the peer node uploads data to other peer nodes, and the speed at which the peer node downloads data from other peer nodes. In the P2P network, if any peer node finds that the speed of uploading data by any peer node to other peer nodes does not meet the preset upload speed, or the speed of downloading data by any peer node from other peer nodes If the preset download speed is not met, any peer node can also send the obtained network status information to the control node, so that the control node reallocates the network bandwidth of the peer nodes in the P2P network based on the network status information, thereby Solve the problem that the upload speed or download speed of any peer node does not meet the preset speed. Next, a schematic diagram of a multi-channel bandwidth adjustment method provided by an embodiment of the present disclosure will be introduced with reference to FIG. 10 .

Figure 10 is a schematic diagram of a network bandwidth adjustment method provided by an embodiment of the present disclosure. It should be understood that the example of Figure 10 only It is only to help those skilled in the art understand the embodiments of the present disclosure, but is not intended to limit the application embodiments to the specific numerical values or specific scenarios illustrated. Those skilled in the art can obviously make various equivalent modifications or changes based on the example of FIG. 10 given below, and such modifications and changes also fall within the scope of the embodiments of the present disclosure. As shown in Figure 10, the method includes S1001 to S1004. Below, S1001 to S1004 are introduced in detail.

In this embodiment of the present disclosure, the following description is given by taking the peer node included in the network architecture shown in Figure 3A as an example: Specifically, the speed at which the peer node 1 shown in Figure 3A uploads data to the peer node 3 meets the predetermined speed. Assume that the upload speed (i.e., the speed at which peer node 3 downloads data from peer node 1 meets the preset download speed), and the speed at which peer node 3 uploads data to peer node 1 meets the preset upload speed (i.e., the speed at which peer node 3 The speed at which node 1 downloads data from peer node 3 meets the preset download speed), and the speed at which peer node 2 uploads data to peer node 3 is less than the preset upload speed (that is, the speed at which peer node 3 downloads data from peer node 2 The speed of downloading data is less than the preset download speed). That is to say. The transmission quality of network channel 3 is higher than the transmission quality of network channel 2.

S1001. Within a preset period, peer node 3 detects peer node 1 and peer node 2 respectively to obtain network status information 1.

The size of the preset period is not specifically limited and can be set according to actual needs. For example, the preset period can be 1 second, 5 seconds, or 20 seconds, etc.

Network status information 1 includes network bandwidth 1 and network bandwidth 2, and network bandwidth 1 meets the preset bandwidth requirement, and network bandwidth 2 does not meet the preset bandwidth requirement. Among them, network bandwidth 1 represents the speed at which peer node 1 uploads data to peer node 3. Network bandwidth 1 meets the preset bandwidth requirement, that is, the speed at which peer node 1 uploads data to peer node 3 meets the preset upload speed. Network bandwidth 2 represents the speed at which peer 2 uploads data to peer 3. Network bandwidth 2 does not meet the preset bandwidth requirement, that is, the speed at which peer node 2 uploads data to peer node 3 is less than the preset upload speed.

Executing the above S1001 includes: within a preset period, peer node 3 probes peer node 1 to obtain network bandwidth 1; and peer node 3 probes peer node 2 to obtain network bandwidth 2. For example, peer node 3 can use raw-socket technology to perform inter-node speed measurement on peer node 1 to obtain network bandwidth 1.

S1002. Peer node 3 sends network status information 1 to the control node. Correspondingly, the control node receives the network status information 1 sent by the peer node 3.

The triggering condition for the peer node 3 to send the network status information 1 to the control node is not specifically limited. For example, when the peer node 3 determines that the speed at which the peer node 2 uploads data to the peer node 3 is less than the preset upload speed, the peer node 3 sends message 1 to the control node. For another example, the peer node 3 may still discover that the peer node 3 still finds the peer node 3 after determining that the speed at which the peer node 2 uploads data to the peer node 3 is less than the preset upload speed and waiting for a short preset time (for example, 100 milliseconds). 2. When the speed of uploading data to peer node 3 is less than the preset upload speed, the peer node 3Send network status information 1 to the control node.

S1003. The control node determines that the network bandwidth 3 needs to be increased based on the preset network bandwidth requirement and network status information 1 to obtain network bandwidth #3.

Network bandwidth 3 represents the speed at which peer 3 uploads data to peer 1. The preset bandwidth requirement represents the preset upload speed for one peer to upload data to another peer.

Among them, the control node determines the need to increase the network bandwidth 3 based on the preset bandwidth requirement and network status information 1, including: the control node determines the preset upload speed minus the peer node 2 to the peer node based on the network bandwidth 2 and the preset bandwidth requirement. Wait until the upload speed of data uploaded by node 3 is equal to the first value; the control node determines that the network bandwidth 3 needs to be increased by the first value to obtain network bandwidth #3. Among them, network bandwidth #3 meets the preset bandwidth requirements. That is to say, the speed of peer node 3 uploading data to peer node 1 indicated by network bandwidth #3 is greater than the speed of peer node 3 uploading data to peer node 1 indicated by network bandwidth #3. At the same time, the speed at which peer node 3 uploads data to peer node 1, indicated by network bandwidth #3, meets the preset upload speed requirement.

In the above implementation, the speed at which peer node 2 uploads data to peer node 3 is less than the preset upload speed, that is, the network quality of network channel 2 is not very good. When the speed of peer node 3 uploading data to peer node 1 meets the preset upload speed (that is, the network quality of network channel 2 is better), peer node 3 can upload data to peer node 1 by increasing the speed to cope with network fluctuations.

S1004: The control node updates the network bandwidth 3 of peer node 3 to network bandwidth #3 according to the bandwidth update message.

Optionally, in order to ensure that the P2P network is in a normal state, after executing the above S1001 to S1004, if the upload speed of peer node 2 to peer node 3 meets the preset upload speed, the control node can also set the upload speed to peer node 3. The speed at which Node 3 uploads data to Peer 1 is re-updated to the upload speed indicated by Network Bandwidth 3.

It should be noted that the method shown in FIG. 10 can be used in combination with the methods shown in FIGS. 9A and 9B . When the method shown in FIG. 10 is used in combination with the method shown in FIGS. 9A and 9B , the execution position of the method shown in FIG. 10 in the method shown in FIGS. 9A and 9B is not limited.

It should be understood that the network bandwidth adjustment method shown in FIG. 10 is only illustrative and does not constitute any limitation on the multi-channel bandwidth adjustment method provided by the present disclosure.

In the embodiment of the present disclosure, a balancing effect is achieved by increasing the load of non-faulty nodes, and the network bandwidth resources are preferentially allocated to network channels with good network quality to cope with network fluctuations. This method can effectively solve the problem of network fluctuations. Abnormal fluctuation problem.

Above, the applicable application scenarios, network architecture, image distribution method, and network bandwidth adjustment method of the image distribution method provided by the present disclosure are introduced in detail with reference to Figures 1 to 10. Next, the disclosure proposed by the present disclosure will be introduced with reference to Figures 11 to 13. Provided image distribution device, image distribution system and image distribution equipment. It should be understood that the above image distribution method corresponds to the image distribution device, image distribution system and equipment below. For content not described in detail below, please refer to the relevant descriptions in the above method embodiments.

Figure 11 is a schematic structural diagram of an image distribution device provided by an embodiment of the present disclosure. As shown in Figure 11, the image distribution device includes a transceiver unit 1101 and a processing unit 1102.

In some implementations, the image distribution device is used to implement each step performed by the first peer node in the image distribution method shown in FIG. 6 . When the structure of the first peer node in the image distribution method shown in FIG. 6 is the structure of the peer node 200 shown in FIG. 5 , the functions of the transceiver unit 1101 shown in FIG. 11 are the same as those shown in FIG. 5 The functions of the image fragment transmitter 210 shown are the same; the functions of the processing unit 1101 shown in Figure 11 are the same as the functions of the network analysis module 220, dynamic control client 230 and file storage service 240 shown in Figure 5. .

In other implementations, the image distribution device is used to implement each step performed by the i-th second peer node in the image distribution method shown in Figure 6. When the structure of the i-th second peer node in the image distribution method shown in FIG. 6 is the structure of the peer node 200 shown in FIG. 5, the function of the transceiver unit 1101 shown in FIG. 11 is the same as that of the peer node 200 shown in FIG. 5. The functions of the image fragment transmitter 210 shown in Figure 5 are the same; the functions of the processing unit 1101 shown in Figure 11 are the same as the network analysis module 220, dynamic control client 230 and file storage service 240 shown in Figure 5. The functions are the same.

In some implementations, the image distribution device is used to implement each step performed by the control node in the image distribution method shown in FIG. 6 . When the structure of the control node in the image distribution method shown in FIG. 6 is the structure of the control node 100 shown in FIG. 4 , the function of the processing unit 1101 shown in FIG. 11 is the same as the service shown in FIG. 5 The registration and discovery 110, network topology center 120, network server 130, and dynamic control center 140 have the same functions.

Figure 12 is a schematic structural diagram of an image distribution system provided by an embodiment of the present disclosure. As shown in Figure 12, the system includes a control node 1201, a first peer node 1202, and N second peer nodes 1203, where N is a positive integer greater than or equal to 2.

Among them, the control node 1201 is used to perform various steps performed by the control node in the image distribution method described above, and the first peer node 1202 is used to perform the first peer node execution in the image distribution method described above. The N second peer nodes 1203 are used to perform each step performed by the N second peer nodes in the image distribution method described above. For content not described in detail here, please refer to the above related describe.

Figure 13 is a schematic structural diagram of an image distribution device provided by an embodiment of the present disclosure. As shown in Figure 13, it includes a memory 1301, a processor 1302, a communication interface 1303 and a communication bus 1304. Among them, memory 1301, processing The controller 1302 and the communication interface 1303 realize the communication connection between each other through the communication bus 1304.

The memory 1301 may be a read only memory (ROM), a static storage device, a dynamic storage device or a random access memory (RAM). The memory 1301 can store a program. When the program stored in the memory 1301 is executed by the processor 1302, the processor 1302 and the communication interface 1303 are used to execute various steps of the method implemented by the block cipher algorithm of the embodiment of the present disclosure.

The processor 1302 may be a general central processing unit (CPU), a microprocessor, an application specific integrated circuit (ASIC), a graphics processing unit (GPU), or one or more The integrated circuit is used to execute relevant programs to implement the functions required to be performed by the units in the device for implementing the block cipher algorithm according to the embodiment of the present disclosure, or to perform various steps of the method for implementing the block cipher algorithm according to the embodiment of the present disclosure.

The processor 1302 may also be an integrated circuit chip with signal processing capabilities. During the implementation process, each step of the method for implementing the block cipher algorithm provided by the present disclosure can be completed by instructions in the form of hardware integrated logic circuits or software in the processor 1302 . The above-mentioned processor 1302 can also be a general-purpose processor, a digital signal processor (digital signal processing, DSP), an application specific integrated circuit (ASIC), an off-the-shelf programmable gate array (field programmable gate array, FPGA) or other programmable logic devices. , discrete gate or transistor logic devices, discrete hardware components. Each disclosed method, step and logical block diagram in the embodiment of the present disclosure can be implemented or executed. A general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiments of the present disclosure can be directly implemented by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software module can be located in random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers and other mature storage media in this field. The storage medium is located in the memory 1301, and the processor 1302 reads the information in the memory 1301, and in combination with its hardware, completes the functions required by the units included in the device for implementing the block cipher algorithm of the embodiment of the present disclosure, or performs the method embodiment of the present disclosure. Methods for implementing block cipher algorithms.

The communication interface 1303 uses a transceiver device such as but not limited to a transceiver to implement communication between the device shown in Figure 13 and other devices or communication networks. For example, ciphertext data and the like can be output through the communication interface 1303.

Communication bus 1304 may include a path for transferring information between various components of the device shown in Figure 13 (eg, memory 1301, processor 1302, communication interface 1303).

Embodiments of the present disclosure provide a computer-readable storage medium. The computer-readable storage medium includes computer instructions. When executed by a processor, the computer instructions are used to implement the technical solution of any image distribution method in the embodiments of the disclosure.

Through the above description of the embodiments, those skilled in the art can easily understand that the example embodiments described here can be implemented by software, or can be implemented by software combined with necessary hardware. Therefore, the technical solutions according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored on a computer-readable medium and include a number of instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or network device, etc.) to perform the method according to the disclosed embodiments of the present disclosure.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

Memory may include non-permanent storage in computer-readable media, random access memory (RAM) and/or non-volatile memory in the form of read-only memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.

1. Computer-readable media includes permanent and non-permanent, removable and non-removable media that can be used to store information by any method or technology. Information may be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), and read-only memory. (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, Magnetic tape cassettes, tape magnetic disk storage or other magnetic storage media or any other non-transmission media can be used to store information that can be accessed by computing devices. As defined in this article, computer-readable media does not include non-transitory computer-readable media (transitory media), such as modulated data signals and carrier waves.

2. Those skilled in the art should understand that embodiments of the present disclosure may be provided as methods, systems or computer program products. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment that combines software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

Although the present disclosure is disclosed above in terms of preferred embodiments, this is not intended to limit the present disclosure. Any person skilled in the art can make possible changes and modifications without departing from the spirit and scope of the present disclosure. Therefore, the present disclosure The scope of protection shall be subject to the scope defined by the claims of this disclosure.

Claims

An image distribution method, which is applied to a peer-to-peer network including a first peer node and N second peer nodes, wherein the first peer node stores an image file associated with an application, and N is greater than Positive integers equal to 2, including:

The first peer node receives N first query messages sent by the N second peer nodes, and the N first query messages correspond to the N second peer nodes on a one-to-one basis;

The first peer node determines, according to the N first query messages, to the N second peer nodes that the N different image files included in the image files queried by the N first query messages are sent to the N second peer nodes. Mirror sharding;

The first peer node sends the N mirror fragments and N different hash values corresponding to the N mirror fragments to the N second peer nodes through N network channels, so that The i-th second peer node interacts with other second peer nodes to obtain the image file, wherein the i-th network channel is used for transmission between the first peer node and the i-th second peer node. The i-th image fragment and the network channel of the hash value corresponding to the i-th image fragment, i=1, 2,...,N.
The image distribution method according to claim 1, wherein the method further includes:

The first peer node receives the first retransmission message sent by the i-th second peer node;

The first peer node determines to send the i-th mirror fragment to the i-th second peer node according to the first retransmission message;

The first peer node sends the i-th mirror fragment and the hash value corresponding to the i-th mirror fragment to the i-th second peer node through the i-th network channel.
The image distribution method according to claim 1 or 2, wherein the application program is a cloud game application program, and the image file associated with the application program is an updated image file generated by the cloud game application program.
The image distribution method according to any one of claims 1 to 3, wherein the control node is any one of the following peer nodes:

The first peer node, or the N second peer nodes.
An image distribution method, which is applied to a peer-to-peer network including a control node and a first peer node managed by the control node and N second peer nodes, wherein the first peer node stores and applies The image file associated with the program, N is a positive integer greater than or equal to 2, including:

The i-th second peer node determines the download order for downloading the N image fragments included in the image file according to the received download instruction sent by the control node, where the download instruction is used to indicate starting to download the image. file, the N second peer nodes all receive the download instruction, and the N second peer nodes and N download sequences are one by one. Corresponding, and the N download orders are different, i=1,2,...,N;

The i-th second peer node determines to send a first query message to the first peer node according to the i-th download sequence corresponding to the i-th second peer node, and to send a first query message to other second peer nodes. The other nodes send a second query message; the first query message is used to query the i-th image fragment included in the image file, and the i-th image fragment is downloaded as indicated by the i-th download sequence. the first mirror fragment; the second query message is used to query a mirror fragment other than the i-th mirror fragment included in the image file, and the image queried by the second query message The fragment is the j-th image fragment downloaded as indicated by the i-th download sequence, j=2,3,...,N;

The i-th second peer node sends the first query message to the first peer node, and sends the second query message to other second peer nodes to obtain the image file.
The image distribution method according to claim 5, wherein the i-th second peer node sends the first query message to the first peer node, and sends the first query message to other second peer nodes. The second query message to obtain the image file includes:

The i-th second peer node sends the first query message to the first peer node;

The i-th second peer node receives the i-th mirror fragment sent by the first peer node and the hash value corresponding to the i-th mirror fragment, and each mirror fragment corresponds to The hash values are different;

When it is determined that the i-th mirror fragment received passes the integrity check, the i-th second peer node saves the i-th mirror fragment and sends the received i-th mirror fragment to other second peer nodes. The second query message;

The i-th second peer node receives the mirror fragment queried by the second query message sent by the other second peer node and the hash value corresponding to the queried mirror fragment, so The number of mirror fragments sent by the other second peer nodes does not exceed the preset threshold;

When it is determined that the mirror fragment queried by the received second query message passes the integrity check, the i-th second peer node saves the mirror fragment queried by the second query message.
The image distribution method according to claim 6, wherein the method further includes:

The i-th second peer node performs integrity verification on the received image fragments, and the i-th second peer node receives the image fragments including the i-th image fragment and all The mirror shard queried by the second query message;

If it is determined that the received i-th mirror fragment fails the integrity check, the i-th second peer node sends a first retransmission message to the first peer node, and the i-th second peer node sends a first retransmission message to the first peer node. A retransmission message is used to instruct the first peer node to send the i-th mirror fragment;

If it is determined that the mirror fragment queried by the received second query message does not pass the integrity check, the i-th second peer node sends a second retransmission to the other second peer nodes. message, the second retransmission message is used to refer to Instruct the other second peer nodes to send the mirror fragment queried by the second query message.
The image distribution method according to claim 6 or 7, wherein the method further includes:

If the i-th second peer node does not receive the mirror fragment queried by the second query message sent by the other second peer node and the hash value corresponding to the queried mirror fragment. , the i-th second peer node sends the second query message to the first peer node;

The i-th second peer node receives the mirror fragment queried by the second query message sent by the first peer node and the hash value corresponding to the queried mirror fragment.
The image distribution method according to any one of claims 5 to 8, wherein the method further includes:

The i-th second peer node sends N detection messages to the first peer node and the other second peer nodes to obtain the network quality corresponding to the N network channels, and the N The second peer node has a one-to-one correspondence with the N detection messages. The network quality corresponding to the i-th network channel does not meet the preset requirements. The i-th network channel is the i-th second peer. A network channel for data transmission between a node and the first peer node, or a network for data transmission between the i-th second peer node and one of the other second peer nodes. aisle;

The i-th second peer node sends the network quality corresponding to the N network channels to the control node, so that the control node evaluates the N networks based on the network quality corresponding to the N network channels. The bandwidth values corresponding to network channels other than the i-th network channel in the channel are adjusted.
The image distribution method according to any one of claims 5 to 9, wherein the application program is a cloud game application program, and the image file associated with the application program is an updated image file generated by the cloud game application program.
The image distribution method according to any one of claims 5 to 10, wherein the control node is any one of the following peer nodes:

The first peer node, or the N second peer nodes.
An image distribution device, which is applied to a peer-to-peer network including a first peer node and N second peer nodes, wherein the first peer node stores an image file associated with an application, and N is greater than Positive integers equal to 2, including:

A transceiver unit configured to receive N first query messages sent by the N second peer nodes, where the N first query messages correspond to the N second peer nodes in one-to-one correspondence;

A processing unit configured to determine, according to the N first query messages, N different image components included in the image file queried by sending the N first query messages to the N second peer nodes. piece;

The transceiver unit is also configured to send the N mirror images to the N second peer nodes through N network channels. N different hash values corresponding to the fragments and the N mirror fragments, so that the i-th second peer node interacts with other second peer nodes to obtain the image file, where the i-th second peer node The network channel is the network channel through which the first peer node and the i-th second peer node transmit the i-th mirror fragment and the hash value corresponding to the i-th mirror fragment, i= 1,2,…,N.
An image distribution device, which is applied to a peer-to-peer network including a control node and a first peer node managed by the control node and N second peer nodes, wherein the first peer node stores and applies The image file associated with the program, N is a positive integer greater than or equal to 2, including:

The processing unit is configured to determine the download order for downloading the N image fragments included in the image file according to the received download instruction sent by the control node, where the download instruction is used to instruct to start downloading the image file, so The N second peer nodes all receive the download instruction, the N second peer nodes correspond to N download sequences one-to-one, and the N download sequences are different, i=1,2,... ,N;

The processing unit is also configured to determine, according to the i-th download sequence corresponding to the i-th second peer node, to send a first query message to the first peer node, and to send a first query message to other second peer nodes. Send a second query message; the first query message is used to query the i-th image fragment included in the image file, and the i-th image fragment is the i-th image fragment downloaded indicated by the i-th download sequence. One mirror fragment; the second query message is used to query a mirror fragment other than the i-th mirror fragment included in the image file, and the mirror fragment queried by the second query message It is the j-th image fragment downloaded as indicated by the i-th download sequence, j=2,3,...,N;

A transceiver unit configured to send the first query message to the first peer node and the second query message to other second peer nodes to obtain the image file.
An image distribution device, which includes: a memory and a processor, and the memory and the processor are coupled;

The memory is used to store one or more computer instructions;

The processor is configured to execute the one or more computer instructions to implement the method according to any one of claims 1 to 6.
An image distribution device, which includes: a memory and a processor, and the memory and the processor are coupled;

The memory is used to store one or more computer instructions;

The processor is configured to execute the one or more computer instructions to implement the method according to any one of claims 7 to 11.
An image distribution system, wherein the system includes a control node, and the control node manages a first pair of A peer-to-peer network of peer nodes and N second peer nodes, wherein the first peer node stores an image file associated with an application, and N is a positive integer greater than or equal to 2, including:

The control node sends a download instruction to the N second peer nodes, where the download instruction is used to instruct to start downloading the image file;

Wherein, the first peer node is used to perform the method as described in any one of claims 1 to 4, and the i-th second peer node among the N second peer nodes is used to perform the method as described in any one of claims 1 to 4. The method according to any one of claims 5 to 11, i=1,2,...,N.
A computer-readable storage medium on which one or more computer instructions are stored, wherein the instructions are executed by a processor to implement the method according to any one of claims 1 to 11.