CN114124825A - Data transmission method, system, device and storage medium - Google Patents
Data transmission method, system, device and storage medium Download PDFInfo
- Publication number
- CN114124825A CN114124825A CN202111249038.9A CN202111249038A CN114124825A CN 114124825 A CN114124825 A CN 114124825A CN 202111249038 A CN202111249038 A CN 202111249038A CN 114124825 A CN114124825 A CN 114124825A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- congestion
- path
- adjacent
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/122—Avoiding congestion; Recovering from congestion by diverting traffic away from congested entities
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a method, a system, a device and a storage medium for data transmission, which relate to the technical field of communication and can improve the efficiency of data transmission of network nodes. The method comprises the following steps: and the congestion node acquires the data information of the congestion data. The congestion node acquires congestion information of each adjacent node in the plurality of adjacent nodes, the congestion information is used for reflecting the data volume in the network node, and the adjacent node is a network node adjacent to an original path for transmitting congestion data. If the target adjacent node exists in the plurality of adjacent nodes, the congestion node determines a first path according to the target adjacent node and the destination node, wherein the first path consists of the target adjacent node and the destination node, and the target adjacent node is an adjacent node of which the data volume of congestion data in the node is smaller than a preset congestion volume threshold value. The congested node transmits the congested data over the first path.
Description
Technical Field
The present application relates to the field of communications, and in particular, to a method, a system, an apparatus, and a storage medium for data transmission.
Background
With the development of science and technology, the amount of data transmitted in the network is larger and larger, and the load of each network node in the network is increased. When the amount of data in a network node is too large, congestion may occur in the network node.
Currently, when data congestion occurs in a network, network nodes can only keep the data transmission and refresh by waiting. However, this takes a lot of time, resulting in inefficient data transmission by the network nodes.
Disclosure of Invention
The application provides a method, a system, a device and a storage medium for data transmission, which can improve the efficiency of data transmission of network nodes.
In order to achieve the purpose, the technical scheme is as follows:
in a first aspect, the present application provides a data transmission method, which is applied to a network system, where the network system includes a congestion node, and a data amount of congestion data in the congestion node is greater than a preset congestion amount threshold. In the method, a congestion node acquires data information of congestion data, the data information comprises an original path for transmitting the congestion data, the original path comprises a destination node, and the destination node is a last hop network node in the original path. The congestion node acquires congestion information of each adjacent node in the plurality of adjacent nodes, the congestion information is used for reflecting the data volume in the network node, and the adjacent node is a network node adjacent to an original path for transmitting congestion data. If the target adjacent node exists in the plurality of adjacent nodes, the congestion node determines a first path according to the target adjacent node and the destination node, wherein the first path consists of the target adjacent node and the destination node, and the target adjacent node is an adjacent node of which the data volume of congestion data in the node is smaller than a preset congestion volume threshold value. The congested node transmits the congested data over the first path.
Based on the technical scheme, the congestion node acquires an original path of the congestion data, wherein the original path comprises a terminal node, and the terminal node is a last hop network node in the original path. And then, the congestion node acquires congestion information of each adjacent node in the plurality of adjacent nodes, wherein the congestion information is used for reflecting the data volume in the network node, and the adjacent node is the network node adjacent to the original path for transmitting the congestion data. Then, if the target adjacent node exists in the plurality of adjacent nodes, the congestion node determines a first path according to the target adjacent node and the destination node. The first path consists of a target adjacent node and a destination node, and the target adjacent node is an adjacent node of which the data volume of congestion data in the node is smaller than a preset congestion volume threshold value. Therefore, under the condition that the congestion node sends congestion, the congestion node can transmit the congestion data through the first path, the congestion node is prevented from consuming longer time to transmit the congestion data to the next hop network node, the time for the congestion node to transmit the congestion data is shortened, and the data transmission efficiency of the congestion node is improved.
In a possible design, the network system further includes a pre-congestion node, where the pre-congestion node is a previous-hop network node of the congestion node. And if the target adjacent node does not exist in the plurality of adjacent nodes, the congestion node transmits congestion data to the node before congestion. And the node before congestion determines a second path according to a preset planning algorithm and the end point node, wherein the second path comprises the end point node. The pre-congestion node transmits the congestion data through the second path.
In a possible design, the data information of the congested data further includes a scheduling identifier, and the scheduling identifier is used to indicate that the transmission path of the congested data is updated from an original path to a new path.
In one possible design, if there is retained data in the node before congestion, the node before congestion transmits the retained data through the second path, the retained data is data that the node before congestion does not transmit to the node before congestion, and the retained data and the congested data are data in the original path.
In one possible design, the data to be transmitted includes congestion data and retention data, the congestion data and the retention data are both composed of at least one segment of data, each segment of data in the at least one segment of data corresponds to a sequence identifier, and the sequence identifier is used for indicating the position of the corresponding data in the data to be transmitted. The network system also includes a destination node. And the terminal node splices each section of data in the congestion data and each section of data in the retention data according to the sequence identifier of each section of data in the congestion data and the sequence identifier of each section of data in the retention data to obtain the data to be transmitted.
In a second aspect, the present application provides a system for data transmission, where in the congested node, a data amount of the congested data in the congested node is greater than a preset congestion amount threshold.
And the congestion node is used for acquiring data information of the congestion data, the data information comprises an original path for transmitting the congestion data, the original path comprises a destination node, and the destination node is a last hop network node in the original path. And the congestion node is also used for acquiring congestion information of each adjacent node in the plurality of adjacent nodes, the congestion information is used for reflecting the data volume in the network node, and the adjacent node is a network node adjacent to the original path for transmitting the congestion data. And the congestion node is further used for determining a first path according to the target adjacent node and the destination node if the target adjacent node exists in the plurality of adjacent nodes, wherein the first path is composed of the target adjacent node and the destination node, and the target adjacent node is an adjacent node of which the data volume of congestion data in the node is smaller than a preset congestion volume threshold value. And the congestion node is also used for transmitting the congestion data through the first path.
In one possible design, the system further includes a pre-congestion node, where the pre-congestion node is a previous-hop network node of the congestion node. And the congestion node is also used for transmitting congestion data to the node before congestion if the target adjacent node does not exist in the plurality of adjacent nodes. And the pre-congestion node is used for determining a second path according to a preset planning algorithm and the end point node, and the second path comprises the end point node. And the node before congestion is also used for transmitting the congestion data through the second path by the node before congestion.
In a possible design, the data information of the congested data further includes a scheduling identifier, and the scheduling identifier is used to indicate that the transmission path of the congested data is updated from an original path to a new path.
In a possible design, the node before congestion is further configured to transmit the retained data through the second path if the retained data exists in the node before congestion, where the retained data is data that is not transmitted to the node before congestion, and the retained data and the congested data are data in an original path.
In one possible design, the data to be transmitted comprises congestion data and retention data, the congestion data and the retention data are both composed of at least one segment of data, each segment of data in the at least one segment of data corresponds to a sequence identifier, and the sequence identifier is used for indicating the position of the corresponding data in the data to be transmitted; the system also includes a destination node. And the terminal node is used for splicing each section of data in the congestion data and each section of data in the retention data according to the sequence identifier of each section of data in the congestion data and the sequence identifier of each section of data in the retention data to obtain the data to be transmitted.
In a third aspect, the present application provides an apparatus for data transmission, the apparatus comprising: a processor and a memory; the processor and the memory are coupled; the memory is used for storing one or more programs, the one or more programs comprising computer executable instructions, which when executed by the data transmission apparatus, are executed by the processor to implement the data transmission method as described in the first aspect and any possible implementation manner of the first aspect.
In a fourth aspect, the present application provides a computer-readable storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the method for data transmission described in the first aspect and any one of the possible implementations of the first aspect.
In a fifth aspect, the present application provides a chip comprising a processor and a communication interface, the communication interface being coupled to the processor, the processor being configured to execute a computer program or instructions to implement the method of data transmission as described in the first aspect and any one of the possible implementations of the first aspect.
In the foregoing solution, for technical problems that can be solved by a data transmission system, a computer device, a computer storage medium, or a chip, and technical effects that can be achieved by the data transmission system and the computer storage medium, reference may be made to the technical problems and technical effects that are solved by the first aspect, and details are not described here again.
Drawings
Fig. 1 is a system architecture diagram of a network system according to an embodiment of the present application;
fig. 2 is a schematic flowchart of a data transmission method according to an embodiment of the present application;
fig. 3 is a schematic diagram illustrating an example of data transmission according to an embodiment of the present application;
fig. 4 is a schematic flowchart of another data transmission method according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a system for data transmission according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a data transmission apparatus according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. 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 application.
The character "/" herein generally indicates that the former and latter associated objects are in an "or" relationship. For example, A/B may be understood as A or B.
The terms "first" and "second" in the description and claims of the present application are used for distinguishing between different objects and not for describing a particular order of the objects.
Furthermore, the terms "including" and "having," and any variations thereof, as referred to in the description of the present application, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or modules is not limited to the listed steps or modules but may alternatively include other steps or modules not listed or inherent to such process, method, article, or apparatus.
In addition, in the embodiments of the present application, words such as "exemplary" or "for example" are used to mean serving as examples, illustrations or explanations. Any embodiment or design described herein as "exemplary" or "e.g.," is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "e.g.," is intended to present concepts in a concrete fashion.
Before describing the data transmission method in the embodiment of the present application in detail, an implementation environment and an application scenario of the embodiment of the present application are described.
As shown in fig. 1, a network system provided for the embodiment of the present application includes a plurality of network nodes (e.g., a plurality of servers). A plurality of servers may be connected by wire.
The network node refers to a device having an independent address and a function of transmitting or receiving data. The network nodes may be workstations or personal computers, servers, printers and other devices connected to the network. Each workstation, server, terminal, network device, i.e. the device with its own unique network address, is a network node.
The terminal may be a device having a transceiving function. The terminal can be deployed on land, including indoors or outdoors, hand-held or vehicle-mounted; can also be deployed on the water surface (such as a ship and the like); and may also be deployed in the air (e.g., airplanes, balloons, satellites, etc.). The terminal comprises a handheld device, a vehicle-mounted device, a wearable device or a computing device with wireless communication function. Illustratively, the terminal may be a mobile phone (mobile phone), a tablet computer or a computer with wireless transceiving function. The terminal device may also be a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in smart grid, a wireless terminal in smart city (smart city), a wireless terminal in smart home (smart home), and the like.
The server can be a physical server or a cloud server.
The embodiments of the present application will be described in detail below with reference to the drawings attached to the specification.
As shown in fig. 2, a method for data transmission provided in this embodiment of the present application is applied to a network system, where the network system includes a congested node, and the congested node is a next-hop network node where data cannot be transmitted to the network node (i.e., the congested node) due to a large amount of data in the network node. The method comprises the following steps:
s201, the congestion node acquires data information of the congestion data.
And the data volume of the congestion data in the congestion node is greater than a preset congestion volume threshold value. The data information comprises an original path for transmitting congestion data, the original path comprises a terminal node, and the terminal node is a last hop network node in the original path.
The congestion data refers to a next hop network node to which data in the congested node cannot be transmitted. Illustratively, if the preset congestion amount threshold is 5 megabits, the data in the congested node is 10 megabits. Wherein 2 million of data in the congested node is being transmitted from the congested node to the next hop network node of the congested node, and the remaining 8 million of data is waiting to be transmitted. The 8 million data is congestion data, and the congestion data is greater than a preset congestion amount threshold.
In one possible design, the congestion data being greater than the predetermined congestion amount threshold may be represented by the following equation one.
Wherein a is a preset congestion amount threshold, N is congestion data in a congested node, and N is the total capacity of a transmission channel of the congested node.
Illustratively, if the preset congestion amount threshold is 1, the congestion data in the congested node is 1000, and the total capacity of the transmission channel of the congested node is 100, then 10 is greater than 1.
In the embodiment of the present application, the original path for transmitting the congestion data refers to a path before the path for transmitting the congestion data is not changed. The original path includes: a network node that sends congestion data (which may be referred to as a starting node), a congested node, and an end node.
It should be noted that the congestion data in the embodiment of the present application may be part of or all of data in data sent by the start node to the end node through the original path.
Illustratively, the congestion data is data sent by network node a to network node B, and the original path includes network node a and network node B. Optionally, when the data is congested when passing through the network node C, the original path further includes the network node C.
S202, the congestion node acquires congestion information of each adjacent node in the plurality of adjacent nodes.
The congestion information is used for reflecting the data volume in the network nodes, and the adjacent nodes are the network nodes adjacent to the original path for transmitting the congestion data.
In one possible implementation, the congested node determines a number of neighboring nodes based on the network topology. And then, the congestion node sends first indication information to each adjacent node in the plurality of adjacent nodes, wherein the first indication information is used for indicating the network node which receives the first indication information to feed back the congestion information of the network node. Each neighboring node may then send congestion information to the congested node.
As one possible design, the congestion information includes an amount of data in the network node. Illustratively, assuming that the plurality of neighboring nodes includes network node a and network node B, the congestion information of network node a is 1000 and the congestion information of network node B is 10000.
Optionally, the congestion information is used to reflect a congestion status. The congestion information includes the first identity or the second identity. The first identifier is used to indicate that the network node is not congested and the second identifier is used to indicate that the network node is congested.
S203, the congestion node determines whether a target adjacent node exists.
And the target adjacent node is an adjacent node of which the data volume of the congestion data in the node is smaller than a preset congestion volume threshold value. Optionally, the target neighboring node is a node that is not congested.
In one possible implementation, the congested node determines whether a target neighbor node exists according to congestion information of each neighbor node. For example, if the congestion information includes the data amount in the network node, such as the data amount of the network node a is 1000, and the preset congestion data amount threshold is 500, the network node a is determined to be the target neighboring node. For another example, if the congestion information of the network node B includes the second identification, the congested node determines that the network node B is not the target neighbor node.
In some embodiments, if there is a target neighbor node among the plurality of neighbor nodes, S204 is performed.
S204, the congestion node determines a first path according to the target adjacent node and the destination node.
Wherein the first path is composed of a target neighbor node and a destination node.
It should be noted that the target neighboring node may include a plurality of network nodes. The target neighboring node in the first path may be a part of the plurality of network nodes or all of the plurality of network nodes.
Illustratively, as shown in fig. 3, the node 2 is a data congestion node (i.e., a congested node), and the nodes 1, 2, 3, 4, and 5 are partial network nodes in an original path. The node 6, the node 7, the node 8, and the node 12 are neighboring nodes, and the node 6, the node 7, and the node 8 are target neighboring nodes. The data sending end is a starting node, and the data receiving end is a destination node.
S205, the congestion node transmits the congestion data through the first path.
Based on the technical scheme, the congestion node acquires an original path of the congestion data, wherein the original path comprises a terminal node, and the terminal node is a last hop network node in the original path. And then, the congestion node acquires congestion information of each adjacent node in the plurality of adjacent nodes, wherein the congestion information is used for reflecting the data volume in the network node, and the adjacent node is the network node adjacent to the original path for transmitting the congestion data. Then, if the target adjacent node exists in the plurality of adjacent nodes, the congestion node determines a first path according to the target adjacent node and the destination node. The first path consists of a target adjacent node and a destination node, and the target adjacent node is an adjacent node of which the data volume of congestion data in the node is smaller than a preset congestion volume threshold value. Therefore, under the condition that the congestion node sends congestion, the congestion node can transmit the congestion data through the first path, the congestion node is prevented from consuming longer time to transmit the congestion data to the next hop network node, the time for the congestion node to transmit the congestion data is shortened, and the data transmission efficiency of the congestion node is improved.
In some embodiments, the network system further comprises a pre-congestion node, which is a previous-hop network node of the congestion node. If the target neighboring node does not exist in the plurality of neighboring nodes, the congested node performs S206.
And S206, the congestion node transmits the congestion data to the node before congestion.
Illustratively, in conjunction with fig. 3, node 2 is a congested node, node 1 is a pre-congested node, and node 2 transmits congestion data to node 1.
And S207, determining a second path by the node before congestion according to a preset planning algorithm and the terminal node.
Wherein the second path includes the end node. The preset planning algorithm is used for determining a path for transmitting data from the node before congestion to the end node.
It should be noted that, the preset planning algorithm is not limited in the embodiment of the present application. For example, the preset planning algorithm may be Dijkstra's algorithm. As another example, the pre-set planning algorithm may be distributed routing. As another example, the predetermined planning algorithm may be a routing algorithm.
Illustratively, in conjunction with FIG. 3, the second path includes node 1, node 9, node 10, node 11, and the received data segment (i.e., the destination node).
208. The pre-congestion node transmits the congestion data through the second path.
Based on the above technical solution, there is no target neighbor node in the plurality of neighbor nodes, which indicates that data cannot be transmitted from the congested node to the end node. The congested node may transmit the congested data to the pre-congested node. And then, the node before congestion determines a second path according to a preset planning algorithm and the end point node, wherein the second path comprises the end point node. The pre-congestion node transmits the congestion data through the second path. Therefore, the congestion node is prevented from consuming longer time to transmit the congestion data to the next-hop network node, the time for transmitting the congestion data by the congestion node is shortened, and the data transmission efficiency of the congestion node is improved.
In some embodiments, the data information of the congested data further includes a scheduling identifier, and the scheduling identifier is used to indicate that the transmission path of the congested data is updated from an original path to a new path.
Illustratively, if the scheduling identifier is "number 1-number 2", the number 1 is used to indicate an original path (e.g., a plurality of network nodes in the original path, such as a congested node and a node before congestion), the number 2 is used to indicate a new path (e.g., a first path) for transmitting congestion data, and the scheduling identifier "number 1-number 2" is used to indicate that the transmission path of the congestion data is updated from the original path to the first path.
It can be understood that the data information of the congestion data includes a scheduling identifier, and the change condition of the transmission path of the congestion data can be recorded, so that the congestion data can be effectively managed, and the condition that the data of the congestion data is lost is avoided.
As shown in fig. 4, another data transmission method provided in this embodiment of the present application includes:
s401, the node before congestion determines whether the data is detained.
The retained data is data which is not transmitted to the congested node by the node before congestion, and the retained data and the congested data are data in an original path.
Illustratively, in the process of sending 1000 bytes of data from the start node to the end node, 200 bytes of data of 1000 bytes are being transmitted from the congested node to the network node next hop of the congested node, 500 bytes of data of 1000 bytes are in the congested node, and 300 bytes of data of 1000 bytes are in the node before congestion and have not been transmitted to the congested node. Of the 1000 bytes, 300 bytes of data are retained data, and 500 bytes of data are congested data.
In some embodiments, if there is stagnant data in the pre-congested node, the pre-congested node performs S402.
S402, the node transmits the detained data through a second path before congestion,
based on the technical scheme, under the condition that the data is detained in the node before congestion, the node before congestion can transmit the detained data through the second path because the speed of transmitting the data by the congestion node is lower. Because the retention data is data which is not transmitted to the congestion node by the node before congestion, and the retention data and the congestion data are data in an original path, the data can be completely transmitted to the terminal node, the data is prevented from being transmitted to the congestion node, and the data transmission efficiency is improved.
In some embodiments, the data to be transmitted includes congestion data and stranded data.
It should be noted that the data to be transmitted is data sent by the start node to the end node through a node before congestion (or a congested node, etc.) in the original path. That is, the congestion data and the stranded data are a set of data transmitted by the originating node. For example, the originating node generates and transmits a set of data (i.e., data to be transmitted) including congestion data and stranded data in response to a request.
Optionally, the data to be transmitted further includes data transmitted from the congested node to the node of the next hop of the congested node.
In the embodiment of the application, the congestion data and the retention data are both composed of at least one piece of data. Each piece of data in at least one piece of data corresponds to a sequence identifier, and the sequence identifier is used for indicating the position of the corresponding data in the data to be transmitted.
Illustratively, the congestion data includes: data segment a, data segment B, and data segment C. The retention data includes: the data segment comprises a data segment D, a data segment E and a data segment F, wherein the sequence identifier corresponding to the data segment A is a sequence identifier a, the sequence identifier corresponding to the data segment B is a sequence identifier B, the sequence identifier corresponding to the data segment C is a sequence identifier C, the sequence identifier corresponding to the data segment D is a sequence identifier D, the sequence identifier corresponding to the data segment E is a sequence identifier E, and the sequence identifier corresponding to the data segment F is a sequence identifier F. The data segment A, the data segment B, the data segment C, the data segment D, the data segment E and the data segment F are sorted according to the sequence identifier as follows: data segment a-data segment B-data segment C-data segment D-data segment E-data segment F.
In one possible implementation, the network system further includes a destination node. And the terminal node splices each section of data in the congestion data and each section of data in the retention data according to the sequence identifier of each section of data in the congestion data and the sequence identifier of each section of data in the retention data to obtain the data to be transmitted.
It can be understood that the congestion data and the retention data are both composed of at least one piece of data, each piece of data in the at least one piece of data corresponds to a sequence identifier, and the sequence identifier is used for indicating the position of the corresponding data in the data to be transmitted. Therefore, the end point node splices each segment of data in the congestion data and each segment of data in the retention data according to the sequence identifier of each segment of data in the congestion data and the sequence identifier of each segment of data in the retention data, so that the sequence of the spliced data to be transmitted is not disordered, and the accuracy of the data is guaranteed.
The foregoing describes the solution provided by an embodiment of the present application, primarily from the perspective of a computer device. It will be appreciated that the computer device, in order to implement the above-described functions, comprises corresponding hardware structures and/or software modules for performing the respective functions. Those of skill in the art will readily appreciate that the method steps of the various examples described in connection with the embodiments disclosed herein may be implemented as hardware or a combination of hardware and computer software. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
Fig. 5 is a schematic structural diagram of a data transmission system according to an embodiment of the present application. The data transmission system is used for executing the data transmission method shown in fig. 2 or fig. 4. A system for data transmission may include a congested node 501.
The congestion node 501 is configured to obtain data information of congestion data, where the data information includes an original path for transmitting the congestion data, the original path includes a destination node 503, and the destination node 503 is a last hop network node in the original path. The congestion node 501 is further configured to obtain congestion information of each of a plurality of adjacent nodes, where the congestion information is used to reflect a data amount in a network node, and the adjacent node is a network node adjacent to an original path for transmitting congestion data. The congested node 501 is further configured to determine a first path according to a target neighboring node and a destination node 503 if the target neighboring node exists in the plurality of neighboring nodes, where the first path is composed of the target neighboring node and the destination node 503, and the target neighboring node is a neighboring node whose data volume of congestion data in the node is smaller than a preset congestion volume threshold. The congested node 501 is also configured to transmit the congested data via the first path.
Optionally, the system further includes a pre-congestion node 502, where the pre-congestion node 502 is a previous-hop network node of the congestion node 501. The congested node 501 is further configured to transmit congestion data to the node before congestion 502 if the target neighboring node does not exist in the plurality of neighboring nodes. And the pre-congestion node 502 is configured to determine, by the pre-congestion node 502 according to a preset planning algorithm and the end node 503, a second path, where the second path includes the end node 503. The pre-congestion node 502 is further configured to transmit the congestion data via the second path by the pre-congestion node 502.
Optionally, the data information of the congested data further includes a scheduling identifier, where the scheduling identifier is used to indicate that the transmission path of the congested data is updated from an original path to a new path.
Optionally, the node 502 before congestion is further configured to transmit the retained data through the second path if the retained data exists in the node 502 before congestion, where the retained data is data that is not transmitted to the node 501 before congestion by the node 502 before congestion, and the retained data and the congested data are data in an original path.
Optionally, the data to be transmitted includes congestion data and retention data, where the congestion data and the retention data are both composed of at least one segment of data, each segment of data in the at least one segment of data corresponds to a sequence identifier, and the sequence identifier is used to indicate a position of the corresponding data in the data to be transmitted; the system also includes an end node 503. And the end node 503 is configured to splice each segment of data in the congestion data and each segment of data in the retained data according to the sequence identifier of each segment of data in the congestion data and the sequence identifier of each segment of data in the retained data, so as to obtain data to be transmitted.
The embodiment of the application also provides a data transmission device. The data transmission device can be any network node in the data transmission system. The data transmission device may be a computer device, or may be a CPU in the computer device, or may be a processing module in the computer device for determining data transmission for data transmission, or may be a client in the computer device for data transmission.
In the embodiment of the present application, functional modules or functional units for data transmission may be divided according to the above method examples, for example, each functional module or functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module may be implemented in a form of hardware, or may be implemented in a form of a software functional module or a functional unit. The division of the modules or units in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
Fig. 6 shows a possible structure of the apparatus for data transmission involved in the above-described embodiment. The data transmission device comprises: a processor 601 and a communication interface 602. The processor 601 is used for controlling and managing the actions of the device, for example, performing the various steps in the method flows shown in the above-described method embodiments, and/or other processes for performing the techniques described herein. The communication interface 602 is used to support communication of the data transfer device with other network entities. The means for data transmission may further comprise a memory 603 and a bus 604, the memory 603 being adapted to store program codes and data of the means.
The processor 601 may implement or execute various exemplary logical blocks, units and circuits described in connection with the present disclosure. The processor may be a central processing unit, general purpose processor, digital signal processor, application specific integrated circuit, field programmable gate array or other programmable logic device, transistor logic device, hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, units, and circuits described in connection with the present disclosure. A processor may also be a combination of computing functions, e.g., comprising one or more microprocessors, a DSP and a microprocessor, or the like.
The bus 604 may be an Extended Industry Standard Architecture (EISA) bus or the like. The bus 604 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 6, but this is not intended to represent only one bus or type of bus.
Through the above description of the embodiments, it is clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to complete all or part of the above described functions. For the specific working processes of the system, the apparatus and the unit described above, reference may be made to the corresponding processes in the foregoing method embodiments, and details are not described here again.
The present application provides a computer program product containing instructions, which when run on a computer causes the computer to execute the method of data transmission in the above method embodiments.
The embodiment of the present application further provides a computer-readable storage medium, where instructions are stored in the computer-readable storage medium, and when the instructions are run on a computer, the computer is caused to execute the method for data transmission in the method flow shown in the foregoing method embodiment.
The computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a Read-Only Memory (ROM), an Erasable Programmable Read-Only Memory (EPROM), a register, a hard disk, an optical fiber, a portable Compact Disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, any suitable combination of the above, or any other form of computer readable storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuit (ASIC). In embodiments of the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
Since the data transmission system, the computer-readable storage medium, and the computer program product in the embodiments of the present invention may be applied to the method described above, the technical effects obtained by the method may also refer to the method embodiments described above, and the details of the embodiments of the present invention are not repeated herein.
The above is only an embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions within the technical scope of the present disclosure should be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (12)
1. The data transmission method is applied to a network system, the network system comprises congestion nodes, and the data volume of congestion data in the congestion nodes is larger than a preset congestion volume threshold; the method comprises the following steps:
the congestion node acquires data information of the congestion data, wherein the data information comprises an original path for transmitting the congestion data, the original path comprises a destination node, and the destination node is a last hop network node in the original path;
the congestion node acquires congestion information of each adjacent node in the plurality of adjacent nodes, wherein the congestion information is used for reflecting the data volume in a network node, and the adjacent node is a network node adjacent to the original path for transmitting the congestion data;
if a target adjacent node exists in the plurality of adjacent nodes, the congestion node determines a first path according to the target adjacent node and the destination node, wherein the first path is composed of the target adjacent node and the destination node, and the target adjacent node is an adjacent node of which the data volume of congestion data in the node is smaller than a preset congestion volume threshold value;
the congested node transmits the congested data over a first path.
2. The method of claim 1, wherein the network system further comprises a pre-congestion node, and wherein the pre-congestion node is a last-hop network node of the congestion node; the method further comprises the following steps:
if the target neighbor node does not exist in the plurality of neighbor nodes, the congested node transmits the congestion data to the node before congestion;
the node before congestion determines a second path according to a preset planning algorithm and the end point node, wherein the second path comprises the end point node;
and the congestion node transmits the congestion data through the second path.
3. The method according to claim 1 or 2, wherein the data information of the congestion data further comprises a scheduling identifier, and the scheduling identifier is used for indicating that the transmission path of the congestion data is updated from an original path to a new path.
4. The method of claim 3, further comprising:
if the node before congestion has retention data, the node before congestion transmits the retention data through the second path, the retention data is data which is not transmitted to the node before congestion, and the retention data and the congestion data are data in the original path.
5. The method according to claim 4, wherein the data to be transmitted comprises the congestion data and the retention data, and both the congestion data and the retention data are composed of at least one piece of data, each piece of data in the at least one piece of data corresponds to one sequence identifier, and the sequence identifier is used for indicating the position of the corresponding data in the data to be transmitted; the network system further comprises the destination node;
the method further comprises the following steps:
and the terminal node splices each segment of data in the congestion data and each segment of data in the retention data according to the sequence identifier of each segment of data in the congestion data and the sequence identifier of each segment of data in the retention data to obtain the data to be transmitted.
6. A system for data transmission is characterized in that the system comprises a congestion node, and the data volume of congestion data in the congestion node is larger than a preset congestion volume threshold value;
the congestion node is configured to obtain data information of the congestion data, where the data information includes an original path for transmitting the congestion data, the original path includes a destination node, and the destination node is a last hop network node in the original path;
the congestion node is further configured to obtain congestion information of each neighboring node in the plurality of neighboring nodes, where the congestion information is used to reflect a data amount in a network node, and the neighboring node is a network node adjacent to the original path through which the congestion data is transmitted;
the congestion node is further configured to determine a first path according to the target neighboring node and the destination node if the target neighboring node exists in the plurality of neighboring nodes, where the first path is composed of the target neighboring node and the destination node, and the target neighboring node is a neighboring node whose data amount of congestion data in the node is smaller than a preset congestion amount threshold;
the congestion node is further configured to transmit the congestion data through a first path.
7. The system of claim 6, further comprising a pre-congestion node, the pre-congestion node being a last-hop network node of the congestion node;
the congested node is further configured to transmit the congestion data to the pre-congested node if the target neighboring node does not exist in the plurality of neighboring nodes;
the pre-congestion node is used for determining a second path according to a preset planning algorithm and the end point node, and the second path comprises the end point node;
the node before congestion is further configured to transmit the congestion data through the second path by the node before congestion.
8. The system according to claim 6 or 7, wherein the data information of the congestion data further comprises a scheduling identifier, and the scheduling identifier is used for indicating that the transmission path of the congestion data is updated from an original path to a new path.
9. The system of claim 8,
the node before congestion is further configured to transmit the retained data through the second path if the retained data exists in the node before congestion, where the retained data is data that is not transmitted to the node before congestion, and the retained data and the congestion data are data in the original path.
10. The system according to claim 9, wherein the data to be transmitted comprises the congestion data and the retention data, and both the congestion data and the retention data are composed of at least one piece of data, each piece of data in the at least one piece of data corresponds to a sequence identifier, and the sequence identifier is used for indicating the position of the corresponding data in the data to be transmitted; the system further comprises the endpoint node;
and the terminal node is used for splicing each segment of data in the congestion data and each segment of data in the retention data according to the sequence identifier of each segment of data in the congestion data and the sequence identifier of each segment of data in the retention data to obtain the data to be transmitted.
11. An apparatus for data transmission, comprising: a processor and a memory; the processor and the memory are coupled; the memory is used for storing one or more programs, the one or more programs include computer-executable instructions, and when the data transmission device runs, the processor executes the computer-executable instructions stored by the memory to cause the data transmission device to execute the method of any one of claims 1-5.
12. A computer-readable storage medium having instructions stored thereon, wherein the instructions, when executed by a computer, cause the computer to perform the method of any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111249038.9A CN114124825B (en) | 2021-10-26 | 2021-10-26 | Method, system, device and storage medium for data transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111249038.9A CN114124825B (en) | 2021-10-26 | 2021-10-26 | Method, system, device and storage medium for data transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114124825A true CN114124825A (en) | 2022-03-01 |
| CN114124825B CN114124825B (en) | 2023-05-16 |
Family
ID=80377007
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111249038.9A Active CN114124825B (en) | 2021-10-26 | 2021-10-26 | Method, system, device and storage medium for data transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114124825B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117236253A (en) * | 2023-11-10 | 2023-12-15 | 苏州异格技术有限公司 | FPGA wiring method and device, computer equipment and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103139070A (en) * | 2013-01-29 | 2013-06-05 | 大唐移动通信设备有限公司 | Method and device for routine selection of data sending |
| CN104303465A (en) * | 2013-03-29 | 2015-01-21 | 华为技术有限公司 | Network congestion processing method, network node, and network system |
| CN105230067A (en) * | 2013-05-20 | 2016-01-06 | 瑞典爱立信有限公司 | Congestion control in communication network |
| WO2016078070A1 (en) * | 2014-11-21 | 2016-05-26 | 华为技术有限公司 | Method for routing data packet, node and communication system |
| CN105634973A (en) * | 2014-10-30 | 2016-06-01 | 华为数字技术（苏州）有限公司 | Routing method and equipment based on load balancing |
| CN108064058A (en) * | 2016-11-07 | 2018-05-22 | 中兴通讯股份有限公司 | Jamming control method and device, base station |
| CN108429699A (en) * | 2018-05-31 | 2018-08-21 | 首都师范大学 | Congestion avoidance mechanisms and device based on two dimension routing |
| US20200322837A1 (en) * | 2017-12-22 | 2020-10-08 | Telefonaktiebolaget Lm Ericsson (Publ) | Congestion notification by data packet from intermediate node |
| CN112995047A (en) * | 2019-12-16 | 2021-06-18 | 中兴通讯股份有限公司 | Flow control method, electronic device, and storage medium |
-
2021
- 2021-10-26 CN CN202111249038.9A patent/CN114124825B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103139070A (en) * | 2013-01-29 | 2013-06-05 | 大唐移动通信设备有限公司 | Method and device for routine selection of data sending |
| CN104303465A (en) * | 2013-03-29 | 2015-01-21 | 华为技术有限公司 | Network congestion processing method, network node, and network system |
| CN105230067A (en) * | 2013-05-20 | 2016-01-06 | 瑞典爱立信有限公司 | Congestion control in communication network |
| CN105634973A (en) * | 2014-10-30 | 2016-06-01 | 华为数字技术（苏州）有限公司 | Routing method and equipment based on load balancing |
| WO2016078070A1 (en) * | 2014-11-21 | 2016-05-26 | 华为技术有限公司 | Method for routing data packet, node and communication system |
| CN105814850A (en) * | 2014-11-21 | 2016-07-27 | 华为技术有限公司 | Method for routing data packet, node and communication system |
| CN108064058A (en) * | 2016-11-07 | 2018-05-22 | 中兴通讯股份有限公司 | Jamming control method and device, base station |
| US20200322837A1 (en) * | 2017-12-22 | 2020-10-08 | Telefonaktiebolaget Lm Ericsson (Publ) | Congestion notification by data packet from intermediate node |
| CN108429699A (en) * | 2018-05-31 | 2018-08-21 | 首都师范大学 | Congestion avoidance mechanisms and device based on two dimension routing |
| CN112995047A (en) * | 2019-12-16 | 2021-06-18 | 中兴通讯股份有限公司 | Flow control method, electronic device, and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 孙利民;李波;周新运;: "无线传感器网络的拥塞控制技术", 计算机研究与发展 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117236253A (en) * | 2023-11-10 | 2023-12-15 | 苏州异格技术有限公司 | FPGA wiring method and device, computer equipment and storage medium |
| CN117236253B (en) * | 2023-11-10 | 2024-02-02 | 苏州异格技术有限公司 | FPGA wiring method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114124825B (en) | 2023-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111651253B (en) | Computing resource scheduling method and device | |
| CN109688058B (en) | Message processing method and device and network equipment | |
| CN111936973A (en) | Techniques for providing efficient migration of services at cloud edge | |
| KR102427550B1 (en) | QoS-AWARE IO MANAGEMENT FOR PCIe STORAGE SYSTEM WITH RECONFIGURABLE MULTI-PORTS | |
| CN108401492B (en) | Routing method, device and server based on mixed resources | |
| CN105743808A (en) | Method and device of adapting QoS | |
| US10534563B2 (en) | Method and system for handling an asynchronous event request command in a solid-state drive | |
| CN111382115B (en) | Path creating method and device for network on chip and electronic equipment | |
| CN114124825B (en) | Method, system, device and storage medium for data transmission | |
| CN108093047B (en) | Data sending method and device, electronic equipment and middleware system | |
| CN116032746B (en) | Information processing method and device of resource pool, storage medium and electronic device | |
| CN112491715A (en) | Routing device and routing equipment of network on chip | |
| CN108279968B (en) | Virtual machine resource scheduling method and device | |
| CN113472591B (en) | Method and device for determining service performance | |
| CN115408328A (en) | Many-core system, processing method and processing unit | |
| CN110839294B (en) | Method and device for transmitting data | |
| CN109257285B (en) | Route storage method and device | |
| CN113778319A (en) | Data processing method of network card and network card | |
| CN115563050A (en) | Many-core computing chip and data access method | |
| CN108628764B (en) | Techniques for fine grain completion tracking of memory buffer accesses | |
| CN116248577B (en) | Method and device for determining calculation force node | |
| WO2016078322A1 (en) | Io channel allocation method and device | |
| CN112968794A (en) | Network function chain deployment method, device, terminal device and storage medium | |
| CN105138392A (en) | Bandwidth control method and electronic equipment | |
| CN112437021B (en) | Routing control method, device, routing equipment and storage medium |
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 |