Data communication method and system, electronic equipment and storage medium

Abstract

The invention relates to the technical field of communication, and discloses a data communication method and system, electronic equipment and a storage medium, and the method comprises the steps: obtaining communication condition information of a plurality of to-be-transmitted data streams and a current reward matrix of a preset deterministic network; for any data stream, screening a target communication path from a preset deterministic network according to the communication condition information of the data stream and the current comprehensive communication performance among the communication nodes in the preset deterministic network represented by the current reward matrix; iteratively updating the current reward matrix according to the communication requirement of the data flow on the target communication path; and transmitting the data stream based on the target communication path. The current reward matrix of the preset deterministic network is determined, and the target communication path is screened for the data stream according to the current reward matrix, so that the accuracy of the screening result of the target communication path is ensured, the determination efficiency of the target communication path is improved, and a foundation is laid for improving the communication efficiency of the deterministic network to the data stream.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a data communication method, system, electronic device and storage medium. Background Art

[0002] With the rapid development of technologies such as cloud computing, artificial intelligence, and communications, deterministic networks have become a key technology supporting high-quality development across various industries. Deterministic networks provide deterministic services for deterministic data streams, ensuring high-quality transmission of these data streams over communication paths within the deterministic network. Therefore, how to select communication paths for data streams within deterministic networks has become a key research topic in deterministic network data communications.

[0003] In related technologies, an integer linear programming model is usually used to search the global solution space based on constraints such as the delay and bandwidth of data stream transmission to select the optimal routing path.

[0004] However, when the deterministic network topology is complex, the integer linear programming model will take a lot of time to search the global solution space, which reduces the efficiency of determining the communication path and is not conducive to ensuring the communication efficiency of the deterministic network for data flow. Summary of the Invention

[0005] The present application provides a data communication method, system, electronic device and storage medium to address the defects of related technologies, such as reducing the efficiency of determining communication paths, which is not conducive to ensuring the communication efficiency of deterministic networks for data streams.

[0006] A first aspect of the present application provides a data communication method, comprising: Obtaining communication condition information of multiple data streams to be transmitted and a current reward matrix of a preset deterministic network; For any of the data flows, selecting a target communication path from the preset deterministic network based on the communication condition information of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix; Iteratively updating the current reward matrix according to the communication demand of the data flow on the target communication path; The data stream is transmitted based on the target communication path.

[0007] In an optional implementation, the communication condition information includes priorities, flow sizes, target delays, source nodes, and destination nodes of multiple data flows to be transmitted.

[0008] In an optional embodiment, obtaining communication condition information of multiple data streams to be transmitted and a current reward matrix of a preset deterministic network includes: Obtaining an initial reward matrix of the preset deterministic network, where the initial reward matrix is ​​used to characterize connectivity between communication nodes of the preset deterministic network; The reward values ​​in the initial reward matrix are adjusted according to the communication delay between each communication node in the preset deterministic network to obtain a current reward matrix of the preset deterministic network.

[0009] In an optional implementation, the communication requirement includes a bandwidth occupancy requirement, and the iteratively updating the current reward matrix according to the communication requirement of the data flow on the target communication path includes: Determining a communication bandwidth threshold between each communication node according to the communication bandwidth between each communication node in the target communication path; For any of the data flows, determining a target reward value between the communication nodes based on the bandwidth occupation requirement of the data flow on the target communication path represented by the communication condition information of the data flow and a communication bandwidth threshold between the communication nodes; The current reward matrix is ​​iteratively updated according to the target reward value between each of the communication nodes.

[0010] In an optional embodiment, determining the target reward value between each of the communication nodes based on the bandwidth occupation requirement of the data flow on the target communication path represented by the communication condition information of the data flow and the communication bandwidth threshold between each of the communication nodes includes: determining a bandwidth occupancy requirement of the data flow on the target communication path according to a flow size of the data flow represented by the communication condition information of the data flow; The target reward value between each of the communication nodes is determined according to the bandwidth occupation requirement of the data flow on the target communication path and the communication bandwidth threshold between each of the communication nodes.

[0011] In an optional embodiment, determining the target reward value between the communication nodes based on the bandwidth occupation requirement of the data flow on the target communication path and the communication bandwidth threshold between the communication nodes includes: The first target reward value between the communication nodes is determined based on the following formula:

[0012] in, Represents a communication node Communication nodes The target reward value between Communication node representing the current reward matrix representation before update Communication nodes The current reward value between Represents a communication node Communication nodes The communication bandwidth between Represents a communication node Communication nodes The communication bandwidth threshold between Indicates the preset communication bandwidth utilization threshold. Representing data flow The bandwidth occupation requirement of the target communication path, Indicates the total number of data streams to be transmitted, Representing data flow Whether the target communication path includes the communication node Communication nodes The path between Representing data flow The target communication path includes communication nodes Communication nodes The path between Representing data flow The target communication path does not include the communication node Communication nodes The path between.

[0013] In an optional embodiment, the selecting a target communication path from the preset deterministic network based on the communication condition information of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix includes: determining a communication order of each of the data flows according to a priority represented by the communication condition information of the data flows; Determining communication constraints of the data flows according to the number of communications of each data flow and the flow size, target delay, source node, and destination node represented by the communication condition information of the data flow; A target communication path is selected from the preset deterministic network according to the communication constraints of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix.

[0014] In an optional embodiment, the selecting a target communication path from the preset deterministic network based on the communication constraints of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix includes: According to the communication constraints of the data flow, screening a plurality of candidate communication paths that meet the communication constraints in the preset deterministic network; Determining the current comprehensive communication performance of each of the candidate communication paths according to the cumulative reward value of each of the candidate communication paths in the current reward matrix; A target communication path is screened from the candidate communication paths according to the current comprehensive communication performance of each of the candidate communication paths.

[0015] In an optional embodiment, the communication requirements include communication nodes included in the target communication path, and the method for iteratively updating the current reward matrix based on the communication requirements of the data flow for the target communication path includes: After determining the target communication path of any of the data flows, the current reward matrix is ​​first updated according to the communication nodes included in the target communication path to reduce the probability that other data flows with a lower priority than the data flow select the target communication path.

[0016] In an optional embodiment, the first updating of the current reward matrix according to the communication nodes included in the target communication path includes: The current reward matrix is ​​first updated based on the following formula:

[0017] in, Indicates the first updated communication node Communication nodes The reward value between Indicates the communication node before the first update Communication nodes The current reward value between Representing data flow Whether the target communication path includes the communication node Communication nodes The path between Representing data flow The target communication path includes communication nodes Communication nodes The path between Representing data flow The target communication path does not include the communication node Communication nodes The path between represents the update coefficient.

[0018] In an optional embodiment, the method further includes: After completing the transmission of any of the data flows, the current reward matrix is ​​secondly updated according to the communication nodes included in the target communication path to increase the probability that other data flows with a lower priority than the data flow and for which the target communication path has not been determined select the target communication path.

[0019] A second aspect of the present application provides a data communication device, comprising: an acquisition module, configured to acquire communication condition information of a plurality of data streams to be transmitted and a current reward matrix of a preset deterministic network; a screening module configured to screen, for any of the data flows, a target communication path from the preset deterministic network based on the communication condition information of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix; an updating module, configured to iteratively update the current reward matrix according to the communication demand of the data flow on the target communication path; The communication module is configured to transmit the data stream based on the target communication path.

[0020] A third aspect of the present application provides a data communication system, comprising: a preset deterministic network composed of a plurality of communication nodes and a control terminal; Based on the data communication method described in the first aspect and various possible designs of the first aspect, the control end transmits multiple data streams to be transmitted through the preset deterministic network to transmit each of the data streams to the destination node.

[0021] A fourth aspect of the present application provides an electronic device, comprising: at least one processor and a memory; The memory stores computer-executable instructions; The at least one processor executes the computer-executable instructions stored in the memory, so that the at least one processor performs the method described in the first aspect and various possible designs of the first aspect.

[0022] The fifth aspect of the present application provides a computer-readable storage medium, which stores computer-executable instructions. When a processor executes the computer-executable instructions, the method described in the first aspect and various possible designs of the first aspect is implemented.

[0023] The sixth aspect of the present application provides a computer program product, including computer instructions, which are used to enable a computer to execute the method described in the first aspect and various possible designs of the first aspect.

[0024] The technical solution of this application has the following advantages: The present application provides a data communication method, system, electronic device and storage medium, the method comprising: obtaining communication condition information of multiple data streams to be transmitted and the current reward matrix of a preset deterministic network; for any data stream, screening a target communication path from the preset deterministic network according to the communication condition information of the data stream and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix; iteratively updating the current reward matrix according to the communication requirements of the data stream for the target communication path; based on the target communication path, transmitting the data stream to the destination node. The method provided by the above scheme determines the current reward matrix of the preset deterministic network, and when the data stream to be transmitted is obtained, the target communication path is screened for the data stream according to the current reward matrix, while ensuring the accuracy of the target communication path screening result, the determination efficiency of the target communication path is improved, laying the foundation for improving the communication efficiency of the deterministic network for the data stream. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the following is a brief introduction to the drawings required for use in the embodiments or related technical descriptions. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0026] Figure 1 This is a schematic diagram of the network structure based on the embodiments of the present application; Figure 2 A flowchart of a data communication method provided in an embodiment of the present application; Figure 3 A schematic diagram of the structure of an exemplary preset deterministic network provided in an embodiment of the present application; Figure 4 A schematic diagram of the structure of a data communication device provided in an embodiment of the present application; Figure 5 A schematic diagram of the structure of a data communication system provided in an embodiment of the present application; Figure 6 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application.

