CN110266438B - Data transmission method, device and system and computer readable storage medium - Google Patents
Data transmission method, device and system and computer readable storage medium Download PDFInfo
- Publication number
- CN110266438B CN110266438B CN201910585175.6A CN201910585175A CN110266438B CN 110266438 B CN110266438 B CN 110266438B CN 201910585175 A CN201910585175 A CN 201910585175A CN 110266438 B CN110266438 B CN 110266438B
- Authority
- CN
- China
- Prior art keywords
- data
- data acquisition
- transmitted
- optimal
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/101—Server selection for load balancing based on network conditions
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Quality & Reliability (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention relates to a data transmission method, which comprises the following steps: receiving a data acquisition request initiated by a data acquisition end; determining first network condition information of the data acquisition terminal according to the data acquisition request; determining at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes by combining the first network condition information; and deploying the data to be transmitted to the optimal acceleration node so that the optimal acceleration node sends the data to be transmitted to the data acquisition end. For each data acquisition end, when the data acquisition end needs to acquire data, an optimal acceleration node is dynamically allocated to the data acquisition end, so that the data transmission rate can be ensured to be in the highest state, and the acceleration node can stably achieve a better acceleration effect. The application also provides a data transmission device, a data transmission system and a computer readable storage medium, which can also achieve the technical effects.
Description
Technical Field
The present invention relates to the field of data transmission technologies, and in particular, to a data transmission method, apparatus, system, and computer-readable storage medium.
Background
In the process of large data transmission or downloading, an acceleration node is usually used to accelerate the transmission speed. In the current data transmission process, a data sending party usually deploys data to be transmitted or downloaded to any acceleration node in advance, when a data acquiring party needs to acquire the data, the data sending party searches information of the acceleration node where the data is deployed, and acquires the data from the acceleration node according to the information.
Because the acceleration node can improve the data transmission rate, the data transmission rate is improved compared with the case that the data acquisition party directly acquires data from the data sending party.
However, for different data acquirers, the acceleration node has a unstable acceleration effect on the data transmission process, that is, in the prior art, the acceleration node has a very obvious acceleration effect for some data acquirers, but has a relatively general acceleration effect for other data acquirers.
Therefore, how to make the acceleration node stably achieve a better acceleration effect is a problem that needs to be solved urgently by those skilled in the art.
Disclosure of Invention
The present invention mainly aims to provide a data transmission method, apparatus, system and computer readable storage medium, so as to solve the problem that in the prior art, an acceleration node cannot stably achieve a better acceleration effect.
In order to achieve the above object, a data transmission method provided by the present invention includes:
receiving a data acquisition request initiated by a data acquisition end;
determining first network condition information of the data acquisition terminal according to the data acquisition request;
determining at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes by combining the first network condition information;
and deploying the data to be transmitted to the optimal acceleration node so that the optimal acceleration node sends the data to be transmitted to the data acquisition end.
Optionally, the first network condition information includes an operator type and a region to which the operator type belongs;
correspondingly, the determining, in combination with the first network condition information, at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes includes:
determining at least two target acceleration nodes which are the same as the operator type and the region of the data acquisition end;
determining at least one of the optimal acceleration nodes among the target acceleration nodes.
Optionally, the determining at least one optimal acceleration node among the target acceleration nodes includes:
and determining a node with the most idle communication link in the target acceleration nodes as the optimal acceleration node.
Optionally, the data to be transmitted includes a preset number of slicing results of the data to be transmitted; the cutting result is obtained by cutting the data to be transmitted according to a preset size in advance;
correspondingly, the determining, in combination with the first network condition information, at least one optimal acceleration node corresponding to the data obtaining end in the at least two acceleration nodes includes:
determining the optimal acceleration nodes corresponding to the preset number of the data acquisition ends in at least two acceleration nodes by combining the first network condition information;
correspondingly, the deploying the data to be transmitted to the optimal acceleration node includes:
synchronously deploying each cutting result to different optimal accelerating nodes.
Optionally, before deploying the data to be transmitted to the optimal acceleration node, the method further includes:
slicing the data to be transmitted according to the size of the data to be transmitted and the data deployment rate of the optimal acceleration node to obtain a slicing result of the data to be transmitted;
correspondingly, the deploying the data to be transmitted to the optimal acceleration node includes:
synchronously deploying each cutting result to different optimal accelerating nodes.
The present application also provides a data transmission apparatus, the apparatus comprising a memory and a processor, the memory having stored thereon a data transmission program operable on the processor, the data transmission program when executed by the processor implementing the steps of:
receiving a data acquisition request initiated by a data acquisition end;
determining first network condition information of the data acquisition terminal according to the data acquisition request;
determining at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes by combining the first network condition information;
and deploying the data to be transmitted to the optimal acceleration node so that the optimal acceleration node sends the data to be transmitted to the data acquisition end.
Optionally, when executed by the processor, the data transmission program further implements the following steps:
slicing the data to be transmitted according to the size of the data to be transmitted and the data deployment rate of the optimal acceleration node to obtain a slicing result of the data to be transmitted;
synchronously deploying each cutting result to different optimal accelerating nodes.
The present application further provides a data transmission system, including:
a data acquisition request receiving module, configured to receive a data acquisition request initiated by a data acquisition end;
the first network condition information determining module is used for determining first network condition information of the data acquisition end according to the data acquisition request;
an optimal acceleration node determination module, configured to determine, in combination with the first network condition information, at least one optimal acceleration node corresponding to the data acquisition end from among the at least two acceleration nodes;
and the deployment module is used for deploying the data to be transmitted to the optimal acceleration node so that the optimal acceleration node sends the data to be transmitted to the data acquisition end.
The present application further provides a data transmission system, including:
the server is used for receiving a data acquisition request initiated by the data acquisition end; determining first network condition information of the data acquisition terminal according to the data acquisition request; determining at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes by combining the first network condition information; deploying the data to be transmitted to the optimal acceleration node;
and the at least two acceleration nodes are used for receiving the data to be transmitted and transmitting the data to be transmitted to the data acquisition end.
To achieve the above technical effects, the present application also provides a computer-readable storage medium having a data transmission program stored thereon, where the data transmission program can be executed by one or more processors to implement the data transmission method.
To achieve the above technical effect, the present application also provides a computer program product, which includes computer instructions that, when executed on a computer, enable the computer to execute any of the data transmission methods described above.
Therefore, after receiving a data acquisition request initiated by a data acquisition end, the method and the device can determine the network condition information of the data acquisition end, dynamically select an optimal acceleration node for a data receiving end in combination with the network condition information, deploy the data to be transmitted to the optimal acceleration node, and transmit the data to be transmitted to the data acquisition end by the optimal acceleration node. Therefore, for each data acquisition end, when the data acquisition end needs to acquire data, the optimal acceleration node is dynamically allocated to the data acquisition end, so that the data transmission rate can be ensured to be in the highest state, and the acceleration node can stably achieve a better acceleration effect.
Drawings
FIG. 1 is a flow chart of a data transmission method provided by the present invention;
fig. 2 is a flow chart of a specific data transmission method according to the present invention;
FIG. 3 is a flow chart of a specific data transmission method according to the present invention;
fig. 4 is a schematic diagram of an internal structure of a data transmission device according to an embodiment of the disclosure;
fig. 5 is a schematic structural diagram of a data transmission system according to an embodiment of the disclosure;
fig. 6 is a schematic structural diagram of another data transmission system according to an embodiment of the disclosure.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and do not limit the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and claims of this application and in the above-described drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be implemented in other sequences than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be noted that the description relating to "first", "second", etc. in the present invention is for descriptive purposes only and is not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between the embodiments may be combined with each other, but must be based on the realization of the technical solutions by a person skilled in the art, and when the technical solutions are contradictory to each other or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present invention.
The application provides a data transmission method, a data transmission device, a data transmission system and a computer-readable storage medium, which are used for solving the problem that an acceleration node in the prior art cannot stably achieve a good acceleration effect.
Referring to fig. 1, fig. 1 is a schematic flow chart of an embodiment of the invention.
In one embodiment, the method comprises the following steps:
s101, receiving a data acquisition request initiated by a data acquisition terminal.
The scheme is applied to the server, and is different from the prior art, the data of the data sending end is not directly deployed on any acceleration node, but is sent to the server in advance, and then the acceleration node is dynamically selected to be deployed by the server according to the condition of the data receiving end which requests to obtain the data.
Specifically, a data acquisition request initiated by a data acquisition end is received first. The data acquisition request indicates the data which the data acquisition end wants to acquire and the information of the data acquisition end.
S102, determining first network condition information of the data acquisition terminal according to the data acquisition request.
It should be noted that the speed of data transmission between the acceleration node and the data acquisition end is usually related to network conditions of both parties, for example, when the acceleration node and the data acquisition end are not in the same region, the transmission speed will be lower, whereas when the acceleration node and the data acquisition end are in the same region, the transmission speed will be higher.
Therefore, in the present solution, it is necessary to determine the network condition information of the data obtaining end, i.e. the first network condition information.
The network condition information is not specifically limited in this scheme, and any information that affects the data transmission rate may be used as the first network condition information.
S103, determining at least one optimal acceleration node corresponding to the data acquisition end in the at least two acceleration nodes by combining the first network condition information.
Since the speed of data transmission between the acceleration node and the data acquisition end is generally related to the network conditions of both sides, in the scheme, the optimal acceleration node capable of enabling the data transmission speed to reach the highest speed can be determined from the two missing acceleration nodes according to the first network condition information of the data receiving end.
In a specific embodiment, the first network condition information includes an operator type, a region to which the operator belongs;
correspondingly, the determining, in combination with the first network condition information, at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes includes:
determining a target acceleration node which is the same as the operator type and the region to which the operator type and the region belong of the data acquisition end in at least two acceleration nodes;
determining at least one of the optimal acceleration nodes among the target acceleration nodes.
In this embodiment, it is necessary to determine, among all the acceleration nodes, a target acceleration node whose operator type and belonging region are the same as those of the data acquisition end.
It should be noted that the data transmission rate is affected by whether the nodes at both ends of the transmission are in the same operator and in the same region, and if both the nodes at both ends of the transmission are in the same operator, the data transmission rate is higher.
On the basis of this embodiment, the present application further proposes a preferred embodiment, where the determining at least one optimal acceleration node in the target acceleration nodes includes:
and determining the node with the most idle communication link in the target acceleration nodes as the optimal acceleration node.
The idle communication link means that the available bandwidth of the target acceleration node is larger or the available transmission paths are more, so that the target acceleration node can be further ensured to have a higher transmission rate of the data to be transmitted.
Therefore, in the scheme, instead of being a fixed acceleration node for any data receiving end, the optimal acceleration node is dynamically selected according to the difference of the data receiving ends, that is, for each data receiving end, the data is transmitted by the optimal acceleration node relative to the data receiving end, so that the data transmission rate is the highest for each data receiving end.
And S104, deploying the data to be transmitted to the optimal acceleration node so that the optimal acceleration node sends the data to be transmitted to the data acquisition end.
Specifically, after the data is deployed to the optimal acceleration node, the acceleration node may transmit the data to be transmitted to the data acquisition end, and the specific transmission process is the same as that in the prior art, which will not be described herein again.
Therefore, after receiving a data acquisition request initiated by a data acquisition end, the method and the device can determine the network condition information of the data acquisition end, dynamically select an optimal acceleration node for a data receiving end in combination with the network condition information, deploy the data to be transmitted to the optimal acceleration node, and transmit the data to be transmitted to the data acquisition end by the optimal acceleration node. Therefore, for each data acquisition end, when the data acquisition end needs to acquire data, the optimal acceleration node is dynamically allocated to the data acquisition end, so that the data transmission rate can ensure the highest state, and the acceleration node can stably achieve a better acceleration effect.
A specific data transmission method provided in the embodiments of the present application is introduced below, and a specific data transmission method described below and the embodiments described above may be referred to with each other.
Referring to fig. 2, a specific data transmission method provided in the embodiment of the present application specifically includes:
s201, receiving a data acquisition request initiated by a data acquisition end.
S202, determining first network condition information of the data acquisition terminal according to the data acquisition request.
And S203, determining the preset number of optimal acceleration nodes corresponding to the data acquisition end in at least two acceleration nodes by combining the first network condition information.
It should be noted that, before the data to be transmitted is transmitted to the data acquisition end by the acceleration node, there is a deployment process, and this process also causes a delay in data transmission to a certain extent, which increases the time for the data acquisition end to acquire the data, and affects the overall rate of the data acquisition process.
Therefore, in order to reduce the influence of the deployment process on the speed, the data to be transmitted is cut into a plurality of small cut blocks, so that the small cut blocks can be deployed on different optimal acceleration nodes in a parallel mode at the same time, the deployment time of the whole data to be transmitted is reduced in a multiplied mode, and the whole speed of the data acquisition process is improved.
In the scheme, the data to be transmitted, which is requested to be acquired by the data acquisition end, is cut into a plurality of block cutting results, and the specific block cutting operation can be performed by the data transmission end, that is, the block cutting results of the data to be transmitted are stored in the server; the server may also perform the block cutting after receiving the data from the data sending end, which is not limited specifically.
And determining the optimal accelerating nodes with the preset number according to the number of the blocks, namely the preset number, so as to complete the deployment of each block.
It should be noted that, it is an optimal solution that the optimal number of acceleration nodes is completely equal to the number of cut-outs, and when the remainder of the optimal number of acceleration nodes and the number of cut-outs is not 0, the nodes left after the first parallel deployment may also be deployed to the corresponding optimal acceleration nodes according to the actual situation of each optimal acceleration node. For example, the data to be transmitted is 20MB, the determined optimal acceleration nodes are 8, the determined optimal block partitioning scheme is to divide the data to be transmitted into 10 blocks of 2MB, the 8 blocks are deployed in parallel to each optimal acceleration node for the first time, and the remaining 2 blocks are deployed by combining the link idle condition of each acceleration node for the second time. It can be understood that, when the average distribution of the blocks cannot be performed, the size of each block may be adjusted according to the actual situation, as described above, that is, the data to be transmitted may be divided into 6 2 MBs and 2 4 MBs, and then the data may be deployed in parallel. The solutions for reducing deployment time by dicing are all within the scope of protection, particularly if dicing and deployment can be determined according to actual conditions.
S204, synchronously deploying each cutting result to different optimal acceleration nodes so that the optimal acceleration nodes can send the data to be transmitted to the data acquisition end; and the cutting result is obtained by cutting the data to be transmitted according to a preset size in advance.
Specifically, each block cutting result is deployed to different optimal nodes, so that parallel deployment of all data to be transmitted is realized, and deployment time is reduced by times.
A specific data transmission method provided in the embodiments of the present application is introduced below, and a specific data transmission method described below and the embodiments described above may be referred to with each other.
Referring to fig. 3, a specific data transmission method provided in the embodiment of the present application specifically includes:
s301, receiving a data acquisition request initiated by a data acquisition end.
S302, determining first network condition information of the data acquisition end according to the data acquisition request.
S303, determining at least one optimal acceleration node corresponding to the data obtaining end in the at least two acceleration nodes according to the first network condition information.
S304, the data to be transmitted is diced according to the size of the data to be transmitted and the data deployment rate of the optimal acceleration node, and a dicing result of the data to be transmitted is obtained.
Preferably, the dicing operation of the data to be transmitted is performed by the server.
Specifically, after the server determines the optimal acceleration node, the rate of data deployment by the optimal acceleration node is further determined, and the data deployment rate and the size of the transmission data are combined to perform block cutting, and specifically, what number of block cutting results need to be obtained can be determined according to the longest deployment time allowed by delay, for example, the deployment of the data to be transmitted is completed within 1 min of the maximum allowed delay time, the data deployment rate of each optimal acceleration node is 2MB deployed per minute, and the size of the data to be transmitted is 10MB, so that the data to be transmitted can be cut into 5 block cutting results of 2MB, and the deployment of all the data to be transmitted is completed within 1 min.
S305, synchronously deploying each cutting result to different optimal acceleration nodes, so that the optimal acceleration nodes send the data to be transmitted to the data acquisition end.
According to the scheme, the server determines the optimal accelerating node and the data deployment rate thereof and then performs the block cutting by combining the data deployment rate, so that the block cutting result is more accurate, and the delay time brought by the deployment of the data to be transmitted can be flexibly controlled.
Further, the embodiment also discloses a data transmission device.
Referring to fig. 4, fig. 4 is a schematic diagram of an internal structure of a data transmission device according to an embodiment of the present invention. In fig. 4, the data transmission device 1 includes a memory 11 and a processor 12, the memory 11 stores a data transmission program operable on the processor 12, and the data transmission when executed by the processor 12 implements the following method:
receiving a data acquisition request initiated by a data acquisition end;
determining first network condition information of the data acquisition terminal according to the data acquisition request;
determining at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes by combining the first network condition information;
and deploying the data to be transmitted to the optimal acceleration node so that the optimal acceleration node sends the data to be transmitted to the data acquisition end.
Therefore, after a data acquisition request initiated by the data acquisition end is received, the network condition information of the data acquisition end is determined, the optimal acceleration node is dynamically selected for the data receiving end in combination with the network condition information, the data to be transmitted is deployed to the optimal acceleration node, and the optimal acceleration node transmits the data to be transmitted to the data acquisition end. Therefore, for each data acquisition end, when the data acquisition end needs to acquire data, the optimal acceleration node is dynamically allocated to the data acquisition end, so that the data transmission rate can be ensured to be in the highest state, and the acceleration node can stably achieve a better acceleration effect.
Optionally, the first network condition information includes an operator type and a region to which the operator type belongs;
when the data transmission program is executed by the processor 12, the following steps may be specifically implemented:
determining target acceleration nodes which are the same as the operator type and the region of the data acquisition end in at least two acceleration nodes;
determining the optimal acceleration node among the target acceleration nodes.
When the data transmission program is executed by the processor 12, the following steps may be specifically implemented:
and determining a node with the most idle communication link in the target acceleration nodes as the optimal acceleration node.
Optionally, the data to be transmitted includes a preset number of slicing results of the data to be transmitted; the cutting result is obtained by cutting the data to be transmitted according to a preset size in advance;
when the data transmission program is executed by the processor 12, the following steps may be specifically implemented:
determining the optimal acceleration nodes corresponding to the preset number of the data acquisition ends in at least two acceleration nodes by combining the first network condition information;
synchronously deploying each cutting result to different optimal accelerating nodes.
The data transfer program, when executed by the processor 12, may further implement:
slicing the data to be transmitted according to the size of the data to be transmitted and the data deployment rate of the optimal acceleration node to obtain a slicing result of the data to be transmitted;
synchronously deploying each cutting result to different optimal accelerating nodes.
Further, referring to fig. 4, the data transmission apparatus 1 may further include a bus 13, wherein the memory 11 and the processor 12 are connected through the bus 13.
The memory 11 includes at least one type of readable storage medium, which includes a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a magnetic memory, a magnetic disk, and the like. The memory 11 may in some embodiments be an internal storage unit of the data transmission device 1, for example a hard disk of the data transmission device 1. The memory 11 may also be an external storage device of the data transmission apparatus 1 in other embodiments, such as a plug-in hard disk provided on the data transmission apparatus 1, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like. Further, the memory 11 may also include both an internal storage unit and an external storage device of the data transmission apparatus 1. The memory 11 may be used not only to store application software installed in the data transmission device 1 and various types of data, such as codes of a data transmission program, but also to temporarily store data that has been output or is to be output.
The processor 12 may be a Central Processing Unit (CPU), a controller, a microcontroller, a microprocessor or other data Processing chip in some embodiments, and is used for executing program codes stored in the memory 11 or Processing data, such as executing a data transmission program.
The bus 13 may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 4, but this does not indicate only one bus or one type of bus.
Further, the data transmission apparatus 1 may further include a network interface 14, and the network interface 14 may optionally include a wireless interface (such as a WI-FI interface, a bluetooth interface, etc.), which is generally used to establish a communication connection between the data transmission apparatus 1 and other electronic devices.
Optionally, the data transmission device 1 may further comprise a user interface 15, and the user interface 15 may comprise a Display (Display), an input unit such as a Keyboard (Keyboard). Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch device, or the like. The display, which may also be referred to as a display screen or display unit, is suitable for displaying information processed in the data transmission device 1 and for displaying a visual user interface.
Fig. 4 shows only the data transmission device 1 with the components 11-15, and it will be understood by those skilled in the art that the structure shown in fig. 4 does not constitute a limitation of the data transmission device 1, and may comprise fewer or more components than shown, or a combination of certain components, or a different arrangement of components.
Further, the embodiment also discloses a data transmission system.
Referring to fig. 5, fig. 5 is a schematic structural diagram of a data transmission system according to an embodiment of the disclosure. In fig. 5, the data transmission system includes:
a data obtaining request receiving module 401, configured to receive a data obtaining request initiated by a data obtaining end;
a first network condition information determining module 402, configured to determine first network condition information of the data obtaining end according to the data obtaining request;
an optimal acceleration node determining module 403, configured to determine, in combination with the first network condition information, at least one optimal acceleration node corresponding to the data obtaining end from among the at least two acceleration nodes;
the deployment module 404 is configured to deploy the data to be transmitted to the optimal acceleration node, so that the optimal acceleration node sends the data to be transmitted to the data obtaining end.
Therefore, after a data acquisition request initiated by the data acquisition end is received, the network condition information of the data acquisition end is determined, the optimal acceleration node is dynamically selected for the data receiving end in combination with the network condition information, the data to be transmitted is deployed to the optimal acceleration node, and the optimal acceleration node transmits the data to be transmitted to the data acquisition end. Therefore, for each data acquisition end, when the data acquisition end needs to acquire data, the optimal acceleration node is dynamically allocated to the data acquisition end, so that the data transmission rate can be ensured to be in the highest state, and the acceleration node can stably achieve a better acceleration effect.
Optionally, the first network condition information includes an operator type and a region to which the operator type belongs; accordingly, the first network condition information determining module 402 includes:
the target acceleration node determining unit is used for receiving and determining a target acceleration node which is the same as the operator type and the region of the data acquisition end;
an optimal acceleration node determination unit, configured to determine at least one optimal acceleration node among the target acceleration nodes.
Optionally, the optimal acceleration node determining unit is specifically configured to determine, as the optimal acceleration node, a node with the most idle communication link in the target acceleration nodes.
Optionally, the data to be transmitted includes a preset number of slicing results of the data to be transmitted; the cutting result is obtained by cutting the data to be transmitted according to a preset size in advance; accordingly, the first network condition information determining module 402 is specifically configured to determine, in combination with the first network condition information, the preset number of optimal acceleration nodes corresponding to the data obtaining end from among the at least two acceleration nodes; the deployment module 404 is specifically configured to synchronously deploy each of the slicing results to different optimal acceleration nodes.
Optionally, the system further comprises:
the block cutting module is used for cutting the data to be transmitted according to the size of the data to be transmitted and the data deployment rate of the optimal acceleration node to obtain a block cutting result of the data to be transmitted; accordingly, the deployment module 404 is specifically configured to synchronously deploy each of the slicing results to different optimal acceleration nodes.
The application also provides another data transmission system, and the embodiment of the application can be mutually referred to any embodiment.
Referring to fig. 6, another data transmission system provided in the embodiment of the present application specifically includes:
a server 501, configured to receive a data acquisition request initiated by a data acquisition end; determining first network condition information of the data acquisition terminal according to the data acquisition request; determining at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes in combination with the first network condition information 502; deploying data to be transmitted to the optimal acceleration node 502;
at least two acceleration nodes 502, configured to receive the data to be transmitted and transmit the data to be transmitted to the data obtaining end 503.
The specific descriptions of the server 501, the optimal acceleration node 502, and the data acquisition end 503 are all described in the above embodiments, and will not be described herein again.
Since the data to be transmitted is sent to the server 501 by the data sender, the data transmission system provided in this embodiment may further include a data sender 504.
The present application also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, may implement the steps provided by the above-described embodiments. The storage medium may include: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, an optical disk, or other various media capable of storing program codes.
It should be noted that the above-mentioned numbers of the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments. And the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrases "comprising a," "8230," "8230," or "comprising" does not exclude the presence of another identical element in a process, apparatus, article, or method comprising the element.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention, and all equivalent structures or equivalent processes performed by the present invention or directly or indirectly applied to other related technical fields are also included in the scope of the present invention.
Claims (10)
1. A method of data transmission, comprising:
receiving a data acquisition request initiated by a data acquisition end;
determining first network condition information of the data acquisition terminal according to the data acquisition request;
determining at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes by combining the first network condition information;
and deploying the data to be transmitted to the optimal acceleration node so that the optimal acceleration node sends the data to be transmitted to the data acquisition end.
2. The method of claim 1, wherein the first network condition information comprises an operator type, a region of interest;
correspondingly, the determining, in combination with the first network condition information, at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes includes:
determining target acceleration nodes which are the same as the operator type and the region of the data acquisition end in at least two acceleration nodes;
determining at least one of the optimal acceleration nodes among the target acceleration nodes.
3. The method of claim 2, wherein said determining at least one of said optimal acceleration nodes among said target acceleration nodes comprises:
and determining a node with the most idle communication link in the target acceleration nodes as the optimal acceleration node.
4. The method according to claim 1, wherein the data to be transmitted comprises a preset number of slicing results of the data to be transmitted; the cutting result is obtained by cutting the data to be transmitted according to a preset size in advance;
correspondingly, the determining, in combination with the first network condition information, at least one optimal acceleration node corresponding to the data acquisition end in the at least two acceleration nodes includes:
determining the optimal acceleration nodes corresponding to the preset number of the data acquisition ends in at least two acceleration nodes by combining the first network condition information;
correspondingly, the deploying the data to be transmitted to the optimal acceleration node includes:
synchronously deploying each cutting result to different optimal accelerating nodes.
5. The method according to claim 1, wherein before deploying the data to be transmitted to the optimal acceleration node, further comprising:
slicing the data to be transmitted according to the size of the data to be transmitted and the data deployment rate of the optimal acceleration node to obtain a slicing result of the data to be transmitted;
correspondingly, the deploying the data to be transmitted to the optimal acceleration node includes:
synchronously deploying each cutting result to different optimal accelerating nodes.
6. A data transfer apparatus comprising a memory and a processor, the memory having stored thereon a data transfer program operable on the processor, the data transfer program when executed by the processor implementing the steps of:
receiving a data acquisition request initiated by a data acquisition end;
determining first network condition information of the data acquisition terminal according to the data acquisition request;
determining at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes by combining the first network condition information;
and deploying the data to be transmitted to the optimal acceleration node so that the optimal acceleration node sends the data to be transmitted to the data acquisition end.
7. The apparatus of claim 6, wherein the data transmission program, when executed by the processor, further performs the steps of:
slicing the data to be transmitted according to the size of the data to be transmitted and the data deployment rate of the optimal acceleration node to obtain a slicing result of the data to be transmitted;
synchronously deploying each cutting result to different optimal acceleration nodes.
8. A data transmission system, comprising:
the data acquisition request receiving module is used for receiving a data acquisition request initiated by a data acquisition end;
the first network condition information determining module is used for determining first network condition information of the data acquisition end according to the data acquisition request;
an optimal acceleration node determination module, configured to determine, in combination with the first network condition information, at least one optimal acceleration node corresponding to the data acquisition end from among the at least two acceleration nodes;
and the deployment module is used for deploying the data to be transmitted to the optimal acceleration node so that the optimal acceleration node sends the data to be transmitted to the data acquisition end.
9. A data transmission system, comprising:
the server is used for receiving a data acquisition request initiated by the data acquisition terminal; determining first network condition information of the data acquisition terminal according to the data acquisition request; determining at least one optimal acceleration node corresponding to the data acquisition end in at least two acceleration nodes by combining the first network condition information; deploying data to be transmitted to the optimal acceleration node;
and the at least two acceleration nodes are used for receiving the data to be transmitted and transmitting the data to be transmitted to the data acquisition end.
10. A computer-readable storage medium having stored thereon a data transfer program executable by one or more processors to implement the data transfer method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910585175.6A CN110266438B (en) | 2019-07-01 | 2019-07-01 | Data transmission method, device and system and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910585175.6A CN110266438B (en) | 2019-07-01 | 2019-07-01 | Data transmission method, device and system and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110266438A CN110266438A (en) | 2019-09-20 |
| CN110266438B true CN110266438B (en) | 2022-11-18 |
Family
ID=67923583
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910585175.6A Active CN110266438B (en) | 2019-07-01 | 2019-07-01 | Data transmission method, device and system and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110266438B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112870692B (en) * | 2021-02-22 | 2023-05-16 | 深圳市迅雷网络技术有限公司 | Game acceleration method, acceleration system, acceleration device and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104506537A (en) * | 2014-12-26 | 2015-04-08 | 电子科技大学 | Node selection method for P2P (peer to peer) systems |
| CN105611425A (en) * | 2015-09-25 | 2016-05-25 | 浪潮(北京)电子信息产业有限公司 | Node optimization method and apparatus thereof |
| CN106357792A (en) * | 2016-10-10 | 2017-01-25 | 网宿科技股份有限公司 | Node routing method and system |
| CN108206862A (en) * | 2017-12-27 | 2018-06-26 | 努比亚技术有限公司 | The distribution method and diostribution device of Web content point |
| CN109639823A (en) * | 2018-12-28 | 2019-04-16 | 深圳市网心科技有限公司 | Network node dispatching method and device, computer installation and storage medium |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080002588A1 (en) * | 2006-06-30 | 2008-01-03 | Mccaughan Sherry L | Method and apparatus for routing data packets in a global IP network |
| CN101106468A (en) * | 2006-07-10 | 2008-01-16 | 研华股份有限公司 | Establishment method for multi-broadcast LAN |
| KR100772886B1 (en) * | 2006-10-27 | 2007-11-05 | 삼성전자주식회사 | Apparatus and method for providing network information |
| CN101459614B (en) * | 2008-12-24 | 2012-02-22 | 腾讯科技（深圳）有限公司 | Method, system and equipment for network data transmission |
| US9143422B2 (en) * | 2011-03-08 | 2015-09-22 | Cisco Technology, Inc. | Determining network node performance data based on location and proximity of nodes |
| CN103327121A (en) * | 2013-07-10 | 2013-09-25 | 亿览在线网络技术（北京）有限公司 | P2P (Peer-to-Peer Network) network resource transmission method and device for same |
| CN104022852B (en) * | 2014-06-25 | 2017-12-05 | 北京奇艺世纪科技有限公司 | A kind of document transmission method and device |
| CN105959219A (en) * | 2016-06-14 | 2016-09-21 | 乐视控股（北京）有限公司 | Data processing method and apparatus |
| CN106789348B (en) * | 2017-01-22 | 2020-07-28 | 维沃移动通信有限公司 | Network acceleration method, server and client |
| CN108494681B (en) * | 2018-02-05 | 2021-02-09 | 普联技术有限公司 | Multilink data stream transmission method, wireless communication device and storage medium |
-
2019
- 2019-07-01 CN CN201910585175.6A patent/CN110266438B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104506537A (en) * | 2014-12-26 | 2015-04-08 | 电子科技大学 | Node selection method for P2P (peer to peer) systems |
| CN105611425A (en) * | 2015-09-25 | 2016-05-25 | 浪潮(北京)电子信息产业有限公司 | Node optimization method and apparatus thereof |
| CN106357792A (en) * | 2016-10-10 | 2017-01-25 | 网宿科技股份有限公司 | Node routing method and system |
| CN108206862A (en) * | 2017-12-27 | 2018-06-26 | 努比亚技术有限公司 | The distribution method and diostribution device of Web content point |
| CN109639823A (en) * | 2018-12-28 | 2019-04-16 | 深圳市网心科技有限公司 | Network node dispatching method and device, computer installation and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| Comparative assessment of centrality indices and implications on the vulnerability of ISP networks;George Nomikos;《2014 26th International Teletraffic Congress (ITC)》;20141023;全文 * |
| 云环境下基于Entropy-KNN算法的节点选择策略;曾志等;《浙江大学学报(理学版)》;20150515(第03期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110266438A (en) | 2019-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106850402B (en) | Message transmission method and device | |
| CN107229528B (en) | Message pushing multiplexing method and device and electronic equipment | |
| CN106570097B (en) | Sequence generation method and device | |
| CN108038148A (en) | Search response method, apparatus, server and storage medium | |
| CN110290009B (en) | Data scheduling method and device and computer readable storage medium | |
| CN102685209B (en) | A kind of method of assisting users equipment transmitting/receiving instance message, device and equipment | |
| CN110266438B (en) | Data transmission method, device and system and computer readable storage medium | |
| CN112866985B (en) | Flow control method, resource downloading method, device, equipment and storage medium | |
| CN109471713B (en) | Method and device for inquiring information | |
| CN112822300A (en) | RDMA (remote direct memory Access) -based data transmission method and device and electronic equipment | |
| CN101572764B (en) | Method and system for sending pictures between electronic picture frames and electronic picture frame | |
| CN110602221A (en) | Notification level processing method and device and readable storage medium | |
| CN108112052B (en) | Terminal network sharing method and device, air conditioner and storage medium | |
| CN115776461A (en) | Screen projection method, equipment and storage medium | |
| CN113162997B (en) | Data transmission method and device, electronic equipment and readable storage medium | |
| CN105978853B (en) | Session scheduling method, scheduling server and terminal | |
| CN110661697B (en) | Message synchronization method, device, readable storage medium, electronic device and system | |
| CN110324377B (en) | Push interaction method and device, electronic equipment and medium | |
| CN114301989A (en) | Information transmission method, device and system | |
| CN115378855A (en) | Data packet testing method and device, communication device and storage medium | |
| CN106897325B (en) | Data loading method and device | |
| CN115220993A (en) | Process monitoring method, device, vehicle and storage medium | |
| CN109388498B (en) | Mutual exclusion processing method, device, equipment and medium | |
| CN110266814B (en) | Transmission method and transmission device | |
| CN112685613A (en) | Resource packet query method and device and information processing system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |