CN109995653A - Data transmission method, device, system and the readable storage medium storing program for executing of cross-node - Google Patents
Data transmission method, device, system and the readable storage medium storing program for executing of cross-node Download PDFInfo
- Publication number
- CN109995653A CN109995653A CN201910300096.6A CN201910300096A CN109995653A CN 109995653 A CN109995653 A CN 109995653A CN 201910300096 A CN201910300096 A CN 201910300096A CN 109995653 A CN109995653 A CN 109995653A
- Authority
- CN
- China
- Prior art keywords
- node
- transmission
- transmission path
- data
- load value
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/26—Route discovery packet
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/70—Routing based on monitoring results
Abstract
The invention discloses a kind of data transmission method of cross-node, equipment, system and computer readable storage mediums；In this programme, when cross-node carries out data transmission, it does not need to build server progress transfer, node is only needed to send transmission path acquisition request to server, after server receives the request, transmission path will be calculated according to the load value and connection situation of line node each in transmission network, and after node gets the transmission path of server transmission, the transmission of data is just carried out according to the transmission path.In this way, the node for taking full advantage of existing different network domains does not need to carry out additional hardware construction, at low cost；And, since the transmission path information in this programme is that server is determining according to the connected state between node, which can adjust according to the connected state between node, during carrying out data transmission, the not available risk of network can be led to avoid due to Single Point of Faliure.
Description
Technical field
The present invention relates to technical field of data transmission more particularly to a kind of data transmission methods of cross-node, device, system
And computer readable storage medium.
Background technique
The data transmission infrastructure device construction and commercial competition problem relied between operator at present between inter-network domain node more,
Can there are high latency, high packet loss, low phenomena such as handling up, so that it is more to show video cardton, mosaic to the user in each field,
Internet phone-calling is unintelligible, intermittent, and webpage is opened phenomena such as slow, and even more serious can not even be connected to.
The enterprise having higher requirements for network communications quality and business, when solving the problems, such as this, in software view, big spininess
To particular network scene, the influence of cross-domain bring disadvantage mentioned above is reduced by optimization transport protocol congestion avoidance algorithm,
Use scope is smaller；It in hardware view, then needs to build multipath server interim data or construction/rental private line network, needs
Will constantly high cost investment, and there are Single Point of Faliures to lead to the not available risk of network.
Summary of the invention
The main purpose of the present invention is to provide a kind of data transmission method of cross-node, device, system and computers can
Read storage medium, it is intended to solve present in cross-node data transmission procedure since Single Point of Faliure leads to the not available wind of network
Danger.
To achieve the above object, the data transmission method of a kind of cross-node provided by the invention is based on server end, described
Method includes:
The transmission path acquisition request that receiving node is sent includes the mesh of data transmission in the transmission path acquisition request
Node information；
It is calculated at least according to the connection situation between the load value and node of line node each in the transmission network obtained
One transmission paths；
At least one transmission path is sent to the node, so that the node utilizes at least one transmission
Path sends data to the destination node.
Optionally, before the transmission path acquisition request that the receiving node is sent, further includes:
Receive the probe node acquisition of information instruction that the node is sent；
The probe node information of the node is sent to the node, so that the node is believed according to the probe node
Connection situation between breath, periodically detection and each probe node, and receive connection situation that the node is sent and
The load value of node.
Optionally, the connection situation in the transmission network that the basis has obtained between the load value and node of each line node
Calculate at least one transmission path, comprising:
The weight between node is generated according to the connection situation between the load value and node of each node, obtains network-in-dialing
Figure；
Using shortest path finding algorithm, at least one transmission path is searched from the network-in-dialing figure.
Optionally, according to the connection situation between the load value and node of each node, the weight between node, packet are generated
It includes:
If the connection situation between node is in connected state, it is determined that the round-trip duration RTT between node；
It determines cpu load value, memory load value, the I/O load value of each node, and determines that rule determines section using weight
Weight L between point；
The weight determines rule are as follows:
L=(1+1/RTT)+(1-CPU%)+(1-RAM%)+(1-IO%)；Wherein, CPU% is cpu load value, RAM%
For memory load value, IO% is I/O load value.
Optionally, described to utilize shortest path finding algorithm, at least one transmission road is searched from the network-in-dialing figure
Diameter includes:
Using shortest path finding algorithm, optimal transmission paths are searched from the network-in-dialing figure；
Random factor is added between the connection situation the load value of each node and node respectively, to update each node
Load value and node between connection situation；
Using the connection situation between the load value and node of updated each node, between the network-in-dialing figure node
It is updated；
Alternative path is chosen from updated network-in-dialing figure using shortest path finding algorithm, and by the optimal road
Diameter and the alternative path are as the transmission path for being sent to the node.
Optionally, it is sent to the transmission path of the node are as follows: the complete transmission routing information of node to destination node, or
Person is phase paths information of the node to destination node.
To achieve the above object, the present invention further provides a kind of data transmission methods of cross-node, are based on node side, institute
The method of stating includes:
Transmission path acquisition request is sent to server, includes the purpose of data transmission in the transmission path acquisition request
The information of node；
At least one transmission path that the server is sent is received, at least one transmission path is the server
It is calculated according to the connection situation between the load value and node of line node each in the transmission network obtained；
Data are sent to the destination node using at least one transmission path.
Optionally, before the transmission transmission path acquisition request to server, further includes:
The instruction of probe node acquisition of information is sent to the server；
Receive the probe node information that the server is sent；
According to the probe node information, connection situation between periodic detection node and each probe node, and
The load value of the connection situation and this node is sent to the server.
Optionally, at least one transmission path are as follows: the complete transmission routing information of this node to destination node, or
For the phase paths information of this node to destination node.
To achieve the above object, the present invention further provides a kind of data transmission device of cross-node, described device includes
Memory and processor are stored with the data distributing program that can be run on the processor, the data on the memory
Transfer program realizes the above-mentioned data transmission method based on server end when being executed by the processor.
To achieve the above object, the present invention further provides a kind of data transmission device of cross-node, described device includes
Memory and processor are stored with the data distributing program that can be run on the processor, the data on the memory
Transfer program realizes the above-mentioned data transmission method based on node side when being executed by the processor.
To achieve the above object, the present invention further provides a kind of data transmission system of cross-node, the system comprises:
First receiving unit, for the transmission path acquisition request that receiving node is sent, the transmission path acquisition request
In include data transmission destination node information；
Path determining unit, for according to the company in the transmission network obtained between the load value and node of each line node
Understanding and considerate condition calculates at least one transmission path；
First transmission unit, at least one transmission path to be sent to the node, so that the node is sharp
Data are sent to the destination node at least one transmission path.
To achieve the above object, the present invention further provides a kind of data transmission system of cross-node, the system comprises:
Second transmission unit, for sending transmission path acquisition request to server, in the transmission path acquisition request
The information of destination node including data transmission；
Second receiving unit, at least one transmission path sent for receiving the server, described at least one passes
Defeated path is the server according to the connection situation between the load value and node of line node each in the transmission network obtained
It calculates；
Data transmission unit, for sending data to the destination node using at least one transmission path.
To achieve the above object, the present invention further provides a kind of computer readable storage medium, computer-readable storages
The data distributing program of cross-node is stored on medium, the data distributing program of the cross-node can be handled by one or more
Device executes, to realize the above-mentioned data transmission method based on server end.
To achieve the above object, the present invention further provides a kind of computer readable storage medium, computer-readable storages
The data distributing program of cross-node is stored on medium, the data distributing program of the cross-node can be handled by one or more
Device executes, to realize the above-mentioned data transmission method based on server end.
By above scheme it is found that a kind of data transmission method of cross-node provided in an embodiment of the present invention, the method
Include: the transmission path acquisition request that receiving node is sent, includes the purpose of data transmission in the transmission path acquisition request
The information of node；According to the connection situation between the load value and node of line node each in the transmission network obtained calculate to
Few transmission paths；At least one transmission path is sent to the node, so that node utilization is described at least
One transmission paths send data to the destination node.
As it can be seen that in the present solution, not needing to build server progress transfer, only needing when cross-node carries out data transmission
Node is wanted to send transmission path acquisition request to server, it, will be according to each in transmission network after server receives the request
The load value and connection situation of line node calculate transmission path, after node gets the transmission path of server transmission, just
The transmission of data is carried out according to the transmission path.In this way, the node for taking full advantage of existing different network domains, is not required to
Additional hardware construction is carried out, it is at low cost；Also, since the transmission path information in this programme is server according between node
Connected state determine, therefore, which can adjust according to the connected state between node, carry out data transmission
Cheng Zhong can lead to the not available risk of network to avoid due to Single Point of Faliure；
The invention also discloses a kind of data transmission set of cross-node, system and computer readable storage mediums, equally
It is able to achieve above-mentioned technical effect.
Detailed description of the invention
Fig. 1 is the flow diagram of one embodiment of the invention；
Fig. 2 is the flow diagram of another embodiment of the present invention；
Fig. 3 is that a kind of data that one embodiment of the invention discloses transmit schematic diagram；
Fig. 4 is the flow diagram of another embodiment of the present invention；
Fig. 5 is the data transmission system structural schematic diagram for the cross-node that one embodiment of the invention discloses；
Fig. 6 is the data transmission system structural schematic diagram for the cross-node that another embodiment of the present invention discloses；
Fig. 7 is the data transmission system overall structure diagram for the cross-node that one embodiment of the invention discloses；
Fig. 8 is the data transmission device structural schematic diagram for the cross-node 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 present invention provides a kind of data transmission method of cross-node.
Referring to Fig.1, Fig. 1 is the flow diagram of one embodiment of the invention, in the present embodiment, this method comprises:
The transmission path acquisition request that S101, receiving node are sent includes that data pass in the transmission path acquisition request
The information of defeated destination node；
It should be noted that the data transmission method described in this programme shares both ends: server end and node side；Service
Device is used to the path acquisition request sent according to node, generates preferred transmission path, and each node in node side is used to root
The transmission of data is carried out according to the transmission path obtained from server；Data transmission method described in the present embodiment, for based on clothes
This programme is described in the angle at business device end, that is to say, that node is before transmitting the data, it is necessary first to obtain from server
Transmission path, at this moment node will to server send carry destination node transmission path acquisition request, so as to node according to
The transmission path that server is sent carries out the transmission of data.
S102, it is calculated according to the connection situation in the transmission network obtained between the load value and node of each line node
At least one transmission path；
It should be noted that stored in server in this programme in transmission network the load value of each line node and
Connection situation between node；The load value is the numerical value for reacting the loading condition of node itself, such as: cpu load value, memory negative
Load value or I/O load value etc., whether be connected between the connection situation key reaction node and node between round-trip duration；When
So, in the present embodiment, only load value and connection situation are illustrated with above- mentioned information, parameter type is not limited to
This.
Also, the connection situation between the load value and node of the node, can be server using preset duration as interval from
What each node actively obtained, each node being also possible in transmission network is actively sent out to server using preset duration as interval
It send, but in order to reduce the load of server, can be set as in this programme: each node is using preset duration as interval active
Load value and connected state are sent to server.
Therefore, server receive node transmission carrying destination node transmission path acquisition request after, will basis
Connection situation in transmission network between the load value and node of each line node calculates at least one transmission path；Certainly, originally
The quantity of transmission path in scheme can be preset, and can be one or a plurality of, can according to the actual situation into
Row adjustment.For example, a transmission paths can be only calculated when the connection status of each node is more stable in network, because
Network state is relatively stable, so a transmission paths, which can be realized, sends data to destination；And for network state
Poor situation, the connection situation between node may change at any time, it is consequently possible to calculate a plurality of transmission path out, if its
In a paths be unable to Successful transmissions, then transmitted using another transmission paths.
It is understood that the node in this programme includes node all in transmission network, such as different operators
The node of different network domains, to realize the data transmission of cross-node.
S103, at least one transmission path is sent to the node, so that the node utilizes described at least one
Transmission paths send data to the destination node.
Further, it after server calculates at least one transmission path, needs at least one transmission path to be sent to
The node, node can send data to destination node according to the transmission path.It should be noted that the section in the present embodiment
Point can be source node, or be transit node；If it is source node, then after source node receives transmission path, just
Next node of the meeting into transmission path sends data, and further includes the transmission road that server is sent to source node in the data
Diameter after receiving data so as to next node, sends data to next node according to the transmission path, until being transmitted to purpose
Node.Such as: A node sends data to B node, and at this moment A node is source node, and B node is purpose node, and from server
The transmission path of acquisition is A-R1-B, and at this moment A node needs the data including transmission path being sent to transit node R1, transfer
It after node R 1 receives data, needs according to the transmission path, the data including transmission path is sent to B node, B node connects
After receiving data, oneself is determined for purpose node, to finish data transmission according to the transmission path.
But if in the data transmission, intermediate node will cannot be counted successfully when sending data to next node
According to next point, and no any alternative path is sent to, at this moment intermediate node can also send to server and carry destination node
Transmission path acquisition request, and continued to transmit data according to the path that server returns, until send data to purpose section
Point.As in above-mentioned example:, at this moment can be to if data cannot be successfully transmitted to B node after transit node R1 receives data
Server send transmission path acquisition request, if receive server transmission new transmission path be R1-R2-B, at this moment in
Data can be sent to B node by R2 by trochanterion R1, it should be noted that at this moment R1 node send data when
It waits, carrying is complete transmission path, so that destination node is apparent from the transmission process of data, that is, is carried: A-R1-
This paths of R2-B.
It in summary it can be seen, this programme does not need to build server progress transfer, only when realizing the transmission of cross-node data
Needing node to send transmission path acquisition request to server will be according in transmission network after server receives the request
Each line node be loaded to and connection situation calculates transmission path, after node gets the transmission path of server transmission,
And the transmission of data is carried out according to the transmission path.In this way, the node of existing different network domains is taken full advantage of, no
Need to carry out additional hardware construction, it is at low cost；Also, since the transmission path information in this programme is server according to node
Between connected state determine, therefore, which can adjust according to the connected state between node, carry out data transmission
In the process, the not available risk of network can be led to avoid due to Single Point of Faliure.
Further, the present invention provides a kind of data transmission method of cross-node.
It is the flow diagram of one embodiment of the invention referring to Fig. 2, Fig. 2, in the present embodiment, this method comprises:
S201, the probe node acquisition of information instruction that the node is sent is received；
It should be noted that there is corresponding probe node, the pass between node and probe node in each node
System are as follows: node needs be periodically detected with the connection situation between its probe node, and by the connection feelings between probe node
Condition and the load value of itself are sent to server, and server is allowed to obtain the connected state between node and its probe node；It can
With understanding, there is probe node in each node, and the probe node of each node is likely to become the node in number
According to the next node in transmission process.Therefore it after in the present solution, node is online, needs to send probe node acquisition to server
Instruction, to determine the probe node information of this node.
S202, the probe node information of the node is sent to the node, so that the node is according to the detection
Nodal information, the periodically connection situation between detection and each probe node, and receive the connection feelings that the node is sent
The load value of condition and node.
In the present solution, server receive node transmission acquisition instruction after, can determine this by the following method
The probe node of node, it should be noted that be only illustrated by taking following situation as an example in the present embodiment, it is not limited to
Lower situation:
If 1, server determine the node be it is online for the first time, server can randomly choose several public networks and load it is lower
Probe node of other nodes as the node；
If 2, server determines that the node is not online for the first time, server can be determined with reference to its history detection event
The probe node of the node: if history detection event is good, such as: it is normally connected to, postpones with the probe node of history detection
It is low, then probe node of the probe node that server detects history as this；If history detection event is poor, such as:
It can not be connected to the probe node of history detection, delay is high, then server random selection is different from other node conducts of history
Probe node.
After server determines the probe node of node by above situation, the information of probe node can be sent to the section
Point；After the node receives the information of probe node, the company between this node and each probe node will be periodically detected
The specific duration of understanding and considerate condition, the detection cycle can be configured according to the actual situation, not specific herein to limit.The connection feelings
Condition may include two information, and first information indicates whether this section point is connected to probe node, and second information is in this section
After point is connected to probe node, the round-trip delay RTT (Round Trip Time) of acquisition, by the two information come the company of expression
Understanding and considerate condition.
The transmission path acquisition request that S203, receiving node are sent includes that data pass in the transmission path acquisition request
The information of defeated destination node；
S204, the weight between node is generated according to the connection situation between the load value and node of each node, obtains net
Network connected graph；
In the present solution, make full use of the line node being distributed in each network/region, it is made mutually to test Zhou Bianjie
Connection situation between point, the connection situation can reflect link-quality between node and its probe node, and will include link-quality
Information reporting to dispatch server throw the net network connected graph so that the information that server is uploaded according to all nodes constitutes one, should
It include the connection situation between each node and its probe node in network-in-dialing figure.Any two points need to transmit data in network
When, it is transmitted if the higher path of dry mass can be distributed with request scheduling server for data.
Therefore, after server receives the path acquisition request of node transmission, need according to the load value of each node and
Connection situation between node, generates the weight between node, which can indicate load value and connection situation between node, pass through
Calculate arbitrary node between weight, server can obtain include whole network node network-in-dialing figure, the network-in-dialing figure
The weight between each node and its probe node is reflected, in this way when determining transmission path, can be carried out on the whole
Consider, obtains preferred transmission path；It should be noted that since each node is periodically to upload load value and connection feelings
Condition, thus server obtain arbitrary node upload weight after, be required to dynamic adjust whole network connected graph, so as to update section
The weight on connection situation and connection side between point.
S205, using shortest path finding algorithm, search at least one transmission path from the network-in-dialing figure；
S206, at least one transmission path is sent to the node, so that the node utilizes described at least one
Transmission paths send data to the destination node.
It is understood that server can be according to network-in-dialing figure after determining network-in-dialing figure through the above steps
In weight between each node, to search transmission path, such as: if transmission path acquisition request is to obtain A node to save to B
The request of point then positioning A node, B node in network-in-dialing figure, then is found out with Dijkstra shortest path finding algorithm
The path of high-quality (load is lower, postpones lower) returns to source node, and the weight which is connected between node is smaller
Path；Transmission path if necessary is one, then using the smallest path of weight as transmission path, path if necessary
To be a plurality of, then the sequence from small to large according to weight is needed, selects mulitpath as transmission path.
It in summary it can be seen, this programme can generate node according to the load value of connection situation and node between node is comprehensive
Between weight, which can represent the connected state between node, by the weight, can react loading condition and the delay of node
Situation, such server can therefrom determine that load is lower, postpone lower path, to improve node by the weight
Between data transmission bauds；Also, data transmission method described in this programme is to realize that the node as transfer is not in logic level
Be it is fixed, can be adjusted in real time by server according to the connected state between current node, therefore sent by this programme
When data, can also realize can multipath it is concurrent, promoted handling capacity.
Based on above-mentioned any means embodiment, in the present embodiment, according between the load value and node of each node
Connection situation, generate node between weight when, may include:
If the connection situation between node is in connected state, it is determined that the round-trip duration RTT between node；
It determines cpu load value, memory load value, the I/O load value of each node, and determines that rule determines section using weight
Weight L between point；
The weight determines rule are as follows:
L=(1+1/RTT)+(1-CPU%)+(1-RAM%)+(1-IO%)；Wherein, CPU% is cpu load value, RAM%
For memory load value, IO% is I/O load value.
As can be seen that after server receives the connection situation between the load value and node that each node uploads, to Mr. Yu
Between two nodes, it is necessary first to according to connection situation, whether determine between node in connected state；If being in connected state,
Then continue to execute subsequent step；If being not at connected state, illustrate that data cannot be transmitted between node, that subsequent step is just not
It needs to be implemented.It determines between node after connected state, weight is just determined according to round-trip duration RTT and load value, at this
It in scheme, is illustrated so that load value includes cpu load value, memory load value, I/O load value as an example, rule is determined according to weight
Determine the weight between node, which determines rule are as follows:
Communication path weight L=(1+1/RTT)+(1-CPU%)+(1- memory %)+(1-IO%)；
That is, server refers to round-trip duration after arbitrary node reports connection situation and load value to server
RTT, cpu load value, memory load value, I/O load value determine the weight between node, to construct one in server internal
Network-in-dialing figure, by the weight of each node in the network-in-dialing figure, to select optimal transmission path for node.It needs
Bright, when each node reports load value, each node only reports the load value of oneself, and such server is finding path
When, when determining next node, the loading condition of own can be referred to, is got off in this way, select just to contain in path process
The load value of all nodes, finally reaches total optimization.
Based on above-mentioned any means embodiment, in the present embodiment, when determining a plurality of transmission path according to network-in-dialing figure,
In view of the network state of transmission network changes in real time, in order to adapt to the real-time change of network, in the present embodiment, using most
Short path lookup algorithm, searching at least one transmission path from the network-in-dialing figure may include:
Using shortest path finding algorithm, optimal transmission paths are searched from the network-in-dialing figure；
Random factor is added between the connection situation the load value of each node and node respectively, to update each node
Load value and node between connection situation；
Using the connection situation between the load value and node of updated each node, between the network-in-dialing figure node
It is updated；
Alternative path is chosen from updated network-in-dialing figure using shortest path finding algorithm, and by the optimal road
Diameter and the alternative path are as the transmission path for being sent to the node.
As can be seen that connection situation and can also be born after the server in this programme sends optimal path to source node
Random factor is added in load value, so as to the connection situation and load value of more new node, due to adding for the random value in random factor
Enter, will lead to weight and change, therefore alternative path will be searched out by shortest path first, and returns to source node to make
With.It should be noted that node can detect optimal path transmission failure, alternative path is recycled to transmit data again；
Data can also be transmitted using optimal path and alternative path simultaneously, failed in order to avoid being transmitted using a paths.
In the present embodiment, it is illustrated for weight method of determination disclosed in the above embodiment, but this programme is simultaneously
Be not limited solely to choose alternative path based on this weight method of determination, other can by update load value and connection situation come
Obtain the mode of alternative path.
In the present embodiment, when connection situation between the load value and node for updating each node, can to RTT with
And at least one of CPU, memory, IO add random value, the random value of each parameter can be the same or different, can mention
Before set.
Such as: to the round-trip duration RTT ± random value of each node, and/or, to cpu load value ± random value, and/or,
To memory load value ± random value, and/or, to I/O load value ± random value.Except of course that above-mentioned each node adds at random
The mode of value, can also random chosen node, constitute an opportunistic transmission path, alternately path, which can be with
For backup path and parallel route, difference are as follows: backup path is to use after other path transmissions fail；Parallel route is to transmit
When data, while transmitting data by multiple parallel routes can specifically using alternative path as backup path or parallel route
In node side self-setting.
It should be noted that node will be updated RTT and node load value, and report clothes after the node on path is used
Business device, so as to the corresponding communication path weight of server update, to avoid hot localised points problem, reasonable distribution the whole network resource.
Referring to Fig. 3, schematic diagram is transmitted for a kind of data that one embodiment of the invention discloses；If final true by the above process
Fixed optimal path, backup path using path include parallel following four:
1、A-B
2、A-R1-B
3、A-R2-B
4、A-R3-R4-R5-B
After node receives path, wherein paths transmission data can be used, can also be passed simultaneously using All Paths
Transmission of data.In this fashion, since weight is an instantaneous state, network condition is real-time change, and calculating is optimal at the moment,
May not be just optimal after being handed down to node, thus it is this randomly update weight and randomly select path by way of,
It is adapted to the real-time change of network, and is a kind of simple load balancing at random, may be used also by this random fashion
To solve the problems, such as hot-spot.
Based on above-mentioned any means embodiment, in the present solution, server is sent to the transmission path of the node are as follows: section
It puts to the complete transmission routing information of destination node, or the phase paths information for node to destination node.
It should be noted that the node in this programme can be source node, or transit node, but no matter the section
Point is source node or transit node, and the transmission path that server calculates may each comprise the following two kinds situation:
1, the path is the complete transmission routing information from source node/transit node to destination node, that is to say, that normal
In the case of transmission, data can be disposably sent to destination node according to this complete transmission path by source node/transit node,
Without obtaining transmission path from server again；But if encounter emergency case, such as the node in the transmission path
At this moment the problems such as failure, still needs node to obtain transmission path from server again.
In this case, the routing iinformation (complete transmission routing information) write-in is needed to pass by node when transmitting data
Defeated data header after such transit node receives data, routes according to head and indicates, forward the data to next node, directly
To arrival destination node.
2, the path is phase paths information, indicates that the routing information that node is obtained from server is not complete road
Diameter information, such as: this paths of A-R3-R4-R5-B, if A node from the path that server obtains be A-R3-R4-R5-B this
Path then illustrates that the path is complete transmission routing information；If A node from the path that server obtains be A-R3 or A-
R3-R4, then explanation is phase paths information.In this case, node is when transmitting data, if transit node receives one
After the transmission path that node is sent, the information of next node can not be found, at this moment needs actively to send transmission road to server
Diameter acquisition request after receiving request, is further continued for sending to next node, until being sent to destination node.
By above-mentioned two situations as can be seen that the routing information that server is returned to node, can be above-mentioned any feelings
Condition, namely: it can be complete transmission routing information, or phase paths information, in this way in data transmission procedure, road
Diameter can be adjusted change according to real-time condition, optimize and revise to keep lower delay, and the whole network flow can be by servicing
The real-time flexible dispatching of device.When carrying out the transmission of data, routing forwarding mechanism can be used, can be replaced by other mechanism, than
Such as: being dispatched using the path of decentralization, the similar widely used ospf protocol of conventional router (Open Shortest Path
First, ospf Routing Protocol).
To sum up any embodiment can be seen that this programme compared with current scheme, have the advantages that
1, network construction only needs to carry out node software update, does not need additional hardware construction, at low cost, can safeguard,
Scalability is strong.
2, the network and Regional Distribution of existing node, as far as possible forwarding nearby can be made full use of, reduces delay, raising gulps down
It spits.
3, without Single Point of Faliure risk, node side multipath parallel transmission, in addition dynamic update transmission path can avoid this and ask
Topic；Dispatch server such as failure, existing network and routing information have caching in node side, available data can be maintained to transmit
Session and part create transmission session.
4, compatible a variety of conventional transmission layer protocols, the transport protocol realized such as TCP, UDP or other application layer
(UDT)。
The present invention provides a kind of data transmission method of cross-node.
It should be noted that unlike the embodiments above, data transmission method described in the present embodiment is based on node
The angle at end, and above method embodiment is that the angle based on server end is described；But no matter it is based on which angle,
Its content be all it is identical, therefore, just the data transmission method is not repeated specifically in the present embodiment, details refer to
Above-mentioned any means embodiment.
It is the flow diagram of one embodiment of the invention referring to Fig. 4, Fig. 4, in the present embodiment, this method comprises:
S301, transmission path acquisition request is sent to server, include that data are transmitted in the transmission path acquisition request
Destination node information；
S302, at least one transmission path that the server is sent is received, at least one transmission path is described
Server is calculated according to the connection situation between the load value and node of line node each in the transmission network obtained；
S303, data are sent to the destination node using at least one transmission path.
Wherein, before the transmission transmission path acquisition request to server, further includes:
The instruction of probe node acquisition of information is sent to the server；
Receive the probe node information that the server is sent；
According to the probe node information, connection situation between periodic detection node and each probe node, and
The load value of the connection situation and this node is sent to the server.
Wherein, at least one transmission path are as follows: the complete transmission routing information of this node to destination node, Huo Zhewei
This node to destination node phase paths information.
Further, the present embodiment also discloses a kind of data transmission system of cross-node, which is based on server-side
Angle be illustrated.
Referring to Fig. 5, for the data transmission system structural schematic diagram for the cross-node that one embodiment of the invention discloses, the system packet
It includes:
First receiving unit 110, for the transmission path acquisition request that receiving node is sent, the transmission path acquisition is asked
It include the information of the destination node of data transmission in asking；
Path determining unit 120, between the load value and node according to each line node in the transmission network that has obtained
Connection situation calculate at least one transmission path；
First transmission unit 130, at least one transmission path to be sent to the node, so that the node
Data are sent to the destination node using at least one transmission path.
Wherein, this programme further include:
Instruction receiving unit, the probe node acquisition of information instruction sent for receiving the node；
First information transmission unit, for the probe node information of the node to be sent to the node, so that described
Node is according to the probe node information, connection situation periodically between detection and each probe node, and described in receiving
The load value of connection situation and node that node is sent.
Wherein, the path determining unit includes:
Connected graph determines subelement, generates node for the connection situation between the load value and node according to each node
Between weight, obtain network-in-dialing figure；
Path searching subelement searches at least one from the network-in-dialing figure for utilizing shortest path finding algorithm
Transmission paths.
Wherein, path searching subelement includes:
Optimal path determines subelement, for utilizing shortest path finding algorithm, searches most from the network-in-dialing figure
Excellent transmission path；
Random factor adds subelement, for the connection situation addition the load value and node respectively between each node
Random factor, the connection situation between load value and node to update each node；
Subelement is updated, the connection situation between load value and node for utilizing updated each node, to section
Network-in-dialing figure between point is updated；
Alternative path determines subelement, for being chosen from updated network-in-dialing figure using shortest path finding algorithm
Alternative path；
Path transmission sub-unit, using the optimal path and the alternative path as the transmission road for being sent to the node
Diameter.
Wherein, the connected graph determines subelement, comprising:
Round-trip duration determines subelement, when for the connection situation between node being in connected state, determines between node
Round-trip duration RTT；
Weight determines subelement, for determining cpu load value, memory load value, the I/O load value of each node, and utilizes
Weight determines that rule determines the weight L between node；
The weight determines rule are as follows:
L=(1+1/RTT)+(1-CPU%)+(1-RAM%)+(1-IO%)；Wherein, CPU% is cpu load value, RAM%
For memory load value, IO% is I/O load value.
Wherein, it is sent to the transmission path of the node are as follows: the complete transmission routing information of node to destination node, or
For the phase paths information of node to destination node.
Further, the present embodiment also discloses a kind of data transmission system of cross-node, which is based on node side
Angle be illustrated.
Referring to Fig. 6, for the data transmission system structural schematic diagram for the cross-node that another embodiment of the present invention discloses, the system
Include:
Second transmission unit 210, for sending transmission path acquisition request, the transmission path acquisition request to server
In include data transmission destination node information；
Second receiving unit 220, at least one transmission path sent for receiving the server, described at least one
Transmission path is connected to feelings between node according to the load value of line node each in the transmission network obtained for the server
What condition calculated；
Data transmission unit 230, for sending data to the destination node using at least one transmission path.
Wherein, this programme further include:
Instruction sending unit, for sending the instruction of probe node acquisition of information to the server；
Information receiving unit, the probe node information sent for receiving the server；
Detection unit is used for according to the probe node information, between periodic detection node and each probe node
Connection situation；
Second information transmitting unit is used for and the load value of the connection situation and this node is sent to the service
Device.
Wherein, at least one transmission path are as follows: the complete transmission routing information of this node to destination node, Huo Zhewei
This node to destination node phase paths information.
Further, the present embodiment also discloses a kind of data transmission system of cross-node.
Referring to Fig. 7, for the data transmission system overall structure diagram for the cross-node that one embodiment of the invention discloses, this is
System includes server 100 and node 200；
The server, for the transmission path acquisition request that receiving node is sent, in the transmission path acquisition request
The information of destination node including data transmission；According between the load value and node of line node each in the transmission network obtained
Connection situation calculate at least one transmission path；At least one transmission path is sent to the node, so that institute
It states node and sends data to the destination node using at least one transmission path.
Wherein, the server is also used to receive the probe node acquisition of information instruction that the node is sent；By the section
The probe node information of point is sent to the node, so that the node is periodically detected according to the probe node information
With the connection situation between each probe node, and the load value of connection situation and node that the node is sent is received.
Wherein, the server is generated specifically for the connection situation between the load value and node according to each node
Weight between node obtains network-in-dialing figure；Using shortest path finding algorithm, at least one is searched from the network-in-dialing figure
Transmission paths.
Wherein, the server is specifically used for utilizing shortest path finding algorithm, search most from the network-in-dialing figure
Excellent transmission path；Random factor is added between the connection situation the load value of each node and node respectively, it is each to update
Connection situation between the load value and node of node；Utilize the connection between the load value and node of updated each node
Situation is updated the network-in-dialing figure node；Using shortest path finding algorithm from updated network-in-dialing figure
Alternative path is chosen, and using the optimal path and the alternative path as the transmission path for being sent to the node.
Wherein, the server, if being in connected state specifically for the connection situation between node, it is determined that between node
Round-trip duration RTT；It determines cpu load value, memory load value, the I/O load value of each node, and determines rule using weight
Determine the weight L between node；The weight determines rule are as follows:
L=(1+1/RTT)+(1-CPU%)+(1-RAM%)+(1-IO%)；Wherein, CPU% is cpu load value, RAM%
For memory load value, IO% is I/O load value.
Wherein, it is sent to the transmission path of the node are as follows: the complete transmission routing information of node to destination node, or
For the phase paths information of node to destination node.
Further, the embodiment of the present invention also provides a kind of computer readable storage medium, the computer-readable storage
The data distributing program of the cross-node based on server end is stored on medium, the data distributing program of the cross-node can be by one
A or multiple processors execute, to realize the data transmission method in above method embodiment based on server end.
Further, the embodiment of the present invention also provides a kind of computer readable storage medium, the computer-readable storage
The data distributing program of the cross-node based on node side is stored on medium, the data distributing program of the cross-node can be by one
Or multiple processors execute, to realize the data transmission method in above method embodiment based on node side.
Further, the present embodiment also discloses a kind of data transmission device of cross-node.
It is the data transmission device that one embodiment of the invention discloses referring to Fig. 8, described device includes memory 11 and processing
Device 12 is stored with the data distributing program 01 based on server end that can be run on the processor on the memory 11,
Realize that the data in above method embodiment based on server end pass when the data distributing program 01 is executed by the processor
Transmission method.
In the present embodiment, data transmission device 1 can be PC (Personal Computer, PC), can also be with
It is the terminal devices such as smart phone, tablet computer, palm PC, portable computer.
The device 1 can be the node of composition CDN network or block chain network.
The device 1 may include memory 11, processor 12 and 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, CD etc..Memory 11
It can be the internal storage unit of device 1, such as the hard disk of the device 1 in some embodiments.Memory 11 is in other realities
Apply the plug-in type hard disk being equipped on the External memory equipment for being also possible to device 1 in example, such as device 1, intelligent memory card
(Smart Media Card, SMC), secure digital (Secure Digital, SD) card, flash card (Flash Card) etc..Into
One step, memory 11 can also both internal storage units including device 1 or including External memory equipment.Memory 11 is not only
It can be used for storing and be installed on application software and Various types of data, such as the code of program 01 of device 1 etc., can be also used for temporarily
Ground stores the data that has exported or will export.
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 program 01 etc..
The 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. 8 only with one slightly
Line indicates, it is not intended that an only bus or a type of bus.
Further, device 1 can also include network interface 14, and network interface 14 optionally may include wireline interface
And/or wireless interface (such as WI-FI interface, blue tooth interface), commonly used in being established between the device 1 and other electronic equipments
Communication connection.
Optionally, which can also include user interface, and user interface may include display (Display), input
Unit such as keyboard (Keyboard), optional user interface can also include standard wireline interface and wireless interface.It is optional
Ground, in some embodiments, display can be light-emitting diode display, liquid crystal display, touch-control liquid crystal display and OLED
(Organic Light-Emitting Diode, Organic Light Emitting Diode) touches device etc..Wherein, display can also be appropriate
Referred to as display screen or display unit, for showing the information handled in the device 1 and for showing visual user interface.
Fig. 8 is illustrated only with component 11-14 and the device of program 01 1, it will be appreciated by persons skilled in the art that
The restriction of structure shown in Fig. 8 not structure twin installation 1, may include than illustrating less perhaps more components or combination
Certain components or different component layouts.
Further, the present embodiment also discloses the data transmission device of another cross-node.
Wherein, the data transmission device that the embodiment of the present invention discloses, including memory and processor are deposited on the memory
The data distributing program based on node side that can be run on the processor is contained, the data distributing program is by the processing
The data transmission method based on node side in above method embodiment is realized when device executes.
It should be noted that the data in the specific structure of the data transmission device in the present embodiment and a upper embodiment pass
The mechanism of defeated device is identical, and only the program of memory storage is different；Therefore, in the present embodiment, just not to the device
Specific structure is illustrated, and details refer to an embodiment.
Further, the embodiment of the present invention also provides a kind of computer program product, including computer instruction, when it is being counted
When running on calculation machine, computer is allowed to execute the data transmission method in above method embodiment based on server end.
Further, the embodiment of the present invention also provides a kind of computer program product, including computer instruction, when it is being counted
When running on calculation machine, computer is allowed to execute the data transmission method in above method embodiment based on node side.
In the above-described embodiments, can come wholly or partly by software, hardware, firmware or any combination thereof real
It is existing.When implemented in software, it can entirely or partly realize in the form of a computer program product.
The computer program product includes one or more computer instructions.Load and execute on computers the meter
When calculation machine program instruction, entirely or partly generate according to process or function described in the embodiment of the present invention.The computer can
To be general purpose computer, special purpose computer, computer network or other programmable devices.The computer instruction can be deposited
Storage in a computer-readable storage medium, or from a computer readable storage medium to another computer readable storage medium
Transmission, for example, the computer instruction can pass through wired (example from a web-site, computer, server or data center
Such as coaxial cable, optical fiber, Digital Subscriber Line (DSL)) or wireless (such as infrared, wireless, microwave) mode to another website
Website, computer, server or data center are transmitted.The computer readable storage medium can be computer and can deposit
Any usable medium of storage either includes that the data storages such as one or more usable mediums integrated server, data center are set
It is standby.The usable medium can be magnetic medium, (for example, floppy disk, hard disk, tape), optical medium (for example, DVD) or partly lead
Body medium (such as solid state hard disk Solid State Disk (SSD)) etc.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, the indirect coupling of device or unit
It closes or communicates to connect, can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, each functional unit in each embodiment of the application can integrate in one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product
When, it can store in a computer readable storage medium.Based on this understanding, the technical solution of the application is substantially
The all or part of the part that contributes to existing technology or the technical solution can be in the form of software products in other words
It embodies, which is stored in a storage medium, including some instructions are used so that a computer
Equipment (can be personal computer, server or the network equipment etc.) executes the complete of each embodiment the method for the application
Portion or part steps.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. are various can store journey
The medium of sequence code.
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 (15)
1. a kind of data transmission method of cross-node, which is characterized in that the described method includes:
The transmission path acquisition request that receiving node is sent includes the purpose section of data transmission in the transmission path acquisition request
The information of point；
At least one is calculated according to the connection situation between the load value and node of line node each in the transmission network obtained
Transmission path；
At least one transmission path is sent to the node, so that the node utilizes at least one transmission path
Data are sent to the destination node.
2. data transmission method according to claim 1, which is characterized in that the transmission path that the receiving node is sent obtains
Before taking request, further includes:
Receive the probe node acquisition of information instruction that the node is sent；
The probe node information of the node is sent to the node, so that the node is according to the probe node information,
Connection situation periodically between detection and each probe node, and receive connection situation and node that the node is sent
Load value.
3. data transmission method according to claim 1, which is characterized in that each in the transmission network that the basis has obtained
Connection situation between the load value and node of line node calculates at least one transmission path, comprising:
The weight between node is generated according to the connection situation between the load value and node of each node, obtains network-in-dialing figure；
Using shortest path finding algorithm, at least one transmission path is searched from the network-in-dialing figure.
4. data transmission method according to claim 3, which is characterized in that according to the load value and node of each node
Between connection situation, generate node between weight, comprising:
If the connection situation between node is in connected state, it is determined that the round-trip duration RTT between node；
Determine cpu load value, memory load value, the I/O load value of each node, and using between the determining node of the determining rule of weight
Weight L；
The weight determines rule are as follows:
L=(1+1/RTT)+(1-CPU%)+(1-RAM%)+(1-IO%)；Wherein, CPU% is cpu load value, and RAM% is interior
Load value is deposited, IO% is I/O load value.
5. data transmission method according to claim 3, which is characterized in that it is described to utilize shortest path finding algorithm, from
Searching at least one transmission path in the network-in-dialing figure includes:
Using shortest path finding algorithm, optimal transmission paths are searched from the network-in-dialing figure；
Random factor is added between the connection situation the load value of each node and node respectively, to update the negative of each node
Connection situation between load value and node；
Using the connection situation between the load value and node of updated each node, the network-in-dialing figure node is carried out
It updates；
Choose alternative path from updated network-in-dialing figure using shortest path finding algorithm, and by the optimal path and
The alternative path is as the transmission path for being sent to the node.
6. data transmission method as claimed in any of claims 1 to 5, which is characterized in that be sent to the node
Transmission path are as follows: the complete transmission routing information of node to destination node, or the phase paths for node to destination node
Information.
7. a kind of data transmission method of cross-node, which is characterized in that the described method includes:
Transmission path acquisition request is sent to server, includes the destination node of data transmission in the transmission path acquisition request
Information；
Receive at least one transmission path that the server is sent, at least one transmission path be the server according to
What the connection situation in the transmission network obtained between the load value and node of each line node calculated；
Data are sent to the destination node using at least one transmission path.
8. data transmission method according to claim 7, which is characterized in that described to send transmission path acquisition to server
Before request, further includes:
The instruction of probe node acquisition of information is sent to the server；
Receive the probe node information that the server is sent；
According to the probe node information, connection situation between periodic detection node and each probe node, and by institute
The load value for stating connection situation and this node is sent to the server.
9. data transmission method according to claim 7 or 8, which is characterized in that at least one transmission path are as follows: this
Complete transmission routing information of the node to destination node, or the phase paths information for this node to destination node.
10. a kind of data transmission device of cross-node, which is characterized in that described device includes memory and processor, described to deposit
The data distributing program that can be run on the processor is stored on reservoir, the data distributing program is held by the processor
The method as described in claim 1 to 6 any one is realized when row.
11. a kind of data transmission device of cross-node, which is characterized in that described device includes memory and processor, described to deposit
The data distributing program that can be run on the processor is stored on reservoir, the data distributing program is held by the processor
The method as described in claim 7 to 9 any one is realized when row.
12. a kind of data transmission system of cross-node, which is characterized in that the system comprises:
First receiving unit wraps in the transmission path acquisition request for the transmission path acquisition request that receiving node is sent
Include the information of the destination node of data transmission；
Path determining unit, for being connected to feelings between node according to the load value of each line node in the transmission network obtained
Condition calculates at least one transmission path；
First transmission unit, at least one transmission path to be sent to the node, so that the node utilizes institute
It states at least one transmission path and sends data to the destination node.
13. a kind of data transmission system of cross-node, which is characterized in that the system comprises:
Second transmission unit is used to send transmission path acquisition request to server, includes in the transmission path acquisition request
The information of the destination node of data transmission；
Second receiving unit, at least one transmission path sent for receiving the server, at least one transmission road
Diameter is that the server is calculated according to the connection situation between the load value and node of line node each in the transmission network obtained
's；
Data transmission unit, for sending data to the destination node using at least one transmission path.
14. a kind of computer readable storage medium, which is characterized in that be stored with cross-node on the computer readable storage medium
Data distributing program, the data distributing program of the cross-node can execute by one or more processor, to realize as weighed
Benefit requires the data transmission method of cross-node described in 1 to 6 any one.
15. a kind of computer readable storage medium, which is characterized in that be stored with cross-node on the computer readable storage medium
Data distributing program, the data distributing program of the cross-node can execute by one or more processor, to realize as weighed
Benefit requires the data transmission method of cross-node described in 7 to 9 any one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910300096.6A CN109995653B (en) | 2019-04-15 | 2019-04-15 | Cross-node data transmission method, device and system and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910300096.6A CN109995653B (en) | 2019-04-15 | 2019-04-15 | Cross-node data transmission method, device and system and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109995653A true CN109995653A (en) | 2019-07-09 |
| CN109995653B CN109995653B (en) | 2021-07-09 |
Family
ID=67133630
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910300096.6A Active CN109995653B (en) | 2019-04-15 | 2019-04-15 | Cross-node data transmission method, device and system and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109995653B (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110474818A (en) * | 2019-07-11 | 2019-11-19 | 福州博泉网络科技有限公司 | Block chain network sniffer, Network Sniffing method and optimization method |
| CN111181853A (en) * | 2019-12-30 | 2020-05-19 | 布比（北京）网络技术有限公司 | Pure distributed data exchange method and system based on block chain |
| CN111338656A (en) * | 2020-02-25 | 2020-06-26 | 平安科技（深圳）有限公司 | Method and device for installing software package to target host and computer equipment |
| CN112188455A (en) * | 2020-09-23 | 2021-01-05 | 深圳前海知行科技有限公司 | Positioning method, device, equipment and storage medium based on gateway |
| CN112738174A (en) * | 2020-12-23 | 2021-04-30 | 中国人民解放军63921部队 | Cross-region multi-task data transmission method and system for private network |
| CN113055339A (en) * | 2019-12-26 | 2021-06-29 | 中国移动通信集团海南有限公司 | Process data processing method and device, storage medium and computer equipment |
| CN113111029A (en) * | 2021-04-14 | 2021-07-13 | 北京希姆计算科技有限公司 | Method, chip and storage medium for determining data transmission path |
| WO2021143239A1 (en) * | 2020-01-13 | 2021-07-22 | 腾讯科技（深圳）有限公司 | Routing control method and apparatus, electronic device, and storage medium |
| CN113573379A (en) * | 2021-07-05 | 2021-10-29 | 北京和峰科技有限公司 | Data transmission method and device |
| CN113568303A (en) * | 2021-09-26 | 2021-10-29 | 成都数默科技有限公司 | PID control algorithm-based network flow packet capturing, flow limiting and packet loss method |
| CN113595894A (en) * | 2021-07-28 | 2021-11-02 | 海尔数字科技(青岛)有限公司 | Communication method, device, equipment and medium between service nodes and client nodes |
| CN113660158A (en) * | 2021-08-05 | 2021-11-16 | 北京网聚云联科技有限公司 | Method, server and storage medium for scheduling dynamic routing of Overlay virtual link |
| CN114760529A (en) * | 2022-06-14 | 2022-07-15 | 苏州华兴源创科技股份有限公司 | Transmission method and device of multichannel video data and computer equipment |
| WO2022171009A1 (en) * | 2021-02-10 | 2022-08-18 | 华为技术有限公司 | Communication method and electronic device |
| WO2024066637A1 (en) * | 2022-09-30 | 2024-04-04 | 中兴通讯股份有限公司 | Data transmission method and device, and storage medium |
| CN114584490B (en) * | 2022-03-25 | 2024-04-09 | 阿里巴巴（中国）有限公司 | Data transmission detection method and device |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102497394A (en) * | 2011-11-28 | 2012-06-13 | 中国科学院研究生院 | Duplicate file placement method in content distribution network based on optimized model |
| CN103200118A (en) * | 2013-03-13 | 2013-07-10 | 南京理工大学 | Complex network protective method oriented towards adding of protective links of key nodes |
| CN103841020A (en) * | 2014-03-17 | 2014-06-04 | 山东大学 | Ad Hoc stable routing algorithm based on power control |
| CN104202247A (en) * | 2014-09-01 | 2014-12-10 | 西安电子科技大学 | Non-linear annealing based multi-constrained routing method for SDN (Software Defined Network) |
| US20170187820A1 (en) * | 2015-12-28 | 2017-06-29 | Microsoft Technology Licensing, Llc | Caching service with client-enabled routing |
| CN107036618A (en) * | 2017-05-24 | 2017-08-11 | 合肥工业大学(马鞍山)高新技术研究院 | A kind of AGV paths planning methods based on shortest path depth optimization algorithm |
| CN107733518A (en) * | 2017-09-30 | 2018-02-23 | 南京理工大学 | The optimal income method for routing of LEO satellite network based on cooperative game |
| CN107770637A (en) * | 2017-09-22 | 2018-03-06 | 广西师范大学 | Elastic optical network stochastic route path generating method |
| CN108449269A (en) * | 2018-04-12 | 2018-08-24 | 重庆邮电大学 | Data center network load-balancing method based on SDN |
| CN108712335A (en) * | 2018-05-14 | 2018-10-26 | 平安科技（深圳）有限公司 | Dispatching method, system, equipment and the storage medium that network accesses |
| CN108712336A (en) * | 2018-05-21 | 2018-10-26 | 华东师范大学 | A kind of local message dynamic routing algorithm improving scales-free network transmission capacity |
-
2019
- 2019-04-15 CN CN201910300096.6A patent/CN109995653B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102497394A (en) * | 2011-11-28 | 2012-06-13 | 中国科学院研究生院 | Duplicate file placement method in content distribution network based on optimized model |
| CN103200118A (en) * | 2013-03-13 | 2013-07-10 | 南京理工大学 | Complex network protective method oriented towards adding of protective links of key nodes |
| CN103841020A (en) * | 2014-03-17 | 2014-06-04 | 山东大学 | Ad Hoc stable routing algorithm based on power control |
| CN104202247A (en) * | 2014-09-01 | 2014-12-10 | 西安电子科技大学 | Non-linear annealing based multi-constrained routing method for SDN (Software Defined Network) |
| US20170187820A1 (en) * | 2015-12-28 | 2017-06-29 | Microsoft Technology Licensing, Llc | Caching service with client-enabled routing |
| CN107036618A (en) * | 2017-05-24 | 2017-08-11 | 合肥工业大学(马鞍山)高新技术研究院 | A kind of AGV paths planning methods based on shortest path depth optimization algorithm |
| CN107770637A (en) * | 2017-09-22 | 2018-03-06 | 广西师范大学 | Elastic optical network stochastic route path generating method |
| CN107733518A (en) * | 2017-09-30 | 2018-02-23 | 南京理工大学 | The optimal income method for routing of LEO satellite network based on cooperative game |
| CN108449269A (en) * | 2018-04-12 | 2018-08-24 | 重庆邮电大学 | Data center network load-balancing method based on SDN |
| CN108712335A (en) * | 2018-05-14 | 2018-10-26 | 平安科技（深圳）有限公司 | Dispatching method, system, equipment and the storage medium that network accesses |
| CN108712336A (en) * | 2018-05-21 | 2018-10-26 | 华东师范大学 | A kind of local message dynamic routing algorithm improving scales-free network transmission capacity |
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110474818B (en) * | 2019-07-11 | 2023-02-28 | 福州博泉网络科技有限公司 | Block chain network sniffer, network sniffing method and optimization method |
| CN110474818A (en) * | 2019-07-11 | 2019-11-19 | 福州博泉网络科技有限公司 | Block chain network sniffer, Network Sniffing method and optimization method |
| CN113055339A (en) * | 2019-12-26 | 2021-06-29 | 中国移动通信集团海南有限公司 | Process data processing method and device, storage medium and computer equipment |
| CN113055339B (en) * | 2019-12-26 | 2023-04-28 | 中国移动通信集团海南有限公司 | Process data processing method and device, storage medium and computer equipment |
| CN111181853A (en) * | 2019-12-30 | 2020-05-19 | 布比（北京）网络技术有限公司 | Pure distributed data exchange method and system based on block chain |
| JP7345059B2 (en) | 2020-01-13 | 2023-09-14 | テンセント・テクノロジー・（シェンジェン）・カンパニー・リミテッド | Routing control method, device, program and computer device |
| WO2021143239A1 (en) * | 2020-01-13 | 2021-07-22 | 腾讯科技（深圳）有限公司 | Routing control method and apparatus, electronic device, and storage medium |
| EP4044559A4 (en) * | 2020-01-13 | 2022-10-19 | Tencent Technology (Shenzhen) Company Limited | Routing control method and apparatus, electronic device, and storage medium |
| JP2022548152A (en) * | 2020-01-13 | 2022-11-16 | テンセント・テクノロジー・（シェンジェン）・カンパニー・リミテッド | Routing control method, device, program and computer device |
| CN111338656B (en) * | 2020-02-25 | 2023-12-15 | 平安科技（深圳）有限公司 | Method and device for installing software package to target host and computer equipment |
| CN111338656A (en) * | 2020-02-25 | 2020-06-26 | 平安科技（深圳）有限公司 | Method and device for installing software package to target host and computer equipment |
| CN112188455A (en) * | 2020-09-23 | 2021-01-05 | 深圳前海知行科技有限公司 | Positioning method, device, equipment and storage medium based on gateway |
| CN112738174A (en) * | 2020-12-23 | 2021-04-30 | 中国人民解放军63921部队 | Cross-region multi-task data transmission method and system for private network |
| CN112738174B (en) * | 2020-12-23 | 2022-11-25 | 中国人民解放军63921部队 | Cross-region multi-task data transmission method and system for private network |
| WO2022171009A1 (en) * | 2021-02-10 | 2022-08-18 | 华为技术有限公司 | Communication method and electronic device |
| CN113111029A (en) * | 2021-04-14 | 2021-07-13 | 北京希姆计算科技有限公司 | Method, chip and storage medium for determining data transmission path |
| CN113111029B (en) * | 2021-04-14 | 2024-03-26 | 广州希姆半导体科技有限公司 | Method, chip and storage medium for determining data transmission path |
| CN113573379A (en) * | 2021-07-05 | 2021-10-29 | 北京和峰科技有限公司 | Data transmission method and device |
| CN113595894A (en) * | 2021-07-28 | 2021-11-02 | 海尔数字科技(青岛)有限公司 | Communication method, device, equipment and medium between service nodes and client nodes |
| CN113660158A (en) * | 2021-08-05 | 2021-11-16 | 北京网聚云联科技有限公司 | Method, server and storage medium for scheduling dynamic routing of Overlay virtual link |
| CN113568303B (en) * | 2021-09-26 | 2021-12-14 | 成都数默科技有限公司 | PID control algorithm-based network flow packet capturing, flow limiting and packet loss method |
| CN113568303A (en) * | 2021-09-26 | 2021-10-29 | 成都数默科技有限公司 | PID control algorithm-based network flow packet capturing, flow limiting and packet loss method |
| CN114584490B (en) * | 2022-03-25 | 2024-04-09 | 阿里巴巴（中国）有限公司 | Data transmission detection method and device |
| CN114760529B (en) * | 2022-06-14 | 2022-09-27 | 苏州华兴源创科技股份有限公司 | Transmission method and device of multichannel video data and computer equipment |
| CN114760529A (en) * | 2022-06-14 | 2022-07-15 | 苏州华兴源创科技股份有限公司 | Transmission method and device of multichannel video data and computer equipment |
| WO2024066637A1 (en) * | 2022-09-30 | 2024-04-04 | 中兴通讯股份有限公司 | Data transmission method and device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109995653B (en) | 2021-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109995653A (en) | Data transmission method, device, system and the readable storage medium storing program for executing of cross-node | |
| CN104756449B (en) | From the method for node and Content owner's transmission packet in content center network | |
| JP5889914B2 (en) | State synchronization between load balancer components | |
| JP5774729B2 (en) | Addressing scheme for hybrid communication networks | |
| CN103491129B (en) | A kind of service node collocation method, pool of service nodes Register and system | |
| WO2017101366A1 (en) | Cdn service node scheduling method and server | |
| JP5684110B2 (en) | Method for maintaining a routing table and node for use in an overlay network | |
| US9853906B2 (en) | Network prioritization based on node-level attributes | |
| JP2015534769A (en) | Load balancing in data networks | |
| CN107172186B (en) | Content acquisition method and system | |
| CN103210617A (en) | Reduction of message and computational overhead in networks | |
| CN107533538A (en) | Tenant is handled in the system using acceleration components to require | |
| CN105119840A (en) | Data center network load balancing method based on SDN and employing fat-tree topological structure | |
| CN103428103A (en) | Link load control method and stacking device | |
| US10469348B2 (en) | Centrality-based caching in information-centric networks | |
| CN107113892A (en) | A kind of method and device of gateway device automatic network-building | |
| Huang et al. | Converged network-cloud service composition with end-to-end performance guarantee | |
| CN108293023A (en) | The system and method for the content requests of the context-aware in network centered on support information | |
| US8645534B2 (en) | Localization of peer to peer traffic | |
| CN108234319A (en) | The transmission method and device of a kind of data | |
| CN103312607A (en) | Transmission path selection method and device | |
| US20210126865A1 (en) | Lossless data traffic deadlock management system | |
| CN105554125B (en) | A kind of method and its system for realizing webpage fit using CDN | |
| US10536368B2 (en) | Network-aware routing in information centric networking | |
| US10817512B2 (en) | Standing queries in memory |
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 |