Method and system for measuring bidirectional shortest delay link in time-sensitive communication network

Abstract

The present invention discloses a method and system for measuring the shortest two-way delay link of a time-sensitive communication network, belonging to the field of 5G communication technology. The time-sensitive communication network includes a plurality of communication terminals, a plurality of switches for realizing information transmission between different communication terminals, and a plurality of communication links composed of the plurality of communication terminals and the plurality of switches; wherein the plurality of communication terminals and the plurality of switches all have the time synchronization characteristics of the time-sensitive communication network, and time synchronization is realized by the generalized precise time protocol gPTP in the 802.1AS standard. The present invention can measure the time symmetry of the two-way link delay, and can use a genetic algorithm to measure the optimal sending and response links that meet the 802.1Qat protocol before the data traffic is sent. By improving the genetic algorithm, the efficiency of iterative convergence is improved.

Description

Technical Field

[0001] The present invention belongs to the field of 5G communication technology, and in particular relates to a method and system for measuring the shortest bidirectional delay link in a time-sensitive communication network. Background Art

[0002] The development of time-sensitive networking (TSN) in recent years has been unprecedented. The application of TSN in the Internet of Vehicles, VR, and industrial production enables these highly time-sensitive traffic to be transmitted with better efficiency.

[0003] First, time-sensitive networking (TSN) has two implications: first, data must be transmitted without delay and with integrity; second, all connected devices must have synchronized and coordinated clocks. Therefore, attention to time is crucial when utilizing TSN. The current TSN standards development group has specified methods for providing time synchronization, namely the IEEE 802.1AS Precision Time Synchronization Protocol, and bandwidth guarantees, namely the IEEE 802.1Qat Resource Reservation Protocol. Currently, only a few companies have mastered the stream reservation protocol. This protocol describes the process of reserving bandwidth for specific data flows in a time-sensitive network, consisting of two steps: registration and reservation. Simply put, before sending a time-sensitive data flow from terminal A, it must confirm whether the receiving terminal can receive it. This process involves bidirectional transmission of the link. However, for a given data flow, due to differences in link structure and transmission materials, link latency can be asymmetric. For example, the time delay from terminal A to terminal C and from terminal C to terminal A can be asymmetric. In the process of implementing the stream reservation protocol, bidirectional message transmission is required. Therefore, it is necessary to consider whether there is asymmetry in the delay of the transmission link and find the fastest transmission link to ensure the rapid transmission of subsequent data streams.

[0004] Today, with a deeper understanding of software testing, it has naturally become an integral part of the software development cycle. With the increasing use of software, people are increasingly concerned about software quality. Genetic algorithms offer significant advantages in convergence and speed when solving optimization and clustering problems. Therefore, combining genetic algorithms with link delay testing can better and more quickly find the optimal solution. This is particularly effective when there are a large number of links. Currently, measuring two-way link delay is done by testing the transmission quality of packets in the laboratory using materials such as optical fiber, or by measuring them using electrical signals. However, laboratory testing often falls short of real-world testing. For example, there can be inconsistencies in forward and reverse transmission messages, resulting in different forward and reverse delays. Furthermore, this method cannot determine the optimal transmission path when there are many nodes in the network. Summary of the Invention

[0005] In order to solve the above technical problems, the present invention proposes a solution for measuring the shortest bidirectional delay link in a time-sensitive communication network.

[0006] A first aspect of the present invention discloses a method for measuring the shortest bidirectional delay link in a time-sensitive communication network. The time-sensitive communication network includes a plurality of communication terminals, a plurality of switches for implementing information transmission between the communication terminals, and a plurality of communication links formed by the plurality of communication terminals and the plurality of switches; wherein the plurality of communication terminals and the plurality of switches all have the time synchronization characteristics of the time-sensitive communication network, and time synchronization is achieved using the Generalized Precision Time Protocol (gPTP) in the 802.1AS standard.

[0007] The method comprises:

[0008] Step S1: performing link initialization between a first communication terminal and a second communication terminal based on a directed graph of the time-sensitive communication network to obtain a set of bidirectional links between the first communication terminal and the second communication terminal;

[0009] Step S2: extracting a portion of the bidirectional links from the bidirectional link set according to a certain ratio as a first bidirectional link set, and the remaining bidirectional links as a second bidirectional link set, and calculating the fitness of each bidirectional link in the first bidirectional link set, where the fitness of the bidirectional link represents the sum of delays of all nodes in the bidirectional link, where the nodes include the first communication terminal, the second communication terminal, and a plurality of switches bidirectionally connected to the first communication terminal and the second communication terminal;

[0010] Step S3: determining a fitness crossover probability value and a fitness mutation probability value based on the fitness of each bidirectional link in the first bidirectional link set to determine a crossover condition and a mutation condition, respectively; performing a crossover operation on the bidirectional links in the first bidirectional link set that meet the crossover condition; and performing a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition.

[0011] Step S4: recalculating the fitness of each bidirectional link in the first bidirectional link set after the crossover operation and the mutation operation are performed; wherein:

[0012] When the recalculated fitness values ​​exceed a fitness threshold, extracting a bidirectional link exceeding the fitness threshold as a bidirectional shortest delay link of the time-sensitive communication network;

[0013] Otherwise, the fitness crossover probability value and the fitness mutation probability value are recalculated, and the crossover operation and information mutation operation are performed again until the fitness threshold condition is met.

[0014] According to the method of the first aspect of the present invention, in step S1:

[0015] The directed graph of the time-sensitive communication network is represented by P=(V, E), where V represents the set of all communication terminals included in the time-sensitive communication network, and E represents the bidirectional link between any two communication terminals, which is expressed as [(X i ,X j ),(X j ,X i )]∈E, 1≤i≤n, 1≤j≤n, i≠j, [(X i ,X j ),(X j ,X i )]=[(X j ,X i ),(X i ,X j )], n is the total number of communication terminals in the time-sensitive communication network;

