CN109995653B - Cross-node data transmission method, device and system and readable storage medium - Google Patents
Cross-node data transmission method, device and system and readable storage medium Download PDFInfo
- Publication number
- CN109995653B CN109995653B CN201910300096.6A CN201910300096A CN109995653B CN 109995653 B CN109995653 B CN 109995653B CN 201910300096 A CN201910300096 A CN 201910300096A CN 109995653 B CN109995653 B CN 109995653B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- path
- transmission
- transmission path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a cross-node data transmission method, equipment, a system and a computer readable storage medium; in the scheme, when data transmission is carried out across nodes, a server does not need to be built for transferring, only the nodes need to send transmission path acquisition requests to the server, after the server receives the requests, the transmission paths can be calculated according to the load values and the communication conditions of all online nodes in a transmission network, and after the nodes acquire the transmission paths sent by the server, data transmission is carried out according to the transmission paths. By the mode, the existing nodes of different network domains are fully utilized, extra hardware construction is not needed, and the cost is low; in addition, because the transmission path information in the scheme is determined by the server according to the communication state between the nodes, the transmission path can be adjusted according to the communication state between the nodes, and the risk that the network is unavailable due to single-point failure can be avoided in the data transmission process.
Description
Technical Field
The present invention relates to the field of data transmission technologies, and in particular, to a method, an apparatus, a system, and a computer-readable storage medium for cross-node data transmission.
Background
At present, data transmission among nodes across network domains mostly depends on infrastructure equipment construction and business competition among operators, and phenomena of high delay, high packet loss rate, low throughput and the like exist, so that the phenomena of video blockage, more mosaics, unclear and discontinuous network conversation, slow webpage opening and the like are shown for users in various fields, and the phenomena are more serious and even can not be communicated.
For enterprises and services with higher requirements on network communication quality, when the problem is solved, on the software level, most specific network scenes are targeted, the influence of the defects caused by cross-domain is reduced by optimizing a transport protocol congestion control algorithm, and the application range is smaller; on the hardware level, a multi-server transfer data needs to be built or a private network needs to be built/leased, high cost investment needs to be continuously invested, and the risk that the network is unavailable due to single-point failure exists.
Disclosure of Invention
The invention mainly aims to provide a cross-node data transmission method, a device, a system and a computer readable storage medium, aiming at solving the risk of network unavailability caused by single point failure in the cross-node data transmission process.
In order to achieve the above object, the present invention provides a method for cross-node data transmission, which is based on a server, and includes:
receiving a transmission path acquisition request sent by a node, wherein the transmission path acquisition request comprises information of a destination node of data transmission;
calculating at least one transmission path according to the acquired load value of each online node in the transmission network and the communication condition among the nodes;
and sending the at least one transmission path to the node so that the node sends data to the destination node by using the at least one transmission path.
Optionally, before the transmission path acquisition request sent by the receiving node, the method further includes:
receiving a detection node information acquisition instruction sent by the node;
and sending the detection node information of the node to the node so that the node periodically detects the communication condition with each detection node according to the detection node information and receives the communication condition sent by the node and the load value of the node.
Optionally, the calculating at least one transmission path according to the obtained load value of each online node in the transmission network and the connectivity between the nodes includes:
generating a weight value among the nodes according to the load value of each node and the communication condition among the nodes to obtain a network communication graph;
and searching at least one transmission path from the network connectivity graph by using a shortest path searching algorithm.
Optionally, generating a weight between nodes according to the load value of each node and the connectivity condition between nodes, includes:
if the connection condition between the nodes is in a connection state, determining the Round Trip Time (RTT) between the nodes;
determining a CPU load value, a memory load value and an IO load value of each node, and determining a weight L between the nodes by using a weight determination rule;
the weight determination rule is as follows:
l ═ 1+1/RTT) + (1-CPU%) + (1-RAM%) + (1-IO%); wherein, CPU% is CPU load value, RAM% is memory load value, and IO% is IO load value.
Optionally, the searching for at least one transmission path from the network connectivity graph by using a shortest path search algorithm includes:
searching an optimal transmission path from the network connectivity graph by using a shortest path searching algorithm;
respectively adding random factors to the load value of each node and the communication condition among the nodes to update the load value of each node and the communication condition among the nodes;
updating the network connection graph among the nodes by using the updated load value of each node and the connection condition among the nodes;
and selecting an alternative path from the updated network connectivity graph by using a shortest path search algorithm, and taking the optimal path and the alternative path as transmission paths sent to the nodes.
Optionally, the transmission path sent to the node is: complete transmission path information from the node to the destination node, or phase path information from the node to the destination node.
In order to achieve the above object, the present invention further provides a method for cross-node data transmission, which is based on a node, and the method includes:
sending a transmission path acquisition request to a server, wherein the transmission path acquisition request comprises information of a destination node of data transmission;
receiving at least one transmission path sent by the server, wherein the at least one transmission path is calculated by the server according to the acquired load value of each online node in the transmission network and the communication condition among the nodes;
and transmitting data to the destination node by using the at least one transmission path.
Optionally, before sending the transmission path acquisition request to the server, the method further includes:
sending a detection node information acquisition instruction to the server;
receiving detection node information sent by the server;
and periodically detecting the communication condition between the nodes and each detection node according to the detection node information, and sending the communication condition and the load value of the node to the server.
Optionally, the at least one transmission path is: complete transmission path information from the node to the destination node, or phase path information from the node to the destination node.
In order to achieve the above object, the present invention further provides a data transmission device across nodes, the device includes a memory and a processor, the memory stores a data transmission program operable on the processor, and the data transmission program, when executed by the processor, implements the above data transmission method based on the server side.
In order to achieve the above object, the present invention further provides a data transmission device across nodes, the device includes a memory and a processor, the memory stores a data transmission program operable on the processor, and the data transmission program, when executed by the processor, implements the above node-side based data transmission method.
To achieve the above object, the present invention further provides a data transmission system across nodes, the system comprising:
a first receiving unit, configured to receive a transmission path acquisition request sent by a node, where the transmission path acquisition request includes information of a destination node of data transmission;
the path determining unit is used for calculating at least one transmission path according to the acquired load value of each online node in the transmission network and the communication condition among the nodes;
a first sending unit, configured to send the at least one transmission path to the node, so that the node sends data to the destination node by using the at least one transmission path.
To achieve the above object, the present invention further provides a data transmission system across nodes, the system comprising:
a second sending unit, configured to send a transmission path acquisition request to a server, where the transmission path acquisition request includes information of a destination node of data transmission;
a second receiving unit, configured to receive at least one transmission path sent by the server, where the at least one transmission path is calculated by the server according to the obtained load value of each online node in the transmission network and the communication condition between the nodes;
and a data sending unit, configured to send data to the destination node using the at least one transmission path.
To achieve the above object, the present invention further provides a computer-readable storage medium, on which a data transmission program across nodes is stored, where the data transmission program across nodes can be executed by one or more processors to implement the above data transmission method based on the server side.
To achieve the above object, the present invention further provides a computer-readable storage medium, on which a data transmission program across nodes is stored, where the data transmission program across nodes can be executed by one or more processors to implement the above data transmission method based on the server side.
According to the above scheme, the method for data transmission across nodes provided by the embodiment of the present invention includes: receiving a transmission path acquisition request sent by a node, wherein the transmission path acquisition request comprises information of a destination node of data transmission; calculating at least one transmission path according to the acquired load value of each online node in the transmission network and the communication condition among the nodes; and sending the at least one transmission path to the node so that the node sends data to the destination node by using the at least one transmission path.
Therefore, in the scheme, when data transmission is carried out across nodes, a server does not need to be built for transferring, only the nodes need to send transmission path acquisition requests to the server, the server can calculate the transmission paths according to the load values and the communication conditions of all online nodes in the transmission network after receiving the requests, and after the nodes acquire the transmission paths sent by the server, data transmission is carried out according to the transmission paths. By the mode, the existing nodes of different network domains are fully utilized, extra hardware construction is not needed, and the cost is low; in addition, because the transmission path information in the scheme is determined by the server according to the communication state between the nodes, the transmission path can be adjusted according to the communication state between the nodes, and the risk of network unavailability caused by single-point failure can be avoided in the data transmission process;
the invention also discloses cross-node data transmission equipment, a cross-node data transmission system and a computer readable storage medium, and the technical effects can be realized.
Drawings
FIG. 1 is a schematic flow chart of an embodiment of the present invention;
FIG. 2 is a schematic flow chart of another embodiment of the present invention;
FIG. 3 is a diagram of a data transmission according to an embodiment of the present invention;
FIG. 4 is a schematic flow chart of another embodiment of the present invention;
fig. 5 is a schematic structural diagram of a cross-node data transmission system according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a cross-node data transmission system according to another embodiment of the present invention;
fig. 7 is a schematic diagram illustrating an overall structure of a cross-node data transmission system according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a cross-node data transmission device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims of the present application and in the drawings described above, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be noted that the description relating to "first", "second", etc. in the present invention is for descriptive purposes only and is not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present invention.
The invention provides a cross-node data transmission method.
Referring to fig. 1, fig. 1 is a schematic flow chart of an embodiment of the present invention, in the embodiment, the method includes:
s101, receiving a transmission path acquisition request sent by a node, wherein the transmission path acquisition request comprises information of a destination node of data transmission;
it should be noted that, the data transmission method described in this embodiment shares two ends: a server side and a node side; the server is used for generating an optimal transmission path according to the path acquisition request sent by the node, and each node in the node end is used for transmitting data according to the transmission path acquired from the server; in the data transmission method described in this embodiment, the present solution is described based on the perspective of a server, that is, before a node transmits data, it first needs to acquire a transmission path from the server, and at this time, the node sends a transmission path acquisition request carrying a destination node to the server, so that the node transmits the data according to the transmission path sent by the server.
S102, calculating at least one transmission path according to the acquired load value of each online node in the transmission network and the communication condition among the nodes;
it should be noted that, the server in the present solution stores the load values of each online node in the transmission network and the communication conditions between the nodes; the load value is a value reflecting the load condition of the node itself, for example: CPU load value, memory load value or IO load value, etc., the communication condition mainly reflects whether the nodes are communicated or not and the round-trip time between the nodes; of course, in the present embodiment, the load value and the connection status are described only by the above information, and the parameter type is not limited to this.
Moreover, the load value of the node and the communication condition between the nodes may be actively obtained by the server from each node at intervals of a preset time length, or may be actively sent to the server by each node in the transmission network at intervals of the preset time length, but in order to reduce the load of the server, the scheme may be set as follows: and each node actively sends the load value and the communication state to the server by taking the preset time length as an interval.
Therefore, after receiving a transmission path acquisition request carrying a destination node sent by a node, a server calculates at least one transmission path according to the load value of each online node in a transmission network and the communication condition among the nodes; of course, the number of transmission paths in the scheme may be preset, may be one or multiple, and may be adjusted according to actual conditions. For example, when the connection state of each node in the network is stable, only one transmission path can be calculated, and because the network state is stable, one transmission path can realize data transmission to the destination end; for the case of poor network state, the communication condition between nodes may change at any time, so that a plurality of transmission paths may be calculated, and if one of the paths fails to transmit successfully, another transmission path is used for transmission.
It can be understood that the nodes in the present solution include all nodes in the transport network, for example, nodes of different network domains of different operators, so as to implement data transmission across nodes.
S103, sending the at least one transmission path to the node so that the node sends data to the destination node by using the at least one transmission path.
Further, after the server calculates at least one transmission path, the node may send data to the destination node according to the transmission path, if it needs to send the at least one transmission path to the node. It should be noted that the node in this embodiment may be a source node or a transit node; if the node is the source node, the source node sends data to the next node in the transmission path after receiving the transmission path, and the data also comprises the transmission path sent to the source node by the server, so that the next node sends the data to the next node according to the transmission path after receiving the data until the data is transmitted to the destination node. For example: the node A sends data to the node B, wherein the node A is a source node, the node B is a destination node, and a transmission path acquired from the server is A-R1-B, the node A needs to send the data including the transmission path to a transfer node R1, the transfer node R1 needs to send the data including the transmission path to the node B according to the transmission path after receiving the data, and the node B determines that the node A is the destination node according to the transmission path after receiving the data, thereby finishing data transmission.
However, if the intermediate node cannot successfully send the data to the next node when sending the data to the next node in the data transmission process and there is no alternative path, the intermediate node may also send a transmission path acquisition request carrying the destination node to the server, and continue to transmit the data according to the path returned by the server until the data is transmitted to the destination node. In the above example: after the transit node R1 receives the data, if the data cannot be successfully sent to the node B, it may send a transmission path acquisition request to the server, and if a new transmission path sent by the server is received as R1-R2-B, at this time, the transit node R1 may send the data to the node B through R2, it should be noted that, at this time, when the node R1 sends the data, a complete transmission path is carried, so that the destination node clearly knows the transmission process of the data, that is, carrying: A-R1-R2-B.
In summary, when the cross-node data transmission is realized, a server does not need to be built for transferring, only the node needs to send a transmission path acquisition request to the server, after receiving the request, the server can calculate a transmission path according to the load arrival and communication conditions of each online node in the transmission network, and after acquiring the transmission path sent by the server, the node transmits data according to the transmission path. By the mode, the existing nodes of different network domains are fully utilized, extra hardware construction is not needed, and the cost is low; in addition, because the transmission path information in the scheme is determined by the server according to the communication state between the nodes, the transmission path can be adjusted according to the communication state between the nodes, and the risk that the network is unavailable due to single-point failure can be avoided in the data transmission process.
Further, the invention provides a cross-node data transmission method.
Referring to fig. 2, fig. 2 is a schematic flow chart of an embodiment of the present invention, in the embodiment, the method includes:
s201, receiving a detection node information acquisition instruction sent by the node;
it should be noted that each node has a corresponding probe node, and the relationship between the node and the probe node is as follows: the method comprises the steps that a node needs to periodically detect the communication condition with a detection node of the node, and sends the communication condition with the detection node and a load value of the node to a server, so that the server obtains the communication state between the node and the detection node of the server; it is understood that there is a probe node for each node, and the probe node for each node is likely to be the next node in the data transmission process for the node. Therefore, in the present solution, after the node is online, a probe node acquisition instruction needs to be sent to the server, so as to determine probe node information of the node.
S202, sending the detection node information of the node to the node, so that the node periodically detects the communication condition between the node and each detection node according to the detection node information, and receives the communication condition sent by the node and the load value of the node.
In this scheme, after receiving an acquisition instruction sent by a node, a server may determine a probe node of the node by the following method, which needs to be described in this embodiment by taking the following case as an example, but is not limited to the following case:
1. if the server judges that the node is on-line for the first time, the server randomly selects a plurality of other nodes with lower load in the public network as the detection nodes of the node;
2. if the server judges that the node is not on line for the first time, the server determines the detection node of the node by referring to the historical detection condition of the node: if the historical detection situation is good, for example: the detection nodes are normally communicated with the detection nodes of the historical detection, and if the delay is low, the server takes the detection nodes of the historical detection as the detection nodes of the time; if the historical detection conditions are poor, for example: and if the detection node cannot be communicated with the detection node of the historical detection and the delay is high, the server randomly selects other nodes different from the historical nodes as the detection nodes.
After determining the detection node of the node through the condition, the server sends the information of the detection node to the node; after receiving the information of the detection node, the node periodically detects the communication condition between the node and each detection node, and the specific duration of the detection period may be configured according to the actual condition, which is not specifically limited herein. The connection condition may include two pieces of information, where the first piece of information indicates whether the node is connected to the probe node, and the second piece of information is round Trip delay rtt (round Trip time) obtained after the node is connected to the probe node, and the connection condition is indicated by the two pieces of information.
S203, receiving a transmission path acquisition request sent by a node, wherein the transmission path acquisition request comprises information of a destination node of data transmission;
s204, generating weights among the nodes according to the load value of each node and the communication condition among the nodes to obtain a network communication graph;
in the scheme, online nodes distributed in each network/region are fully utilized to mutually test the communication condition between peripheral nodes, the communication condition can reflect the link quality between the nodes and the detection nodes thereof, and the information comprising the link quality is reported to a scheduling server, so that the server forms a network communication graph according to the information uploaded by all the nodes, and the network communication graph comprises the communication condition between each node and the detection nodes thereof. When any two points in the network need to transmit data, the scheduling server can be requested to allocate a plurality of paths with higher quality for data transmission.
Therefore, after receiving a path acquisition request sent by a node, a server needs to generate a weight value between the nodes according to a load value of each node and a communication condition between the nodes, wherein the weight value can represent the load value and the communication condition between the nodes; it should be noted that, since each node periodically uploads a load value and a connection condition, after the server obtains a weight uploaded by any node, the server needs to dynamically adjust the entire network connection graph so as to update the connection condition between the nodes and the weight of the connection edge.
S205, searching at least one transmission path from the network connectivity graph by using a shortest path searching algorithm;
s206, the at least one transmission path is sent to the node, so that the node sends data to the destination node by using the at least one transmission path.
It can be understood that, after determining the network connectivity graph through the above steps, the server may find the transmission path according to the weight between each node in the network connectivity graph, for example: if the transmission path acquisition request is a request for acquiring the node A to the node B, positioning the node A and the node B in a network connectivity graph, and then finding out a high-quality (low load and low delay) path by using a Dijkstra shortest path search algorithm to return to the source node, wherein the high-quality path is a path with small weight for communication between the nodes; if the required transmission path is one path, the path with the minimum weight is used as the transmission path, and if the required path is multiple paths, the multiple paths are required to be selected as the transmission paths according to the sequence from small to large of the weight.
In conclusion, the method can comprehensively generate the weight between the nodes according to the communication condition between the nodes and the load value of the nodes, the weight can represent the communication state between the nodes, and the load condition and the delay condition of the nodes can be reflected through the weight, so that the server can determine a path with lower load and lower delay from the weight, and the data transmission speed between the nodes is improved; in addition, the data transmission method is realized on a logic level, the nodes serving as the relay nodes are not fixed, and the data transmission method can be adjusted in real time according to the current communication state between the nodes through the server, so that multipath concurrence can be realized when data is sent through the method, and the throughput capacity is improved.
Based on any of the above method embodiments, in this embodiment, when generating the weight between nodes according to the load value of each node and the connectivity condition between nodes, the method may include:
if the connection condition between the nodes is in a connection state, determining the Round Trip Time (RTT) between the nodes;
determining a CPU load value, a memory load value and an IO load value of each node, and determining a weight L between the nodes by using a weight determination rule;
the weight determination rule is as follows:
l ═ 1+1/RTT) + (1-CPU%) + (1-RAM%) + (1-IO%); wherein, CPU% is CPU load value, RAM% is memory load value, and IO% is IO load value.
After receiving the load values uploaded by the nodes and the communication conditions among the nodes, the server firstly needs to determine whether the nodes are in a communication state according to the communication conditions between the two nodes; if the communication state is in the communication state, continuing to execute the subsequent steps; if the nodes are not in the connected state, the data cannot be transmitted between the nodes, and the subsequent steps are not required to be executed. After the nodes are determined to be in a connected state, determining a weight according to the round trip time RTT and the load value, in the scheme, taking the load value including a CPU load value, a memory load value and an IO load value as an example for explanation, determining the weight between the nodes according to a weight determination rule, wherein the weight determination rule is as follows:
the communication path weight L is (1+1/RTT) + (1-CPU%) + (1-memory%) + (1-IO%);
that is, after any node reports the connection condition and the load value to the server, the server determines the weight between the nodes by referring to the round trip time RTT, the CPU load value, the memory load value, and the IO load value, thereby constructing a network connection graph inside the server, and selecting an optimal transmission path for the node by the weight of each node in the network connection graph. It should be noted that, when each node reports a load value, each node only reports its own load value, so that when a server searches for a path, it refers to its own load condition when determining a next node, and thus, the load values of all nodes are included in the process of selecting a path, and finally, the overall optimum is achieved.
Based on any of the above method embodiments, in this embodiment, when determining multiple transmission paths according to a network connectivity graph, in order to adapt to real-time changes of a network in consideration of real-time changes of a network state of a transmission network, in this embodiment, searching for at least one transmission path from the network connectivity graph by using a shortest path search algorithm may include:
searching an optimal transmission path from the network connectivity graph by using a shortest path searching algorithm;
respectively adding random factors to the load value of each node and the communication condition among the nodes to update the load value of each node and the communication condition among the nodes;
updating the network connection graph among the nodes by using the updated load value of each node and the connection condition among the nodes;
and selecting an alternative path from the updated network connectivity graph by using a shortest path search algorithm, and taking the optimal path and the alternative path as transmission paths sent to the nodes.
It can be seen that, after the server in the present scheme sends the optimal path to the source node, a random factor may be added to the connection condition and the load value to update the connection condition and the load value of the node, and since the addition of the random value in the random factor may cause the weight to change, an alternative path may be found by the shortest path algorithm and returned to the source node for use. It should be noted that, when detecting that the transmission of the optimal path fails, the node may retransmit the data by using the alternative path; the optimal path and the alternative path can be used for transmitting data at the same time, so that failure in transmission by using one path is avoided.
In this embodiment, the weight determination method disclosed in the above embodiment is described as an example, but the present solution is not limited to selecting the alternative path based on the weight determination method, and other methods may be used to obtain the alternative path by updating the load value and the connectivity condition.
In this embodiment, when updating the load value of each node and the connectivity between nodes, a random value may be added to the RTT and at least one of the CPU, the memory, and the IO, and the random value of each parameter may be the same or different, and may be set in advance.
Such as: the round trip time RTT of each node is +/-random, and/or the CPU load value is +/-random, and/or the memory load value is +/-random, and/or the IO load value is +/-random. Of course, in addition to the above-mentioned manner in which each node adds a random value, the nodes may be randomly selected to form a random transmission path, which is used as an alternative path, where the alternative path may be a standby path and a parallel path, and the difference is: the standby path is used after the transmission of other paths fails; the parallel path is used for transmitting data through a plurality of parallel paths simultaneously when the data are transmitted, and particularly, the alternative path is used as a standby path or a parallel path and can be set at a node end.
It should be noted that, after the nodes on the path are used, the nodes update the RTT and the node load value, and report to the server, so that the server updates the corresponding communication path weight, thereby avoiding the problem of local hot spots and reasonably allocating the resources of the whole network.
Fig. 3 is a schematic diagram of data transmission according to an embodiment of the present invention; if the optimal path, the backup path, or the parallel use path finally determined through the above process includes the following four paths:
1、A-B
2、A-R1-B
3、A-R2-B
4、A-R3-R4-R5-B
after receiving the paths, the node may transmit data using one of the paths, or may transmit data using all of the paths at the same time. In the method, because the weight is in an instantaneous state, the network condition changes in real time, the optimal calculation is carried out at this moment, and the optimal calculation is not possible after the weight is sent to the node, so the method for randomly updating the weight and randomly selecting the path can adapt to the real-time change of the network, is a simple load balancing strategy, and can solve the problem of local overheating through the random method.
Based on any of the above method embodiments, in this scheme, the transmission path that the server sends to the node is: complete transmission path information from the node to the destination node, or phase path information from the node to the destination node.
It should be noted that the node in this scheme may be a source node or a transit node, but whether the node is a source node or a transit node, the transmission path calculated by the server may include the following two cases:
1. the path is complete transmission path information from the source node/the transit node to the destination node, that is, under the normal transmission condition, the source node/the transit node can send data to the destination node at one time according to the complete transmission path without acquiring the transmission path from the server again; however, if an emergency situation is encountered, such as a failure of a node in the transmission path, the node is still required to acquire the transmission path from the server again.
In this case, when the node transmits data, the routing information (complete transmission path information) is written into the header of the data to be transmitted, so that after the transit node receives the data, the transit node forwards the data to the next node according to the header routing indication until the destination node is reached.
2. The path is phase path information, which indicates that the path information acquired by the node from the server is not complete path information, for example: if the path obtained by the node A from the server is the path of A-R3-R4-R5-B, the path is the complete transmission path information; if the path obtained by the A node from the server is A-R3 or A-R3-R4, the path is interpreted as phase path information. In this case, when the node transmits data, if the transit node cannot find the information of the next node after receiving the transmission path sent by the previous node, it needs to actively send a transmission path acquisition request to the server, and after receiving the request, it continues to send the information to the next node until the information is sent to the destination node.
As can be seen from the above two cases, the path information returned by the server to the node may be any of the above cases, that is: the path information can be completely transmitted or phase path information, so that in the data transmission process, the path can be adjusted and changed according to the real-time condition, the optimization adjustment is carried out so as to keep lower delay, and the whole network flow can be flexibly scheduled by a server in real time. When data is transmitted, a route forwarding mechanism may be adopted, and may be replaced by other mechanisms, such as: adopt the non-centralized Path scheduling, similar to OSPF protocol (Open Shortest Path First ) that the traditional router uses extensively.
In summary, any embodiment can show that the scheme has the following advantages compared with the current scheme:
1. the network construction only needs to update node software, does not need additional hardware construction, and has low cost, maintainability and strong expandability.
2. The network and the regional distribution of the existing nodes can be fully utilized, the forwarding is carried out as close as possible, the delay is reduced, and the throughput is improved.
3. The risk of single point failure does not exist, multi-path parallel transmission is carried out at the node end, and the problem can be avoided by dynamically updating the transmission path; if the dispatching server fails, the existing network and path information is cached at the node end, and the existing data transmission session and part of the newly-built transmission session can be maintained.
4. A variety of conventional transport layer protocols may be compatible, such as TCP, UDP, or other application layer implemented transport protocol (UDT).
The invention provides a cross-node data transmission method.
It should be noted that, different from the above embodiments, the data transmission method described in this embodiment is based on an angle of a node side, and the above method embodiment is described based on an angle of a server side; however, the content is the same regardless of the angle, and therefore, detailed description of the data transmission method is omitted in this embodiment, and please refer to any of the above embodiments for details.
Referring to fig. 4, fig. 4 is a schematic flow chart of an embodiment of the present invention, in the embodiment, the method includes:
s301, sending a transmission path acquisition request to a server, wherein the transmission path acquisition request comprises information of a destination node of data transmission;
s302, receiving at least one transmission path sent by the server, wherein the at least one transmission path is calculated by the server according to the acquired load values of all online nodes in the transmission network and the communication condition among the nodes;
s303, sending data to the destination node by using the at least one transmission path.
Before sending the transmission path acquisition request to the server, the method further includes:
sending a detection node information acquisition instruction to the server;
receiving detection node information sent by the server;
and periodically detecting the communication condition between the nodes and each detection node according to the detection node information, and sending the communication condition and the load value of the node to the server.
Wherein the at least one transmission path is: complete transmission path information from the node to the destination node, or phase path information from the node to the destination node.
Further, the present embodiment also discloses a cross-node data transmission system, which is explained based on the angle of the server.
Referring to fig. 5, a schematic structural diagram of a cross-node data transmission system according to an embodiment of the present invention is shown, the system including:
a first receiving unit 110, configured to receive a transmission path acquisition request sent by a node, where the transmission path acquisition request includes information of a destination node of data transmission;
a path determining unit 120, configured to calculate at least one transmission path according to the obtained load value of each online node in the transmission network and the connectivity between the nodes;
a first sending unit 130, configured to send the at least one transmission path to the node, so that the node sends data to the destination node by using the at least one transmission path.
Wherein, this scheme still includes:
the instruction receiving unit is used for receiving a detection node information acquisition instruction sent by the node;
and the first information sending unit is used for sending the detection node information of the node to the node so as to enable the node to periodically detect the communication condition between the node and each detection node according to the detection node information and receive the communication condition sent by the node and the load value of the node.
Wherein the path determination unit includes:
the connected graph determining subunit is used for generating a weight value among the nodes according to the load value of each node and the connection condition among the nodes to obtain a network connected graph;
and the path searching subunit is used for searching at least one transmission path from the network connectivity graph by using a shortest path searching algorithm.
Wherein, the path finding subunit comprises:
the optimal path determining subunit is used for searching an optimal transmission path from the network connectivity graph by using a shortest path searching algorithm;
the random factor adding subunit is used for respectively adding a random factor to the load value of each node and the communication condition among the nodes so as to update the load value of each node and the communication condition among the nodes;
the updating subunit is used for updating the network connectivity graph among the nodes by using the updated load value of each node and the connectivity condition among the nodes;
the alternative path determining subunit is used for selecting an alternative path from the updated network connectivity graph by using a shortest path search algorithm;
and the path sending subunit takes the optimal path and the alternative path as transmission paths sent to the nodes.
Wherein the connectivity map determining subunit includes:
a round trip time length determining subunit, configured to determine a round trip time length RTT between nodes when the connectivity between the nodes is in a connectivity state;
the weight determining subunit is used for determining a CPU load value, a memory load value and an IO load value of each node, and determining a weight L between the nodes by using a weight determining rule;
the weight determination rule is as follows:
l ═ 1+1/RTT) + (1-CPU%) + (1-RAM%) + (1-IO%); wherein, CPU% is CPU load value, RAM% is memory load value, and IO% is IO load value.
Wherein the transmission path sent to the node is: complete transmission path information from the node to the destination node, or phase path information from the node to the destination node.
Further, the present embodiment also discloses a cross-node data transmission system, which is explained based on the angle of the node end.
Referring to fig. 6, a schematic structural diagram of a cross-node data transmission system according to another embodiment of the present invention is shown, the system including:
a second sending unit 210, configured to send a transmission path obtaining request to a server, where the transmission path obtaining request includes information of a destination node of data transmission;
a second receiving unit 220, configured to receive at least one transmission path sent by the server, where the at least one transmission path is calculated by the server according to the obtained load value of each online node in the transmission network and the connectivity between the nodes;
a data sending unit 230, configured to send data to the destination node by using the at least one transmission path.
Wherein, this scheme still includes:
the instruction sending unit is used for sending a detection node information acquisition instruction to the server;
an information receiving unit, configured to receive probe node information sent by the server;
the detection unit is used for periodically detecting the communication condition between each detection node and each detection node according to the detection node information;
and the second information sending unit is used for sending the communication condition and the load value of the node to the server.
Wherein the at least one transmission path is: complete transmission path information from the node to the destination node, or phase path information from the node to the destination node.
Further, the embodiment also discloses a data transmission system across nodes.
Referring to fig. 7, a schematic diagram of an overall structure of a cross-node data transmission system according to an embodiment of the present invention is shown, the system including a server 100 and a node 200;
the server is used for receiving a transmission path acquisition request sent by a node, wherein the transmission path acquisition request comprises information of a destination node of data transmission; calculating at least one transmission path according to the acquired load value of each online node in the transmission network and the communication condition among the nodes; and sending the at least one transmission path to the node so that the node sends data to the destination node by using the at least one transmission path.
The server is further configured to receive a probe node information acquisition instruction sent by the node; and sending the detection node information of the node to the node so that the node periodically detects the communication condition with each detection node according to the detection node information and receives the communication condition sent by the node and the load value of the node.
The server is specifically used for generating a weight value among the nodes according to the load value of each node and the communication condition among the nodes to obtain a network connection graph; and searching at least one transmission path from the network connectivity graph by using a shortest path searching algorithm.
The server is specifically configured to search for an optimal transmission path from the network connectivity graph by using a shortest path search algorithm; respectively adding random factors to the load value of each node and the communication condition among the nodes to update the load value of each node and the communication condition among the nodes; updating the network connection graph among the nodes by using the updated load value of each node and the connection condition among the nodes; and selecting an alternative path from the updated network connectivity graph by using a shortest path search algorithm, and taking the optimal path and the alternative path as transmission paths sent to the nodes.
The server is specifically configured to determine a round trip time RTT between nodes if the connectivity between the nodes is in a connectivity state; determining a CPU load value, a memory load value and an IO load value of each node, and determining a weight L between the nodes by using a weight determination rule; the weight determination rule is as follows:
l ═ 1+1/RTT) + (1-CPU%) + (1-RAM%) + (1-IO%); wherein, CPU% is CPU load value, RAM% is memory load value, and IO% is IO load value.
Wherein the transmission path sent to the node is: complete transmission path information from the node to the destination node, or phase path information from the node to the destination node.
Further, an embodiment of the present invention further provides a computer-readable storage medium, where a server-side cross-node data transmission program is stored on the computer-readable storage medium, and the cross-node data transmission program may be executed by one or more processors to implement the server-side data transmission method in the foregoing method embodiment.
Further, an embodiment of the present invention further provides a computer-readable storage medium, where a node-side cross-node data transmission program is stored on the computer-readable storage medium, and the node-side cross-node data transmission program may be executed by one or more processors to implement the node-side data transmission method in the foregoing method embodiment.
Further, the embodiment also discloses a data transmission device across nodes.
Referring to fig. 8, a data transmission apparatus according to an embodiment of the present invention is disclosed, the apparatus includes a memory 11 and a processor 12, the memory 11 stores a server-side based data transmission program 01 that can run on the processor, and when the data transmission program 01 is executed by the processor, the server-side based data transmission method in the foregoing method embodiment is implemented.
In this embodiment, the data transmission device 1 may be a PC (Personal Computer), or may be a terminal device such as a smart phone, a tablet Computer, a palmtop Computer, or a portable Computer.
The apparatus 1 may be a node constituting a CDN network or a blockchain network.
The apparatus 1 may include a memory 11, a processor 12, and a bus 13.
The memory 11 includes at least one type of readable storage medium, which includes a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a magnetic memory, a magnetic disk, an optical disk, and the like. The memory 11 may in some embodiments be an internal storage unit of the apparatus 1, for example a hard disk of the apparatus 1. The memory 11 may in other embodiments also be an external storage device of the apparatus 1, such as a plug-in hard disk provided on the apparatus 1, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), etc. Further, the memory 11 may also comprise both internal memory units of the apparatus 1 and external memory devices. The memory 11 can be used not only to store application software installed in the apparatus 1 and various types of data such as codes of the program 01, but also to temporarily store data that has been output or is to be output.
The processor 12 may be a Central Processing Unit (CPU), a controller, a microcontroller, a microprocessor or other data Processing chip in some embodiments, and is used for executing program codes stored in the memory 11 or Processing data, such as executing the program 01.
The bus 13 may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 8, but this is not intended to represent only one bus or type of bus.
Further, the apparatus 1 may further comprise a network interface 14, and the network interface 14 may optionally comprise a wired interface and/or a wireless interface (such as a WI-FI interface, a bluetooth interface, etc.), which are generally used for establishing a communication connection between the apparatus 1 and other electronic devices.
Optionally, the apparatus 1 may further comprise a user interface, which may comprise a Display (Display), an input unit such as a Keyboard (Keyboard), and optionally a standard wired interface, a wireless interface. Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch device, or the like. The display, which may also be referred to as a display screen or display unit, is suitable for displaying information processed in the apparatus 1 and for displaying a visual user interface.
While fig. 8 shows only the apparatus 1 with the components 11-14 and the program 01, it will be understood by those skilled in the art that the structure shown in fig. 8 does not constitute a limitation of the apparatus 1, and may include fewer or more components than those shown, or some components in combination, or a different arrangement of components.
Further, the embodiment also discloses another data transmission device crossing nodes.
The data transmission device disclosed in the embodiment of the present invention includes a memory and a processor, where the memory stores a node-side-based data transmission program that can be executed on the processor, and the data transmission program is executed by the processor to implement the node-side-based data transmission method in the above method embodiment.
It should be noted that the specific structure of the data transmission device in this embodiment is the same as the structure of the data transmission device in the previous embodiment, and only the program stored in the memory is different; therefore, in this embodiment, the specific structure of the apparatus will not be described, and refer to the above embodiment for details.
Further, an embodiment of the present invention further provides a computer program product, which includes computer instructions, and when the computer program product runs on a computer, the computer may execute the data transmission method based on the server side in the foregoing method embodiments.
Further, an embodiment of the present invention further provides a computer program product, which includes computer instructions, and when the computer program product runs on a computer, the computer may execute the node-side based data transmission method in the foregoing method embodiments.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product.
The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that a computer can store or a data storage device, such as a server, a data center, etc., that is integrated with one or more available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It should be noted that the above-mentioned numbers of the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments. And the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, apparatus, article, or method that includes the element.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (13)
1. A method of data transmission across nodes, the method comprising:
receiving a transmission path acquisition request sent by a node, wherein the transmission path acquisition request comprises information of a destination node of data transmission;
generating a weight value among the nodes according to the load value of each node and the communication condition among the nodes to obtain a network communication graph;
searching an optimal transmission path from the network connectivity graph by using a shortest path searching algorithm;
respectively adding random factors to the load value of each node and the communication condition among the nodes to update the load value of each node and the communication condition among the nodes;
updating the network connection graph among the nodes by using the updated load value of each node and the connection condition among the nodes;
selecting an alternative path from the updated network connectivity graph by using a shortest path search algorithm, and taking the optimal path and the alternative path as at least one transmission path sent to the node;
and sending the at least one transmission path to the node so that the node sends data to the destination node by using the at least one transmission path.
2. The data transmission method according to claim 1, wherein before the transmission path acquisition request sent by the receiving node, the method further comprises:
receiving a detection node information acquisition instruction sent by the node;
and sending the detection node information of the node to the node so that the node periodically detects the communication condition with each detection node according to the detection node information and receives the communication condition sent by the node and the load value of the node.
3. The data transmission method according to claim 1, wherein generating the weight values between the nodes according to the load value of each node and the connectivity condition between the nodes comprises:
if the connection condition between the nodes is in a connection state, determining the Round Trip Time (RTT) between the nodes;
determining a CPU load value, a memory load value and an IO load value of each node, and determining a weight L between the nodes by using a weight determination rule;
the weight determination rule is as follows:
l ═ 1+1/RTT) + (1-CPU%) + (1-RAM%) + (1-IO%); wherein, CPU% is CPU load value, RAM% is memory load value, and IO% is IO load value.
4. A data transmission method according to any one of claims 1 to 3, wherein the transmission path sent to the node is: complete transmission path information from the node to the destination node, or phase path information from the node to the destination node.
5. A method of data transmission across nodes, the method comprising:
sending a transmission path acquisition request to a server, wherein the transmission path acquisition request comprises information of a destination node of data transmission;
receiving at least one transmission path sent by the server, wherein the at least one transmission path is calculated by the server according to the acquired load value of each online node in the transmission network and the communication condition among the nodes; the server generates a weight value among the nodes according to the load value of each node and the communication condition among the nodes to obtain a network communication graph; searching an optimal transmission path from the network connectivity graph by using a shortest path searching algorithm; respectively adding random factors to the load value of each node and the communication condition among the nodes to update the load value of each node and the communication condition among the nodes; updating the network connection graph among the nodes by using the updated load value of each node and the connection condition among the nodes; selecting an alternative path from the updated network connectivity graph by using a shortest path search algorithm, and taking the optimal path and the alternative path as at least one transmission path sent to the node;
and transmitting data to the destination node by using the at least one transmission path.
6. The data transmission method according to claim 5, wherein before sending the transmission path acquisition request to the server, the method further comprises:
sending a detection node information acquisition instruction to the server;
receiving detection node information sent by the server;
and periodically detecting the communication condition between the nodes and each detection node according to the detection node information, and sending the communication condition and the load value of the node to the server.
7. The data transmission method according to claim 5 or 6, wherein the at least one transmission path is: complete transmission path information from the node to the destination node, or phase path information from the node to the destination node.
8. An apparatus for data transmission across nodes, the apparatus comprising a memory and a processor, the memory having stored thereon a data transmission program operable on the processor, the data transmission program when executed by the processor implementing the method of any one of claims 1 to 4.
9. An apparatus for data transmission across nodes, the apparatus comprising a memory and a processor, the memory having stored thereon a data transmission program operable on the processor, the data transmission program when executed by the processor implementing the method of any one of claims 5 to 7.
10. A system for data transmission across nodes, the system comprising:
a first receiving unit, configured to receive a transmission path acquisition request sent by a node, where the transmission path acquisition request includes information of a destination node of data transmission;
the path determining unit is used for calculating at least one transmission path according to the acquired load value of each online node in the transmission network and the communication condition among the nodes;
a first sending unit, configured to send the at least one transmission path to the node, so that the node sends data to the destination node by using the at least one transmission path;
wherein the path determining unit is specifically configured to: generating a weight value among the nodes according to the load value of each node and the communication condition among the nodes to obtain a network communication graph; searching an optimal transmission path from the network connectivity graph by using a shortest path searching algorithm; respectively adding random factors to the load value of each node and the communication condition among the nodes to update the load value of each node and the communication condition among the nodes; updating the network connection graph among the nodes by using the updated load value of each node and the connection condition among the nodes; and selecting an alternative path from the updated network connectivity graph by using a shortest path search algorithm, and taking the optimal path and the alternative path as at least one transmission path sent to the node.
11. A system for data transmission across nodes, the system comprising:
a second sending unit, configured to send a transmission path acquisition request to a server, where the transmission path acquisition request includes information of a destination node of data transmission;
a second receiving unit, configured to receive at least one transmission path sent by the server, where the at least one transmission path is calculated by the server according to the obtained load value of each online node in the transmission network and the communication condition between the nodes; the server generates a weight value among the nodes according to the load value of each node and the communication condition among the nodes to obtain a network communication graph; searching an optimal transmission path from the network connectivity graph by using a shortest path searching algorithm; respectively adding random factors to the load value of each node and the communication condition among the nodes to update the load value of each node and the communication condition among the nodes; updating the network connection graph among the nodes by using the updated load value of each node and the connection condition among the nodes; selecting an alternative path from the updated network connectivity graph by using a shortest path search algorithm, and taking the optimal path and the alternative path as at least one transmission path sent to the node;
and a data sending unit, configured to send data to the destination node using the at least one transmission path.
12. A computer-readable storage medium having stored thereon a cross-node data transfer program executable by one or more processors to implement a cross-node data transfer method as claimed in any one of claims 1 to 4.
13. A computer-readable storage medium having stored thereon a cross-node data transfer program executable by one or more processors to implement a cross-node data transfer method as claimed in any one of claims 5 to 7.
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 CN109995653A (en) | 2019-07-09 |
| CN109995653B true 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) |
Families Citing this family (17)
| 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 |
| CN113055339B (en) * | 2019-12-26 | 2023-04-28 | 中国移动通信集团海南有限公司 | Process data processing method and device, storage medium and computer equipment |
| CN111181853B (en) * | 2019-12-30 | 2022-07-01 | 布比（北京）网络技术有限公司 | Pure distributed data exchange method and system based on block chain |
| CN111277630B (en) * | 2020-01-13 | 2022-09-09 | 腾讯科技（深圳）有限公司 | Routing control method and device, electronic equipment and storage medium |
| CN111338656B (en) * | 2020-02-25 | 2023-12-15 | 平安科技（深圳）有限公司 | Method and device for installing software package to target host and computer equipment |
| CN112188455B (en) * | 2020-09-23 | 2023-04-11 | 深圳前海知行科技有限公司 | Positioning method, device, equipment and storage medium based on gateway |
| CN112738174B (en) * | 2020-12-23 | 2022-11-25 | 中国人民解放军63921部队 | Cross-region multi-task data transmission method and system for private network |
| CN114827007A (en) * | 2021-01-18 | 2022-07-29 | 中国移动通信有限公司研究院 | Routing method and device for computing power perception, routing node and client equipment |
| CN113382392B (en) * | 2021-02-10 | 2023-03-24 | 华为技术有限公司 | Communication method and electronic device |
| 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 |
| CN113595894B (en) * | 2021-07-28 | 2023-04-18 | 海尔数字科技(青岛)有限公司 | Communication method, device, equipment and medium between service nodes and client nodes |
| CN113660158B (en) * | 2021-08-05 | 2023-06-30 | 北京网聚云联科技有限公司 | Scheduling method, server and storage medium for 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 |
| 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 |
| CN117811983A (en) * | 2022-09-30 | 2024-04-02 | 中兴通讯股份有限公司 | Data transmission method, device and storage medium |
Citations (7)
| 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) |
| CN107733518A (en) * | 2017-09-30 | 2018-02-23 | 南京理工大学 | The optimal income method for routing of LEO satellite network based on cooperative game |
| 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 |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10171612B2 (en) * | 2015-12-28 | 2019-01-01 | 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 |
| CN108449269A (en) * | 2018-04-12 | 2018-08-24 | 重庆邮电大学 | Data center network load-balancing method based on SDN |
-
2019
- 2019-04-15 CN CN201910300096.6A patent/CN109995653B/en active Active
Patent Citations (7)
| 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) |
| CN107733518A (en) * | 2017-09-30 | 2018-02-23 | 南京理工大学 | The optimal income method for routing of LEO satellite network based on cooperative game |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109995653A (en) | 2019-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109995653B (en) | Cross-node data transmission method, device and system and readable storage medium | |
| JP5889914B2 (en) | State synchronization between load balancer components | |
| US8004984B2 (en) | Routing control technique in MPLS | |
| CN104539531A (en) | Data transmission method and device | |
| WO2017101366A1 (en) | Cdn service node scheduling method and server | |
| CN101989951A (en) | Method, system and equipment for selecting service node | |
| CN103475566A (en) | Real-time message exchange platform and distributed cluster establishment method | |
| US8892982B2 (en) | Method and system for network latency virtualization in a cloud transport environment | |
| US20140337524A1 (en) | Distributed network coordinate system | |
| US20120191769A1 (en) | Site-aware distributed file system access from outside enterprise network | |
| EP3306861A1 (en) | Cluster communication | |
| CN107113892A (en) | A kind of method and device of gateway device automatic network-building | |
| CN108768878A (en) | A kind of SiteServer LBS, method, apparatus and load-balancing device | |
| CN109151009A (en) | A kind of CDN node distribution method and system based on MEC | |
| CN103312716A (en) | Internet information accessing method and system | |
| JP2016063315A (en) | Relay device and communication system | |
| US10536368B2 (en) | Network-aware routing in information centric networking | |
| EP3066575B1 (en) | Server network address selection based on network characteristics of service providers | |
| CN103312607A (en) | Transmission path selection method and device | |
| JP2001290787A (en) | Data distribution method and storage medium with data distribution program stored therein | |
| CN109218181A (en) | A kind of method, apparatus and electronic equipment of data transmission | |
| US11277342B2 (en) | Lossless data traffic deadlock management system | |
| CN105991365B (en) | The method, apparatus and system of path detection | |
| JP5526780B2 (en) | Load distribution system, service processing server, load distribution method, and load distribution program | |
| WO2018188570A1 (en) | Data transmission method and apparatus |
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 |