Data transmission method and device based on BitTorrent protocol and storage medium

Abstract

The invention discloses a data transmission method and device based on a BitTorrent protocol and a storage medium, and relates to the technical field of P2P network transmission. The method comprises the following steps: determining a current network state and a historical interruption transmission record of each peer node, wherein the network state comprises a connection mode and a network type; and determining the network value of each peer-to-peer node according to the current network state of each peer-to-peer node and the historical transmission interruption record, and allocating the peer-to-peer node with the highest network value. According to the method, the peer node with the highest network value is allocated according to the current network state and the historical transmission record of each peer node; therefore, compared with'blind 'selection of the peer node, the peer node distributed each time can be ensured to be the peer node with the best network quality, so that the network transmission efficiency is remarkably improved and ensured.

Description

Technical Field

[0001] The present application relates to the field of P2P (Peer To Peer) network transmission technology, and in particular to a data transmission method, device, and storage medium based on the BitTorrent protocol. Background Art

[0002] The BitTorrent protocol (BT) is a content distribution protocol that uses peer-to-peer (P2P) technology to allow users to efficiently share large files, such as movies and TV shows, over the internet. As the current mainstream P2P file-sharing protocol, BitTorrent is widely used in large-scale file distribution scenarios.

[0003] However, the traditional BitTorrent technology currently has the following shortcomings: Download quality is unstable (sometimes good, sometimes bad). For example, the download speed varies greatly at different times, making it difficult to guarantee the overall network transmission efficiency. Summary of the Invention

[0004] In view of the defects in the prior art, the present invention solves the technical problem of how to improve network transmission efficiency by reasonably allocating download resources.

[0005] To achieve the above objectives, in the first aspect, an embodiment of the present application provides a data transmission method based on the BitTorrent protocol, the method comprising the following steps: after the business data files to be distributed are divided into blocks according to the BitTorrent protocol, a seed file is generated; after adding a new peer node, the current network status and historical interrupted transmission records of each peer node are determined, the network status including the connection mode and network type; based on the current network status and historical interrupted transmission records of each peer node, the network value of each peer node is determined, and the peer node with the highest network value is allocated.

[0006] In conjunction with the first aspect, in one embodiment, the process of determining the network value of each peer node based on the current network status and historical transmission interruption records of each peer node includes: The network status score is determined based on the current network status. The network status scores are ranked from high to low as follows: Network type is LAN and the connection method is wired, Network type is LAN and the connection method is wireless, and Network type is WAN; The historical record score is determined based on the historical transmission interruption records. The historical record score includes the score for no interruption and the score for the number of interruptions above a specified threshold. The more interruptions, the lower the score. The network value score is obtained based on the network status score and history score.

[0007] In conjunction with the first aspect, in one embodiment, the process of determining the network status score according to the current network status specifically includes: if the network type is a local area network and the connection mode is a wired network, the score is 8 to 10; if the network type is a local area network and the connection mode is a wireless network, the score is 6 to 8; and if the network type is a wide area network, the score is 3 to 5; The process of determining the historical record score based on the historical transmission interruption record includes: a score of 8 to 10 for no interruption, a score of 6 to 8 for 1 to 8 interruptions, and a score of 3 to 5 for more than 9 interruptions.

[0008] In conjunction with the first aspect, in one embodiment, the network value score a is calculated as follows: a=b*b q +c*c q , where b represents the network status score, b q represents the weight of b, c represents the historical record score, c q Represents the weight of c.

[0009] In combination with the first aspect, in one embodiment, the method further includes the following steps: real-time monitoring of the network transmission indicators of each peer node, and when any peer node whose network transmission indicator is above a specified threshold is monitored, re-execute the process of determining the network value of each peer node and allocating the peer node with the highest network value.

[0010] In combination with the first aspect, in one embodiment, the network transmission indicators include network delay and packet loss rate; the threshold of network delay is 20%~40% of the initial network delay, and the threshold of packet loss rate is 40%~60% of the initial packet loss rate.

[0011] In combination with the first aspect, in one embodiment, the method further includes the following steps: allocating a shard scheduling strategy to each peer node based on the network bandwidth of each peer node, the shard scheduling strategy including: when the network bandwidth is below a low bandwidth threshold, prioritizing scheduling of common shards; when the network bandwidth is above a high bandwidth threshold and is under low load, prioritizing scheduling of rare shards.

[0012] In combination with the first aspect, in one embodiment, the low bandwidth threshold is 20 Mbps, the high bandwidth threshold is 21 Mbps, and the low load judgment condition is: the CPU usage rate is below 30%, and the disk usage rate is below 40%; the common shard is a shard whose number of nodes is more than 50% of the total number of nodes, and the rare shard is a shard whose number of nodes is less than 10% of the total number of nodes.

[0013] In a second aspect, an embodiment of the present application provides a data transmission device based on the BitTorrent protocol, wherein the data transmission device based on the BitTorrent protocol includes a processor, a memory, and a data transmission program based on the BitTorrent protocol stored on the memory and executable by the processor, wherein when the data transmission program based on the BitTorrent protocol is executed by the processor, the steps of the method provided in the first aspect are implemented.

[0014] In a third aspect, an embodiment of the present application provides a computer-readable storage medium, on which a data transmission program based on the BitTorrent protocol is stored, wherein when the data transmission program based on the BitTorrent protocol is executed, the steps of the method provided in the first aspect are implemented.

[0015] Compared with the prior art, the advantages of the present invention are: This application allocates the peer nodes with the highest network value based on the current network status and historical transmission records of each peer node; therefore, compared with the "blind" selection of peer nodes, this application can ensure that the peer nodes allocated each time are the peer nodes with the best network quality, thereby significantly improving and ensuring network transmission efficiency.

[0016] Furthermore, after allocating the peer node with the highest network value, the present application will also monitor the network transmission indicators of each peer node in real time, and reallocate the peer nodes with abnormal network transmission indicators (exceeding the threshold, such as a sudden increase in network delay or an abnormal increase in packet loss rate). In this way, the peer nodes with "degraded quality" can be dynamically replaced throughout the entire process of data transmission of the peer nodes, thereby further improving and ensuring network transmission efficiency.

[0017] At the same time, the present invention cannot share files with nodes with low bandwidth. In this case, it prioritizes downloading common fragments, which can reduce waiting time (because there are fewer nodes holding rare fragments and need to wait). For nodes with high bandwidth and sufficient load, file sharing is possible. In this case, prioritizing downloading rare fragments can increase the number of nodes holding rare fragments. The fragment scheduling strategy formed by this coordination method can accelerate the speed of obtaining file integrity, thereby further improving and ensuring network transmission efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0019] Figure 1 Schematic diagram of the flow of a data transmission method based on the BitTorrent protocol in an embodiment of the present application; Figure 2 This is a schematic diagram of the hardware structure of a data transmission device based on the BitTorrent protocol involved in the embodiment of the present application. DETAILED DESCRIPTION

[0020] To make the purpose, technical solutions, and advantages of the embodiments of this application more clear, the technical solutions in the embodiments of this application will be clearly and completely described below in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0021] The flowcharts shown in the accompanying drawings are for illustrative purposes only and do not necessarily include all contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps may be decomposed, combined, or partially merged, so the actual execution order may vary depending on the actual situation.

[0022] First, the research and development principles of this application are briefly explained.

[0023] The applicant has concluded through research that the reasons why BitTorrent technology in the prior art cannot guarantee network transmission efficiency are: "Blind" peer selection, i.e. assigning any peer that is available without considering the peer's network quality, results in faster download speeds for peers connected to better networks, and slower download speeds for peers connected to worse networks.

[0024] On this basis, in order to make the purpose, technical solutions and advantages of this application clearer, the implementation methods of this application will be further described in detail with reference to the accompanying drawings.

[0025] In a first aspect, an embodiment of the present application provides a data transmission method based on the BitTorrent protocol, the method comprising the following steps: The server (seed server) generates seed files after dividing the business data files to be distributed into blocks according to the BitTorrent protocol. After adding a new peer node, the server determines the current network status and historical transmission interruption records of each peer node. The network status includes the connection method (wired or wireless) and network type (LAN or WAN). After receiving the peer node request, the server determines the network value of each peer node based on the current network status and historical transmission interruption records of each available peer node, and allocates the peer node with the highest network value.

[0026] From this, it can be seen that the present application allocates the peer nodes with the highest network value based on the current network status and historical transmission records of each peer node; therefore, compared with the "blind" selection of peer nodes, the present application can ensure that the peer nodes allocated each time are the peer nodes with the best network quality, thereby significantly improving and guaranteeing network transmission efficiency.

[0027] In one embodiment, the process of determining the network value of each peer node based on the current network status and historical transmission interruption records of each peer node includes: The network status score is determined based on the current network status. The network status scores are ranked from high to low as follows: network type is LAN and connection mode is wired, network type is LAN and connection mode is wireless, and network type is WAN.

[0028] The historical record score is determined based on historical transmission interruption records. The historical record score includes a score for no interruption and a score for interruption times above a specified threshold. The more interruptions there are, the lower the score.

[0029] The network value score is obtained based on the network status score and history score.

[0030] It can be seen that this application uses a scoring method to estimate the network value of peer nodes, and takes into account the network status score and historical record score of each peer node in a refined manner, so as to determine that the peer node with the highest network value is the optimal peer node, such as a node with high and stable bandwidth and active participation in file transfer in the recent period, so as to maximize data transmission efficiency.

[0031] On this basis, the above process of determining the network status score based on the current network status specifically includes: the score for a LAN network type and a wired connection is 8 to 10, the score for a LAN network type and a wireless connection is 6 to 8, and the score for a WAN network type is 3 to 5.

[0032] The process of determining the historical record score based on the historical interruption transmission record includes: the score of no interruption is 8-10, the score of 1-8 interruptions is 6-8, and the score of more than 9 interruptions is 3-5.

[0033] Furthermore, the calculation formula for the above network value score a is: a=b*b q +c*c q , where b represents the network status score, b q represents the weight of the network status score, b q Generally, it is 60%~80%, preferably 70%; c represents the historical record score, c q represents the weight of the historical record score, c q It is generally 20%~40%, preferably 30%.

[0034] In one embodiment, the above method further includes the following steps after allocating peer nodes: real-time monitoring of the network transmission indicators of each peer node; when any peer node whose network transmission indicator is above a specified threshold is monitored, other nodes communicating with the peer node re-initiate a peer node request to the server; at this time, the server re-determines the network value of each peer node based on the current network status and historical transmission interruption records of each available peer node, and allocates the peer node with the highest network value.

[0035] From this, it can be seen that after allocating the peer node with the highest network value, this application will also monitor the network transmission indicators of each peer node in real time, and reallocate the peer nodes with abnormal network transmission indicators (exceeding the threshold, such as a sudden increase in network delay or an abnormal increase in packet loss rate). In this way, the peer nodes with "degraded quality" can be dynamically replaced throughout the entire process of data transmission of the peer nodes, thereby further improving and ensuring network transmission efficiency.

[0036] On this basis, the above-mentioned network transmission indicators include network delay and packet loss rate; the threshold of network delay is 20%~40% of the initial network delay, generally 30%, and the threshold of packet loss rate is 40%~60% of the initial packet loss rate, generally 50%.

[0037] In one embodiment, after allocating peer nodes, the above method further includes the following steps: allocating a shard scheduling strategy to each peer node based on the network bandwidth of each peer node, the shard scheduling strategy including: when the network bandwidth is below a low bandwidth threshold, prioritizing scheduling of common shards; when the network bandwidth is above a high bandwidth threshold and is under low load, prioritizing scheduling of rare shards; in this way, the client can request corresponding file shards from the peer node in an orderly manner according to the received scheduling strategy.

[0038] The principle of the above implementation is: for nodes with low bandwidth, there is no way to share files. In this case, prioritizing downloading common shards can reduce waiting time (because there are fewer nodes holding rare shards and they need to wait); for nodes with high bandwidth and sufficient load, files can be shared. In this case, prioritizing downloading rare shards can increase the number of nodes holding rare shards.

[0039] Therefore, the sharding scheduling strategy formed by the above-mentioned coordination method can speed up the acquisition of file integrity, thereby further improving and ensuring network transmission efficiency.

[0040] On this basis, the low bandwidth threshold is 20 Mbps, the high bandwidth threshold is 21 Mbps, and the low load determination criteria are: CPU utilization below 30% and disk utilization below 40%. Common shards and rare shards are commonly used in this field and can be defined based on actual circumstances. In this embodiment, common shards are shards with a number of nodes (i.e., nodes that own the shard) exceeding 50% of the total number of nodes, while rare shards are shards with a number of nodes below 10% of the total number of nodes.

[0041] 1, the method of the present invention is described below through a specific embodiment.

[0042] The application scenario of this embodiment is as follows: Large enterprise A has 100 branches across the country, each of which is equipped with 10-20 terminal devices, including PCs, laptops and other terminal devices. The terminal devices are connected to the devices through some and wireless networks. The enterprise needs to regularly distribute large business data files to these branches, with a file size of about 10GB. In order to improve the efficiency of file distribution and network resource utilization, the enterprise uses the application plan to build an optimized BitTorrent system, which specifically includes a peer node evaluation module, a network environment perception module and an intelligent sharding scheduling module. The process of the method of this system can be found in Figure 1 As shown, specifically: S1: System Deployment: A high-performance seed server equipped with a peer-to-peer node assessment module and an intelligent sharding scheduling module is deployed in the corporate headquarters data center. Simultaneously, within each branch's local area network, each terminal device is installed with an optimized intelligent client. This client integrates a network environment awareness module and an intelligent sharding scheduling module, responsible for data interaction with the seed server and other peer nodes, and dynamically adjusts transmission behavior based on scheduling strategies.

[0043] S2: When an enterprise needs to distribute a new business data file, the seed server divides the file into blocks according to the BitTorrent protocol and generates a seed file. Simultaneously, the peer node assessment module begins collecting network environment information, including the current network status of each branch and historical transmission interruptions. This module constructs an initial state space, providing a data foundation for subsequent policy formulation.

[0044] S3: After the smart client of each branch is started, it requests the seed server peer node to obtain the peer node list.

[0045] S4: The peer node evaluation module recommends the optimal peer node connection plan for the client based on the current state space. Specifically, it determines the network value of each peer node and allocates the peer node with the highest network value. For example, it gives priority to connecting to nodes with high and stable bandwidth and active participation in file transfer in the recent period to improve data transmission efficiency.

[0046] S5: The seed server assigns a shard scheduling strategy to each peer node based on the network bandwidth of each peer node (feedback by the client's network environment perception module). The shard scheduling strategy includes: when the network bandwidth is below the low bandwidth threshold, common shards are prioritized; when the network bandwidth is above the high bandwidth threshold and the load is below the low load threshold, rare shards are prioritized.

[0047] S6: The client requests the corresponding file shards from the peer node according to the received scheduling policy.

[0048] During the execution of S2 to S5, the network environment perception module of each peer node monitors the network transmission indicators of the peer node in real time by actively sending detection packets to the connected peer nodes; when any peer node with a network transmission indicator above the specified threshold is detected, a peer node request is re-initiated to the server and the process goes to S4, that is, requesting the seed server to reallocate the node.

[0049] In a second aspect, an embodiment of the present application provides a data transmission device based on the BitTorrent protocol. The data transmission device based on the BitTorrent protocol can be a personal computer (PC), a laptop, a server, or other device with data processing capabilities.

[0050] Reference Figure 2 , Figure 2 Schematic diagram of the hardware structure of a data transmission device based on the BitTorrent protocol involved in the embodiment of the present application. In the embodiment of the present application, the data transmission device based on the BitTorrent protocol may include a processor, a memory, a communication interface and a communication bus.

[0051] The communication bus may be of any type and is used to interconnect the processor, memory, and communication interface.

[0052] Communication interfaces include input / output (I / O) interfaces, physical interfaces, and logical interfaces. These interfaces interconnect components within BitTorrent-based data transmission equipment, as well as interfaces that connect BitTorrent-based data transmission equipment to other devices (such as other computing devices or user devices). Physical interfaces can include Ethernet, fiber, and ATM interfaces; user devices can include displays and keyboards.

[0053] The memory can be various types of storage media, such as random access memory (RAM), read-only memory (ROM), non-volatile RAM (NVRAM), flash memory, optical storage, hard disk, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), etc.

