CN110266438A - A kind of data transmission method, device, system and computer readable storage medium - Google Patents
A kind of data transmission method, device, system and computer readable storage medium Download PDFInfo
- Publication number
- CN110266438A CN110266438A CN201910585175.6A CN201910585175A CN110266438A CN 110266438 A CN110266438 A CN 110266438A CN 201910585175 A CN201910585175 A CN 201910585175A CN 110266438 A CN110266438 A CN 110266438A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- data acquisition
- transmitted
- optimal
- 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.)
- Granted
Links
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
A kind of data transmission method of the present invention, comprising: receive the data acquisition request that data acquisition end is initiated；The first network conditional information at the data acquisition end is determined according to the data acquisition request；Accelerate to determine at least one the optimal acceleration node for corresponding to the data acquisition end in node at least two in conjunction with the first network conditional information；Data to be transmitted is deployed to the optimal acceleration node, so that the data to be transmitted is sent to the data acquisition end by the optimal acceleration node.For each data acquisition end, when it needs to obtain data, it all dynamically can accelerate node for its optimal scheme, make message transmission rate that can guarantee highest state, so as to so that acclerating section point steadily reaches preferable acceleration effect.Present invention also provides a kind of data transmission device, system and computer readable storage mediums, and above-mentioned technical effect equally may be implemented.
Description
Technical field
Technical field of data transmission of the present invention more particularly to a kind of data transmission method, device, system and computer-readable
Storage medium.
Background technique
In big data transmission or downloading process, it will usually accelerate transmission speed using node is accelerated.Data pass at present
Defeated process is usually that will first need data to be transmitted or being downloaded to be deployed to arbitrary acceleration node in advance by data sender,
When data recipient needs to obtain data, then search the information for the acceleration node that data are deployed to, then according to the information to
Node is accelerated to obtain data.
Due to accelerating node itself that the factor of message transmission rate can be improved, compared to data recipient directly to data
Sender obtains data, and the rate of data transmission can increase.
But for different data recipients, node is accelerated to be not sufficiently stable the speed-increasing effect of data transmission process,
That is in the prior art, accelerate node for some data recipients, speed-increasing effect clearly, but for
For other data recipients, speed-increasing effect is just relatively more general.
Therefore, how to make that node is accelerated steadily to reach preferable acceleration effect, be asking for those skilled in the art's urgent need to resolve
Topic.
Summary of the invention
The main purpose of the present invention is to provide a kind of data transmission method, device, system and computer-readable storage mediums
Matter, to solve the problems, such as to accelerate node that cannot steadily reach preferable acceleration effect in the prior art.
To achieve the above object, a kind of data transmission method provided by the invention, comprising:
Receive the data acquisition request that data acquisition end is initiated；
The first network conditional information at the data acquisition end is determined according to the data acquisition request；
Accelerate to determine the corresponding data acquisition end in node at least two in conjunction with the first network conditional information
At least one optimal acceleration node；
Data to be transmitted is deployed to the optimal acceleration node, so that the optimal acceleration node is by the number to be transmitted
According to being sent to the data acquisition end.
Optionally, the first network conditional information includes operator types, affiliated region；
Correspondingly, first network conditional information described in the combination determines the corresponding number at least two acceleration nodes
According at least one the optimal acceleration node for obtaining end, comprising:
The determining at least two objects acclerating section all the same with the operator types at the data acquisition end, affiliated region
Point；
Accelerate to determine at least one described optimal acceleration node in node in the target.
It is optionally, described to accelerate to determine at least one described optimal acceleration node in node in the target, comprising:
Accelerate to determine the most idle node of communication link in node in the target, as the optimal acceleration node.
Optionally, the data to be transmitted includes the stripping and slicing result of the predetermined number of the data to be transmitted；The stripping and slicing
As a result the stripping and slicing result in advance to obtain the data to be transmitted according to pre-set dimension progress dicing operation；
Correspondingly, first network conditional information described in the combination determines the corresponding number at least two acceleration nodes
According at least one the optimal acceleration node for obtaining end, comprising:
Accelerate to determine the corresponding data acquisition end in node at least two in conjunction with the first network conditional information
The optimal acceleration node of the predetermined number；
Correspondingly, described be deployed to the optimal acceleration node for data to be transmitted, comprising:
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes.
It is optionally, described that data to be transmitted is deployed to before the optimal acceleration node, further includes:
According to the size of the data to be transmitted with the optimal data deployment rate for accelerating node to described to be transmitted
Data carry out stripping and slicing, obtain the stripping and slicing result of the data to be transmitted；
Correspondingly, described be deployed to the optimal acceleration node for data to be transmitted, comprising:
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes.
The application also provides a kind of data transmission device, and described device includes memory and processor, on the memory
It is stored with the data distributing program that can be run on the processor, it is real when the data distributing program is executed by the processor
Now such as following steps:
Receive the data acquisition request that data acquisition end is initiated；
The first network conditional information at the data acquisition end is determined according to the data acquisition request；
Accelerate to determine the corresponding data acquisition end in node at least two in conjunction with the first network conditional information
At least one optimal acceleration node；
Data to be transmitted is deployed to the optimal acceleration node, so that the optimal acceleration node is by the number to be transmitted
According to being sent to the data acquisition end.
Optionally, when the data distributing program is executed by the processor, such as following steps are also realized:
According to the size of the data to be transmitted with the optimal data deployment rate for accelerating node to described to be transmitted
Data carry out stripping and slicing, obtain the stripping and slicing result of the data to be transmitted；
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes.
The application also provides a kind of data transmission system, comprising:
Data acquisition request receiving module obtains the data acquisition request initiated at end for receiving data；
First network conditional information determining module, for determining the data acquisition end according to the data acquisition request
First network conditional information；
Optimal acceleration node determining module is used in conjunction with the first network conditional information at least two acceleration nodes
Determine at least one optimal acceleration node at the corresponding data acquisition end；
Deployment module, for data to be transmitted to be deployed to the optimal acceleration node, so that the optimal acceleration node
The data to be transmitted is sent to the data acquisition end.
The application also provides a kind of data transmission system, comprising:
Server obtains the data acquisition request initiated at end for receiving data；It is determined according to the data acquisition request
The first network conditional information at the data acquisition end；In conjunction with the first network conditional information at least two acceleration nodes
Determine at least one optimal acceleration node at the corresponding data acquisition end；Data to be transmitted is deployed to the optimal acclerating section
Point；
At least two acceleration nodes for receiving the data to be transmitted, and the data to be transmitted are transmitted to described
Data acquisition end.
In order to realize the above technical effect, present invention also provides a kind of computer readable storage mediums, and the computer can
It reads to be stored with data distributing program on storage medium, the data distributing program can be executed by one or more processors, with reality
Now data transmission method as mentioned.
In order to realize the above technical effect, present invention also provides a kind of computer program product, including computer instruction, when
When it runs on computers, computer is allowed to execute data transmission method described in any of the above embodiments.
It can be seen that the application can determine whether data acquisition after the data acquisition request for receiving the initiation of data acquisition end
The network condition information at end, and in conjunction with network condition information be dynamically that data receiver selects optimal acceleration node, and will be to
Transmission data are deployed to optimal acceleration node, and data to be transmitted is transmitted to data acquisition end by optimal acceleration node.Therefore, right
For each data acquisition end, when it needs to obtain data, it all dynamically can accelerate node for its optimal scheme, make data
Transmission rate can guarantee highest state, so as to so that acclerating section point steadily reaches preferable acceleration effect.
Detailed description of the invention
Fig. 1 is a kind of data transmission method flow chart provided by the invention；
Fig. 2 is a kind of specific data transmission method flow chart provided by the invention；
Fig. 3 is a kind of specific data transmission method flow chart provided by the invention；
Fig. 4 is the schematic diagram of internal structure for the data transmission device that one embodiment of the invention discloses；
Fig. 5 is the structural schematic diagram for the data transmission system that one embodiment of the invention discloses；
Fig. 6 is the structural schematic diagram for another data transmission system that one embodiment of the invention discloses.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that described herein, specific examples are only used to explain the present invention, not
For limiting the present invention.Based on the embodiments of the present invention, those of ordinary skill in the art are not before making creative work
Every other embodiment obtained is put, shall fall within the protection scope of the present invention.
The description and claims of this application and term " first ", " second ", " third ", " in above-mentioned attached drawing
The (if present)s such as four " are to be used to distinguish similar objects, without being used to describe a particular order or precedence order.It should manage
The data that solution uses in this way are interchangeable under appropriate circumstances, so that the embodiments described herein can be in addition to illustrating herein
Or the sequence other than the content of description is implemented.In addition, term " includes " and " having " and their any deformation, it is intended that
Cover it is non-exclusive include, for example, containing the process, method, system, product or equipment of a series of steps or units need not limit
In step or unit those of is clearly listed, but may include be not clearly listed or for these process, methods, produce
The other step or units of product or equipment inherently.
It should be noted that the description for being related to " first ", " second " etc. in the present invention is used for description purposes only, and cannot
It is interpreted as its relative importance of indication or suggestion or implicitly indicates the quantity of indicated technical characteristic.Define as a result, " the
One ", the feature of " second " can explicitly or implicitly include at least one of the features.In addition, the skill between each embodiment
Art scheme can be combined with each other, but must be based on can be realized by those of ordinary skill in the art, when technical solution
Will be understood that the combination of this technical solution is not present in conjunction with there is conflicting or cannot achieve when, also not the present invention claims
Protection scope within.
The application provides a kind of data transmission method, device, system and computer readable storage medium, to solve existing skill
The problem of accelerating node that cannot steadily reach preferable acceleration effect in art.
Referring to Fig.1, Fig. 1 is the flow diagram of one embodiment of the invention.
In one embodiment, comprising:
S101 receives the data acquisition request that data acquisition end is initiated.
This programme is applied to server, is different from the prior art, and the data of data sending terminal are not to be deployed directly into arbitrarily
An acceleration node on, but be previously transmitted to server, then by server according to the data receiver of request data
The case where dynamically select acclerating section point to be disposed.
Specifically, the data acquisition request initiated at data acquisition end is received first.Indicate that data obtain in data acquisition request
End is taken to want the information at the data obtained and data acquisition end.
S102 determines the first network conditional information at the data acquisition end according to the data acquisition request.
It should be noted that accelerate the rate of data transmission between node and data acquisition end usually with the network item of both sides
Part is related, for example, when accelerating node and data acquisition end, transmission rate will be lower not at same region, conversely, when accelerating
At same region, transmission rate then can be higher for node and data acquisition end.
Therefore, it needs to be determined that the network condition information at data acquisition end, i.e. first network conditional information in this programme.
Network condition information is not specifically limited in this programme, as long as influencing the information of message transmission rate can make
For first network conditional information.
S103 determines the corresponding data acquisition in conjunction with the first network conditional information at least two acceleration nodes
At least one optimal acceleration node at end.
Due to accelerating the rate of data transmission between node and data acquisition end usually related with the network condition of both sides, because
This, can be determined in losing few two acceleration nodes in this programme according to the first network conditional information of data receiver
Message transmission rate is set to reach highest optimal acceleration node.
In a specific embodiment, the first network conditional information includes operator types, affiliated region；
Correspondingly, first network conditional information described in the combination determines the corresponding number at least two acceleration nodes
According at least one the optimal acceleration node for obtaining end, comprising:
Accelerate at least two determining all the same with the operator types at the data acquisition end, affiliated region in node
Target accelerates node；
Accelerate to determine at least one described optimal acceleration node in node in the target.
In the present embodiment, need to determine operator types and affiliated region and data in all acceleration nodes
It obtains the identical target in end and accelerates node.
It should be noted that data transmission rate will receive transmission two end nodes whether be same operator, whether
The influence of same region, if all the same, message transmission rate can be higher.
On the basis of preferably, the application is described in the mesh it is further proposed that a kind of preferred embodiment
Mark accelerates to determine at least one described optimal acceleration node in node, comprising:
Accelerate to determine the most idle node of communication link in node in the target, as the optimal acceleration node.
The communication link free time refers to that target accelerates node available bandwidth bigger or available transmission number is more, so as to
Further to guarantee that target accelerates the rate of the above-mentioned data to be transmitted of node-node transmission higher.
It therefore, is no longer an acceleration node to be fixed to any data receiver, but understand basis in this programme
The difference of data receiver is dynamically selected optimal acceleration node, that is to say, that for each data receiver, be all
By transmitting data relative to its optimal acceleration node, therefore for each data receiver, message transmission rate is all
It is highest.
Data to be transmitted is deployed to the optimal acceleration node by S104 so that the optimal acceleration node will it is described to
Transmission data are sent to the data acquisition end.
Specifically, after data being deployed to optimal acceleration node, node is accelerated data to be transmitted can be transmitted to data
End is obtained, specific transmission process is same as the prior art, will not be described in great detail herein.
It can be seen that the application can determine whether data acquisition after the data acquisition request for receiving the initiation of data acquisition end
The network condition information at end, and in conjunction with network condition information be dynamically that data receiver selects optimal acceleration node, and will be to
Transmission data are deployed to optimal acceleration node, and data to be transmitted is transmitted to data acquisition end by optimal acceleration node.Therefore, right
For each data acquisition end, when it needs to obtain data, it all dynamically can accelerate node for its optimal scheme, make data
Transmission rate can guarantee highest state, so as to so that acclerating section point steadily reaches preferable acceleration effect.
A kind of specific data transmission method provided by the embodiments of the present application is introduced below, one kind described below
Specific data transmission method can be cross-referenced with above-described embodiment.
Referring to fig. 2, a kind of specific data transmission method provided by the embodiments of the present application, specifically includes:
S201 receives the data acquisition request that data acquisition end is initiated.
S202 determines the first network conditional information at the data acquisition end according to the data acquisition request.
S203 determines the corresponding data acquisition in conjunction with the first network conditional information at least two acceleration nodes
The optimal acceleration node of the predetermined number at end.
It should be noted that can also exist since data to be transmitted is before being transmitted to data acquisition end by acceleration node
The process of one deployment, the delay that this process can also cause data to transmit to a certain extent cause data acquisition end to obtain
Time to data increases, and influences the overall rate of data acquisition.
Therefore, it is small to be cut into several in order to reduce influence of the deployment process to rate by this programme for data to be transmitted
Stripping and slicing, so as to which several small strippings and slicings are simultaneously deployed in a parallel fashion on different optimal acceleration nodes,
Complete so whole data to be transmitted deployment time will reduction at double, promote the overall rate of data acquisition.
In the present solution, the data to be transmitted of data acquisition end institute request can be cut into several strippings and slicings as a result,
Specific dicing operation can be by data sending terminal progress, that is to say, that is saved in server is exactly data to be transmitted
Stripping and slicing result；It is also possible to server and carries out stripping and slicing after the data for receiving data sending terminal, specifically without limitation.
According to the number of stripping and slicing, i.e. predetermined number, the optimal acceleration node of the predetermined number is determined, to complete each stripping and slicing
Deployment.
It should be noted that it is optimal scheme that optimal acceleration node number is essentially equal with stripping and slicing number, add when optimal
It, can also be according to each optimal actual conditions for accelerating node when the remainder result of fast node number and the number of stripping and slicing is not 0
After parallel for the first time disposing on remaining node deployment to corresponding optimal acceleration node.For example, data to be transmitted is 20MB,
The optimal acceleration node determined is 8, is that data to be transmitted is divided into 10 2MB based on this best stripping and slicing scheme determined
Stripping and slicing, for the first time in parallel deployment 8 strippings and slicings to each optimal acceleration node, second in conjunction with each link for accelerating node
Idle condition disposes remaining 2 strippings and slicings.It, can be with it is understood that when that stripping and slicing cannot be distributed equally
The size of each stripping and slicing will be adjusted, example as above according to the actual situation, data to be transmitted can be divided into 6 2MB and 2 4MB,
It is disposed parallel again.The scheme of deployment time is reduced by stripping and slicing in protection scope, if specific stripping and slicing and deployment
It can determine according to the actual situation.
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes, so that the optimal acceleration by S204
The data to be transmitted is sent to the data acquisition end by node；The stripping and slicing result is in advance to press the data to be transmitted
The stripping and slicing result that dicing operation obtains is carried out according to pre-set dimension.
Specifically, each stripping and slicing result is deployed on different optimal nodes, realize by all data to be transmitted and
Row deployment, thus at double reduce deployment time.
A kind of specific data transmission method provided by the embodiments of the present application is introduced below, one kind described below
Specific data transmission method can be cross-referenced with above-described embodiment.
Referring to Fig. 3, a kind of specific data transmission method provided by the embodiments of the present application is specifically included:
S301 receives the data acquisition request that data acquisition end is initiated.
S302 determines the first network conditional information at the data acquisition end according to the data acquisition request.
S303 determines the corresponding data acquisition in conjunction with the first network conditional information at least two acceleration nodes
At least one optimal acceleration node at end.
S304, according to the size of the data to be transmitted and it is described it is optimal accelerate node data deployment rate to it is described to
It transmits data and carries out stripping and slicing, obtain the stripping and slicing result of the data to be transmitted.
Preferably, the dicing operation of data to be transmitted is carried out by server.
Specifically, server further determines that optimal acceleration node disposed data after determining optimal acceleration node
Rate, and combined data deployment rate and the size progress stripping and slicing for transmitting data, specifically need to obtain the stripping and slicing of how many number
As a result, can be determined according to the longest deployment time that delay allows, for example, delay allow to complete in longest 1 minute it is to be transmitted
The deployment of data, each optimal data deployment rate for accelerating node is deployment 2MB per minute, and data to be transmitted size is
Data to be transmitted can be then cut into the stripping and slicing of 5 2MB as a result, to complete all data to be transmitted in 1 minute by 10MB
Deployment.
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes, so that described optimal by S305
Accelerate node that the data to be transmitted is sent to the data acquisition end.
In the present solution, by server after optimal acceleration node and its data deployment rate has been determined, in conjunction with data portion
It affixes one's name to rate and carries out stripping and slicing, stripping and slicing result can be made more accurate, can also flexibly control brought by deployment data to be transmitted
Delay time.
Further, the present embodiment also discloses a kind of data transmission device.
It is the schematic diagram of internal structure for the data transmission device that one embodiment of the invention discloses referring to Fig. 4, Fig. 4.In Fig. 4,
Data transmission device 1 includes memory 11 and processor 12, is stored with and can transport on the processor 12 on the memory 11
Capable data distributing program, the data transmission realize following method when being executed by the processor 12:
Receive the data acquisition request that data acquisition end is initiated；
The first network conditional information at the data acquisition end is determined according to the data acquisition request；
Accelerate to determine the corresponding data acquisition end in node at least two in conjunction with the first network conditional information
At least one optimal acceleration node；
Data to be transmitted is deployed to the optimal acceleration node, so that the optimal acceleration node is by the number to be transmitted
According to being sent to the data acquisition end.
It can be seen that the application can determine whether data acquisition after the data acquisition request for receiving the initiation of data acquisition end
The network condition information at end, and in conjunction with network condition information be dynamically that data receiver selects optimal acceleration node, and will be to
Transmission data are deployed to optimal acceleration node, and data to be transmitted is transmitted to data acquisition end by optimal acceleration node.Therefore, right
For each data acquisition end, when it needs to obtain data, it all dynamically can accelerate node for its optimal scheme, make data
Transmission rate can guarantee highest state, so as to so that acclerating section point steadily reaches preferable acceleration effect.
Optionally, the first network conditional information includes operator types, affiliated region；
When the data distributing program is executed by the processor 12, specifically it may be implemented:
Accelerate at least two determining all the same with the operator types at the data acquisition end, affiliated region in node
Target accelerates node；
Accelerate to determine the optimal acceleration node in node in the target.
When the data distributing program is executed by the processor 12, specifically it may be implemented:
Accelerate to determine the most idle node of communication link in node in the target, as the optimal acceleration node.
Optionally, the data to be transmitted includes the stripping and slicing result of the predetermined number of the data to be transmitted；The stripping and slicing
As a result the stripping and slicing result in advance to obtain the data to be transmitted according to pre-set dimension progress dicing operation；
When the data distributing program is executed by the processor 12, specifically it may be implemented:
Accelerate to determine the corresponding data acquisition end in node at least two in conjunction with the first network conditional information
The optimal acceleration node of the predetermined number；
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes.
When the data distributing program is executed by the processor 12, it can also realize:
According to the size of the data to be transmitted with the optimal data deployment rate for accelerating node to described to be transmitted
Data carry out stripping and slicing, obtain the stripping and slicing result of the data to be transmitted；
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes.
Further, referring to Fig. 4, the data transmission device 1 can also include bus 13, wherein the memory 11
It is connected with the processor 12 by the bus 13.
Wherein, memory 11 include at least a type of readable storage medium storing program for executing, the readable storage medium storing program for executing include flash memory,
Hard disk, multimedia card, card-type memory (for example, SD or DX memory etc.), magnetic storage, disk etc..Memory 11 is one
It can be the internal storage unit of data transmission device 1, such as the hard disk of the data transmission device 1 in a little embodiments.Memory
11 are also possible to be equipped on the External memory equipment of data transmission device 1, such as data transmission device 1 in further embodiments
Plug-in type hard disk, intelligent memory card (Smart Media Card, SMC), secure digital (Secure Digital, SD) card,
Flash card (Flash Card) etc..Further, memory 11 can also both include the internal storage unit of data transmission device 1
It also include External memory equipment.Memory 11 can be not only used for storage and be installed on the application software of data transmission device 1 and each
Class data, such as the code of data distributing program etc. can be also used for temporarily storing the number that has exported or will export
According to.
Processor 12 can be in some embodiments a central processing unit (Central Processing Unit,
CPU), controller, microcontroller, microprocessor or other data processing chips, the program for being stored in run memory 11
Code or processing data, such as execute data distributing program etc..
Bus 13 can be Peripheral Component Interconnect standard (peripheral component interconnect, abbreviation
PCI) bus or expanding the industrial standard structure (extended industry standard architecture, abbreviation EISA)
Bus etc..The bus can be divided into address bus, data/address bus, control bus etc..For convenient for indicating, in Fig. 4 only with one slightly
Line indicates, it is not intended that an only bus or a type of bus.
Further, data transmission device 1 can also include network interface 14, and network interface 14 optionally may include nothing
Line interface (such as WI-FI interface, blue tooth interface), commonly used in being built between the data transmission device 1 and other electronic equipments
Vertical communication connection.
Optionally, which can also include user interface 15, and user interface 15 may include display
(Display), input unit such as keyboard (Keyboard).Optionally, in some embodiments, it is aobvious to can be LED for display
Show device, liquid crystal display, touch-control liquid crystal display and OLED (Organic Light-Emitting Diode, You Jifa
Optical diode) touch device etc..Wherein, display appropriate can also be known as display screen or display unit, for being shown in data
The information that is handled in transmitting device 1 and for showing visual user interface.
Fig. 4 illustrates only the data transmission device 1 with component 11-15, it will be appreciated by persons skilled in the art that figure
The restriction of structure shown in 4 not structure paired data transmitting device 1, may include than illustrating less or more components, or
Person combines certain components or different component layouts.
Further, the present embodiment also discloses a kind of data transmission system.
It is the data transmission system structural schematic diagram that one embodiment of the invention discloses referring to Fig. 5, Fig. 5.In Fig. 5, the number
According to Transmission system, comprising:
Data acquisition request receiving module 401 obtains the data acquisition request initiated at end for receiving data；
First network conditional information determining module 402, for determining the data acquisition according to the data acquisition request
The first network conditional information at end；
Optimal acceleration node determining module 403 is used in conjunction with the first network conditional information at least two acclerating sections
At least one optimal acceleration node at the corresponding data acquisition end is determined in point；
Deployment module 404, for data to be transmitted to be deployed to the optimal acceleration node, so that the optimal acclerating section
The data to be transmitted is sent to the data acquisition end by point.
It can be seen that the application can determine whether data acquisition after the data acquisition request for receiving the initiation of data acquisition end
The network condition information at end, and in conjunction with network condition information be dynamically that data receiver selects optimal acceleration node, and will be to
Transmission data are deployed to optimal acceleration node, and data to be transmitted is transmitted to data acquisition end by optimal acceleration node.Therefore, right
For each data acquisition end, when it needs to obtain data, it all dynamically can accelerate node for its optimal scheme, make data
Transmission rate can guarantee highest state, so as to so that acclerating section point steadily reaches preferable acceleration effect.
Optionally, the first network conditional information includes operator types, affiliated region；Correspondingly, first network item
Part information determination module 402 includes:
Target accelerates node determination unit, for receiving the determining operator types with the data acquisition end, institute possession
Domain target all the same accelerates node；
Optimal acceleration node determination unit determines at least one described optimal acceleration for accelerating in the target in node
Node.
Optionally, optimal acceleration node determination unit is specifically used for accelerating to determine communication link most in node in the target
Idle node, as the optimal acceleration node.
Optionally, the data to be transmitted includes the stripping and slicing result of the predetermined number of the data to be transmitted；The stripping and slicing
As a result the stripping and slicing result in advance to obtain the data to be transmitted according to pre-set dimension progress dicing operation；Correspondingly, first
Network condition information determining module 402 is specifically used for true at least two acceleration nodes in conjunction with the first network conditional information
Surely the optimal acceleration node of the predetermined number at the data acquisition end is corresponded to；Deployment module 404 is specifically used for each institute
It states stripping and slicing result and synchronizes and be deployed to the different optimal acceleration nodes.
Optionally, the system also includes:
Stripping and slicing module, for disposing rate according to the size and the optimal data for accelerating node of the data to be transmitted
Stripping and slicing is carried out to the data to be transmitted, obtains the stripping and slicing result of the data to be transmitted；Correspondingly, deployment module 404 is specific
The different optimal acceleration nodes is deployed to for synchronizing each stripping and slicing result.
Present invention also provides another data transmission system, the embodiment of the present application can be mutual with any of the above-described embodiment
Reference.
Referring to Fig. 6, another kind data transmission system provided by the embodiments of the present application is specifically included:
Server 501 obtains the data acquisition request initiated at end for receiving data；It is true according to the data acquisition request
The first network conditional information at the fixed data acquisition end；In conjunction with the first network conditional information at least two acceleration nodes
At least one optimal acceleration node 502 at the middle determining corresponding data acquisition end；Data to be transmitted is deployed to described optimal
Accelerate node 502；
At least two acceleration nodes 502, are transmitted to institute for receiving the data to be transmitted, and by the data to be transmitted
State data acquisition end 503.
In relation to server 501, the optimal specific introduction for accelerating node 502, data acquisition end 503 in above-described embodiment
Introduction is made, will no longer be repeated herein.
Since data to be transmitted is sent in server 501 by data sending terminal, number provided in this embodiment
It further can also include data sending terminal 504 according to Transmission system.
Present invention also provides a kind of computer readable storage mediums, are stored thereon with computer program, the computer
Step provided by above-described embodiment may be implemented when program is executed by processor.The storage medium may include: USB flash disk, movement
Hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory,
RAM), the various media that can store program code such as magnetic or disk.
It should be noted that the serial number of the above embodiments of the invention is only for description, do not represent the advantages or disadvantages of the embodiments.And
The terms "include", "comprise" herein or any other variant thereof is intended to cover non-exclusive inclusion, so that packet
Process, device, article or the method for including a series of elements not only include those elements, but also including being not explicitly listed
Other element, or further include for this process, device, article or the intrinsic element of method.Do not limiting more
In the case where, the element that is limited by sentence "including a ...", it is not excluded that including process, device, the article of the element
Or there is also other identical elements in method.
The above is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (10)
1. a kind of data transmission method characterized by comprising
Receive the data acquisition request that data acquisition end is initiated；
The first network conditional information at the data acquisition end is determined according to the data acquisition request；
The corresponding data acquisition end is determined at least two acceleration nodes at least in conjunction with the first network conditional information
One optimal acceleration node；
Data to be transmitted is deployed to the optimal acceleration node, so that the optimal acceleration node sends out the data to be transmitted
It send to the data acquisition end.
2. the method according to claim 1, wherein the first network conditional information include operator types,
Affiliated region；
Correspondingly, first network conditional information described in the combination determines that the corresponding data obtain at least two acceleration nodes
Take at least one optimal acceleration node at end, comprising:
Accelerate the determining target all the same with the operator types at the data acquisition end, affiliated region in node at least two
Accelerate node；
Accelerate to determine at least one described optimal acceleration node in node in the target.
3. according to the method described in claim 2, it is characterized in that, described accelerate to determine at least one in node in the target
The optimal acceleration node, comprising:
Accelerate to determine the most idle node of communication link in node in the target, as the optimal acceleration node.
4. the method according to claim 1, wherein the data to be transmitted includes the pre- of the data to be transmitted
If the stripping and slicing result of number；The stripping and slicing result is that the data to be transmitted is carried out dicing operation according to pre-set dimension in advance to obtain
The stripping and slicing result arrived；
Correspondingly, first network conditional information described in the combination determines that the corresponding data obtain at least two acceleration nodes
Take at least one optimal acceleration node at end, comprising:
It is determined at least two acceleration nodes described in the corresponding data acquisition end in conjunction with the first network conditional information
The optimal acceleration node of predetermined number；
Correspondingly, described be deployed to the optimal acceleration node for data to be transmitted, comprising:
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes.
5. the method according to claim 1, wherein described be deployed to the optimal acclerating section for data to be transmitted
Before point, further includes:
According to the size of the data to be transmitted and the optimal data deployment rate for accelerating node to the data to be transmitted
Stripping and slicing is carried out, the stripping and slicing result of the data to be transmitted is obtained；
Correspondingly, described be deployed to the optimal acceleration node for data to be transmitted, comprising:
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes.
6. a kind of data transmission device, which is characterized in that described device includes memory and processor, is stored on the memory
There is the data distributing program that can be run on the processor, is realized such as when the data distributing program is executed by the processor
Following steps:
Receive the data acquisition request that data acquisition end is initiated；
The first network conditional information at the data acquisition end is determined according to the data acquisition request；
The corresponding data acquisition end is determined at least two acceleration nodes at least in conjunction with the first network conditional information
One optimal acceleration node；
Data to be transmitted is deployed to the optimal acceleration node, so that the optimal acceleration node sends out the data to be transmitted
It send to the data acquisition end.
7. device according to claim 6, which is characterized in that when the data distributing program is executed by the processor,
Also realize such as following steps:
According to the size of the data to be transmitted and the optimal data deployment rate for accelerating node to the data to be transmitted
Stripping and slicing is carried out, the stripping and slicing result of the data to be transmitted is obtained；
Each stripping and slicing result is synchronized and is deployed to the different optimal acceleration nodes.
8. a kind of data transmission system characterized by comprising
Data acquisition request receiving module obtains the data acquisition request initiated at end for receiving data；
First network conditional information determining module, for determining the first of the data acquisition end according to the data acquisition request
Network condition information；
Optimal acceleration node determining module, for being determined at least two acceleration nodes in conjunction with the first network conditional information
At least one optimal acceleration node at the corresponding data acquisition end；
Deployment module, for data to be transmitted to be deployed to the optimal acceleration node, so that the optimal acceleration node is by institute
It states data to be transmitted and is sent to the data acquisition end.
9. a kind of data transmission system characterized by comprising
Server obtains the data acquisition request initiated at end for receiving data；According to data acquisition request determination
The first network conditional information at data acquisition end；It is determined at least two acceleration nodes in conjunction with the first network conditional information
At least one optimal acceleration node at the corresponding data acquisition end；Data to be transmitted is deployed to the optimal acceleration node；
At least two acceleration nodes, are transmitted to the data for receiving the data to be transmitted, and by the data to be transmitted
Obtain end.
10. a kind of computer readable storage medium, which is characterized in that be stored with data biography on the computer readable storage medium
Defeated program, the data distributing program can be executed by one or more processors, to realize such as any one of claim 1 to 5 institute
The data transmission method stated.
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 true CN110266438A (en) | 2019-09-20 |
| CN110266438B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112870692A (en) * | 2021-02-22 | 2021-06-01 | 深圳市迅雷网络技术有限公司 | Game acceleration method, acceleration system, acceleration device and storage medium |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101106468A (en) * | 2006-07-10 | 2008-01-16 | 研华股份有限公司 | Establishment method for multi-broadcast LAN |
| US20080101384A1 (en) * | 2006-10-27 | 2008-05-01 | Samsung Electronics Co., Ltd. | Apparatus and method for providing network information |
| EP2036277A2 (en) * | 2006-06-30 | 2009-03-18 | At&T Corp. | Method and apparatus for routing data packets in a global ip network |
| CN101459614A (en) * | 2008-12-24 | 2009-06-17 | 腾讯科技（深圳）有限公司 | Method, system and equipment for network data transmission |
| US20120233308A1 (en) * | 2011-03-08 | 2012-09-13 | Van De Houten S Scott | 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 |
| CN104022852A (en) * | 2014-06-25 | 2014-09-03 | 北京奇艺世纪科技有限公司 | Document transmission method and device |
| 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 |
| CN105959219A (en) * | 2016-06-14 | 2016-09-21 | 乐视控股（北京）有限公司 | Data processing method and apparatus |
| CN106357792A (en) * | 2016-10-10 | 2017-01-25 | 网宿科技股份有限公司 | Node routing method and system |
| CN106789348A (en) * | 2017-01-22 | 2017-05-31 | 维沃移动通信有限公司 | A kind of method of network acceleration, server and client |
| CN108206862A (en) * | 2017-12-27 | 2018-06-26 | 努比亚技术有限公司 | The distribution method and diostribution device of Web content point |
| CN108494681A (en) * | 2018-02-05 | 2018-09-04 | 普联技术有限公司 | Data flow transmission method, wireless telecom equipment and the storage medium of multilink |
| CN109639823A (en) * | 2018-12-28 | 2019-04-16 | 深圳市网心科技有限公司 | Network node dispatching method and device, computer installation and storage medium |
-
2019
- 2019-07-01 CN CN201910585175.6A patent/CN110266438B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2036277A2 (en) * | 2006-06-30 | 2009-03-18 | At&T Corp. | 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 |
| US20080101384A1 (en) * | 2006-10-27 | 2008-05-01 | Samsung Electronics Co., Ltd. | Apparatus and method for providing network information |
| CN101459614A (en) * | 2008-12-24 | 2009-06-17 | 腾讯科技（深圳）有限公司 | Method, system and equipment for network data transmission |
| US20120233308A1 (en) * | 2011-03-08 | 2012-09-13 | Van De Houten S Scott | 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 |
| CN104022852A (en) * | 2014-06-25 | 2014-09-03 | 北京奇艺世纪科技有限公司 | Document transmission method and device |
| 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 |
| CN105959219A (en) * | 2016-06-14 | 2016-09-21 | 乐视控股（北京）有限公司 | Data processing method and apparatus |
| CN106357792A (en) * | 2016-10-10 | 2017-01-25 | 网宿科技股份有限公司 | Node routing method and system |
| CN106789348A (en) * | 2017-01-22 | 2017-05-31 | 维沃移动通信有限公司 | A kind of method of network acceleration, server and client |
| CN108206862A (en) * | 2017-12-27 | 2018-06-26 | 努比亚技术有限公司 | The distribution method and diostribution device of Web content point |
| CN108494681A (en) * | 2018-02-05 | 2018-09-04 | 普联技术有限公司 | Data flow transmission method, wireless telecom equipment and the storage medium of multilink |
| CN109639823A (en) * | 2018-12-28 | 2019-04-16 | 深圳市网心科技有限公司 | Network node dispatching method and device, computer installation and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| GEORGE NOMIKOS: "Comparative assessment of centrality indices and implications on the vulnerability of ISP networks", 《2014 26TH INTERNATIONAL TELETRAFFIC CONGRESS (ITC)》 * |
| 曾志等: "云环境下基于Entropy-KNN算法的节点选择策略", 《浙江大学学报(理学版)》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112870692A (en) * | 2021-02-22 | 2021-06-01 | 深圳市迅雷网络技术有限公司 | Game acceleration method, acceleration system, acceleration device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110266438B (en) | 2022-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110691412B (en) | PUCCH conflict processing method and terminal | |
| CN108970116B (en) | Virtual role control method and device | |
| CN106302632B (en) | Downloading method of basic mirror image and management node | |
| CN113055451B (en) | Resource downloading method and device, electronic equipment and storage medium | |
| CN104410665B (en) | A kind of method for down loading and equipment upgrading bag | |
| CN103647870A (en) | Terminal and terminal expression display method | |
| CN109617959A (en) | A kind of data load method, device, system and storage medium | |
| CN112579515B (en) | Thread message processing method and related product | |
| CN110266438A (en) | A kind of data transmission method, device, system and computer readable storage medium | |
| CN106550021B (en) | Push method and device for push message | |
| CN106302670B (en) | A kind of picture update method, communication terminal and server | |
| CN109067864B (en) | Notification message pushing method and device and electronic equipment | |
| CN109558222B (en) | Batch business process monitoring method and device, computer and readable storage medium | |
| CN110300182A (en) | Network node dispatching method and device, computer installation and storage medium | |
| CN113162997B (en) | Data transmission method and device, electronic equipment and readable storage medium | |
| CN112883107B (en) | Asynchronous execution method, system and related equipment for transactions in block chain | |
| CN115955590A (en) | Video processing method, video processing device, computer equipment and medium | |
| CN105978853B (en) | Session scheduling method, scheduling server and terminal | |
| CN115378855A (en) | Data packet testing method and device, communication device and storage medium | |
| CN112860431B (en) | Connection method, system, equipment and storage medium of micro service node | |
| US8374593B2 (en) | Method of providing mobile application | |
| CN108495336B (en) | Data receiving and transmitting method and device based on wireless communication and computer equipment | |
| CN100444548C (en) | Loading method and client end | |
| CN115277557B (en) | Broadcast processing method, device, electronic equipment and storage medium | |
| CN111787587B (en) | Data transmission method and device and electronic equipment |
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 |