[0016] The first communication terminal and the second communication terminal are selected from the directed graph, and the set of bidirectional links between the first communication terminal and the second communication terminal is represented by Q(t)={U1, U2, ..., U L},U1,U2,...,U L represents all feasible L bidirectional links between the first communication terminal and the second communication terminal, for U1, U2, ..., U LFor each bidirectional link in the embodiment, the starting node and the end node of the bidirectional link are both the first communication terminal, there is an intermediate node between the starting node and the end node, which is the second terminal, the other nodes between the starting node and the intermediate node are several switches that can connect the first communication terminal and the second communication terminal, and the other nodes between the intermediate node and the end node are several switches that can connect the second communication terminal and the first communication terminal.

[0017] According to the method of the first aspect of the present invention, in step S2: the fitness of the kth bidirectional link in the first bidirectional link set is characterized by F k =1 / T k , T k is the sum of the delays of all nodes in the k-th bidirectional link, T k =t k(起始) +t k(第一方向交换机时延和) +t k(中间) +t k(第二方向交换机时延和) +t k(末端) , 1≤k≤L,t k(起始) is the delay of the starting node, t k(第一方向交换机时延和) is the sum of the delays of several switches connecting the first communication terminal and the second communication terminal between the starting node and the intermediate node, t k(中间) is the delay of the intermediate node, t k(第二方向交换机时延和) is the sum of the delays of several switches connecting the second communication terminal and the first communication terminal between the intermediate node and the end node, t k(末端) is the delay of the end node.

[0018] According to the method of the first aspect of the present invention, in step S3:

[0019] The fitness crossover probability value P 交叉 =(F 最大 -F 平均 ) / (F 最大 -F 最小 ), F 最大 represents the maximum fitness among the fitness of all bidirectional links in the first bidirectional link set, F 平均 represents the average fitness of all bidirectional links in the first bidirectional link set, F 最小 represents the minimum fitness among the fitnesses of all bidirectional links in the first bidirectional link set;

[0020] The cross condition is that the fitness of the bidirectional link on which the cross operation is to be performed is less than the fitness cross probability value;

[0021] The fitness mutation probability value P变异 =P 交叉 ×g, g is the adjustment coefficient, 0.5<g<1;

[0022] The mutation condition is that the fitness of the bidirectional link on which the mutation operation is to be performed is less than the fitness mutation probability value.

[0023] According to the method of the first aspect of the present invention, in step S3, performing a crossover operation on the bidirectional links in the first bidirectional link set that meet the crossover condition using the second bidirectional link set specifically includes:

[0024] For each bidirectional link in the first bidirectional link set, when it meets the cross condition, any one of its unidirectional links is exchanged with any one of the bidirectional links randomly selected from the second bidirectional link set to complete the cross operation, and during the exchange process, the correspondence between any one of the unidirectional links and the first communication terminal and the second communication terminal is maintained.

[0025] According to the method of the first aspect of the present invention, in step S3, performing a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition using the second bidirectional link set specifically includes:

[0026] For each bidirectional link in the first bidirectional link set, when the mutation condition is met, q switches in any unidirectional link are replaced with q different switches other than the switches included in the unidirectional link. Connectivity of the replaced unidirectional link is checked. If the connectivity check passes, the mutation operation is completed.

[0027] According to the method of the first aspect of the present invention, between step S2 and step S3, the method further includes:

[0028] Each bidirectional link in the first bidirectional link set calculated in step S2 is sorted from large to small according to fitness, and the w bidirectional links with lower sorting are replaced with the w bidirectional links with higher sorting. The crossover operation and the mutation operation are performed on the replaced first bidirectional links in step S3.

[0029] A second aspect of the present invention discloses a system for measuring the shortest bidirectional delay link in a time-sensitive communication network. The time-sensitive communication network includes a plurality of communication terminals, a plurality of switches for implementing information transmission between the communication terminals, and a plurality of communication links formed by the plurality of communication terminals and the plurality of switches. The plurality of communication terminals and the plurality of switches all have the time synchronization characteristics of the time-sensitive communication network, and time synchronization is achieved using the Generalized Precision Time Protocol (gPTP) in the 802.1AS standard.

[0030] The system comprises:

[0031] a first processing unit configured to perform link initialization between a first communication terminal and a second communication terminal based on a directed graph of the time-sensitive communication network, so as to obtain a set of bidirectional links between the first communication terminal and the second communication terminal;

[0032] a second processing unit configured to extract, according to a certain ratio, a portion of the bidirectional links from the bidirectional link set as a first bidirectional link set and the remaining bidirectional links as a second bidirectional link set, and calculate the fitness of each bidirectional link in the first bidirectional link set, where the fitness of the bidirectional link represents the sum of delays of all nodes in the bidirectional link, where the nodes include a first communication terminal, a second communication terminal, and a plurality of switches bidirectionally connected to the first communication terminal and the second communication terminal;

[0033] a third processing unit configured to determine a fitness crossover probability value and a fitness mutation probability value based on the fitness of each bidirectional link in the first bidirectional link set, so as to respectively determine a crossover condition and a mutation condition, perform a crossover operation on the bidirectional links in the first bidirectional link set that meet the crossover condition using the second bidirectional link set, and perform a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition using the second bidirectional link set;

[0034] The fourth processing unit is configured to recalculate the fitness of each bidirectional link in the first bidirectional link set after performing the crossover operation and the mutation operation; wherein:

[0035] When the recalculated fitness values ​​exceed a fitness threshold, extracting a bidirectional link exceeding the fitness threshold as a bidirectional shortest delay link of the time-sensitive communication network;

[0036] Otherwise, the fitness crossover probability value and the fitness mutation probability value are recalculated, and the crossover operation and information mutation operation are performed again until the fitness threshold condition is met.

[0037] According to the system of the second aspect of the present invention, the directed graph of the time-sensitive communication network is represented by P=(V, E), where V represents the set of all communication terminals included in the time-sensitive communication network, and E represents the bidirectional link between any two communication terminals, which is expressed as [(X i ,X j ),(X j ,X i )]∈E, 1≤i≤n, 1≤j≤n, i≠j, [(X i ,X j ),(Xj ,X i )]=[(X j ,X i ),(X i ,X j )], n is the total number of communication terminals in the time-sensitive communication network.

