CN116320068B - A data transmission method, apparatus, electronic device, and computer storage medium - Google Patents
A data transmission method, apparatus, electronic device, and computer storage mediumInfo
- Publication number
- CN116320068B CN116320068B CN202211095654.8A CN202211095654A CN116320068B CN 116320068 B CN116320068 B CN 116320068B CN 202211095654 A CN202211095654 A CN 202211095654A CN 116320068 B CN116320068 B CN 116320068B
- Authority
- CN
- China
- Prior art keywords
- path
- paths
- shortest path
- transmitted
- data packet
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
-
- 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/02—Topology update or discovery
-
- 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
-
- 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/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the application discloses a data transmission method which is applied to a source node in network topology and comprises the steps of acquiring congestion identification of a shortest path between the source node and a destination node in the network topology, selecting a target path from other paths except the shortest path in paths between the source node and the destination node when the congestion identification indicates that the shortest path is congested, and transmitting a data packet to be transmitted to the destination node by using the target path. The embodiment of the application also provides a data transmission device, electronic equipment and a computer storage medium.
Description
Technical Field
The present application relates to a determination technology for a routing path in a network topology, and in particular, to a data transmission method, a data transmission device, an electronic apparatus, and a computer storage medium.
Background
At present, when network topology is calculated, the shortest path is generally calculated, and transmission is performed based on the shortest path, so that the cost of a router passing through the middle is minimum.
However, in some cases, the number of tasks is relatively large, congestion is easily caused by using the shortest path for transmission, and other nodes in the network are not used for transmission if not in the shortest path, so that the resource waste of the whole network is caused, and therefore, the problem that the network resource utilization is unreasonable when the data is transmitted in the existing network topology can be seen.
Disclosure of Invention
The embodiment of the application provides a data transmission method, a data transmission device, electronic equipment and a computer storage medium, which can optimize the utilization rate of network resources in network topology while ensuring the transmission rate of data.
The technical scheme of the application is realized as follows:
The embodiment of the application provides a data transmission method, which is applied to a source node in network topology and comprises the following steps:
Acquiring congestion identification of a shortest path between the source node and a destination node in the network topology;
When the congestion identification indicates that congestion occurs in the shortest path, selecting a target path from other paths except the shortest path in paths between the source node and the destination node;
and transmitting the data packet to be transmitted to the destination node by utilizing the target path.
The embodiment of the application provides a data transmission device, which is a source node of network topology, comprising:
An obtaining module, configured to obtain a congestion identifier of a shortest path between the source node and a destination node in the network topology;
A selecting module, configured to select a target path from paths other than the shortest path in paths between the source node and the destination node when the congestion identifier indicates that congestion occurs in the shortest path;
And the transmission module is used for transmitting the data packet to be transmitted to the destination node by utilizing the target path.
The embodiment of the application provides an electronic device, which is a source node of network topology, comprising:
A processor and a storage medium storing instructions executable by the processor, the storage medium performing operations in dependence upon the processor through a communication bus, the instructions, when executed by the processor, performing the data transmission method described in one or more embodiments above.
Embodiments of the present application provide a computer storage medium storing executable instructions that, when executed by one or more processors, perform a data transmission method as described in one or more embodiments.
The embodiment of the application provides a data transmission method, a device, electronic equipment and a computer storage medium, wherein the method is applied to a source node in network topology and comprises the steps of acquiring congestion identifications of shortest paths between the source node and a destination node in the network topology, selecting a target path from other paths except the shortest paths in the paths between the source node and the destination node when the congestion identifications indicate congestion, and transmitting a data packet to be transmitted to the destination node by using the target path, namely, in the embodiment of the application, determining whether the shortest path is congested by using the congestion identifications of the shortest paths between the source node and the destination node, and transmitting the data to be transmitted by using the target path selected from the paths except the shortest paths in the paths between the source node and the destination node if congestion occurs, so that the transmission pressure on the shortest paths is relieved, the other paths are fully utilized by resources, and the phenomenon that network resources are unreasonably utilized when the data is transmitted in the network topology is avoided, thereby optimizing network resources in the network topology.
Drawings
Fig. 1 is a schematic flow chart of an alternative data transmission method according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of an example of an alternative network topology according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an alternative data transmission device according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an alternative electronic device 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 accompanying drawings in the embodiments of the present application.
An embodiment of the present application provides a data transmission method, where the method is applied to a source node in a network topology, and fig. 1 is a schematic flow diagram of an optional data transmission method provided by the embodiment of the present application, as shown in fig. 1, where the data transmission may include:
s101, acquiring congestion identification of a shortest path between a source node and a destination node in network topology;
at present, for network topology, the shortest path is generally selected to transmit data, however, when the amount of data transmitted is relatively large, the transmission efficiency of the shortest path will be reduced, if only the shortest path is used to transmit data at this time, the transmission efficiency of the data will be affected, and other paths of the network topology will be idle, resulting in waste of resources.
In order to improve the data transmission efficiency and optimize the resources in the network topology, in the embodiment of the present application, the transmission efficiency of the shortest path needs to be monitored, where, for each node in the network topology, when the node is used as a source node, a congestion identifier of the shortest path from the source node to the destination node is set, where, the shortest path from the source node to the destination node is a path corresponding to the minimum value of the cost values in all paths from the source node to the destination node, and the congestion identifier from the source node to the destination node is used to characterize the data transmission situation of the shortest path from the source node to the destination node, which may include congestion occurrence and congestion non-occurrence, and of course, the specific situations of congestion occurrence may also be classified, for example, the degree of congestion occurrence may be classified into severe, moderate, slight, and so on.
Further, the congestion identification may be determined by using the amount of data sent by the source node in unit time, the type of data sent in unit event, the number of packet loss in unit event, or the like, which is not specifically limited in the embodiment of the present application.
The network topology may be a network topology implemented by a heterogeneous networking technology, or may be a network topology implemented by a wireless fidelity (WIRELESS FIDELITY, wi-Fi) technology, which is not particularly limited in this aspect of the present application.
In addition, the network nodes in the network topology, such as the source node, the destination node and the intermediate node according to the embodiments of the present application, may be devices in the network topology, where the devices may be terminal devices, such as smart phones, smart televisions, smart speakers, and may also be routing devices, such as routers.
To more accurately determine whether congestion is occurring on the shortest path, in an alternative embodiment, S101 may include:
Acquiring the data quantity and the transmission time of a data packet transmitted by using the shortest path;
Calculating to obtain a transmission rate by using the data quantity and the transmission time;
the transmission rate is determined as the congestion identification.
It can be understood that, after obtaining a response message of a destination node for a transmitted data packet, a source node may obtain a receiving time of the data packet reaching the destination node from the response message, so as to obtain a transmission time of the data packet, divide a data volume of the transmitted data packet by the transmission time, so as to calculate a transmission rate, determine the transmission rate as a congestion identifier, and determine whether congestion occurs in a shortest path according to the transmission rate, so that the source node can know a congestion condition of data transmission on the shortest path, so as to determine a target path for data to be transmitted.
Of course, a test data packet may be set, through which the data amount and the transmission time of the transmission from the source node to the destination node may be determined, and then the transmission rate of the test data packet may be calculated, where the transmission rate may reflect the transmission rate of the shortest path, and the embodiment of the present application is not limited in detail.
S102, when congestion identification indicates that congestion occurs in a shortest path, selecting a target path from other paths except the shortest path in paths between a source node and a destination node;
here, after the congestion identifier is obtained, it is required to determine the congestion identifier, and when it is determined that the congestion identifier indicates that the shortest path is congested, it is indicated that the transmission efficiency is low when data is transmitted on the shortest path at this time, so that, in order not to affect the transmission efficiency of the data, and make full use of resources in the network topology, a target path is selected from paths between the source node and the destination node, except for the shortest path, where the paths between the source node and the destination node refer to all optional paths between the source node and the destination node, and obviously, all optional paths include the shortest path.
In this way, the data to be transmitted is transmitted by using other paths except the shortest path in the paths between the source node and the destination node, so that the data transmission efficiency can be improved, and the resources in the network topology are optimized.
For congestion identified as a transmission rate, in an alternative embodiment, the method further comprises:
When the transmission rate is smaller than a preset transmission rate threshold value, determining that congestion identification indicates that congestion occurs in the shortest path;
And when the transmission rate is larger than a preset transmission rate threshold value, determining that the congestion identification indicates that congestion occurs in the shortest path.
It can be understood that, after the transmission rate is obtained, since a preset transmission rate threshold is preset in the source node, the transmission rate threshold is a critical value of whether congestion occurs in the shortest path, when the transmission rate is smaller than the preset transmission rate threshold, it is indicated that the transmission rate of the shortest path from the source node to the destination node is lower at this time, congestion can be determined in the shortest path, and when the transmission rate is greater than the preset transmission rate threshold, it is indicated that congestion does not occur in the shortest path at this time, so as to determine whether congestion occurs in the shortest path.
In addition, it should be noted that, when the transmission rate is equal to the preset transmission rate threshold, it may be determined that congestion occurs in the shortest path, or it may be determined that congestion does not occur in the shortest path, where the embodiment of the present application is not limited in particular.
Additionally, in an alternative embodiment, the method may further include, for a case where the congestion identifier indicates that the shortest path is not congested:
when the congestion identification indicates that congestion does not occur on the shortest path, the shortest path is determined to be the target path.
It will be appreciated that when the congestion flag indicates that the shortest path is not congested, that is, the ability to transmit data on the shortest path is still acceptable, the shortest path is determined as the target path, that is, the shortest path is still used to transmit data to be transmitted, so that the transmission rate is guaranteed.
The candidate paths may be all paths from the source node to the destination node, or may be part of paths from the source node to the destination node, which is not particularly limited in the embodiment of the present application.
To determine the candidate path to increase the data transmission rate, in an alternative embodiment, S102 may include:
When the congestion identification indicates that the shortest path is congested, selecting a path to be selected from a path between a source node and a destination node;
and selecting a target path from other paths except the shortest path in the paths to be selected.
Here, the paths between the source node and the destination node are determined first, and then the paths to be selected are selected from the paths between the source node and the destination node, wherein the intermediate nodes of any two paths in the paths to be selected are not coincident, and the paths to be selected include the shortest paths, and the intermediate nodes of any two paths refer to nodes except the source node and the destination node in the paths between the source node and the destination node, that is, the paths to be selected include not only the shortest paths, but also the intermediate nodes of any two paths are different in the paths to be selected, so that congestion of the target paths caused by coincidence of the intermediate nodes in the target paths can be prevented, and the phenomenon that the data transmission efficiency cannot be improved even if the target paths are adopted can be prevented.
In addition, when selecting the target path, paths with different priority levels may be selected for different data to be transmitted, where the priority level of each path in the paths to be selected needs to be determined, in order to determine the priority level of each path more reasonably, in an optional embodiment, the method further includes:
determining a cost value of each path in the paths to be selected;
And determining the priority level of each path according to the cost value of each path, wherein the cost value of each path is positively correlated with the priority level of each path.
It will be appreciated that the cost value of each path in the paths to be selected may be determined first, and then the priority level of each path may be determined according to the cost value of each path, so that the cost value of each path and the priority level of each path have a positive correlation.
For example, three sections are set, and when the cost value of the path to be selected falls into a first section, the priority level is determined to be high, when the cost value of the path to be selected falls into a second section, the priority level is determined to be medium, and when the cost value of the path to be selected falls into a third section, the priority level is determined to be low, wherein the first section is positioned on the right of the second section and the second section is positioned on the right of the third section with respect to the coordinate axis of the cost value, in addition, the priority level of the path corresponding to the larger cost value arranged in front is determined to be high, the priority level of the path corresponding to the cost value arranged in the middle is determined to be medium, and the priority level of the path corresponding to the smaller cost value arranged in the rear is determined to be low.
Therefore, the priority level of each path can be determined by the mode, and the determination of the target path for the data to be transmitted is facilitated, so that the data transmission rate is ensured and the resources of the network topology are optimized.
In order to select an appropriate target path for the data to be transmitted to guarantee the transmission rate and optimize the resources of the network topology, in an alternative embodiment, S102 may include:
And selecting a target path from other paths except the shortest path in the paths to be selected based on the type of the data packet to be transmitted.
Here, the type of the data packet to be transmitted may be determined first, and the destination path may be selected based on the type of the data packet to be transmitted, so that the selected destination path is closely related to the type of the data packet to be transmitted, which is beneficial to the transmission of the data packet to be transmitted.
Further, in order to achieve transmission of data packets to be transmitted for different types, so as to ensure the transmission rate and optimize resources at the same time, in an alternative embodiment, selecting a target path from paths other than the shortest path in the paths to be selected based on the type of the data packets to be transmitted includes:
when the type of the data packet to be transmitted is a video data packet, determining the paths with high priority levels in other paths except the shortest path in the paths to be selected as target paths;
When the type of the data packet to be transmitted is an audio data packet, determining the paths with priority levels being in other paths except the shortest path in the paths to be selected as target paths;
and when the type of the data packet to be transmitted is a file type data packet, determining the paths with low priority levels in other paths except the shortest path in the paths to be selected as target paths.
It can be understood that the types of the data packets to be transmitted can be classified into three types, namely, video type data packets, audio type data packets and file type data packets, and in general, the video type data packets affect the experience of users, so when the types of the data packets to be transmitted are video type data packets, paths with high priority levels in other paths except the shortest path in the paths to be selected are determined as target paths, that is, paths with high priority levels are selected from the other paths to transmit the video type data packets, thereby ensuring the transmission rate of data, preventing the occurrence of a clamping phenomenon in the playing process of video, and simultaneously making full use of resources of network topology.
When the type of the data packet to be transmitted is the audio data packet, the paths with the priority level being the shortest paths among the paths to be selected are determined as target paths, that is, the paths with the priority level being the middle are selected from the other paths to transmit the audio data packet, so that the audio data packet can be quickly transmitted, and the resources of the network topology can be fully utilized.
In addition, when the type of the data packet to be transmitted is the file data packet, the path with the low priority level in the paths except the shortest path in the paths to be selected is determined as the target path, that is, the path with the low priority level is selected from the other paths to transmit the audio data packet, so that the longer path is utilized to transmit the audio data packet, and the resources of the network topology are fully utilized.
In this way, different types of data to be transmitted are transmitted by using paths with different priority levels, so that resources in the network topology are optimized while the transmission rate of the data is ensured.
In addition, in order to select an appropriate target path for the data to be transmitted, to ensure the transmission rate and optimize the resources of the network topology, in an alternative embodiment, S102 may include:
Acquiring a priority level of a data packet to be transmitted;
And selecting a target path from other paths except the shortest path in the paths to be selected based on the priority level of the data packet to be transmitted.
It can be appreciated that the priority level of the data packet to be transmitted is determined first, and the target path is selected based on the determined priority level of the data packet to be transmitted, so that the data packets to be transmitted with different priority levels can be transmitted by adopting the paths with corresponding priority levels.
Here, in order to obtain the priority level of the data packet to be transmitted, the priority level of the data packet to be transmitted may be determined according to a preset rule, or the priority level of the data packet to be transmitted may be set by the user according to the own requirement, which is not particularly limited in the embodiment of the present application.
Further, to select the target path based on the priority level of the data to be transmitted, in an alternative embodiment, selecting the target path from paths other than the shortest path among the paths to be selected based on the priority level of the data packet to be transmitted includes:
When the priority level of the data packet to be transmitted is high, determining the paths with high priority levels in other paths except the shortest path in the paths to be selected as target paths;
When the priority level of the data packet to be transmitted is the middle, determining the paths with the middle priority level in other paths except the shortest path in the paths to be selected as target paths;
And when the priority level of the data packet to be transmitted is low, determining the paths with low priority levels in other paths except the shortest path in the paths to be selected as target paths.
It will be appreciated that when the priority level of a packet to be transmitted is high, the packet is considered to be a relatively important packet, so that a path with a high priority level out of other paths except the shortest path among the paths to be selected is determined as a target path, that is, a path with a high priority level is selected from the other paths to transmit the packet with a high priority level, so that the packet with a high priority level is ensured to be transmitted to a destination node at a relatively high transmission rate, and resources in the network topology are optimized.
When the priority level of the data packet to be transmitted is middle, the data packet is considered to be a general important data packet, so that the paths with the middle priority level in other paths except the shortest path in the paths to be selected are determined as target paths, namely, the paths with the middle priority level are selected from the other paths to transmit the data packet with the middle priority level, thereby ensuring that the data packet with the middle priority level is transmitted to a destination node at a moderate transmission rate, and simultaneously optimizing resources in the network topology.
When the priority level of the data packet to be transmitted is low, the data packet is considered to be a common data packet, so that the paths with low priority level in other paths except the shortest path in the paths to be selected are determined as target paths, that is, the paths with low priority level are selected from the other paths to transmit the data packet with low priority level, thereby ensuring that the data packet with low priority level can be transmitted to the destination node, and optimizing resources in the network topology.
And S103, transmitting the data packet to be transmitted to a destination node by utilizing the target path.
After the target path is selected, the data packet to be transmitted can be transmitted to the target node by using the target path, so that the data packet to be transmitted is transmitted by using the target path, the transmission rate of the data packet can be ensured, the resources in the network topology can be optimized, and the utilization rate of the resources can be improved.
The data transmission method in one or more of the above embodiments is described below by way of example.
Fig. 2 is a schematic structural diagram of an example of an alternative network topology provided in an embodiment of the present application, as shown in fig. 2, a Source Node is Node1 (Node 1), a destination Node is Node3 (Node 3), and intermediate nodes include Node2 (Node 2), node4 (Node 4), node5 (Node 5), node6 (Node 6), node7 (Node 7) and Node8 (Node 8).
Wherein the cost value between Node1 and Node2 is cost2, the cost value between Node2 and Node3 is cost1, the cost value between Node1 and Node4 is cost1, the cost value between Node4 and Node5 is cost5, the cost value between Node2 and Node5 is cost1, the cost value between Node5 and Node3 is cost3, the cost value between Node4 and Node7 is cost3, the cost value between Node7 and Node8 is cost6, the cost value between Node5 and Node8 is cost2, the cost value between Node8 and Node6 is cost6, the cost value between Node6 and Node3 is cost6, and the cost value between Node1 and Node7 is cost6.
When data is transmitted between the Node1 and the Node3, firstly judging whether congestion occurs in the transmission of the Node1- > Node2- > Node3 on the shortest path between the Node1 and the Node3, calculating congestion by using a transmission rate, calculating the transmission rate by using a formula of transmission rate=transmission data amount/transmission time, and when the transmission rate is smaller than a preset transmission rate threshold value, considering that the multi-task transmission between the Node1- > Node2- > Node3 is congested, and starting priority routing path searching.
The priority routing path search traverses the network topology structure, generates priority paths of each level according to cost values, and eliminates intermediate nodes contained in the priority paths of the higher level when searching the priority routing paths in order to avoid the influence on the transmission of the nodes of the paths of the higher priority.
For example, based on the topology of fig. 2, 3 paths with different priorities may be generated, in order:
The shortest path is Node1- > Node2- > Node3, and the priority level is high;
a secondary short path, node1- > Node4- > Node5- > Node3, and the priority level is the middle;
The secondary short path is Node1- > Node7- > Node8- > Node6- > Node3, and the priority level is low.
Therefore, the generated series of priority routing paths can be combined with the priority ordering of tasks, the priority routing paths can be adjusted to be used for the high-level priority tasks in the case of congestion, the priority routing paths are used for the lower-level priority tasks, and therefore the whole topological network path resource nodes are used, the purpose of maximizing the path resource use is achieved, and meanwhile the high-level priority tasks can be timely executed by the high-level priority routing paths.
In addition, the priority level of the task can be defined and input according to the scene when the task starts transmission, for example, the priority level of the transmission definition of the video data packet is higher than the priority level of the file data packet transmission, so that when congestion occurs, the file data packet can be adjusted to be transmitted through a secondary short path, and the quality of network transmission can be improved because one more path is added.
In the example, when the multi-task transmission is congested, the transmission task of the secondary priority level is put on the secondary short-circuit route for transmission through the calculation of the multi-level weight route, so that the transmission quality of network data is improved.
The embodiment of the application provides a data transmission method which is applied to a source node in network topology and comprises the steps of acquiring congestion identification of a shortest path between the source node and a destination node in the network topology, selecting a target path from other paths except the shortest path in the paths between the source node and the destination node when congestion identification indicates congestion of the shortest path, and transmitting a data packet to be transmitted to the destination node by using the target path, namely, in the embodiment of the application, determining whether the shortest path is congested by using the congestion identification of the shortest path between the source node and the destination node, and transmitting the data to be transmitted by using the target path selected from the other paths except the shortest path in the paths between the source node and the destination node if congestion occurs, so that transmission pressure on the shortest path is relieved, the other paths are fully utilized by resources, the phenomenon that network resources are unreasonably utilized when the data is transmitted in the network topology is avoided, and network resources in the network topology are optimized.
Based on the same inventive concept as the foregoing embodiments, an embodiment of the present application provides a data transmission device, where the data transmission device is a source node of a network topology, and fig. 3 is a schematic structural diagram of an alternative data transmission device provided by the embodiment of the present application, and as shown in fig. 3, the data transmission device includes:
an obtaining module 31, configured to obtain a congestion identifier of a shortest path between a source node and a destination node in a network topology;
A selecting module 32, configured to select a target path from paths other than the shortest path among paths between the source node and the destination node when the congestion identifier indicates that congestion occurs in the shortest path;
The transmission module 33 is configured to transmit the data packet to be transmitted to the destination node by using the target path.
In an alternative embodiment, the selecting module 32 is specifically configured to:
when congestion identification indicates that congestion occurs in the shortest path, selecting a path to be selected from paths between a source node and a destination node, wherein intermediate nodes of any two paths in the path to be selected are not overlapped;
and selecting a target path from other paths except the shortest path in the paths to be selected.
In an alternative embodiment, the data transmission device is further configured to:
determining a cost value of each path in the paths to be selected;
And determining the priority level of each path according to the cost value of each path, wherein the cost value of each path is positively correlated with the priority level of each path.
In an alternative embodiment, the obtaining module 31 is specifically configured to:
Acquiring the data quantity and the transmission time of a data packet transmitted by using the shortest path;
Calculating to obtain a transmission rate by using the data quantity and the transmission time;
the transmission rate is determined as the congestion identification.
In an alternative embodiment, the data transmission device is further configured to:
When the transmission rate is smaller than a preset transmission rate threshold value, determining that congestion identification indicates that congestion occurs in the shortest path;
And when the transmission rate is larger than a preset transmission rate threshold value, determining that the congestion identification indicates that congestion occurs in the shortest path.
In an alternative embodiment, the selecting module 32 is specifically configured to:
And selecting a target path from other paths except the shortest path in the paths to be selected based on the type of the data packet to be transmitted.
In an alternative embodiment, the selecting module 32 selects, based on the type of the data packet to be transmitted, a target path from paths other than the shortest path among the paths to be selected, including:
when the type of the data packet to be transmitted is a video data packet, determining the paths with high priority levels in other paths except the shortest path in the paths to be selected as target paths;
When the type of the data packet to be transmitted is an audio data packet, determining the paths with priority levels being in other paths except the shortest path in the paths to be selected as target paths;
and when the type of the data packet to be transmitted is a file type data packet, determining the paths with low priority levels in other paths except the shortest path in the paths to be selected as target paths.
In an alternative embodiment, the selecting module 32 is specifically configured to:
Acquiring a priority level of a data packet to be transmitted;
And selecting a target path from other paths except the shortest path in the paths to be selected based on the priority level of the data packet to be transmitted.
In an alternative embodiment, the selecting module 32 selects, based on the priority level of the data packet to be transmitted, a target path from paths other than the shortest path among the paths to be selected, including:
When the priority level of the data packet to be transmitted is high, determining the paths with high priority levels in other paths except the shortest path in the paths to be selected as the target paths;
When the priority level of the data packet to be transmitted is the middle, determining the paths with the middle priority level in other paths except the shortest path in the paths to be selected as target paths;
And when the priority level of the data packet to be transmitted is low, determining the paths with low priority levels in other paths except the shortest path in the paths to be selected as target paths.
In an alternative embodiment, the network node is further adapted to:
when the congestion identification indicates that congestion does not occur on the shortest path, the shortest path is determined to be the target path.
In practical applications, the acquiring module 31, the selecting module 32, and the transmitting module 33 may be implemented by a processor located on a network node, specifically, a central Processing unit (CPU, central Processing Unit), a microprocessor (MPU, microprocessor Unit), a digital signal processor (DSP, digital Signal Processing), or a field programmable gate array (FPGA, field Programmable GATE ARRAY), etc.
Fig. 4 is a schematic structural diagram of another alternative network node provided by an embodiment of the present application, and as shown in fig. 4, an embodiment of the present application provides a network node 400, including:
a processor 41 and a storage medium 42 storing instructions executable by the processor 41, the storage medium 42 performing operations in dependence on the processor 41 through a communication bus 43, the instructions, when executed by the processor 41, performing the data transmission method performed in one or more embodiments described above.
In practical use, the components in the terminal are coupled together via the communication bus 43. It is understood that the communication bus 43 is used to enable connected communication between these components. The communication bus 43 includes a power bus, a control bus, and a status signal bus in addition to the data bus. But for clarity of illustration the various buses are labeled as communication bus 43 in fig. 4.
Embodiments of the present application provide a computer storage medium storing executable instructions that, when executed by one or more processors, perform the data transmission method as described in the control apparatus of one or more embodiments above.
The computer readable storage medium may be a magnetic random access Memory (ferromagnetic random access Memory, FRAM), read Only Memory (ROM), programmable Read Only Memory (Programmable Read-Only Memory, PROM), erasable programmable Read Only Memory (Erasable Programmable Read-Only Memory, EPROM), electrically erasable programmable Read Only Memory (ELECTRICALLY ERASABLE PROGRAMMABLE READ-Only Memory, EEPROM), flash Memory (Flash Memory), magnetic surface Memory, optical disk, or Read Only optical disk (Compact Disc Read-Only Memory, CD-ROM), etc.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, magnetic disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the present application.
Claims (11)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211095654.8A CN116320068B (en) | 2022-09-05 | 2022-09-05 | A data transmission method, apparatus, electronic device, and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211095654.8A CN116320068B (en) | 2022-09-05 | 2022-09-05 | A data transmission method, apparatus, electronic device, and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116320068A CN116320068A (en) | 2023-06-23 |
| CN116320068B true CN116320068B (en) | 2026-01-30 |
Family
ID=86782073
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211095654.8A Active CN116320068B (en) | 2022-09-05 | 2022-09-05 | A data transmission method, apparatus, electronic device, and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116320068B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116760763B (en) * | 2023-08-16 | 2024-01-09 | 苏州浪潮智能科技有限公司 | Link switching method, device, computing system, electronic equipment and storage medium |
| CN116760761B (en) * | 2023-08-16 | 2023-10-13 | 摩尔线程智能科技(北京)有限责任公司 | Path creation method, data processing system, controller, storage medium |
| CN117097661B (en) * | 2023-10-18 | 2024-02-20 | 苏州元脑智能科技有限公司 | Data packet forwarding method and device, storage medium and electronic equipment |
| CN118175111B (en) * | 2024-04-16 | 2024-11-19 | 中昊芯英(杭州)科技有限公司 | Data transmission method, DMA controller, equipment and storage medium |
| CN119835214B (en) * | 2024-12-18 | 2025-10-21 | 深圳开鸿数字产业发展有限公司 | Distributed data transmission method, device, equipment, medium and product |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113347083A (en) * | 2021-05-31 | 2021-09-03 | 北京字跳网络技术有限公司 | Network path determination and switching method, device, equipment, medium and program product |
| CN113438163A (en) * | 2021-05-29 | 2021-09-24 | 中国人民解放军空军工程大学 | Data center network mixed flow routing method and system based on path isolation |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107959633B (en) * | 2017-11-18 | 2021-04-23 | 浙江工商大学 | A Price Mechanism-Based Multipath Load Balancing Method in Industrial Real-Time Networks |
| CN108768713A (en) * | 2018-05-09 | 2018-11-06 | 西安工业大学 | A kind of guarantee QoS dynamic routing algorithms in SDN |
| US10986017B2 (en) * | 2018-08-23 | 2021-04-20 | Agora Lab, Inc. | Large-scale real-time multimedia communications |
| CN114844836A (en) * | 2021-01-30 | 2022-08-02 | 华为技术有限公司 | Method, device and equipment for processing network congestion |
-
2022
- 2022-09-05 CN CN202211095654.8A patent/CN116320068B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113438163A (en) * | 2021-05-29 | 2021-09-24 | 中国人民解放军空军工程大学 | Data center network mixed flow routing method and system based on path isolation |
| CN113347083A (en) * | 2021-05-31 | 2021-09-03 | 北京字跳网络技术有限公司 | Network path determination and switching method, device, equipment, medium and program product |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116320068A (en) | 2023-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116320068B (en) | A data transmission method, apparatus, electronic device, and computer storage medium | |
| US9258212B2 (en) | Supporting arbitrary routing criteria in software defined networks | |
| CN109802997B (en) | Node equipment selection method and related equipment thereof | |
| WO2018152919A1 (en) | Path selection method and system, network acceleration node, and network acceleration system | |
| US11252078B2 (en) | Data transmission method and apparatus | |
| US10412182B2 (en) | Communication speed estimation apparatus, communication speed estimation method, and program | |
| CN105099908A (en) | Path calculating method, message responding method and related equipment | |
| CN112511230B (en) | Optimal optical fiber path selection method and device | |
| CN115460131A (en) | Path selection method, device, system and storage medium | |
| CN111083050A (en) | Data stream transmission method and device based on software defined network | |
| CN112615780A (en) | Method and device for determining alternative path of data flow in SDN network | |
| CN112737940A (en) | Data transmission method and device | |
| CN117439951A (en) | Data stream transmission method, device, network equipment and storage medium | |
| CN113452758A (en) | Service access method and device | |
| CN108737264B (en) | Data transmission method and device | |
| CN113852554B (en) | Data transmission method, device and equipment | |
| Bikas et al. | Improving QoE with genetic algorithm-based path selection for MPTCP | |
| US9774515B2 (en) | Router and resource assignment method thereof | |
| CN112600753B (en) | Equipment node communication path selection method and device according to equipment access amount | |
| JP2016122960A (en) | Management system, network management method, network system | |
| CN115174480A (en) | Load balancing method, device, equipment and readable storage medium | |
| CN119276773A (en) | Network path selection method, device, network equipment, medium and program product | |
| CN117729602A (en) | Link switching control method and device | |
| CN115695203B (en) | Data transmission method and device, electronic equipment and computer storage medium | |
| CN116418891A (en) | Data transmission method, device, medium and computer equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |