Communication path matching method and system

Abstract

The embodiment of the invention discloses a communication path matching method and system, and relates to the technical field of communication. The method comprises the following steps: acquiring a network topology relationship between a communication source node and a communication target node; constructing a dynamic communication path database based on the network topological relation and the real-time link state parameters; screening out candidate communication paths meeting basic connection conditions from the dynamic communication path database to obtain a candidate communication path set; calculating the communication cost of multiple dimensions corresponding to each candidate communication path in the candidate communication path set through a multi-dimensional communication cost evaluation model; and performing communication path matching according to the QoS demand information corresponding to the to-be-transmitted data and the communication cost of the multiple dimensions corresponding to each candidate communication path to determine a target communication path. Through the method, the accuracy of communication path matching can be effectively improved, the high-quality transmission of data is ensured, and meanwhile, the communication path is flexibly matched according to the QoS demand information.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method and system for matching communication paths. Background Art

[0002] In existing communication technologies, the selection of communication paths is crucial to the efficiency and quality of data transmission. As networks expand in size and complexity, how to quickly and accurately match communication paths that meet specific Quality of Service (QoS) requirements becomes an urgent problem.

[0003] Traditional communication path matching methods often rely on static network topology information and preset routing rules. They cannot reflect the actual status of the network in real time, nor can they flexibly match according to the QoS requirements of the data. Therefore, the quality of data transmission needs to be improved.

[0004] Based on this, it is necessary to study a more intelligent and efficient communication path matching method to cope with the increasingly complex network communication environment. Summary of the Invention

[0005] To solve the above problem, one aspect of an embodiment of this specification provides a communication path matching method, the method comprising:

[0006] Obtaining the network topology relationship between the communication source node and the communication target node;

[0007] Building a dynamic communication path database based on the network topology and real-time link state parameters, wherein the link state parameters include latency, packet loss rate, and available bandwidth;

[0008] Screening candidate communication paths that meet basic connection conditions from the dynamic communication path database to obtain a set of candidate communication paths, wherein the basic connection conditions include a maximum hop limit and a minimum link state score threshold, and each candidate communication path includes at least the communication source node and the communication target node;

[0009] Calculating the communication costs of multiple dimensions corresponding to each candidate communication path in the candidate communication path set by a multi-dimensional communication cost evaluation model, wherein the communication costs of the multiple dimensions are used to measure the communication quality risks of each candidate communication path in the multiple dimensions;

[0010] Communication path matching is performed based on the QoS requirement information corresponding to the data to be transmitted and the communication costs in multiple dimensions corresponding to each of the candidate communication paths to determine the target communication path, wherein the QoS requirement information includes at least one of delay sensitivity, bandwidth requirement, packet loss tolerance and security level indicator.

[0011] In some embodiments, the constructing a dynamic communication path database based on the network topology relationship and the real-time link state parameters includes:

[0012] Determining all possible communication links between the communication source node and the communication target node based on the network topology relationship, and performing a status evaluation on each possible communication link according to the real-time link status parameter to obtain a real-time link status score corresponding to each possible communication link;

[0013] The real-time link status scores are associated with corresponding communication links and stored, thereby constructing the dynamic communication path database.

[0014] In some embodiments, determining all possible communication links between the communication source node and the communication target node based on the network topology relationship, and performing a status evaluation on each possible communication link according to the real-time link status parameter to obtain a real-time link status score corresponding to each possible communication link includes:

[0015] Taking the communication source node as the starting point, traverse the entire network topology relationship through a depth-first search or breadth-first search algorithm to find all possible communication links from the communication source node to the communication target node;

[0016] Calculating each possible communication link using the real-time link state parameter and a preset link state evaluation function to obtain a real-time link state score corresponding to each possible communication link;

[0017] The link state evaluation function is:

[0018]

[0019] Where W represents the real-time link status score corresponding to the communication link; delay represents the comprehensive delay of the communication link, and α represents the parameter The corresponding weight; loss represents the comprehensive packet loss rate of the communication link, and β represents the parameter The corresponding weight; bandwid represents the available bandwidth of the communication link, and γ represents the weight corresponding to the available bandwidth bandwid.

[0020] In some embodiments, screening out candidate communication paths that meet basic connection conditions from the dynamic communication path database includes:

[0021] Screening all communication links in the dynamic communication path database according to the maximum hop limit, excluding communication links with hops exceeding the maximum hop limit, and obtaining pre-screened communication links;

[0022] All communication links in the preliminarily screened communication links are further screened according to the minimum link status score threshold, and communication links with real-time link status scores not lower than the minimum link status score threshold are selected as the candidate communication paths.

[0023] In some embodiments, the multidimensional communication cost evaluation model includes a plurality of communication cost evaluation sub-models, wherein the communication cost evaluation sub-models include at least a delay cost evaluation sub-model, a packet loss cost evaluation sub-model, a bandwidth cost evaluation sub-model, and a security cost evaluation sub-model;

[0024] The calculating, using a multi-dimensional communication cost evaluation model, the communication costs of multiple dimensions corresponding to each candidate communication path in the candidate communication path set includes:

[0025] Inputting the comprehensive delay, path length, and delay stability corresponding to the candidate communication path into the delay cost evaluation submodel for calculation to obtain the delay cost corresponding to the candidate communication path, wherein the path length is obtained by calculating the sum of the physical distances between all communication nodes passed by the candidate communication path, and the delay stability is obtained by performing a statistical analysis on the comprehensive delay of the candidate communication path within a preset time period;

[0026] Inputting the comprehensive packet loss rate and packet loss rate stability corresponding to the candidate communication path into the packet loss cost evaluation sub-model for calculation to obtain the packet loss cost corresponding to the candidate communication path, wherein the packet loss rate stability is obtained by statistically analyzing the packet loss rate of the candidate communication path within a preset time period;

[0027] Inputting the available bandwidth and bandwidth stability corresponding to the candidate communication path into the bandwidth cost evaluation sub-model for calculation to obtain the bandwidth cost corresponding to the candidate communication path, wherein the bandwidth stability is obtained by statistically analyzing the changes in bandwidth utilization of the candidate communication path within a preset time period;

[0028] The number of network nodes corresponding to the candidate communication path and the security score of each network node are input into the security cost assessment sub-model for calculation to obtain the security cost corresponding to the candidate communication path, wherein the security score of each network node is obtained by statistically analyzing the security events of the candidate communication path within a preset time period.

[0029] In some embodiments, the delay cost is calculated using the following formula (1):

[0030] C1=k1*delay+k2*l+k3*s1; (1)