[0054] The processor may be a general-purpose processor that can invoke a BitTorrent protocol-based data transmission program stored in a memory and execute the BitTorrent protocol-based data transmission method provided in the embodiments of the present application. For example, the general-purpose processor may be a central processing unit (CPU). The method executed when the BitTorrent protocol-based data transmission program is invoked can be referenced in the various embodiments of the BitTorrent protocol-based data transmission method of the present application and will not be further described here.

[0055] Those skilled in the art will understand that Figure 2 The hardware structure shown in the figure does not constitute a limitation to the present application and may include more or fewer components than shown in the figure, or a combination of certain components, or a different arrangement of components.

[0056] In a third aspect, an embodiment of the present application also provides a computer-readable storage medium.

[0057] The computer-readable storage medium of the present application stores a data transmission program based on the BitTorrent protocol, wherein when the data transmission program based on the BitTorrent protocol is executed by a processor, the steps of the data transmission method based on the BitTorrent protocol as described above are implemented.

[0058] Among them, the method implemented when the data transmission program based on the BitTorrent protocol is executed can refer to the various embodiments of the data transmission method based on the BitTorrent protocol of this application, and will not be repeated here.

[0059] It should be noted that the serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0060] Through the description of the above embodiments, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus the necessary general hardware platform. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, or the part that contributes to the existing technology, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above and includes a number of instructions for enabling a terminal device to execute the methods described in each embodiment of this application.

[0061] The terms "including" and "having" and any variations thereof in the specification and claims of this application and the above-mentioned drawings are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally includes steps or units that are not listed, or optionally includes other steps or units inherent to these processes, methods, products or devices. The terms "first", "second" and "third" are used to distinguish different objects, etc., and do not represent a sequence, nor do they limit the "first", "second" and "third" to different types.

[0062] In the description of the embodiments of this application, the words "exemplary," "for example," or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary," "for example," or "for example" in the embodiments of this application should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary," "for example," or "for example" is intended to present the relevant concepts in a concrete manner.

[0063] In the description of the embodiments of the present application, unless otherwise specified, “ / ” means or, for example, A / B can mean A or B; “and / or” in the text is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the description of the embodiments of the present application, “multiple” refers to two or more than two.

[0064] In some processes described in the embodiments of the present application, multiple operations or steps are included that appear in a specific order. However, it should be understood that these operations or steps may not be performed in the order in which they appear in the embodiments of the present application or may be performed in parallel. The sequence numbers of the operations are only used to distinguish between different operations, and the sequence numbers themselves do not represent any order of execution. In addition, these processes may include more or fewer operations, and these operations or steps may be performed in sequence or in parallel, and these operations or steps may be combined.

[0065] Through the description of the above embodiments, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus the necessary general hardware platform. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, or the part that contributes to the existing technology, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above and includes a number of instructions for enabling a terminal device to execute the methods described in each embodiment of this application.

[0066] The above are only specific implementations of the embodiments of the present invention, but the scope of protection of the embodiments of the present invention is not limited to them. Any person skilled in the art can easily conceive of various equivalent modifications or replacements within the technical scope disclosed in the embodiments of the present invention, and such modifications or replacements should be included in the scope of protection of the embodiments of the present invention. Therefore, the scope of protection of the embodiments of the present invention should be based on the scope of protection of the claims.

Claims

1. A data transmission method based on the BitTorrent protocol, characterized in that: The method includes the following steps: after the business data files to be distributed are divided into blocks according to the BitTorrent protocol, a seed file is generated; after adding a new peer node, the current network status and historical interruption transmission record of each peer node are determined, and the network status includes the connection mode and network type; based on the current network status and historical interruption transmission record of each peer node, the network value of each peer node is determined, and the peer node with the highest network value is allocated.

2. The data transmission method based on the BitTorrent protocol according to claim 1, wherein: The process of determining the network value of each peer node based on the current network status and historical interrupted transmission records of each peer node includes: The network status score is determined based on the current network status. The network status scores are ranked from high to low as follows: Network type is LAN and the connection method is wired, Network type is LAN and the connection method is wireless, and Network type is WAN; The historical record score is determined based on the historical transmission interruption records. The historical record score includes the score for no interruption and the score for the number of interruptions above a specified threshold. The more interruptions there are, the lower the score. The network value score is obtained based on the network status score and history score.

3. The data transmission method based on the BitTorrent protocol according to claim 2, wherein: The process of determining the network status score according to the current network status specifically includes: if the network type is a local area network and the connection mode is a wired network, the score is 8 to 10; if the network type is a local area network and the connection mode is a wireless network, the score is 6 to 8; and if the network type is a wide area network, the score is 3 to 5; The process of determining the historical record score based on the historical transmission interruption record includes: a score of 8 to 10 for no interruption, a score of 6 to 8 for 1 to 8 interruptions, and a score of 3 to 5 for more than 9 interruptions.

4. The data transmission method based on the BitTorrent protocol according to claim 3, wherein: The calculation formula of the network value score a is: a=b*b q +c*c q , where b represents the network status score, b q represents the weight of b, c represents the historical record score, c q Represents the weight of c.

5. The data transmission method based on the BitTorrent protocol according to any one of claims 1 to 4, characterized in that: The method also includes the following steps: real-time monitoring of the network transmission indicators of each peer node, and when any peer node with a network transmission indicator above a specified threshold is monitored, re-execution of the process of determining the network value of each peer node and allocating the peer node with the highest network value.

6. The data transmission method based on the BitTorrent protocol according to claim 5, characterized in that: The network transmission indicators include network delay and packet loss rate; the threshold of network delay is 20%~40% of the initial network delay, and the threshold of packet loss rate is 40%~60% of the initial packet loss rate.

7. The data transmission method based on the BitTorrent protocol according to any one of claims 1 to 4, characterized in that: The method also includes the following steps: allocating a shard scheduling strategy to each peer node according to the network bandwidth of each peer node, wherein the shard scheduling strategy includes: when the network bandwidth is below a low bandwidth threshold, prioritizing scheduling of common shards; when the network bandwidth is above a high bandwidth threshold and is under low load, prioritizing scheduling of rare shards.

8. The data transmission method based on the BitTorrent protocol according to claim 7, characterized in that: The low bandwidth threshold is 20 Mbps, the high bandwidth threshold is 21 Mbps, and the low load determination condition is: CPU usage is below 30%, and disk usage is below 40%. The common shard is a shard whose number of nodes is more than 50% of the total number of nodes, and the rare shard is a shard whose number of nodes is less than 10% of the total number of nodes.

9. A data transmission device based on the BitTorrent protocol, characterized in that: The data transmission device based on the BitTorrent protocol includes a processor, a memory, and a data transmission program based on the BitTorrent protocol stored on the memory and executable by the processor, wherein when the data transmission program based on the BitTorrent protocol is executed by the processor, the steps of the data transmission method based on the BitTorrent protocol as described in any one of claims 1 to 8 are implemented.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a data transmission program based on the BitTorrent protocol, wherein when the data transmission program based on the BitTorrent protocol is executed, the steps of the data transmission method based on the BitTorrent protocol as described in any one of claims 1 to 8 are implemented.

Images