[0038] The first processing unit is specifically configured to:

[0039] The first communication terminal and the second communication terminal are selected from the directed graph, and the set of bidirectional links between the first communication terminal and the second communication terminal is represented by Q(t)={U1, U2, ..., U L},U1,U2,...,U L represents all feasible L bidirectional links between the first communication terminal and the second communication terminal, for U1, U2, ..., U L For each bidirectional link in the embodiment, the starting node and the end node of the bidirectional link are both the first communication terminal, there is an intermediate node between the starting node and the end node, which is the second terminal, the other nodes between the starting node and the intermediate node are several switches that can connect the first communication terminal and the second communication terminal, and the other nodes between the intermediate node and the end node are several switches that can connect the second communication terminal and the first communication terminal.

[0040] According to the system of the second aspect of the present invention, the fitness of the kth bidirectional link in the first bidirectional link set is characterized by F k =1 / T k , T k is the sum of the delays of all nodes in the k-th bidirectional link, T k =t k(起始) +t k(第一方向交换机时延和) +t k(中间) +t k(第二方向交换机时延和) +t k(末端) , 1≤k≤L,t k(起始) is the delay of the starting node, t k(第一方向交换机时延和) is the sum of the delays of several switches connecting the first communication terminal and the second communication terminal between the starting node and the intermediate node, t k(中间) is the delay of the intermediate node, t k(第二方向交换机时延和) is the sum of the delays of several switches connecting the second communication terminal and the first communication terminal between the intermediate node and the end node, t k(末端) is the delay of the end node.

[0041] The system according to the second aspect of the present invention:

[0042] The fitness crossover probability value P 交叉 =(F 最大 -F 平均 ) / (F 最大 -F 最小 ), F 最大 represents the maximum fitness among the fitness of all bidirectional links in the first bidirectional link set, F 平均 represents the average fitness of all bidirectional links in the first bidirectional link set, F 最小 represents the minimum fitness among the fitnesses of all bidirectional links in the first bidirectional link set;

[0043] The cross condition is that the fitness of the bidirectional link on which the cross operation is to be performed is less than the fitness cross probability value;

[0044] The fitness mutation probability value P 变异 =P 交叉 ×g, g is the adjustment coefficient, 0.5<g<1;

[0045] The mutation condition is that the fitness of the bidirectional link on which the mutation operation is to be performed is less than the fitness mutation probability value.

[0046] According to the system of the second aspect of the present invention, the third processing unit is specifically configured to: use the second bidirectional link set to perform a cross operation on the bidirectional links in the first bidirectional link set that meet the cross condition, specifically including:

[0047] For each bidirectional link in the first bidirectional link set, when it meets the cross condition, any one of its unidirectional links is exchanged with any one of the bidirectional links randomly selected from the second bidirectional link set to complete the cross operation, and during the exchange process, the correspondence between any one of the unidirectional links and the first communication terminal and the second communication terminal is maintained.

[0048] According to the system of the second aspect of the present invention, the third processing unit is specifically configured to: use the second bidirectional link set to perform a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition, specifically including:

[0049] For each bidirectional link in the first bidirectional link set, when the mutation condition is met, q switches in any unidirectional link are replaced with q different switches other than the switches included in the unidirectional link. Connectivity of the replaced unidirectional link is checked. If the connectivity check passes, the mutation operation is completed.

[0050] According to the system of the second aspect of the present invention, each bidirectional link in the first bidirectional link set calculated by the second processing unit is sorted from large to small according to fitness, and the w bidirectional links with lower sorting are replaced with the w bidirectional links with higher sorting. The third processing unit performs the crossover operation and the mutation operation on the replaced first bidirectional links.

[0051] A third aspect of the present invention discloses an electronic device. The electronic device includes a memory and a processor. The memory stores a computer program. When the processor executes the computer program, it implements the steps of the method for measuring the shortest bidirectional delay link in a time-sensitive communication network described in the first aspect of the present invention.

[0052] A fourth aspect of the present invention discloses a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method for measuring the shortest bidirectional delay link in a time-sensitive communication network described in the first aspect of the present invention.

[0053] In summary, the solution of the present invention can measure the time symmetry of bidirectional link delay. Using a genetic algorithm, it is possible to select the optimal sending and reply links that meet the 802.1Qat protocol before data traffic is sent. By improving the genetic algorithm, the efficiency of iterative convergence is improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the specific embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0055] Figure 1 Flowchart of a method for measuring the shortest bidirectional delay link in a time-sensitive communication network according to an embodiment of the present invention;

[0056] Figure 2 is a directed graph of bidirectional links (return path) of a time-sensitive communication network when a first communication terminal and a second communication terminal are selected according to an embodiment of the present invention;

[0057] Figure 3 FIG. 4 is a structural diagram of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION

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

[0059] A request declaration message is sent from terminal A to apply for bandwidth reservation for the data traffic. It is transmitted and forwarded through different ports of different switches and finally reaches terminal C. After receiving the request declaration message, terminal C registers the attribute. At the same time, terminal C sends a response declaration message corresponding to the bandwidth reservation application. It is again transmitted and forwarded through different ports of different switches and finally reaches terminal A. In this way, terminal A knows that terminal C can receive the specific data stream at this time and then immediately sends the data traffic. In this process, the transmission of the declaration message becomes complicated due to the presence of different switches and different data transmission and forwarding ports in the TSN network system. At the same time, there may be links with asymmetric transmission delays in the TSN network. Therefore, if we simply consider the declaration message being transmitted along the original route, the time gap from the time terminal A sends the request declaration message to the time it receives the response declaration message will become longer, which is not conducive to the real-time transmission of time-sensitive data. Therefore, when measuring the time delay for this type of problem, it is necessary to consider the asymmetry of the links and select the fastest link by calculating the two-way delay of each link: the link with the shortest time from terminal A to C and then back to A is selected to send and receive the corresponding declaration message, thereby achieving higher accuracy and faster latency data transmission.