[0031] Where C1 represents the delay cost, delay represents the comprehensive delay corresponding to the candidate communication path, l represents the path length corresponding to the candidate communication path, s1 represents the delay stability corresponding to the candidate communication path, k1 represents the weight corresponding to the comprehensive delay delay, k2 represents the weight corresponding to the path length l, and k3 represents the weight corresponding to the delay stability s1;

[0032] The packet loss cost is calculated using the following formula (2):

[0033]

[0034] Among them, C2 represents the packet loss cost, loss represents the comprehensive packet loss rate corresponding to the candidate communication path, s2 represents the packet loss rate stability corresponding to the candidate communication path, k4 represents the weight corresponding to the comprehensive packet loss rate loss, and k5 represents the parameter The corresponding weight;

[0035] The bandwidth cost is calculated by the following formula (3):

[0036]

[0037] Among them, C3 represents the bandwidth cost, bandwid represents the available bandwidth corresponding to the candidate communication path, s3 represents the bandwidth stability corresponding to the candidate communication path, and k6 represents the parameter The corresponding weight, k5 represents the parameter The corresponding weight;

[0038] The security cost is calculated by the following formula (4):

[0039]

[0040] Among them, C4 represents the security cost, N represents the number of network nodes corresponding to the candidate communication path, and Z represents the sum of the security scores of all network nodes passed by the candidate communication path.

[0041] In some embodiments, performing communication path matching based on the QoS requirement information corresponding to the data to be transmitted and the communication costs of multiple dimensions corresponding to each of the candidate communication paths to determine the target communication path includes:

[0042] Comparing the QoS requirement information corresponding to the data to be transmitted with the communication service quality information calculated based on the communication costs of multiple dimensions corresponding to each of the candidate communication paths, and determining a candidate communication path that meets the QoS requirement information;

[0043] Among the candidate communication paths that meet the QoS requirement information, the candidate communication path with the smallest total communication cost is selected as the target communication path.

[0044] In some embodiments, performing communication path matching based on the QoS requirement information corresponding to the data to be transmitted and the communication costs of multiple dimensions corresponding to each of the candidate communication paths to determine the target communication path further includes:

[0045] When all the candidate communication paths do not meet the QoS requirement information corresponding to the data to be transmitted, the network topology relationship between the communication source node and the communication target node is re-acquired, and the real-time link status parameters are updated, and the steps of constructing a dynamic communication path database, screening candidate communication paths, and calculating communication costs are re-executed until a target communication path that meets the QoS requirement information is determined.

[0046] In some embodiments, the method further comprises:

[0047] monitoring the target communication path in real time, and predicting the link state parameters of the monitored target communication path to obtain predicted link state parameters;

[0048] When the predicted link state parameters change, and the changed link state parameters cause the target communication path to be unable to meet the QoS requirement information, the steps of constructing a dynamic communication path database, screening candidate communication paths, and calculating communication costs are re-executed to match the new target communication path, and the data to be transmitted is switched to the new target communication path for transmission.

[0049] Another aspect of the embodiments of this specification further provides a communication path matching system, the system comprising:

[0050] A network topology acquisition module is used to obtain the network topology relationship between the communication source node and the communication target node;

[0051] A dynamic database construction module, configured to construct a dynamic communication path database based on the network topology and real-time link state parameters, wherein the link state parameters include latency, packet loss rate, and available bandwidth;

[0052] a candidate path screening module, configured to screen candidate communication paths that meet basic connection conditions from the dynamic communication path database to obtain a set of candidate communication paths, wherein the basic connection conditions include a maximum hop limit and a minimum link state score threshold, and each candidate communication path includes at least the communication source node and the communication target node;

[0053] a communication cost calculation module, configured to calculate the communication costs in multiple dimensions corresponding to each candidate communication path in the candidate communication path set using a multi-dimensional communication cost evaluation model, wherein the communication costs in multiple dimensions are used to measure the communication quality risks of each candidate communication path in multiple dimensions;

[0054] A path matching module is used to match communication paths based on the QoS requirement information corresponding to the data to be transmitted and the communication costs in multiple dimensions corresponding to each of the candidate communication paths to determine the target communication path, wherein the QoS requirement information includes at least one of delay sensitivity, bandwidth requirement, packet loss tolerance and security level indicator.

[0055] The communication path matching method and system provided in the embodiments of this specification may bring about at least the following beneficial effects:

[0056] (1) A dynamic communication path database is constructed based on the network topology relationship and real-time link state parameters between the communication source node and the communication target node. Then, candidate communication paths that meet the basic connection conditions are screened from the dynamic communication path database to obtain a candidate communication path set. The communication costs of multiple dimensions corresponding to each candidate communication path in the candidate communication path set are calculated using a multi-dimensional communication cost evaluation model. Finally, communication path matching is performed based on the QoS requirement information corresponding to the data to be transmitted and the communication costs of multiple dimensions corresponding to each candidate communication path to determine the target communication path. This can effectively improve the accuracy of communication path matching, ensure high-quality data transmission, and achieve flexible matching of communication paths according to QoS requirement information.

[0057] (2) By constructing a dynamic communication path database based on the network topology relationship and real-time link state parameters between the communication source node and the communication target node, the data transmission capacity of each communication path in the dynamic communication path database can be dynamically updated, thereby accurately reflecting the actual status of the current network and facilitating the accurate selection of target communication paths that meet the QoS requirements corresponding to the data to be transmitted;

[0058] (3) By evaluating the communication cost of candidate communication paths in multiple dimensions, the transmission performance of candidate communication paths can be reflected more comprehensively and accurately, thereby improving the accuracy and reliability of communication path matching.

[0059] Additional features are described in part in the following description. They will become apparent to those skilled in the art by reviewing the following and accompanying drawings, or by following the production or operation of the examples. The features of this specification may be realized and obtained by practicing or using the various aspects of the methods, tools, and combinations described in the following detailed examples. BRIEF DESCRIPTION OF THE DRAWINGS

[0060] This specification will be further described in the form of exemplary embodiments, which will be described in detail with reference to the accompanying drawings. These embodiments are not limiting, and in these embodiments, the same numbers represent the same structures, wherein:

[0061] Figure 1 is an exemplary flow chart of a communication path matching method according to some embodiments of this specification;

[0062] Figure 2 is a schematic diagram of an exemplary communication path according to some embodiments of this specification;

[0063] Figure 3 is a flowchart of exemplary sub-steps of a communication path matching method according to some embodiments of this specification;

[0064] Figure 4 is an exemplary module diagram of a communication path matching system according to some embodiments of this specification. DETAILED DESCRIPTION

[0065] To more clearly illustrate the technical solutions of the embodiments of this specification, the following briefly describes the drawings required for describing the embodiments. Obviously, the drawings described below are merely examples or embodiments of this specification. Those skilled in the art can apply this specification to other similar scenarios based on these drawings without inventive effort. Unless otherwise apparent from the context or otherwise noted, the same reference numerals in the figures represent the same structure or operation.

[0066] It should be understood that the terms "system," "device," "unit," and / or "module" used in this specification are a method for distinguishing different components, elements, parts, portions, or assemblies at different levels. However, if other terms can achieve the same purpose, the terms may be replaced by other expressions.

[0067] As used in this specification and claims, unless the context clearly indicates otherwise, the words "a," "an," "an," and / or "the" do not refer to the singular but also include the plural. Generally speaking, the terms "comprises" and "include" only indicate the inclusion of the steps and elements specifically identified, and these steps and elements do not constitute an exclusive list. A method or apparatus may also include other steps or elements.

[0068] Flowcharts are used throughout this specification to illustrate the operations performed by systems according to embodiments of this specification. It should be understood that preceding or following operations do not necessarily need to be performed in exact order. Instead, the steps may be processed in reverse order or simultaneously. Furthermore, other operations may be added to these processes, or one or more operations may be removed from these processes.

[0069] The communication path matching method and system provided in the embodiments of this specification are described in detail below with reference to the accompanying drawings.

[0070] Figure 1 is an exemplary flow chart of a communication path matching method according to some embodiments of this specification. In some embodiments, the communication path matching method can be executed by processing logic, which can include hardware (e.g., circuits, dedicated logic, programmable logic, microcode, etc.), software (instructions running on a processing device to perform hardware simulation), etc., or any combination thereof. In some embodiments, Figure 1 One or more operations in the flowchart of the communication path matching method shown can be implemented by a processing device and / or a terminal device. For example, the communication path matching method can be stored in the form of a computer program and / or instructions in a storage device and called and / or executed by the processing device and / or the terminal device.

[0071] Reference Figure 1 The communication path matching method provided in the embodiment of the present application may include the following steps S110 to S150:

[0072] Step S110: Acquire the network topology relationship between the communication source node and the communication target node. In some embodiments, step S110 may be executed by the network topology acquisition module 210 mentioned below.

[0073] In the embodiment of the present application, the communication source node can be understood as the starting point of information transmission, and the communication target node can be understood as the end point of information reception. Figure 2 In some embodiments, node A can respond to a request from node B or spontaneously transmit data (such as files, pictures, audio, video, etc.) to node B. At this time, node A is the communication source node, and node B is the communication target node.

[0074] The network topology relationship between the communication source node and the communication target node can describe the connection status between each node in the communication network where the communication source node and the communication target node are located, as well as the path of data flow. In the embodiment of the present application, by obtaining this network topology relationship, all possible communication links can be understood, thereby providing basic data for the subsequent path matching process.

[0075] Step S120: construct a dynamic communication path database based on the network topology and the real-time link state parameters. In some embodiments, step S120 may be executed by the dynamic database construction module 220 mentioned below.

[0076] In an embodiment of the present application, all possible communication links between the communication source node and the communication target node can be determined based on the network topology relationship, and the status of each possible communication link can be evaluated according to the real-time link status parameters to obtain a real-time link status score corresponding to each possible communication link.

[0077] Specifically, refer to Figure 2 ( Figure 2 (This is an exemplary communication path diagram shown in some embodiments of this specification). In some embodiments of the present application, the communication source node can be used as a starting point, and the entire network topology relationship can be traversed through a depth-first search or breadth-first search algorithm to find all possible communication links from the communication source node to the communication target node (each possible communication path includes at least the communication source node and the communication target node). Among them, the depth-first search algorithm can search in depth according to the connection relationship between the nodes until the communication target node is reached or all possible paths are traversed; while the breadth-first search algorithm can expand layer by layer according to the node hierarchy, first searching all nodes directly connected to the source node, and then expanding outward layer by layer until the target node is found or all possible paths are traversed.

[0078] It should be noted that Figure 2 The communication paths shown are only exemplary. In practical applications, the communication network may include more or fewer network nodes (in theory, each network node can establish a connection with any other network node to form a communication link). It will be understood that in the embodiments of the present application, all potential communication links can be found comprehensively and accurately in the above manner. More details about using a depth-first search or breadth-first search algorithm to find all possible communication links from the communication source node to the communication target node can be regarded as prior art and will not be discussed in detail in this specification.

[0079] After obtaining all possible communication links, the status of each communication link can be evaluated based on the real-time link status parameters of each communication link to obtain a real-time link status score corresponding to each possible communication link. In an embodiment of the present application, the real-time link status parameters may include latency, packet loss rate, and available bandwidth, and the real-time link status parameters can be used to describe the current operating status of the communication link. For example, the latency parameter can reflect the length of time it takes for a data packet to be transmitted in the communication link, the packet loss rate parameter can reflect the data loss during the transmission process of the communication link, and the available bandwidth parameter can reflect the idle transmission capacity of the communication link at the current moment.

[0080] Specifically, in some embodiments of the present application, each possible communication link can be calculated using the real-time link state parameter and a preset link state evaluation function to obtain a real-time link state score corresponding to each possible communication link. In some embodiments, the link state evaluation function can be expressed as follows:

[0081]

[0082] Where W represents the real-time link status score corresponding to the communication link; delay represents the comprehensive delay of the communication link (that is, when the communication link includes multiple nodes, delay represents the sum of the delays between all nodes on the communication link), and α represents the parameter The corresponding weight; loss represents the comprehensive packet loss rate of the communication link (when the communication link includes multiple nodes, loss represents the sum of the packet loss rates between all nodes on the communication link), β represents the parameter The corresponding weight; bandwid represents the available bandwidth of the communication link (when the communication link includes multiple nodes, bandwid represents the minimum value of the available bandwidth of all nodes on the communication link), γ represents the weight corresponding to the available bandwidth bandwid.

[0083] According to the above-mentioned link status evaluation function, in the embodiment of the present application, the real-time link status score corresponding to each communication link is negatively correlated with the comprehensive delay delay and the comprehensive packet loss rate loss, and is positively correlated with the available bandwidth bandwid. That is to say, the real-time link status score of the communication link will decrease with the increase of the comprehensive delay and the comprehensive packet loss rate, and increase with the increase of the available bandwidth.

[0084] In the embodiments of the present application, the values ​​of the above-mentioned weight parameters α, β and γ can be set according to actual needs and are not specifically limited in this specification. For example, in some embodiments, when the communication link is mainly used to transmit data with high real-time requirements, the values ​​of the weight parameters α and β can be appropriately increased, that is, the influence of the comprehensive delay delay and the comprehensive packet loss rate loss in the link state evaluation function can be increased to ensure the stability and real-time performance of data transmission. When the communication link is mainly used to transmit data with high bandwidth requirements, the value of the weight parameter γ can be appropriately increased, that is, the influence of the available bandwidth bandwid in the link state evaluation function can be increased to make full use of the bandwidth resources of the communication link and improve data transmission efficiency.

[0085] In the embodiment of the present application, the link state evaluation function is used to calculate each possible communication link, thereby obtaining a real-time link state score corresponding to each possible communication link. Furthermore, in the embodiment of the present application, the real-time link state score can be associated with the corresponding communication link and stored, thereby constructing the dynamic communication path database.

[0086] It should be noted that in this embodiment of the present application, because the dynamic communication path database takes into account real-time link state parameters, the data transmission capacity of each communication path in the dynamic communication path database is dynamically updated. When the state of a communication link in the network changes, such as when latency increases, packet loss rate rises, or available bandwidth decreases, the corresponding link state score in the dynamic communication path database is promptly updated to reflect the current network status, thereby facilitating the accurate selection of preferred communication paths in subsequent processes.

[0087] Step S130: Filter candidate communication paths that meet basic connection conditions from the dynamic communication path database to obtain a candidate communication path set. In some embodiments, step S130 may be performed by the candidate path screening module 230 mentioned below.

[0088] In an embodiment of the present application, the basic connection condition includes a maximum hop limit and a minimum link status score threshold, wherein the maximum hop limit refers to the maximum number of nodes passed from the communication source node to the communication target node. The maximum hop limit can be set according to actual needs to avoid excessive transmission delay or degradation of transmission quality caused by a long communication path; the minimum link status score threshold refers to the minimum value of the real-time link status score corresponding to the communication link. In other words, in an embodiment of the present application, only when the real-time link status score corresponding to the communication link is greater than or equal to the threshold, can the communication link be selected as a candidate communication path.

[0089] Specifically, in some embodiments of the present application, all communication links in the dynamic communication path database can be screened according to the maximum hop limit, and communication links with hops exceeding the maximum hop limit can be excluded to obtain pre-screened communication links; then, all communication links in the pre-screened communication links can be further screened according to the minimum link status score threshold, and communication links with real-time link status scores not lower than the minimum link status score threshold are selected as candidate communication paths. In the embodiment of the present application, each candidate communication path includes at least the communication source node and the communication destination node.

[0090] Step S140, using a multi-dimensional communication cost evaluation model to calculate the communication costs of multiple dimensions corresponding to each candidate communication path in the candidate communication path set. In some embodiments, step S140 may be performed by the communication cost calculation module 240 mentioned below.

[0091] In an embodiment of the present application, the communication costs of the multiple dimensions can be used to measure the communication quality risks of each of the candidate communication paths in multiple dimensions. Specifically, in some embodiments of the present application, the multidimensional communication cost evaluation model includes multiple communication cost evaluation sub-models, and the communication cost evaluation sub-models include at least a delay cost evaluation sub-model, a packet loss cost evaluation sub-model, a bandwidth cost evaluation sub-model and a security cost evaluation sub-model. Among them, the delay cost evaluation sub-model can be used to evaluate the delay cost (also referred to as delay risk) corresponding to the candidate communication path, the packet loss cost evaluation sub-model can be used to evaluate the packet loss cost (also referred to as packet loss risk) corresponding to the candidate communication path, the bandwidth cost evaluation sub-model can be used to evaluate the bandwidth cost (also referred to as bandwidth occupancy risk) corresponding to the candidate communication path, and the security cost evaluation sub-model can be used to evaluate the security cost (also referred to as security risk) corresponding to the candidate communication path.

[0092] Specifically, in some embodiments of the present application, the comprehensive delay, path length, and delay stability corresponding to the candidate communication path can be input into the delay cost evaluation sub-model for calculation to obtain the delay cost corresponding to the candidate communication path. The path length can be obtained by calculating the sum of the physical distances between all communication nodes passed by the candidate communication path, and the delay stability can be obtained by statistically analyzing the comprehensive delay of the candidate communication path within a preset time period.

[0093] As an example only, in some embodiments of the present application, the path length can be obtained based on the following method: first, determine all the communication nodes passed by the candidate communication path, and obtain the physical distance between these communication nodes (the physical distance can be determined by the IP address and / or the corresponding location information). Then, these physical distances are added together to obtain the path length of the candidate communication path. It can be understood that in embodiments of the present application, the path length can reflect the physical characteristics of the communication path. A longer path may mean a higher transmission delay and more potential failure points. Therefore, the greater the path length, the greater the delay cost of the candidate communication path.

[0094] In some embodiments, the delay stability can be determined as follows: first, comprehensive delay data for candidate communication paths within a preset time period is obtained. Then, statistical analysis is performed on this data (e.g., calculating the delay fluctuation range), and the delay stability of the candidate communication paths is evaluated based on the statistical analysis results (e.g., a communication path with a larger delay fluctuation range has poorer delay stability and a higher delay cost).

[0095] In some embodiments of the present application, the delay cost can be calculated using the following formula (1):

[0096] C1=k1*delay+k2*l+k3*s1; (1)

[0097] Among them, C1 represents the delay cost, delay represents the comprehensive delay corresponding to the candidate communication path, l represents the path length corresponding to the candidate communication path, s1 represents the delay stability corresponding to the candidate communication path, k1 represents the weight corresponding to the comprehensive delay delay, k2 represents the weight corresponding to the path length l, and k3 represents the weight corresponding to the delay stability s1.

[0098] Furthermore, in an embodiment of the present application, the comprehensive packet loss rate and packet loss rate stability corresponding to the candidate communication path can be input into the packet loss cost evaluation sub-model for calculation to obtain the packet loss cost corresponding to the candidate communication path. The packet loss rate stability can be obtained by statistically analyzing the packet loss rate of the candidate communication path within a preset time period (the specific method for determining the packet loss rate stability can refer to the above-mentioned delay stability).

[0099] In some embodiments, the packet loss cost can be calculated using the following formula (2):

[0100]

[0101] Among them, C2 represents the packet loss cost, loss represents the comprehensive packet loss rate corresponding to the candidate communication path, s2 represents the packet loss rate stability corresponding to the candidate communication path (the smaller the packet loss rate stability, the greater the packet loss cost), k4 represents the weight corresponding to the comprehensive packet loss rate loss, and k5 represents the parameter The corresponding weight.

[0102] Furthermore, in an embodiment of the present application, the available bandwidth and bandwidth stability corresponding to the candidate communication path can be input into the bandwidth cost evaluation sub-model for calculation to obtain the bandwidth cost corresponding to the candidate communication path. The bandwidth stability can be obtained by statistically analyzing the changes in the bandwidth utilization of the candidate communication path within a preset time period (the specific method for determining bandwidth stability can refer to the above-mentioned delay stability).

[0103] In some embodiments, the bandwidth cost can be calculated using the following formula (3):

[0104]

[0105] Among them, C3 represents the bandwidth cost, bandwid represents the available bandwidth corresponding to the candidate communication path, s3 represents the bandwidth stability corresponding to the candidate communication path, and k6 represents the parameter The corresponding weight, k5 represents the parameter The corresponding weight.

[0106] Furthermore, in an embodiment of the present application, the number of network nodes corresponding to the candidate communication path and the security score of each network node can be input into the security cost assessment sub-model for calculation to obtain the security cost corresponding to the candidate communication path. The security score of each network node can be obtained by statistically analyzing the security events of the candidate communication path within a preset time period. For example, the frequency of security events (such as virus intrusion, data leakage, data tampering, etc.) within the preset time period can be counted to obtain the security score of each network node (the higher the frequency of security events, the lower the corresponding security score).

[0107] In some embodiments, the security cost can be calculated using the following formula (4):

[0108]

[0109] Among them, C4 represents the security cost, N represents the number of network nodes corresponding to the candidate communication path, and Z represents the sum of the security scores of all network nodes passed by the candidate communication path.

[0110] It is understood that in the embodiment of the present application, by calculating each candidate communication path in the candidate communication path set in the above manner, the communication costs of multiple dimensions corresponding to each candidate communication path can be obtained. The specific values ​​of the above weight coefficients k1 to k7 can be set according to actual needs and are not specifically limited in this specification.

[0111] Step S150 is to perform communication path matching based on the QoS requirement information corresponding to the data to be transmitted and the communication costs in multiple dimensions corresponding to each candidate communication path to determine the target communication path. In some embodiments, step S150 may be performed by the path matching module 250 mentioned below.

[0112] Figure 3 FIG. 1 is a flowchart of exemplary sub-steps of a communication path matching method according to some embodiments of this specification. Figure 3 In some embodiments, step S150 may include the following sub-steps:

[0113] Sub-step S151 , comparing the QoS requirement information corresponding to the data to be transmitted with the communication service quality information calculated based on the communication costs of multiple dimensions corresponding to each candidate communication path, and determining a candidate communication path that meets the QoS requirement information.

[0114] In an embodiment of the present application, the QoS requirement information corresponding to the data to be transmitted can be understood as the quality of service (QoS) requirements for the data to be transmitted during the transmission process, such as transmission delay, packet loss rate, bandwidth requirements, and information security requirements. In an embodiment of the present application, the corresponding QoS requirement information can be obtained based on the quality of service requirements of the data to be transmitted during the transmission process. The QoS requirement information may include at least one of delay sensitivity, bandwidth requirements, packet loss tolerance, and security level indicators. For example, in some embodiments, the delay sensitivity can be determined based on the transmission delay requirement (delay sensitivity = average delay / maximum allowed delay), the bandwidth requirement can be determined based on the minimum transmission bandwidth requirement, the packet loss tolerance can be determined based on the maximum tolerable number of packet losses (packet loss tolerance = maximum tolerable number of packet losses / total number of transmitted data packets), and the security level indicator can be determined based on the information security requirement.

[0115] In an embodiment of the present application, the QoS requirement information corresponding to the data to be transmitted can be compared with the communication service quality information calculated based on the communication costs of multiple dimensions corresponding to each candidate communication path to determine the candidate communication path that meets the QoS requirement information. The communication service quality information corresponding to each candidate communication path may include delay information, packet loss information, bandwidth information, and security information. In some embodiments of the present application, the delay information in the communication service quality information can be calculated based on the delay cost corresponding to the candidate communication path, the packet loss information can be obtained based on the packet loss cost corresponding to the candidate communication path, the bandwidth information can be obtained based on the bandwidth cost corresponding to the candidate communication path, and the security information can be obtained based on the security cost corresponding to the candidate communication path.

[0116] By way of example only, in some embodiments, the delay cost calculated by the above process may be normalized, and the normalized result may be used as a coefficient to multiply the combined delay corresponding to the candidate communication path to obtain the highest predicted delay corresponding to the candidate communication path. The ratio of the combined delay to the highest predicted delay may then be used as the delay information in the communication service quality information.

[0117] Similarly, in some embodiments of the present application, the packet loss cost calculated by the above process can be normalized, and the normalized result can be used as a coefficient to multiply the comprehensive packet loss rate corresponding to the candidate communication path to obtain the maximum predicted packet loss rate corresponding to the candidate communication path. The maximum predicted packet loss rate is then used as the packet loss information in the communication service quality information.

[0118] In some embodiments of the present application, the bandwidth cost calculated by the above process can be normalized, and the absolute value of the difference between the normalized result and the maximum normalized value 1 is used as a coefficient to multiply the available bandwidth corresponding to the candidate communication path to obtain the minimum predicted bandwidth corresponding to the candidate communication path. The minimum predicted bandwidth is then used as the bandwidth information in the communication service quality information.

[0119] In some embodiments of the present application, the security cost calculated by the above process can be mapped (or mapped based on the number of network nodes N involved in the security cost calculation process and the sum Z of the security scores of all network nodes passed by the candidate communication path) to obtain the security level corresponding to the candidate communication path, and the security level can be used as the security information in the communication service quality information.

[0120] In the embodiments of the present application, the time delay information, the packet loss information, the bandwidth information and the security information in the communication service quality information are compared with the QoS requirement information corresponding to the to-be-transmitted data, so that it is determined which candidate communication paths can meet the transmission requirements, and the candidate communication paths meeting the QoS requirement information are screened out.

[0121] In substep S152, among the candidate communication paths meeting the QoS requirement information, the candidate communication path with the minimum communication cost sum is selected as the target communication path.

[0122] Further, in the embodiments of the present application, the candidate communication paths meeting the QoS requirement information screened out in substep S151 are further screened, so that the target communication path for transmitting the to-be-transmitted data is determined.

[0123] For example, in some embodiments of the present application, the communication cost sum (i.e., time delay cost + packet loss cost + bandwidth cost + security cost) of each candidate communication path meeting the QoS requirement information screened out in step S151 is calculated, and then the candidate communication path with the minimum communication cost sum is selected as the target communication path.

[0124] Continuing to refer to Figure 3 In some embodiments of the present application, step S150 can further include:

[0125] In substep S153, when none of the candidate communication paths meets the QoS requirement information corresponding to the to-be-transmitted data, the network topology relationship between the communication source node and the communication target node is re-acquired, the real-time link state parameters are updated, and the steps of constructing the dynamic communication path database, screening the candidate communication paths and calculating the communication cost are re-executed until the target communication path meeting the QoS requirement information is determined.

[0126] In some embodiments of the present application, there can be a case that none of the candidate communication paths meets the QoS requirement information corresponding to the to-be-transmitted data. In this case, the network topology relationship between the communication source node and the communication target node is re-acquired, the real-time link state parameters are updated, and the steps of constructing the dynamic communication path database, screening the candidate communication paths and calculating the communication cost (i.e., steps S110-S140 described above) are re-executed until the target communication path meeting the QoS requirement information is determined.

[0127] In some embodiments of the present application, when the number of times the above steps are repeated (i.e., re-obtaining the network topology relationship between the communication source node and the communication target node, updating the real-time link status parameters, and re-executing the steps of building a dynamic communication path database, screening candidate communication paths, and calculating the communication cost) reaches a preset threshold and still no communication path that meets the QoS requirement information corresponding to the data to be transmitted is determined, a candidate communication path with the smallest total communication cost can be selected from the candidate communication paths as the target communication path, and the target communication path can be used to transmit the data to be transmitted.

[0128] In some embodiments of the present application, the target communication path can be monitored in real time, and the link state parameters of the monitored target communication path can be predicted (for example, using a recurrent neural network, a long short-term memory model, etc.) to obtain the predicted link state parameters. When it is detected that the predicted link state parameters have changed, and the changed link state parameters cause the target communication path to be unable to meet the QoS requirement information, the steps of constructing a dynamic communication path database, screening candidate communication paths, and calculating the communication cost (i.e., steps S110 to S140) can be re-executed to match the new target communication path, and the data to be transmitted can be switched to the new target communication path for transmission.

[0129] Figure 4 Schematic diagram of a module of a communication path matching system according to some embodiments of this specification. Figure 4 The communication path matching system 200 shown can be implemented in software and / or hardware. For example, it can be configured in the form of software and / or hardware to a processing device and / or a terminal device to be used for matching according to the QoS requirement information corresponding to the data to be transmitted and the network topology relationship and real-time link state parameters between the communication source node and the communication target node to determine the target communication path.

[0130] Reference Figure 4 In some embodiments, the communication path matching system 200 may include a network topology acquisition module 210 , a dynamic database construction module 220 , a candidate path screening module 230 , a communication cost calculation module 240 , and a path matching module 250 .

[0131] The network topology acquisition module 210 may be used to acquire a network topology relationship between a communication source node and a communication target node.

[0132] The dynamic database construction module 220 may be configured to construct a dynamic communication path database based on the network topology relationship and real-time link status parameters.

[0133] The candidate path screening module 230 may be configured to screen candidate communication paths that meet basic connection conditions from the dynamic communication path database to obtain a set of candidate communication paths.

[0134] The communication cost calculation module 240 may be configured to calculate the communication costs of multiple dimensions corresponding to each candidate communication path in the candidate communication path set by using a multi-dimensional communication cost evaluation model.

[0135] The path matching module 250 may be configured to perform communication path matching based on the QoS requirement information corresponding to the data to be transmitted and the communication costs in multiple dimensions corresponding to each candidate communication path, so as to determine a target communication path.

[0136] For more details about the above modules, please refer to other places in this manual (for example Figures 1 to 3 part and its related description), which will not be repeated here.

[0137] It should be understood that Figure 4 The communication path matching system 200 and its modules shown can be implemented in various ways. For example, in some embodiments, the system and its modules can be implemented by hardware, software, or a combination of software and hardware. The hardware portion can be implemented using dedicated logic; the software portion can be stored in a memory and executed by an appropriate instruction execution system, such as a microprocessor or dedicated hardware. Those skilled in the art will understand that the above-mentioned methods and systems can be implemented using computer-executable instructions and / or contained in processor control code, for example, such code is provided on a carrier medium such as a disk, CD or DVD-ROM, a programmable memory such as a read-only memory (firmware), or a data carrier such as an optical or electronic signal carrier. The system and its modules of this specification can be implemented not only by hardware circuits such as very large-scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, or programmable hardware devices such as field programmable gate arrays, programmable logic devices, but can also be implemented by software, for example, executed by various types of processors, or by a combination of the above-mentioned hardware circuits and software (for example, firmware).

[0138] It should be noted that the above description of the communication path matching system 200 is provided for illustrative purposes only and is not intended to limit the scope of this specification. It is understood that those skilled in the art can, based on the description of this specification, arbitrarily combine the modules or form subsystems connected with other modules without departing from the principles of this specification. For example, Figure 4The network topology acquisition module 210, dynamic database construction module 220, candidate path screening module 230, communication cost calculation module 240, and path matching module 250 described above may be different modules in a single system, or a single module may implement the functions of two or more of the aforementioned modules. Such variations are within the scope of protection of this specification.

[0139] In summary, the beneficial effects that may be brought about by the embodiments of this specification include but are not limited to: (1) In the communication path matching method and system provided in some embodiments of this specification, a dynamic communication path database is constructed based on the network topology relationship and real-time link state parameters between the communication source node and the communication target node, and then candidate communication paths that meet the basic connection conditions are screened out from the dynamic communication path database to obtain a candidate communication path set, and the communication costs of multiple dimensions corresponding to each candidate communication path in the candidate communication path set are calculated through a multi-dimensional communication cost evaluation model. Finally, communication path matching is performed according to the QoS requirement information corresponding to the data to be transmitted and the communication costs of multiple dimensions corresponding to each candidate communication path to determine the target communication path, which can effectively improve the accuracy of communication path matching and ensure high-quality data transmission. , and at the same time realize flexible matching of communication paths according to QoS requirement information; (2) in the communication path matching method and system provided in some embodiments of the present specification, by constructing a dynamic communication path database based on the network topology relationship and real-time link state parameters between the communication source node and the communication target node, the data transmission capacity of each communication path in the dynamic communication path database can be dynamically updated, thereby accurately reflecting the actual status of the current network, and facilitating accurate screening of the target communication path that meets the QoS requirement information corresponding to the data to be transmitted; (3) in the communication path matching method and system provided in some embodiments of the present specification, by performing communication cost evaluation on candidate communication paths in multiple dimensions, the transmission performance of candidate communication paths can be more comprehensively and accurately reflected, thereby improving the accuracy and reliability of communication path matching.

[0140] It should be noted that different embodiments may produce different beneficial effects. In different embodiments, the beneficial effects that may be produced may be any one or a combination of the above, or any other possible beneficial effects.

[0141] While the basic concepts have been described above, it will be apparent to those skilled in the art that the detailed disclosure is merely illustrative and does not limit this specification. Although not explicitly stated herein, various modifications, improvements, and revisions to this specification may be made by those skilled in the art. Such modifications, improvements, and revisions are suggested in this specification and remain within the spirit and scope of the exemplary embodiments of this specification.

[0142] This specification also uses specific terms to describe the embodiments of this specification. For example, "one embodiment," "an embodiment," and / or "some embodiments" refer to a feature, structure, or characteristic associated with at least one embodiment of this specification. Therefore, it should be emphasized and noted that references to "one embodiment," "an embodiment," or "an alternative embodiment" two or more times in different locations in this specification do not necessarily refer to the same embodiment. Furthermore, certain features, structures, or characteristics of one or more embodiments of this specification may be appropriately combined.

[0143] In addition, it will be understood by those skilled in the art that various aspects of this specification may be illustrated and described by a number of patentable categories or situations, including any new and useful process, machine, product or combination of substances, or any new and useful improvements thereto. Accordingly, various aspects of this specification may be performed entirely by hardware, entirely by software (including firmware, resident software, microcode, etc.), or by a combination of hardware and software. The above hardware or software may be referred to as "data blocks", "modules", "engines", "units", "components" or "systems". In addition, various aspects of this specification may be represented as a computer product located in one or more computer-readable media, which includes computer-readable program code.

[0144] A computer storage medium may include a propagated data signal embodying the computer program code, for example, in baseband or as part of a carrier wave. The propagated signal may be in a variety of forms, including electromagnetic, optical, or any suitable combination thereof. A computer storage medium may be any computer-readable medium other than a computer-readable storage medium that can be connected to an instruction execution system, apparatus, or device to communicate, propagate, or transfer the program for use. The program code on the computer storage medium may be transmitted via any suitable medium, including radio, cable, fiber optic cable, RF, or similar media, or any combination of these.

[0145] The computer program codes required for the operation of the various parts of this specification can be written in any one or more programming languages, including object-oriented programming languages ​​such as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C++, C#, VB.NET, Python, etc., conventional procedural programming languages ​​such as C, Visual Basic, Fortran2003, Perl, COBOL2002, PHP, ABAP, dynamic programming languages ​​such as Python, Ruby and Groovy, or other programming languages. The program code can be run entirely on the user's computer, or as a separate software package on the user's computer, or partly on the user's computer and partly on a remote computer, or entirely on a remote computer or processing device. In the latter case, the remote computer can be connected to the user's computer through any network form, such as a local area network (LAN) or a wide area network (WAN), or connected to an external computer (e.g., via the Internet), or in a cloud computing environment, or used as a service such as software as a service (SaaS).

[0146] In addition, unless expressly stated in the claims, the order of the processing elements and sequences, the use of alphanumeric characters, or the use of other names described in this specification are not intended to limit the order of the processes and methods of this specification. Although the above disclosure discusses some embodiments of the invention that are currently considered useful through various examples, it should be understood that such details are for illustrative purposes only, and the appended claims are not limited to the disclosed embodiments. On the contrary, the claims are intended to cover all modifications and equivalent combinations that are consistent with the spirit and scope of the embodiments of this specification. For example, although the system components described above can be implemented by hardware devices, they can also be implemented only by software solutions, such as installing the described system on an existing processing device or mobile device.

[0147] Similarly, it should be noted that, in order to simplify the presentation of this specification and thus facilitate understanding of one or more embodiments of the invention, the foregoing descriptions of the embodiments of this specification sometimes combine multiple features into a single embodiment, figure, or description thereof. However, this disclosure method does not imply that the subject matter of this specification requires more features than those recited in the claims. In fact, an embodiment may have fewer features than all of the features of a single disclosed embodiment.

[0148] In some embodiments, numbers are used to describe the quantity of components and attributes. It should be understood that such numbers used in the description of the embodiments are modified by the modifiers "about", "approximately" or "substantially" in some examples. Unless otherwise stated, "about", "approximately" or "substantially" indicate that the numbers are allowed to vary by ±20%. Accordingly, in some embodiments, the numerical parameters used in the description and claims are approximate values, which may change according to the required characteristics of individual embodiments. In some embodiments, the numerical parameters should take into account the specified significant digits and adopt the general method of retaining digits. Although the numerical domains and parameters used to confirm the breadth of their range in some embodiments of this specification are approximate values, in specific embodiments, the settings of such numerical values ​​are as accurate as possible within the feasible range.

[0149] Finally, it should be understood that the embodiments described in this specification are intended only to illustrate the principles of the embodiments of this specification. Other variations may also fall within the scope of this specification. Therefore, by way of example and not limitation, alternative configurations of the embodiments of this specification may be considered consistent with the teachings of this specification. Accordingly, the embodiments of this specification are not limited to the embodiments explicitly described and illustrated in this specification.

Claims

1. A communication path matching method, characterized in that: include: Obtaining the network topology relationship between the communication source node and the communication target node; Building a dynamic communication path database based on the network topology and real-time link state parameters, wherein the link state parameters include latency, packet loss rate, and available bandwidth; Screening candidate communication paths that meet basic connection conditions from the dynamic communication path database to obtain a set of candidate communication paths, wherein the basic connection conditions include a maximum hop limit and a minimum link state score threshold, and each candidate communication path includes at least the communication source node and the communication target node; Calculating the communication costs of multiple dimensions corresponding to each candidate communication path in the candidate communication path set by a multi-dimensional communication cost evaluation model, wherein the communication costs of the multiple dimensions are used to measure the communication quality risks of each candidate communication path in the multiple dimensions; Communication paths are matched based on the QoS requirement information corresponding to the data to be transmitted and the communication costs in multiple dimensions corresponding to each of the candidate communication paths to determine the target communication path, wherein the QoS requirement information includes at least one of delay sensitivity, bandwidth requirement, packet loss tolerance and security level indicator.

2. The communication path matching method according to claim 1, wherein: The constructing of a dynamic communication path database based on the network topology relationship and real-time link status parameters includes: Determining all possible communication links between the communication source node and the communication target node based on the network topology relationship, and performing a status evaluation on each possible communication link according to the real-time link status parameter to obtain a real-time link status score corresponding to each possible communication link; The real-time link status scores are associated with corresponding communication links and stored, thereby constructing the dynamic communication path database.

3. The communication path matching method according to claim 2, wherein: The determining all possible communication links between the communication source node and the communication target node based on the network topology relationship, and performing a status evaluation on each possible communication link according to the real-time link status parameter to obtain a real-time link status score corresponding to each possible communication link, including: Taking the communication source node as the starting point, traverse the entire network topology relationship through a depth-first search or breadth-first search algorithm to find all possible communication links from the communication source node to the communication target node; Calculating each possible communication link using the real-time link state parameter and a preset link state evaluation function to obtain a real-time link state score corresponding to each possible communication link; The link state evaluation function is: Where W represents the real-time link status score corresponding to the communication link; delay represents the comprehensive delay of the communication link, and α represents the parameter The corresponding weight; loss represents the comprehensive packet loss rate of the communication link, and β represents the parameter The corresponding weight; bandwid represents the available bandwidth of the communication link, and γ represents the weight corresponding to the available bandwidth bandwid.

4. The communication path matching method according to claim 3, wherein: The step of screening out candidate communication paths that meet basic connection conditions from the dynamic communication path database includes: Screening all communication links in the dynamic communication path database according to the maximum hop limit, excluding communication links with hops exceeding the maximum hop limit, and obtaining pre-screened communication links; All communication links in the preliminarily screened communication links are further screened according to the minimum link status score threshold, and communication links with real-time link status scores not lower than the minimum link status score threshold are selected as the candidate communication paths.

5. The communication path matching method according to claim 3, wherein: The multidimensional communication cost evaluation model includes a plurality of communication cost evaluation sub-models, wherein the communication cost evaluation sub-models include at least a delay cost evaluation sub-model, a packet loss cost evaluation sub-model, a bandwidth cost evaluation sub-model and a security cost evaluation sub-model; The calculating, using a multi-dimensional communication cost evaluation model, the communication costs of multiple dimensions corresponding to each candidate communication path in the candidate communication path set includes: Inputting the comprehensive delay, path length, and delay stability corresponding to the candidate communication path into the delay cost evaluation submodel for calculation to obtain the delay cost corresponding to the candidate communication path, wherein the path length is obtained by calculating the sum of the physical distances between all communication nodes passed by the candidate communication path, and the delay stability is obtained by performing a statistical analysis on the comprehensive delay of the candidate communication path within a preset time period; Inputting the comprehensive packet loss rate and packet loss rate stability corresponding to the candidate communication path into the packet loss cost evaluation sub-model for calculation to obtain the packet loss cost corresponding to the candidate communication path, wherein the packet loss rate stability is obtained by statistically analyzing the packet loss rate of the candidate communication path within a preset time period; Inputting the available bandwidth and bandwidth stability corresponding to the candidate communication path into the bandwidth cost evaluation sub-model for calculation to obtain the bandwidth cost corresponding to the candidate communication path, wherein the bandwidth stability is obtained by statistically analyzing the changes in bandwidth utilization of the candidate communication path within a preset time period; The number of network nodes corresponding to the candidate communication path and the security score of each network node are input into the security cost assessment sub-model for calculation to obtain the security cost corresponding to the candidate communication path, wherein the security score of each network node is obtained by statistically analyzing the security events of the candidate communication path within a preset time period.

6. The communication path matching method according to claim 5, wherein: The delay cost is calculated by the following formula (1): C1=k1*delay+k2*l+k3*s1; (1) Where C1 represents the delay cost, delay represents the comprehensive delay corresponding to the candidate communication path, l represents the path length corresponding to the candidate communication path, s1 represents the delay stability corresponding to the candidate communication path, k1 represents the weight corresponding to the comprehensive delay delay, k2 represents the weight corresponding to the path length l, and k3 represents the weight corresponding to the delay stability s1; The packet loss cost is calculated using the following formula (2): Among them, C2 represents the packet loss cost, loss represents the comprehensive packet loss rate corresponding to the candidate communication path, s2 represents the packet loss rate stability corresponding to the candidate communication path, k4 represents the weight corresponding to the comprehensive packet loss rate loss, and k5 represents the parameter The corresponding weight; The bandwidth cost is calculated by the following formula (3): Among them, C3 represents the bandwidth cost, bandwid represents the available bandwidth corresponding to the candidate communication path, s3 represents the bandwidth stability corresponding to the candidate communication path, and k6 represents the parameter The corresponding weight, k5 represents the parameter The corresponding weight; The security cost is calculated by the following formula (4): Among them, C4 represents the security cost, N represents the number of network nodes corresponding to the candidate communication path, and Z represents the sum of the security scores of all network nodes passed by the candidate communication path.

7. The communication path matching method according to claim 6, wherein: The performing communication path matching according to the QoS requirement information corresponding to the data to be transmitted and the communication costs of multiple dimensions corresponding to each of the candidate communication paths to determine the target communication path includes: Comparing the QoS requirement information corresponding to the data to be transmitted with the communication service quality information calculated based on the communication costs of multiple dimensions corresponding to each of the candidate communication paths, and determining a candidate communication path that meets the QoS requirement information; Among the candidate communication paths that meet the QoS requirement information, the candidate communication path with the smallest total communication cost is selected as the target communication path.

8. The communication path matching method according to claim 7, wherein: The performing communication path matching according to the QoS requirement information corresponding to the data to be transmitted and the communication costs of multiple dimensions corresponding to each of the candidate communication paths to determine the target communication path further includes: When all the candidate communication paths do not meet the QoS requirement information corresponding to the data to be transmitted, the network topology relationship between the communication source node and the communication target node is re-acquired, and the real-time link status parameters are updated, and the steps of constructing a dynamic communication path database, screening candidate communication paths, and calculating communication costs are re-executed until a target communication path that meets the QoS requirement information is determined.

9. The communication path matching method according to claim 8, wherein: The method further comprises: monitoring the target communication path in real time, and predicting the link state parameters of the monitored target communication path to obtain predicted link state parameters; When the predicted link state parameters change, and the changed link state parameters cause the target communication path to be unable to meet the QoS requirement information, the steps of constructing a dynamic communication path database, screening candidate communication paths, and calculating communication costs are re-executed to match the new target communication path, and the data to be transmitted is switched to the new target communication path for transmission.

10. A communication path matching system, characterized in that: include: A network topology acquisition module is used to obtain the network topology relationship between the communication source node and the communication target node; A dynamic database construction module, configured to construct a dynamic communication path database based on the network topology and real-time link state parameters, wherein the link state parameters include latency, packet loss rate, and available bandwidth; a candidate path screening module, configured to screen candidate communication paths that meet basic connection conditions from the dynamic communication path database to obtain a set of candidate communication paths, wherein the basic connection conditions include a maximum hop limit and a minimum link state score threshold, and each candidate communication path includes at least the communication source node and the communication target node; a communication cost calculation module, configured to calculate the communication costs in multiple dimensions corresponding to each candidate communication path in the candidate communication path set using a multi-dimensional communication cost evaluation model, wherein the communication costs in multiple dimensions are used to measure the communication quality risks of each candidate communication path in multiple dimensions; A path matching module is used to match communication paths based on the QoS requirement information corresponding to the data to be transmitted and the communication costs in multiple dimensions corresponding to each of the candidate communication paths to determine the target communication path, wherein the QoS requirement information includes at least one of delay sensitivity, bandwidth requirement, packet loss tolerance and security level indicator.

Images