[0027] The above drawings illustrate specific embodiments of the present application, which will be described in more detail below. These drawings and the textual description are not intended to limit the scope of the present disclosure in any way, but rather to illustrate the concepts of the present application to those skilled in the art by reference to specific embodiments. DETAILED DESCRIPTION

[0028] To make the purpose, technical solutions, and advantages of the embodiments of this application more clear, the technical solutions in the embodiments of this application will be clearly and completely described below in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0029] In addition, the terms "first," "second," etc. are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. In the description of the following embodiments, "plurality" means more than two, unless otherwise specifically defined.

[0030] In related technologies, a deterministic network (DetNet) refers to a network that provides deterministic services for deterministic flows (DetFlow) within a defined network topology. Deterministic networks were proposed because current networks often suffer from data congestion, high data transmission latency, and poor stability. For data with special requirements, current networks cannot provide high-quality data transmission services (QoS). Deterministic networks implement three concepts: resource reservation, explicit routing, and service protection to ensure high-quality services for certain data.

[0031] Under a defined network topology and deterministic flows, high-quality service is guaranteed for deterministic flows. Deterministic networks reserve bandwidth to ensure the transmission of this portion of traffic, preventing other flows from occupying it (resource reservation). The transmission path of deterministic flows is fixed and unchangeable (explicit routing). Furthermore, data transmission latency is guaranteed to be within a certain range (service protection).

[0032] Planning the transmission paths of multiple deterministic flows in a deterministic network is a key issue in deterministic networks. Currently proposed models include integer linear programming models, ant colony algorithm models, and gradient-based optimal solution models.

[0033] The integer linear programming model adds some constraints and uses linear programming to determine the optimal transmission path for the determined flow. This method essentially searches the global solution space and is less efficient.

[0034] Other algorithms, such as ant colony algorithms and genetic algorithms, perform well with small flows. However, as traffic increases, the algorithm complexity increases, leading to poor solution efficiency. Furthermore, if a new flow is added to the network, the algorithm must recalculate the optimal transmission path, indicating poor scalability.

[0035] In response to the above problems, an embodiment of the present application provides a data communication method, system, electronic device and storage medium, the method comprising: obtaining communication condition information of multiple data streams to be transmitted and the current reward matrix of a preset deterministic network; for any data stream, based on the communication condition information of the data stream and the current comprehensive communication performance between each communication node in the preset deterministic network represented by the current reward matrix, screening the target communication path from the preset deterministic network; iteratively updating the current reward matrix according to the communication requirements of the data stream for the target communication path; based on the target communication path, transmitting the data stream to the destination node. The method provided by the above scheme determines the current reward matrix of the preset deterministic network, and when the data stream to be transmitted is obtained, the target communication path is screened for the data stream according to the current reward matrix. While ensuring the accuracy of the target communication path screening result, the efficiency of determining the target communication path is improved, laying the foundation for improving the communication efficiency of the deterministic network for the data stream.

[0036] The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described in detail in some embodiments. The following describes the embodiments of the present invention in conjunction with the accompanying drawings.

[0037] First, the network structure on which this application is based is described: The data communication method, system, electronic device and storage medium provided in the embodiments of the present application are suitable for transmitting data streams based on a preset deterministic network after a control terminal such as a server obtains the data stream to be transmitted. Figure 1 The figure shows a schematic diagram of the network structure based on the embodiments of the present application, which mainly includes a control terminal and a deterministic network. The deterministic network is composed of multiple network communication devices such as routers and switches. After receiving the user's data stream to be transmitted, the host terminal determines the target communication path for transmitting the data stream in the deterministic network, transmits the data stream through the target communication path, and finally sends the data stream to the destination terminal through the destination communication device.

[0038] Embodiments of the present application provide a data communication method for selecting a target communication path in a preset deterministic network. The embodiment of the present application is performed by an electronic device, such as a server, a desktop computer, a laptop computer, a tablet computer, or other electronic device capable of selecting a target communication path in a preset deterministic network.

[0039] like Figure 2 FIG. 1 is a flow chart of a data communication method provided in an embodiment of the present application, the method comprising: Step 201: Acquire communication condition information of multiple data streams to be transmitted and a current reward matrix of a preset deterministic network.

[0040] The current reward matrix of the preset deterministic network includes reward values ​​between adjacent communication nodes in the preset deterministic network, and the reward values ​​are positively correlated with the communication performance between the communication nodes.

[0041] Specifically, in one embodiment, the priority, flow size, target delay, source node, and destination node of multiple data flows to be transmitted can be obtained; and communication condition information of the data flows can be determined based on the priority, flow size, target delay, source node, and destination node of the data flows. The communication condition information includes the priority, flow size, target delay, source node, and destination node of the multiple data flows to be transmitted.

[0042] For example, assume that four data streams to be transmitted are obtained this time, and assume that this deterministic network needs to optimize the paths of the four deterministic streams (data streams). For convenience, assume that the source address of each data stream is 1, and the data streams are numbered DF1, DF2, DF3, and DF4 respectively. Their communication condition information is shown in Table 1 below: Table 1

[0043] The unit of the flow size may be megabytes (M), and the target delay may be microseconds (μs).

[0044] Step 202 : For any data flow, a target communication path is selected from the preset deterministic network based on the communication condition information of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix.

[0045] Specifically, for any data flow, we can first determine the reachable communication path between the source node and the destination node based on the destination node represented by the communication condition information of the data flow, and then determine the communication constraints of the data flow based on the flow size and target delay of the data flow. Then, we can preliminarily screen the reachable communication paths according to the communication constraints. Finally, we can further screen the preliminary screening results based on the current comprehensive communication performance between each communication node in the preset deterministic network represented by the current reward matrix to obtain the target communication path.

[0046] Step 203: Iteratively update the current reward matrix according to the communication requirements of the data flow on the target communication path.

[0047] It should be noted that after the target communication path of any data stream is determined, the communication performance will be reduced because the target communication path will consume certain communication resources to transmit the data stream. In order to ensure the accuracy of the target communication path selection results of data streams with lower priority, each time the target communication path of a data stream is determined, the current reward matrix is ​​iteratively updated according to the communication requirements of the data stream for the target communication path to ensure that the current reward matrix matches the actual communication performance of the preset deterministic network.

[0048] Step 204: Transmit the data stream based on the target communication path.

[0049] It should be noted that the target communication path includes at least a source node and a destination node, and the data flow is sent from the source node to the destination node through the target communication path.

[0050] Based on the above embodiment, since the current reward matrix of the preset deterministic network will directly affect the accuracy of the determination result of the target communication path, as an implementable approach, in one embodiment, obtaining communication condition information of multiple data streams to be transmitted and the current reward matrix of the preset deterministic network includes: Step 2011: obtaining an initial reward matrix of a preset deterministic network, where the initial reward matrix is ​​used to characterize connectivity between communication nodes of the preset deterministic network; Step 2012: Adjust the reward values ​​in the initial reward matrix according to the communication delay between each communication node in the preset deterministic network to obtain the current reward matrix of the preset deterministic network.

[0051] For example, Figure 3 The figure shows a schematic diagram of the structure of an exemplary preset deterministic network provided in an embodiment of the present application, which represents a deterministic network with 6 nodes. Each link has a vector (a, b), where a represents the communication bandwidth of the link and b represents the communication delay of the link. The initial reward matrix of the preset deterministic network is shown in Table 2 below: Table 2

[0052] Among them, -1 is used to represent the link between two communication nodes being connected, and an extremely large value (-1000) is used to represent the link between two communication nodes being disconnected, indicating that it is impossible to select the line.

[0053] It's important to note that the target latency, as part of the data flow network's Quality of Service (QoS), primarily serves as a constraint on link selection for data flows. Specifically, the target latency of a data flow serves only to filter the target communication path for the data flow within the network. Paths exceeding the target latency should not be selected and are removed from the set of available paths. The greater the latency of a deterministic network link, the less likely the DF will select that path. Therefore, the link latency can be subtracted from the initial reward matrix. Specifically, the reward values ​​in the initial reward matrix can be adjusted based on the following formula.

[0054]

[0055] in, Represents the communication node in the current reward matrix Communication nodes The current reward value between Represents a communication node Communication nodes The communication delay between them is finally obtained, and the current reward matrix of the preset deterministic network is shown in Table 3 below: Table 3

[0056] Specifically, in one embodiment, to further improve the reliability of the preliminarily determined current reward matrix, a weighted fusion of multiple path characteristics can be employed to determine the reward value between each communication node. In addition to communication latency, path characteristics can also include packet loss rate, congestion status, and security.

[0057] The packet loss rate of a link reflects its stability. A low packet loss rate indicates a more reliable and stable link, making it suitable for transmitting important data. Rewards for links with high packet loss rates can be reduced to encourage the use of more stable paths. Some links may be congested due to excessive load, resulting in additional delays or even packet loss. Monitoring and dynamically adjusting rewards based on real-time congestion levels can improve the reliability of reward values ​​and avoid selecting links that are already busy. Furthermore, security and privacy protection are particularly important in certain application scenarios. Giving higher rewards to links that provide better security measures (such as encrypted transmission and access control) can help improve the security of data stream transmission.

[0058] Based on the above embodiment, in order to further improve the reliability of the current reward matrix of the preset determined network, as an implementable approach, in one embodiment, the communication requirements include bandwidth occupation requirements. Based on the communication requirements of the data flow for the target communication path, the current reward matrix is ​​iteratively updated, including: Step 2031, determining a communication bandwidth threshold between each communication node according to the communication bandwidth between each communication node in the target communication path; Step 2032: For any data flow, determine the target reward value between each communication node based on the bandwidth occupation requirement of the data flow on the target communication path represented by the communication condition information of the data flow and the communication bandwidth threshold between each communication node; Step 2033: Iteratively update the current reward matrix according to the target reward value between each communication node.

[0059] It should be noted that path selection in related technologies often only considers whether the latency and bandwidth meet the data flow requirements, but ignores the factor that excessive communication bandwidth occupancy of the communication node will affect the communication performance. In order to further improve the accuracy of the target communication path determination result, this application considers the bandwidth occupancy requirement of the data flow for the target communication path represented by the communication condition information of the data flow and the communication bandwidth threshold between each communication node, and iteratively updates the current reward matrix.

[0060] Among them, for any two adjacent communication nodes, if the communication bandwidth occupancy between the two communication nodes exceeds the communication bandwidth threshold, the communication performance of the link between the two communication nodes will be reduced, and the link should be avoided in the future to avoid overload.

[0061] Specifically, in one embodiment, the bandwidth occupation requirement of the data flow on the target communication path can be determined based on the flow size of the data flow represented by the communication condition information of the data flow; and the target reward value between each communication node can be determined based on the bandwidth occupation requirement of the data flow on the target communication path and the communication bandwidth threshold between each communication node.

[0062] The bandwidth occupation requirement of the data flow on the target communication path can be specifically quantified by its flow size, that is, the flow size of the data flow is equal to the bandwidth occupation requirement of the data flow on the target communication path.

[0063] Specifically, in one embodiment, the first target reward value between each communication node may be determined based on the following formula:

[0064] in, Represents a communication node Communication nodes The target reward value between Communication node representing the current reward matrix representation before update Communication nodes The current reward value between Represents a communication node Communication nodes The communication bandwidth between Represents a communication node Communication nodes The communication bandwidth threshold between Indicates the preset communication bandwidth utilization threshold. Representing data flow The bandwidth requirement of the target communication path, Indicates the total number of data streams to be transmitted, Representing data flow Whether the target communication path includes the communication node Communication nodes The path between Representing data flow The target communication path includes communication nodes Communication nodes The path between Representing data flow The target communication path does not include the communication node Communication nodes The path between.

[0065] in, , that is, when the link<i,j> When the total flow exceeds 80% of the link, the reward function will increase the negative value appropriately after each iteration to improve the link congestion by reducing DF's choice of this path.

[0066] On the basis of the above embodiment, in order to further improve the accuracy of the target communication path determination result, as an implementable approach, in one embodiment, based on the communication condition information of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix, the target communication path is screened from the preset deterministic network, including: Step 2021, determining the communication order of each data stream according to the priority represented by the communication condition information of the data stream; Step 2022: Determine the communication constraints of the data flows according to the number of communications of each data flow and the flow size, target delay, source node, and destination node represented by the communication condition information of the data flow. Step 2023 , based on the communication constraints of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix, a target communication path is selected from the preset deterministic network.

[0067] It should be noted that the communication constraints on data flow latency can be abstracted into the following expression: for M deterministic flows, the total latency of any flow m is within the target latency, that is:

[0068] in, is the communication path to be selected, Indicates the target delay of data flow m.

[0069] The communication constraints of data flow in terms of bandwidth can be abstracted as the following expression: for each link, the total flow number should not exceed its bandwidth, that is:

[0070] in, Represents a communication node Communication nodes The communication bandwidth between Representing data flow The bandwidth occupation requirement of the target communication path is Representing data flow The stream size.

[0071] Specifically, in one example, based on the communication constraints of the data flow, several candidate communication paths that meet the communication constraints can be screened in a preset deterministic network; based on the cumulative reward value of each candidate communication path in the current reward matrix, the current comprehensive communication performance of each candidate communication path can be determined; based on the current comprehensive communication performance of each candidate communication path, the target communication path can be screened from the candidate communication paths.

[0072] Specifically, a reward function can be formulated for each link based on the above two expressions: , that is, determining the current reward matrix of the preset deterministic network, the optimization goal of the target communication path is as follows:

[0073] That is, the candidate communication path with the largest cumulative reward value in the current reward matrix has better current comprehensive communication performance, so the candidate communication path with the highest cumulative reward value is selected as the target communication path.

[0074] Furthermore, in one embodiment, the communication requirements include the communication nodes included in the target communication path. After determining the target communication path of any data flow, the current reward matrix is ​​first updated based on the communication nodes included in the target communication path to reduce the probability that other data flows with a lower priority than the data flow select the target communication path.

[0075] It should be noted that the resulting data flows are transmitted in order of priority. During an iteration, after a deterministic flow m selects a transmission path, the reward function for that path can be appropriately increased in this iteration, i.e., the first update of the current reward matrix is ​​performed. This is done to reduce the probability of other flows choosing that path, thereby reducing congestion on the transmission path selected by high-priority flows and increasing network stability.

[0076] Specifically, in one embodiment, the current reward matrix may be first updated based on the following formula:

[0077] in, Indicates the first updated communication node Communication nodes The reward value between Indicates the communication node before the first update Communication nodes The current reward value between Representing data flow Whether the target communication path includes the communication node Communication nodes The path between Representing data flow The target communication path includes communication nodes Communication nodes The path between Representing data flow The target communication path does not include the communication node Communication nodes The path between represents the update coefficient, for example, .

[0078] Accordingly, in one embodiment, after the transmission of any data stream is completed, the current reward matrix can be secondly updated based on the communication nodes included in the target communication path to increase the probability that other data streams with a lower priority than the data stream and for which the target communication path has not been determined select the target communication path.

[0079] Specifically, performing a second update on the current reward matrix is ​​to restore the effect of the first update on the current reward matrix. The implementation principle is the same and will not be repeated here.

[0080] In order to facilitate those skilled in the art to better understand the method provided in the embodiments of the present application, the embodiments of the present application provide the following examples. Figure 3 Taking the deterministic network structure shown in the figure as an example, the starting reward matrix (current reward matrix) of the deterministic network is determined as shown in Table 4 below: Table 4

[0081] Nodes 1 and 2, 3 are directly connected, and the maximum reward function sum is obviously -1.2, -1.2. Node 4 is connected to 2, 3, and the reward function between 4 and 2 is small, so the path 1-2-4 is feasible, with a reward function of -2.35. Nodes 5 and 3, 4 are connected, similarly resulting in 1-3-5, with a reward function of -2.5. Node 6 is connected to 4, 5, resulting in 1-2-4-6, with a reward function of -3.65, as shown in Table 5. The reward function and the reward function sum both represent the cumulative reward value of the path (Note: The maximum reward function sum of the data flow DF with a lower priority should be calculated when selecting its path. This is convenient for introducing the calculation of the maximum reward function sum and the path selection method).

[0082] Table 5

[0083] According to the priority DF1, line 1-2 is selected and the reward function of line 1-2 is updated to -0.1. To facilitate understanding by those skilled in the art, this example only considers the first update of the current reward matrix, that is, the update table is shown in Table 6 below: Table 6

[0084] Furthermore, DF2 selects line 1-2-4, and links <1,2> ​​and <2,4> are increased by -0.1. The updated table is shown in Table 7 below: Table 7

[0085] Furthermore, at this point, the reward cumulative value for selecting path 1-3-4 to destination node 4 is determined to be 2.6. If there is a subsequent data flow with the destination node being node 4, path 1-3-4 will be selected. DF3 selects path 1-3-5, and links <1,3> and <3,5> increase by 0.1. That is, if after DF3, the destination communication path for node 4 is changed to 1-2-4, the updated table is shown in Table 8 below: Table 8

[0086] Furthermore, according to the updated table, it is determined that the path 1-2-4-6 corresponding to the destination node 6 is still the path with the smallest cumulative reward value, that is, DF4 is determined to select the route 1-2-4-6.

[0087] Specifically, in practical applications, the update of the first target reward value between each communication node will also be considered. DF1 passes through <1,2>, the total flow of DF1 is 4, and <1-2> increases the negative value of the reward function (6-0.8×6) / 6=0.02, that is, Similarly, for <1,3>, <2.4>, <5,6>, the reward function is increased by a negative value of 0, and for <3,5> by 0.009. This table is updated as shown in Table 9 below, and this is completed in one iteration.

[0088] Table 9

[0089] Furthermore, in order to further improve the generalization of the method provided in the embodiment of the present application, randomness can be added based on reinforcement learning logic, and the path with a larger cumulative reward value is more likely to be selected.

[0090] The data communication method provided by the embodiment of the present application obtains the communication condition information of multiple data streams to be transmitted and the current reward matrix of the preset deterministic network; for any data stream, based on the communication condition information of the data stream and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix, the target communication path is screened from the preset deterministic network; based on the communication requirements of the data stream for the target communication path, the current reward matrix is ​​iteratively updated; based on the target communication path, the data stream is transmitted to transmit the data stream to the destination node. The method provided by the above scheme determines the current reward matrix of the preset deterministic network. When the data stream to be transmitted is obtained, the target communication path is screened for the data stream according to the current reward matrix. While ensuring the accuracy of the target communication path screening result, the determination efficiency of the target communication path is improved, laying the foundation for improving the communication efficiency of the deterministic network for the data stream. In addition, by setting the reward function according to information such as network bandwidth, traffic delay and priority, the reliability of the current reward matrix is ​​improved, thereby further improving the accuracy of the target communication path determination result.

[0091] An embodiment of the present application provides a data communication device for executing the data communication method provided in the above embodiment.

[0092] like Figure 4 FIG. 4 is a schematic diagram of the structure of a data communication device according to an embodiment of the present invention. The data communication device 40 includes an acquisition module 401 , a screening module 402 , an update module 403 and a communication module 404 .

[0093] Among them, the acquisition module is used to obtain the communication condition information of multiple data streams to be transmitted and the current reward matrix of the preset deterministic network; the screening module is used to screen the target communication path from the preset deterministic network for any data stream based on the communication condition information of the data stream and the current comprehensive communication performance between each communication node in the preset deterministic network represented by the current reward matrix; the update module is used to iteratively update the current reward matrix according to the communication requirements of the data stream for the target communication path; and the communication module is used to transmit the data stream based on the target communication path.

[0094] Regarding the data communication device in this embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be elaborated here.

[0095] The data communication device provided in the embodiment of the present application is used to execute the data communication method provided in the above embodiment. Its implementation method and principle are the same and will not be repeated here.

[0096] An embodiment of the present application provides a data communication system for executing the data communication method provided in the above embodiment.

[0097] like Figure 5 FIG2 is a schematic diagram of the structure of a data communication system provided by an embodiment of the present application. The data communication system includes: a preset deterministic network composed of multiple communication nodes and a control terminal; Based on the data communication method provided in the above embodiment, the control end transmits the multiple data streams to be transmitted through a preset deterministic network, so as to transmit each data stream to the destination node.

[0098] An embodiment of the present application provides an electronic device for executing the data communication method provided in the above embodiment.

[0099] like Figure 6 FIG. 6 is a schematic diagram of the structure of an electronic device according to an embodiment of the present application. The electronic device 60 includes at least one processor 61 and a memory 62 .

[0100] The memory stores computer-executable instructions; and at least one processor executes the computer-executable instructions stored in the memory, so that the at least one processor executes the data communication method provided in the above embodiment.

[0101] The electronic device provided in the embodiment of the present application is used to execute the data communication method provided in the above embodiment. Its implementation method and principle are the same and will not be repeated here.

[0102] An embodiment of the present application provides a computer-readable storage medium, in which computer-executable instructions are stored. When a processor executes the computer-executable instructions, the data communication method provided in any of the above embodiments is implemented.

[0103] The storage medium containing computer-executable instructions provided in the embodiments of the present application can be used to store computer-executable instructions of the data communication method provided in the aforementioned embodiments. Its implementation method and principle are the same and will not be repeated here.

[0104] An embodiment of the present application provides a computer program product, including computer instructions, which are used to enable a computer to execute the data communication method provided in the aforementioned embodiment.

[0105] The embodiments of the present application provide computer program products that can be used to execute computer instructions of the data communication methods provided in the aforementioned embodiments. The implementation method and principle are the same and will not be repeated here.

[0106] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of units is only a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0107] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0108] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or in the form of hardware plus software functional units.

[0109] The above-mentioned integrated unit implemented in the form of a software functional unit can be stored in a computer-readable storage medium. The above-mentioned software functional unit is stored in a storage medium and includes a number of instructions for causing a computer device (which can be a personal computer, server, or network device, etc.) or a processor to perform some of the steps of the method described in each embodiment of this application. The aforementioned storage medium includes: USB flash drives, mobile hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, optical disks, and other media that can store program code.

[0110] Part of the present application may be applied as a computer program product, such as a computer program instruction, which, when executed by a computer, can call or provide the method and / or technical solution according to the present invention through the operation of the computer. Those skilled in the art should understand that the form in which the computer program instruction exists in a computer-readable medium includes but is not limited to a source file, an executable file, an installation package file, etc. Accordingly, the way in which the computer program instruction is executed by the computer includes but is not limited to: the computer directly executes the instruction, or the computer compiles the instruction and then executes the corresponding compiled program, or the computer reads and executes the instruction, or the computer reads and installs the instruction and then executes the corresponding installed program. Here, the computer-readable medium can be any available computer-readable storage medium or communication medium that can be accessed by the computer.

[0111] Those skilled in the art will clearly understand that for the sake of convenience and brevity, the division of the above-mentioned functional modules is only used as an example for illustration. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above. The specific working process of the device described above can refer to the corresponding process in the aforementioned method embodiment and will not be repeated here.

[0112] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some or all of the technical features therein. These modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application.

Claims

1. A data communication method, characterized in that: include: Acquire communication condition information of multiple data streams to be transmitted and a current reward matrix of a preset deterministic network; For any of the data flows, according to the communication condition information of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix, a target communication path is selected from the preset deterministic network; Iteratively updating the current reward matrix according to the communication demand of the data flow for the target communication path; The data stream is transmitted based on the target communication path.

2. The method according to claim 1, characterized in that The communication condition information includes the priority, flow size, target delay, source node and destination node of multiple data flows to be transmitted.

3. The method according to claim 1, characterized in that The obtaining of communication condition information of a plurality of data streams to be transmitted and a current reward matrix of a preset deterministic network includes: Acquire an initial reward matrix of the preset deterministic network, where the initial reward matrix is ​​used to characterize the connectivity between communication nodes of the preset deterministic network; According to the communication delay between each communication node in the preset deterministic network, the reward value in the initial reward matrix is ​​adjusted to obtain the current reward matrix of the preset deterministic network.

4. The method according to claim 1, characterized in that: The communication requirement includes a bandwidth occupation requirement, and the iterative updating of the current reward matrix according to the communication requirement of the data flow for the target communication path includes: Determining a communication bandwidth threshold between each communication node according to the communication bandwidth between each communication node in the target communication path; For any of the data flows, determine a target reward value between the communication nodes according to the bandwidth occupation requirement of the data flow for the target communication path represented by the communication condition information of the data flow and a communication bandwidth threshold between the communication nodes; The current reward matrix is ​​iteratively updated according to the target reward value between each of the communication nodes.

5. The method according to claim 4, characterized in that The step of determining the target reward value between the communication nodes based on the bandwidth occupation requirement of the data flow for the target communication path and the communication bandwidth threshold between the communication nodes represented by the communication condition information of the data flow comprises: Determining the bandwidth occupation requirement of the data flow on the target communication path according to the flow size of the data flow represented by the communication condition information of the data flow; According to the bandwidth occupation requirement of the data flow on the target communication path and the communication bandwidth threshold between the communication nodes, the target reward value between the communication nodes is determined.

6. The method according to claim 5, characterized in that Determining the target reward value between the communication nodes according to the bandwidth occupation requirement of the data flow on the target communication path and the communication bandwidth threshold between the communication nodes includes: Based on the following formula, the first target reward value between each of the communication nodes is determined: in, Represents a communication node With communication node The target reward value between The communication node representing the current reward matrix before the update With communication node The current reward value between Represents a communication node With communication node The communication bandwidth between Represents a communication node With communication node The communication bandwidth threshold between Indicates the preset communication bandwidth utilization threshold. Representing data flow The bandwidth occupation requirement of the target communication path, Indicates the total number of data streams to be transmitted, Representing data flow Whether the target communication path includes the communication node With communication node The path between Representing data flow The target communication path includes communication nodes With communication node The path between Representing data flow The target communication path does not include the communication node With communication node The path between.

7. The method according to claim 1, characterized in that The step of selecting a target communication path from the preset deterministic network according to the communication condition information of the data stream and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix includes: Determining the communication order of each of the data flows according to the priority represented by the communication condition information of the data flows; Determining the communication constraint conditions of the data flows according to the communication times of each of the data flows and the flow size, target delay, source node and destination node represented by the communication condition information of the data flows; A target communication path is selected from the preset deterministic network according to the communication constraints of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix.

8. The method according to claim 7, characterized in that The step of selecting a target communication path from the preset deterministic network according to the communication constraint of the data flow and the current comprehensive communication performance between the communication nodes in the preset deterministic network represented by the current reward matrix includes: According to the communication constraint condition of the data flow, selecting a plurality of candidate communication paths satisfying the communication constraint condition in the preset deterministic network; Determining the current comprehensive communication performance of each of the candidate communication paths according to the cumulative reward value of each of the candidate communication paths in the current reward matrix; A target communication path is screened from the candidate communication paths according to the current comprehensive communication performance of each of the candidate communication paths.

9. The method according to claim 7, characterized in that: The communication requirement includes the communication nodes included in the target communication path, and the iterative updating of the current reward matrix according to the communication requirement of the data flow for the target communication path includes: After determining the target communication path of any of the data flows, the current reward matrix is ​​first updated according to the communication nodes included in the target communication path to reduce the probability that other data flows with a lower priority than the data flow select the target communication path.

10. The method according to claim 9, characterized in that The first updating of the current reward matrix according to the communication nodes included in the target communication path includes: Based on the following formula, the current reward matrix is ​​first updated: in, Represents the first updated communication node With communication node The reward value between Indicates the communication node before the first update With communication node The current reward value between Representing data flow Whether the target communication path includes the communication node With communication node The path between Representing data flow The target communication path includes communication nodes With communication node The path between Representing data flow The target communication path does not include the communication node With communication node The path between represents the update coefficient.

11. The method according to claim 9, characterized in that The method further comprises: After completing the transmission of any of the data flows, the current reward matrix is ​​secondly updated according to the communication nodes included in the target communication path to increase the probability that other data flows with a lower priority than the data flow and whose target communication path has not been determined select the target communication path.

12. A data communication system, characterized in that: include: A preset deterministic network consisting of multiple communication nodes and a control terminal; The control end transmits the multiple data streams to be transmitted through the preset deterministic network based on the data communication method according to any one of claims 1 to 11, so as to transmit each of the data streams to the destination node.

13. An electronic device, characterized in that: include: at least one processor and memory; The memory stores computer-executable instructions; The at least one processor executes the computer-executable instructions stored in the memory, so that the at least one processor performs the method according to any one of claims 1 to 11.

14. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and when a processor executes the computer-executable instructions, the method according to any one of claims 1 to 11 is implemented.

15. A computer program product, characterized in that The method comprises computer instructions for causing a computer to execute the method according to any one of claims 1 to 11.

Images