[0060] A first aspect of the present invention discloses a method for measuring the shortest bidirectional delay link in a time-sensitive communication network. The time-sensitive communication network includes a plurality of communication terminals, a plurality of switches for implementing information transmission between the communication terminals, and a plurality of communication links formed by the plurality of communication terminals and the plurality of switches; wherein the plurality of communication terminals and the plurality of switches all have the time synchronization characteristics of the time-sensitive communication network, and time synchronization is achieved using the Generalized Precision Time Protocol (gPTP) in the 802.1AS standard.

[0061] Specifically, assume that a TSN network model contains three elements: terminals, switches, and transmission links. When measuring the time delay of a TSN, the tester is also regarded as a terminal, which includes a traffic generation module and a traffic receiving module. Each TSN switch contains several ports for receiving and forwarding data. All terminals and ports are called nodes. For TSN, each node in the model should support TSN features such as time synchronization and traffic scheduling. Before testing, the network model is first synchronized using the generalized precision time protocol (gPTP) in the 802.1AS standard to ensure that the time used by all nodes is synchronized. The transmission link is a bidirectional Ethernet link.

[0062] Specifically, if Figure 1 As shown, the method includes:

[0063] Step S1: performing link initialization between a first communication terminal and a second communication terminal based on a directed graph of the time-sensitive communication network to obtain a set of bidirectional links between the first communication terminal and the second communication terminal;

[0064] Step S2: extracting a portion of the bidirectional links from the bidirectional link set according to a certain ratio as a first bidirectional link set, and the remaining bidirectional links as a second bidirectional link set, and calculating the fitness of each bidirectional link in the first bidirectional link set, where the fitness of the bidirectional link represents the sum of delays of all nodes in the bidirectional link, where the nodes include the first communication terminal, the second communication terminal, and a plurality of switches bidirectionally connected to the first communication terminal and the second communication terminal;

[0065] Step S3: determining a fitness crossover probability value and a fitness mutation probability value based on the fitness of each bidirectional link in the first bidirectional link set to determine a crossover condition and a mutation condition, respectively; performing a crossover operation on the bidirectional links in the first bidirectional link set that meet the crossover condition; and performing a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition.

[0066] Step S4: recalculating the fitness of each bidirectional link in the first bidirectional link set after the crossover operation and the mutation operation are performed; wherein:

[0067] When the recalculated fitness values ​​exceed a fitness threshold, extracting a bidirectional link exceeding the fitness threshold as a bidirectional shortest delay link of the time-sensitive communication network;

[0068] Otherwise, the fitness crossover probability value and the fitness mutation probability value are recalculated, and the crossover operation and information mutation operation are performed again until the fitness threshold condition is met.

[0069] In step S1, link initialization between a first communication terminal and a second communication terminal is performed based on a directed graph of the time-sensitive communication network to obtain a set of bidirectional links between the first communication terminal and the second communication terminal.

[0070] In some embodiments, in step S1:

[0071] The directed graph of the time-sensitive communication network is represented by P=(V, E), where V represents the set of all communication terminals included in the time-sensitive communication network, and E represents the bidirectional link between any two communication terminals, which is expressed as [(X i ,X j ),(X j ,X i )]∈E, 1≤i≤n, 1≤j≤n, i≠j, [(X i ,X j ),(X j ,X i )]=[(X j ,X i ),(X i ,X j )], n is the total number of communication terminals in the time-sensitive communication network.

[0072] Specifically, if Figure 2 As shown, when the first communication terminal and the second communication terminal are selected, for example, the tester is the first communication terminal and the terminal is the second communication terminal; there are two bidirectional links between the two communication terminals, link 1 passes through switches 1 and 3, and link 2 passes through switches 2 and 4.

[0073] The first communication terminal and the second communication terminal are selected from the directed graph, and the set of bidirectional links between the first communication terminal and the second communication terminal is represented by Q(t)={U1, U2, ..., U L},U1,U2,...,U L represents all feasible L bidirectional links between the first communication terminal and the second communication terminal, for U1, U2, ..., U LFor each bidirectional link in the embodiment, the starting node and the end node of the bidirectional link are both the first communication terminal, there is an intermediate node between the starting node and the end node, which is the second terminal, the other nodes between the starting node and the intermediate node are several switches that can connect the first communication terminal and the second communication terminal, and the other nodes between the intermediate node and the end node are several switches that can connect the second communication terminal and the first communication terminal.

[0074] Specifically, the ordered data sequence that starts from the starting node and is transmitted to the end node according to certain requirements is called a data stream. For the test data stream, the transmission cycle and load value generated each time should be consistent.

[0075] Specifically, for each bidirectional link, the outbound and return switches may or may not be the same. That is, the switches (e.g., switches 1, 3, or 5) used by the first communication terminal to reach the second communication terminal can be different from the switches (e.g., switches 2, 4, or 6) used by the second communication terminal to return to the first communication terminal. The test data stream does not necessarily return along the same route (via the original switch) after arriving at the second communication terminal. Alternatively, it can return along the same route. All of the above solutions are included in the set of bidirectional links between the first and second communication terminals.

[0076] Specifically, the link refers to all transmission paths (between nodes) that each test data passes through from the tester's sending port to the terminal's receiving port and back to the tester. Using binary coding, write L possible feasible links from the first communication terminal to the second communication terminal and then back to the first communication terminal as the initial population. Note that during the initialization process, eliminate links that cannot be expressed as a legal link (links that pass the connectivity test), that is, delete impossible links.

[0077] In step S2, a portion of the bidirectional links is extracted from the bidirectional link set according to a certain ratio as a first bidirectional link set, and the remaining bidirectional links are extracted as a second bidirectional link set. The fitness of each bidirectional link in the first bidirectional link set is calculated. The fitness of the bidirectional link represents the sum of the delays of all nodes in the bidirectional link. The nodes include the first communication terminal, the second communication terminal, and a number of switches bidirectionally connected to the first communication terminal and the second communication terminal.

[0078] Specifically, the ratio may be 3:7, 5:5, etc. When the bidirectional link set includes tens of thousands or even hundreds of thousands of combinations of bidirectional links, a specific number of bidirectional links (e.g., 500 or 1000) may be specified to form the first bidirectional link set, and when extracting some bidirectional links to form the first bidirectional link set, the extraction method is random extraction.

[0079] In some embodiments, in step S2: the fitness of the kth bidirectional link in the first bidirectional link set is represented by F k =1 / T k , T k is the sum of the delays of all nodes in the k-th bidirectional link, T k =t k(起始) +t k(第一方向交换机时延和) +t k(中间) +t k(第二方向交换机时延和) +t k(末端) , 1≤k≤L,t k(起始) is the delay of the starting node, t k(第一方向交换机时延和) is the sum of the delays of several switches connecting the first communication terminal and the second communication terminal between the starting node and the intermediate node, t k(中间) is the delay of the intermediate node, t k(第二方向交换机时延和) is the sum of the delays of several switches connecting the second communication terminal and the first communication terminal between the intermediate node and the end node, t k(末端) is the delay of the end node.

[0080] Specifically, taking a route from a first communication terminal to a second communication terminal via switches 1, 3, and 5, and then from the second communication terminal back to the first communication terminal via switches 2, 4, and 6 as an example, the sum of the delays for the entire bidirectional link is the sum of the delays of the first communication terminal, switches 1, 3, and 5, the second communication terminal, switches 2, 4, and 6, and the second communication terminal. The inverse of this sum is the fitness value for the bidirectional link. The delay can be calculated based on the load value of the test data stream to obtain the corresponding data transmission time. Determination of the delay can be performed using commonly used methods in the art and is not limited here.

[0081] In some embodiments, between step S2 and step S3, the method further includes: sorting each bidirectional link in the first bidirectional link set calculated in step S2 from highest to lowest fitness, replacing the w bidirectional links with the w bidirectional links with the highest fitness, and performing the crossover and mutation operations in step S3 on the replaced first bidirectional links. Specifically, the above process can be an additional or optional step, i.e., prior to executing step S3, the bidirectional links in the first bidirectional link set are optimized.

[0082] In step S3, a fitness crossover probability value and a fitness mutation probability value are determined based on the fitness of each bidirectional link in the first bidirectional link set to respectively determine a crossover condition and a mutation condition, and a crossover operation is performed on the bidirectional links in the first bidirectional link set that meet the crossover condition using the second bidirectional link set, and a mutation operation is performed on the bidirectional links in the bidirectional link set that meet the mutation condition using the second bidirectional link set.

[0083] In some embodiments, in step S3:

[0084] The fitness crossover probability value P 交叉 =(F 最大 -F 平均 ) / (F 最大 -F 最小 ), F 最大 represents the maximum fitness among the fitness of all bidirectional links in the first bidirectional link set, F 平均 represents the average fitness of all bidirectional links in the first bidirectional link set, F 最小 represents the minimum fitness of all bidirectional links in the first bidirectional link set; F 平均 The fitness cross probability value can be determined by a commonly used calculation method in the art and is not limited here. The cross condition is that the fitness of the bidirectional link to be cross-linked is less than the fitness cross probability value.

[0085] The fitness mutation probability value P 变异 =P 交叉 ×g, where g is the adjustment coefficient and 0.5 < g < 1. Alternatively, the fitness crossover probability value can be directly used as the fitness mutation probability value. The fitness mutation probability value can be determined using commonly used calculation methods in the art and is not limited here. The mutation condition is that the fitness of the bidirectional link on which the mutation operation is to be performed is less than the fitness mutation probability value.

[0086] In some embodiments, in step S3, the second bidirectional link set is used to perform a cross operation on the bidirectional links in the first bidirectional link set that meet the cross condition, specifically including: for each bidirectional link in the first bidirectional link set, when it meets the cross condition, any of its unidirectional links is exchanged with any unidirectional link of a bidirectional link randomly selected from the second bidirectional link set to complete the cross operation, and during the exchange process, the correspondence between any unidirectional link and the first communication terminal and the second communication terminal is maintained respectively.

[0087] Specifically, for example, if the links in the first bidirectional link set: {first communication terminal, switches 1, 3, 5, second communication terminal, switches 2, 4, 6, first communication terminal} meet the crossover condition, the bidirectional links randomly selected from the second bidirectional link set are {first communication terminal, switches 45, 98, 120, 151, second communication terminal, switches 68, 32, first communication terminal}; when crossover occurs, the following operations (any one of which can be selected) can be performed:

[0088] (1) Swap the unidirectional link {switch 1, 3, 5} with the unidirectional link {switch 45, 98, 120, 151} to obtain a bidirectional link {first communication terminal, switch 45, 98, 120, 151, second communication terminal, switch 2, 4, 6, first communication terminal} after crossing;

[0089] (2) Swap the unidirectional link {switch 2, 4, 6} with the unidirectional link {switch 68, 32} to obtain a bidirectional link {first communication terminal, switch 1, 3, 5, second communication terminal, switch 68, 32, first communication terminal} after crossing;

[0090] (3) Swap the unidirectional link {switch 1, 3, 5} with the unidirectional link {switch 68, 32}. Note that during the swapping process, the correspondence between any of the unidirectional links and the first communication terminal and the second communication terminal is maintained, resulting in a bidirectional link {first communication terminal, switch 32, 68, second communication terminal, switch 2, 4, 6, first communication terminal} after the crossover.

[0091] (4) Swap the unidirectional link {switch 2, 4, 6} with the unidirectional link {switch 45, 98, 120, 151}. Note that during the swapping process, the correspondence between any of the unidirectional links and the first communication terminal and the second communication terminal is maintained, resulting in a crossed bidirectional link {first communication terminal, switch 1, 3, 5, second communication terminal, switch 151, 120, 98, 45, first communication terminal}.

[0092] In some embodiments, in step S3, a mutation operation is performed on the bidirectional links in the bidirectional link set that meet the mutation condition using the second bidirectional link set. Specifically, for each bidirectional link in the first bidirectional link set, when it meets the mutation condition, q switches in any unidirectional link are replaced with q different switches other than the switches included in any unidirectional link, and connectivity of any replaced unidirectional link is checked. After the connectivity check passes, the mutation operation is completed.

[0093] Specifically, for example, the links in the first bidirectional link set: {first communication terminal, switches 1, 3, 5, second communication terminal, switches 2, 4, 6, first communication terminal} meet the mutation condition. During mutation, if q = 1, switch 3 is randomly selected as the switch to be crossed and replaced with any switch other than the switches in the unidirectional link (switches 1, 3, 5) where it is located. For example, this could be switch 2, 6, 68, 193, and so on. If q is multiple switches, the mutation operation described above is performed on each of the selected switches to be mutated.

[0094] In step S4, the fitness of each bidirectional link in the first bidirectional link set after the crossover operation and the mutation operation are performed is calculated again; wherein:

[0095] If any of the recalculated fitness values ​​exceeds a fitness threshold, the bidirectional link exceeding the fitness threshold is selected as the bidirectional shortest-delay link in the time-sensitive communication network. (Note that if more than one bidirectional link exceeds the fitness threshold, the link with the highest fitness value is selected as the bidirectional shortest-delay link.)

[0096] Otherwise, the fitness crossover probability value and the fitness mutation probability value are recalculated, and the crossover operation and information mutation operation are performed again until the fitness threshold condition is met. Through multiple cycles (polling), the bidirectional shortest delay link is finally obtained.

[0097] A second aspect of the present invention discloses a system for measuring the shortest bidirectional delay link in a time-sensitive communication network. The time-sensitive communication network includes a plurality of communication terminals, a plurality of switches for implementing information transmission between the communication terminals, and a plurality of communication links formed by the plurality of communication terminals and the plurality of switches. The plurality of communication terminals and the plurality of switches all have the time synchronization characteristics of the time-sensitive communication network, and time synchronization is achieved using the Generalized Precision Time Protocol (gPTP) in the 802.1AS standard.

[0098] The system comprises:

[0099] a first processing unit configured to perform link initialization between a first communication terminal and a second communication terminal based on a directed graph of the time-sensitive communication network, so as to obtain a set of bidirectional links between the first communication terminal and the second communication terminal;

[0100] a second processing unit configured to extract, according to a certain ratio, a portion of the bidirectional links from the bidirectional link set as a first bidirectional link set and the remaining bidirectional links as a second bidirectional link set, and calculate the fitness of each bidirectional link in the first bidirectional link set, where the fitness of the bidirectional link represents the sum of delays of all nodes in the bidirectional link, where the nodes include a first communication terminal, a second communication terminal, and a plurality of switches bidirectionally connected to the first communication terminal and the second communication terminal;

[0101] a third processing unit configured to determine a fitness crossover probability value and a fitness mutation probability value based on the fitness of each bidirectional link in the first bidirectional link set, so as to respectively determine a crossover condition and a mutation condition, perform a crossover operation on the bidirectional links in the first bidirectional link set that meet the crossover condition using the second bidirectional link set, and perform a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition using the second bidirectional link set;

[0102] The fourth processing unit is configured to recalculate the fitness of each bidirectional link in the first bidirectional link set after performing the crossover operation and the mutation operation; wherein:

[0103] When the recalculated fitness values ​​exceed a fitness threshold, extracting a bidirectional link exceeding the fitness threshold as a bidirectional shortest delay link of the time-sensitive communication network;

[0104] Otherwise, the fitness crossover probability value and the fitness mutation probability value are recalculated, and the crossover operation and information mutation operation are performed again until the fitness threshold condition is met.

[0105] According to the system of the second aspect of the present invention, the directed graph of the time-sensitive communication network is represented by P=(V, E), where V represents the set of all communication terminals included in the time-sensitive communication network, and E represents the bidirectional link between any two communication terminals, which is expressed as [(X i ,X j ),(X j ,X i )]∈E, 1≤i≤n, 1≤j≤n, i≠j, [(X i ,X j ),(X j ,X i )]=[(X j ,X i ),(X i ,X j )], n is the total number of communication terminals in the time-sensitive communication network.

[0106] The first processing unit is specifically configured to:

[0107] The first communication terminal and the second communication terminal are selected from the directed graph, and the set of bidirectional links between the first communication terminal and the second communication terminal is represented by Q(t)={U1, U2, ..., U L},U1,U2,...,U L represents all feasible L bidirectional links between the first communication terminal and the second communication terminal, for U1, U2, ..., U L For each bidirectional link in the embodiment, the starting node and the end node of the bidirectional link are both the first communication terminal, there is an intermediate node between the starting node and the end node, which is the second terminal, the other nodes between the starting node and the intermediate node are several switches that can connect the first communication terminal and the second communication terminal, and the other nodes between the intermediate node and the end node are several switches that can connect the second communication terminal and the first communication terminal.

[0108] According to the system of the second aspect of the present invention, the fitness of the kth bidirectional link in the first bidirectional link set is characterized by F k =1 / T k , T k is the sum of the delays of all nodes in the k-th bidirectional link, T k =t k(起始) +t k(第一方向交换机时延和) +t k(中间) +t k(第二方向交换机时延和) +t k(末端) , 1≤k≤L,t k(起始) is the delay of the starting node, t k(第一方向交换机时延和) is the sum of the delays of several switches connecting the first communication terminal and the second communication terminal between the starting node and the intermediate node, t k(中间) is the delay of the intermediate node, t k(第二方向交换机时延和) is the sum of the delays of several switches connecting the second communication terminal and the first communication terminal between the intermediate node and the end node, t k(末端) is the delay of the end node.

[0109] The system according to the second aspect of the present invention:

[0110] The fitness crossover probability value P 交叉 =(F 最大 -F 平均 ) / (F 最大 -F 最小 ), F 最大 represents the maximum fitness among the fitness of all bidirectional links in the first bidirectional link set, F 平均represents the average fitness of all bidirectional links in the first bidirectional link set, F 最小 represents the minimum fitness among the fitnesses of all bidirectional links in the first bidirectional link set;

[0111] The cross condition is that the fitness of the bidirectional link on which the cross operation is to be performed is less than the fitness cross probability value;

[0112] The fitness mutation probability value P 变异 =P 交叉 ×g, g is the adjustment coefficient, 0.5<g<1;

[0113] The mutation condition is that the fitness of the bidirectional link on which the mutation operation is to be performed is less than the fitness mutation probability value.

[0114] According to the system of the second aspect of the present invention, the third processing unit is specifically configured to: use the second bidirectional link set to perform a cross operation on the bidirectional links in the first bidirectional link set that meet the cross condition, specifically including:

[0115] For each bidirectional link in the first bidirectional link set, when it meets the cross condition, any one of its unidirectional links is exchanged with any one of the bidirectional links randomly selected from the second bidirectional link set to complete the cross operation, and during the exchange process, the correspondence between any one of the unidirectional links and the first communication terminal and the second communication terminal is maintained.

[0116] According to the system of the second aspect of the present invention, the third processing unit is specifically configured to: use the second bidirectional link set to perform a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition, specifically including:

[0117] For each bidirectional link in the first bidirectional link set, when the mutation condition is met, q switches in any unidirectional link are replaced with q different switches other than the switches included in the unidirectional link. Connectivity of the replaced unidirectional link is checked. If the connectivity check passes, the mutation operation is completed.

[0118] According to the system of the second aspect of the present invention, each bidirectional link in the first bidirectional link set calculated by the second processing unit is sorted from large to small according to fitness, and the w bidirectional links with lower sorting are replaced with the w bidirectional links with higher sorting. The third processing unit performs the crossover operation and the mutation operation on the replaced first bidirectional links.

[0119] A third aspect of the present invention discloses an electronic device. The electronic device includes a memory and a processor. The memory stores a computer program. When the processor executes the computer program, it implements the steps of the method for measuring the shortest bidirectional delay link in a time-sensitive communication network described in the first aspect of the present invention.

[0120] Figure 3 FIG. 1 is a structural diagram of an electronic device according to an embodiment of the present invention; FIG. Figure 3 As shown, the electronic device includes a processor, a memory, a communication interface, a display screen and an input device connected via a system bus. The processor of the electronic device is used to provide computing and control capabilities. The memory of the electronic device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The communication interface of the electronic device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be achieved through WIFI, an operator network, near field communication (NFC) or other technologies. The display screen of the electronic device can be a liquid crystal display or an electronic ink display screen, and the input device of the electronic device can be a touch layer covering the display screen, or a button, trackball or touchpad provided on the electronic device housing, or an external keyboard, touchpad or mouse.

[0121] Those skilled in the art will understand that Figure 3 The structure shown in the figure is only a structural diagram of the part related to the technical solution of the present disclosure, and does not constitute a limitation on the electronic device to which the solution of the present application is applied. The specific electronic device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0122] A fourth aspect of the present invention discloses a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method for measuring the shortest bidirectional delay link in a time-sensitive communication network described in the first aspect of the present invention.

[0123] In summary, the solution of the present invention can measure the time symmetry of bidirectional link delay. Using a genetic algorithm, it is possible to select the optimal sending and reply links that meet the 802.1Qat protocol before data traffic is sent. By improving the genetic algorithm, the efficiency of iterative convergence is improved.

[0124] Please note that the various technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, not all possible combinations of the various technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification. The above-mentioned embodiments only express several implementation methods of the present application. The description is relatively specific and detailed, but it cannot be understood as a limitation on the scope of the invention patent. It should be pointed out that for ordinary technicians in this field, without departing from the concept of this application, several variations and improvements can be made, which all fall within the scope of protection of this application. Therefore, the scope of protection of the patent in this application shall be based on the attached claims.

Claims

1. A method for measuring the shortest delay link in a two-way time-sensitive communication network, characterized in that ； The time-sensitive communication network includes a plurality of communication terminals, a plurality of switches for implementing information transmission between different communication terminals, and a plurality of communication links composed of the plurality of communication terminals and the plurality of switches; wherein the plurality of communication terminals and the plurality of switches all have the time synchronization feature of the time-sensitive communication network, and time synchronization is achieved through the generalized precision time protocol gPTP in the 802.1AS standard; The method comprises: Step S1: performing link initialization between a first communication terminal and a second communication terminal based on a directed graph of the time-sensitive communication network to obtain a set of bidirectional links between the first communication terminal and the second communication terminal; Step S2: extracting a portion of the bidirectional links from the bidirectional link set according to a certain ratio as a first bidirectional link set, and the remaining bidirectional links as a second bidirectional link set, and calculating the fitness of each bidirectional link in the first bidirectional link set, where the fitness of the bidirectional link represents the sum of delays of all nodes in the bidirectional link, where the nodes include the first communication terminal, the second communication terminal, and a plurality of switches bidirectionally connected to the first communication terminal and the second communication terminal; Step S3: determining a fitness crossover probability value and a fitness mutation probability value based on the fitness of each bidirectional link in the first bidirectional link set to determine a crossover condition and a mutation condition, respectively; performing a crossover operation on the bidirectional links in the first bidirectional link set that meet the crossover condition; and performing a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition. Step S4: recalculating the fitness of each bidirectional link in the first bidirectional link set after the crossover operation and the mutation operation are performed; wherein: When the recalculated fitness values ​​exceed a fitness threshold, extracting a bidirectional link exceeding the fitness threshold as a bidirectional shortest delay link of the time-sensitive communication network; Otherwise, the fitness crossover probability value and the fitness mutation probability value are recalculated, and the crossover operation and information mutation operation are performed again until the fitness threshold condition is met.

2. The method for measuring the shortest bidirectional delay link in a time-sensitive communication network according to claim 1, wherein: In step S1: The directed graph of the time-sensitive communication network is represented by P=(V, E), where V represents the set of all communication terminals included in the time-sensitive communication network, and E represents the bidirectional link between any two communication terminals, which is expressed as [(X i ,X j ),(X j ,X i )]∈E, 1≤i≤n, 1≤j≤n, i≠j, [(X i ,X j ),(X j ,X i )]=[(X j ,X i ),(X i ,X j )], n is the total number of communication terminals in the time-sensitive communication network; The first communication terminal and the second communication terminal are selected from the directed graph, and the set of bidirectional links between the first communication terminal and the second communication terminal is represented by Q(t)={U1, U2, ..., U L },U1,U2,...,U L represents all feasible L bidirectional links between the first communication terminal and the second communication terminal, for U1, U2, ..., U L For each bidirectional link in the embodiment, the starting node and the end node of the bidirectional link are both the first communication terminal, there is an intermediate node between the starting node and the end node, which is the second communication terminal, and other nodes between the starting node and the intermediate node are several switches that can connect the first communication terminal and the second communication terminal, and other nodes between the intermediate node and the end node are several switches that can connect the second communication terminal and the first communication terminal.

3. The method for measuring the shortest bidirectional delay link in a time-sensitive communication network according to claim 2, wherein: In step S2: the fitness of the kth bidirectional link in the first bidirectional link set is represented by F k =1 / T k , T k is the sum of the delays of all nodes in the k-th bidirectional link, T k =t k(起始) +t k(第一方向交换机时延和) +t k(中间) +t k(第二方向交换机时延和) +t k(末端) , 1≤k≤L,t k(起始) is the delay of the starting node, t k(第一方向交换机时延和) is the sum of the delays of several switches connecting the first communication terminal and the second communication terminal between the starting node and the intermediate node, t k(中间) is the delay of the intermediate node, t k(第二方向交换机时延和) is the sum of the delays of several switches connecting the second communication terminal and the first communication terminal between the intermediate node and the end node, t k(末端) is the delay of the end node.

4. The method for measuring the shortest bidirectional delay link in a time-sensitive communication network according to claim 3, wherein: In step S3: The fitness crossover probability value P 交叉 =(F 最大 -F 平均 ) / (F 最大 -F 最小 ), F 最大 represents the maximum fitness among the fitness of all bidirectional links in the first bidirectional link set, F 平均 represents the average fitness of all bidirectional links in the first bidirectional link set, F 最小 represents the minimum fitness among the fitnesses of all bidirectional links in the first bidirectional link set; The cross condition is that the fitness of the bidirectional link on which the cross operation is to be performed is less than the fitness cross probability value; The fitness mutation probability value P 变异 =P 交叉 ×g, g is the adjustment coefficient, 0.5<g<1; The mutation condition is that the fitness of the bidirectional link on which the mutation operation is to be performed is less than the fitness mutation probability value.

5. The method for measuring the shortest bidirectional delay link in a time-sensitive communication network according to claim 4, wherein: In step S3, performing a cross operation on the bidirectional links in the first bidirectional link set that meet the cross condition by using the second bidirectional link set specifically includes: For each bidirectional link in the first bidirectional link set, when it meets the cross condition, any one of its unidirectional links is exchanged with any one of the bidirectional links randomly selected from the second bidirectional link set to complete the cross operation, and during the exchange process, the correspondence between any one of the unidirectional links and the first communication terminal and the second communication terminal is maintained.

6. The method for measuring the shortest bidirectional delay link in a time-sensitive communication network according to claim 5, wherein: In step S3, performing a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition using the second bidirectional link set specifically includes: For each bidirectional link in the first bidirectional link set, when the mutation condition is met, q switches in any unidirectional link are replaced with q different switches other than the switches included in the unidirectional link. Connectivity of the replaced unidirectional link is checked. If the connectivity check passes, the mutation operation is completed.

7. The method for measuring the shortest bidirectional delay link in a time-sensitive communication network according to claim 6, wherein: Between step S2 and step S3, the method further includes: Each bidirectional link in the first bidirectional link set calculated in step S2 is sorted from large to small according to fitness, and the w bidirectional links with lower sorting are replaced with the w bidirectional links with higher sorting. The crossover operation and the mutation operation are performed on the replaced first bidirectional links in step S3.

8. A system for measuring the shortest bidirectional delay link in a time-sensitive communication network, characterized in that ； The time-sensitive communication network includes a plurality of communication terminals, a plurality of switches for implementing information transmission between different communication terminals, and a plurality of communication links composed of the plurality of communication terminals and the plurality of switches; wherein the plurality of communication terminals and the plurality of switches all have the time synchronization feature of the time-sensitive communication network, and time synchronization is achieved through the generalized precision time protocol gPTP in the 802.1AS standard; The system comprises: a first processing unit configured to perform link initialization between a first communication terminal and a second communication terminal based on a directed graph of the time-sensitive communication network, so as to obtain a set of bidirectional links between the first communication terminal and the second communication terminal; a second processing unit configured to extract, according to a certain ratio, a portion of the bidirectional links from the bidirectional link set as a first bidirectional link set and the remaining bidirectional links as a second bidirectional link set, and calculate the fitness of each bidirectional link in the first bidirectional link set, where the fitness of the bidirectional link represents the sum of delays of all nodes in the bidirectional link, where the nodes include a first communication terminal, a second communication terminal, and a plurality of switches bidirectionally connected to the first communication terminal and the second communication terminal; a third processing unit configured to determine a fitness crossover probability value and a fitness mutation probability value based on the fitness of each bidirectional link in the first bidirectional link set, so as to respectively determine a crossover condition and a mutation condition, perform a crossover operation on the bidirectional links in the first bidirectional link set that meet the crossover condition using the second bidirectional link set, and perform a mutation operation on the bidirectional links in the bidirectional link set that meet the mutation condition using the second bidirectional link set; The fourth processing unit is configured to recalculate the fitness of each bidirectional link in the first bidirectional link set after performing the crossover operation and the mutation operation; wherein: When the recalculated fitness values ​​exceed a fitness threshold, extracting a bidirectional link exceeding the fitness threshold as a bidirectional shortest delay link of the time-sensitive communication network; Otherwise, the fitness crossover probability value and the fitness mutation probability value are recalculated, and the crossover operation and information mutation operation are performed again until the fitness threshold condition is met.

9. An electronic device, characterized in that: The electronic device includes a memory and a processor, the memory stores a computer program, and when the processor executes the computer program, it implements the steps in the method for measuring the bidirectional shortest delay link of a time-sensitive communication network according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the computer program implements the steps in the method for measuring the shortest bidirectional delay link of a time-sensitive communication network according to any one of claims 1 to 7.

Images