Network path topology method and system, storage medium and electronic equipment

Abstract

The invention relates to the technical field of communication, and provides a network path topology method and system, a storage medium and electronic equipment, and the method comprises the steps: inputting network nodes and a network node connection relation, determining a network node as a main injection node, traversing all network nodes, and determining a main network directed graph; calculating the number of main network paths of each network node to obtain an in-out degree value of each network node, and dividing the gradient of the network nodes; selecting a network node with the highest gradient as a standby injection node, taking the standby injection node as an initial node, establishing a standby network path by avoiding the main network path towards the network node with the low gradient or the network nodes with the same gradient until all the network nodes are traversed, and determining a standby network directed graph; and combining the main network directed graph and the standby network directed graph to generate a complete network directed graph, and determining a complete network path. Through the method, the stability of the clock synchronization network is improved, and the manual maintenance cost is reduced.

Description

Technical Field

[0001] The present disclosure belongs to the field of communication technology, and in particular, relates to a network path topology method, system, storage medium and electronic device. Background Art

[0002] When the current intelligent clock network is used to process large-scale networking, it can ensure that there is no loop in the clock synchronization network in the initial stage; however, in engineering applications, when service cutover occurs, it will cause dynamic changes to the original clock synchronization network. Due to the existence of the main path and backup path of the clock synchronization network, the newly generated clock synchronization network is very likely to form a loop, resulting in clock interlocking, and in severe cases, it will cause service interruption. When the intelligent clock network is used in the field of synchronous Ethernet technology and 5G communication, preventing the clock synchronization network from forming a loop is an issue that must be solved.

[0003] Therefore, a more stable and reliable network path topology method is urgently needed to cope with the risks of clock interlocking and service interruption caused by changes in clock synchronization paths when network nodes are added or deleted. Summary of the invention

[0004] To solve the above problems, the present invention provides a network path topology method, system, storage medium and electronic device. After generating a main network directed graph, the gradient is divided according to the in-and-out degree values ​​of the network nodes, and a backup network path is generated according to the gradient of the network nodes, providing a more stable and reliable network path topology method.

[0005] The present invention is achieved through the following technical solutions:

[0006] In a first aspect, an embodiment of the present disclosure provides a network path topology method, the method comprising:

[0007] Enter the network nodes and the connection relationship between the network nodes, determine a network node to be used as the main injection node, take the main injection node as the starting node, traverse all network nodes according to the connection relationship between the network nodes, generate a main network path, and determine the main network directed graph;

[0008] Calculate the number of main network paths of each network node, obtain the in-degree value of each network node, and divide the gradient of the network node according to the in-degree value of the network node;

[0009] Select a network node with the highest gradient as a backup injection node, and use the backup injection node as the starting node to move toward network nodes with low gradients or network nodes with the same gradient, avoiding the main network path, and establishing a backup network path until all network nodes are traversed to determine a backup network directed graph;

[0010] The main network directed graph and the backup network directed graph are merged to generate a complete network directed graph, and a complete network path is determined.

[0011] Furthermore,

[0012] Entering network nodes and connection relationships between the network nodes, and determining a network node to be used as the main injection node;

[0013] Taking the main injection node as the starting node, and sequentially establishing a main network path according to the connection relationship of the network nodes;

[0014] When the tail network node is reached, the process returns to the previous network node until a network node that has not established a main network path exists according to the network node connection relationship, and the main network path is established;

[0015] All network nodes are traversed, a main network path is established, and the main network directed graph is determined.

[0016] Furthermore,

[0017] Calculate the sum of the number of input paths and output paths of each network node to obtain the in-degree value of each network node;

[0018] The network nodes are sorted from large to small according to their corresponding in-degree values, and the gradients of the network nodes are divided in order from high to low according to the sorting of the network nodes.

[0019] Furthermore,

[0020] Add network nodes with the same in-degree values ​​to the same gradient array, and sort the gradient array according to the size of the in-degree values.

[0021] Furthermore,

[0022] Select a network node from the network nodes with the highest gradient as the backup injection node;

[0023] Taking the backup injection node as the starting node, toward the network node with a low gradient or the network node with the same gradient, avoiding the main network path, and establishing the backup network path;

[0024] When reaching the tail network node, return to the previous network node until there is a network node with a low gradient or the same gradient and no backup network path is established;

[0025] Determine whether the two network nodes include a primary network path. If there is no primary network path, establish a backup network path.

[0026] All network nodes are traversed, a backup network path is established, and the backup network directed graph is determined.

[0027] In a second aspect, an embodiment of the present disclosure provides a network path topology system, the system comprising a main network path generation module, a calculation module, a backup network path generation module and a network path integration module;

[0028] The main network path generation module is used to input network nodes and network node connection relationships, determine a network node to be used as a main injection node, take the main injection node as a starting node, traverse all network nodes according to the network node connection relationship, and generate a main network path to determine a main network directed graph;

[0029] The calculation module is used to calculate the number of main network paths of each network node, obtain the in-degree value of each network node, and divide the gradient of the network node according to the in-degree value of the network node;

[0030] The backup network path generation module is used to select a network node with the highest gradient as a backup injection node, and use the backup injection node as the starting node to avoid the main network path and establish a backup network path towards the network node with a low gradient or the network node with the same gradient, until all network nodes are traversed to determine the backup network directed graph;

[0031] The network path integration module is used to merge the main network directed graph and the backup network directed graph to generate a complete network directed graph and determine a complete network path.

[0032] Furthermore,

[0033] The backup injection node selection unit is used to select a network node from the network nodes with the highest gradient as the backup injection node;

[0034] The backup network path generation unit is used to establish a backup network path with the backup injection node as the starting node, toward the network node with a low gradient or the network node with the same gradient, avoiding the main network path; when reaching the tail network node, return to the previous network node until there is a network node with a low gradient or the same gradient and no backup network path is established; determine whether the main network path is included between two network nodes, and if there is no main network path, establish a backup network path; traverse all network nodes, establish a backup network path, and determine a backup network directed graph.

[0035] Furthermore,

[0036] The main injection node receives: GPS signal or BI TS signal; the backup injection node receives: GPS signal or BI TS signal.

[0037] In a third aspect, an embodiment of the present disclosure provides a computer-readable storage medium storing one or more programs, wherein:

[0038] When the one or more programs are executed, any of the above-mentioned network path topology methods can be implemented.

[0039] In a fourth aspect, an embodiment of the present disclosure provides an electronic device, including a processor, a communication interface, the above-mentioned computer-readable storage medium and a communication bus; wherein the processor, the communication interface, and the computer-readable storage medium communicate with each other via the communication bus;

[0040] in,

[0041] The processor is configured to execute a program stored in a computer-readable storage medium.

[0042] Compared with the prior art, the present invention has the following advantages:

[0043] 1. During the initial construction of the main network path and the backup network path, the entire clock synchronization network is prevented from failing when a certain network node fails or a network node is added or deleted. This improves the stability of the clock synchronization network and reduces the cost of manual maintenance.

[0044] 2. It is not necessary to establish network connections between all network nodes, so that when a network node fails, it will not cause problems in the entire clock synchronization network, or there will be intact network nodes disconnected from the clock synchronization network.

[0045] Other features and advantages of the present disclosure will be described in the following description, and partly become apparent from the description, or be understood by implementing the present disclosure. The purpose and other advantages of the present disclosure can be realized and obtained by the structures pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0047] Figure 1 A flow chart of a network path topology method provided by an embodiment of the present disclosure;

[0048] Figure 2 A schematic diagram of a network node and connection relationship structure provided in an embodiment of the present disclosure;

[0049] Figure 3a-3c A main network directed graph provided by an embodiment of the present disclosure;

[0050] Figure 4a-4c A backup network directed graph provided by an embodiment of the present disclosure;

[0051] Figure 5 A complete network directed graph is provided for an embodiment of the present disclosure. DETAILED DESCRIPTION

[0052] In order to make the purpose, technical solution and advantages of the embodiments of the present disclosure clearer, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present disclosure.

[0053] Figure 1 A flow chart of a network path topology method provided by an embodiment of the present disclosure, such as Figure 1 As shown, the network path topology method of the embodiment of the present disclosure includes:

[0054] S1: input network nodes and network node connection relationships, determine a network node to be used as a main injection node, take the main injection node as the starting node, traverse all network nodes according to the network node connection relationship, generate a main network path, and determine a main network directed graph.

[0055] Specifically, the network nodes and the connection relationship of the network nodes are entered into the network path topology system, a network node is determined to be used as the main injection node, all network nodes are traversed according to the connection relationship of the network nodes, the main network path is generated, and the main network directed graph is determined according to all the main network paths. In the process of determining the main network directed graph, starting from the main injection node, each network node is traversed, some network nodes have only one main network path, and some network nodes have multiple main network paths, wherein the main network path includes an output path and an input path.

[0056] S2: Calculate the number of main network paths of each network node, obtain the in-degree value of each network node, and divide the gradient of the network node according to the in-degree value of the network node.

[0057] Specifically, the main network path includes an output path and an input path. In the main network directed graph, the number of input paths and output paths connected to each network node is different. The sum of the number of input paths and output paths of each network node is calculated and used as the in-degree value of each network node. Network nodes with the same in-degree value have the same gradient. Network nodes with large in-degree values ​​are high-gradient network nodes, and network nodes with low in-degree values ​​are low-gradient network nodes. Among them, the network node used as the main injection node, in addition to establishing a network path with other network nodes, also includes an input path for receiving BITS signals (Building Integrated Timing Supply) or GPS (Global Positioning System) signals.

[0058] S3: Select a network node with the highest gradient as the backup injection node, and use the backup injection node as the starting node to move toward network nodes with low gradients or network nodes with the same gradient, avoiding the main network path, and establishing a backup network path until all network nodes are traversed to determine the backup network directed graph.

[0059] Specifically, a network node with the highest gradient, that is, a network node with the highest in-degree value, is selected, and the network node is used as a backup injection node. With the backup injection node as the starting node, a backup network path is generated from the network node with a high gradient to the network node with a low gradient or the network node with the same gradient; it can be understood that with the backup injection node as the starting node, a backup network path is established to the network node with the same in-degree value or the network node with a small in-degree value. When generating a backup network path, it is also necessary to consider preventing path conflicts and avoiding the main network path. After traversing each network node, all backup network paths are determined, and based on all backup network paths, a backup network directed graph is determined. The backup network path also includes an input path and an output path.

[0060] S4: Merge the main network directed graph and the backup network directed graph to generate a complete network directed graph, and determine the complete network path.

[0061] Specifically, in the network path topology system, the main network directed graph and the backup network directed graph are merged to obtain a complete network directed graph, and the complete network path is determined.

[0062] In some examples, network nodes and network node connection relationships are entered, a network node is determined to be used as a main injection node, the main injection node is used as a starting node, all network nodes are traversed according to the network node connection relationship, and a main network path is generated to determine a main network directed graph, specifically including:

[0063] S11: Enter the network nodes and the connection relationship between the network nodes, and determine a network node to be used as the main injection node.

[0064] Specifically, the network nodes and the network node connection relationships are entered into the network path topology system. A network node is determined to be used as the main injection node. A network node can be randomly selected as the main injection node. Of course, a tail network node is preferably used as the main injection node.

[0065] S12: Taking the main injection node as the starting node, a main network path is sequentially established according to the connection relationship of the network nodes.

[0066] Specifically, starting from the main injection node, along the network node connection relationship, the main network path is established in sequence, and as many main network paths as possible are established until the tail network node is reached.

[0067] S13: When the tail network node is reached, return to the previous network node until a network node for which a main network path has not been established exists according to the network node connection relationship, and then establish the main network path.

[0068] Specifically, after reaching the tail network node, starting from the tail network node, return to the previous network node in sequence until there is a network node that has not established a main network path before the previous network node, and there is a network node connection relationship between the two network nodes, and the main network path is established;

[0069] S14: traverse all network nodes, establish a main network path, and determine the main network directed graph.

[0070] Specifically, the above method is executed in a loop until all network nodes are traversed, so that all network nodes establish a main network path according to the network node connection relationship. The main network path includes an output path and an input path. In the process of determining the main network directed graph, starting from the main injection node, each network node is traversed. Some network nodes have only one main network path, and some network nodes have multiple main network paths.

[0071] In some examples, the number of main network paths of each network node is calculated to obtain the in-degree value of each network node, and the gradient of the network node is divided according to the in-degree value of the network node, specifically including:

[0072] S21: Calculate the sum of the number of input paths and output paths of each network node to obtain the in-degree value of each network node.

[0073] Specifically, the main network path includes an input path and an output path. The number of input paths and output paths connected to each network node is different. The sum of the number of input paths and output paths of the network node is the in-degree value of the network node.

[0074] S22: sorting the network nodes from large to small according to their corresponding in-degree values, and dividing the gradients of the network nodes in a descending order according to the sorting of the network nodes.

[0075] Specifically, network nodes with the same in-degree value have the same gradient, network nodes with large in-degree values ​​are high-gradient network nodes, and network nodes with low in-degree values ​​are low-gradient network nodes. It can be understood that the higher the in-degree value of a network node, the higher the gradient of the network node. The network nodes are sorted from large to small according to their corresponding in-degree values, and the gradients of the network nodes are divided in order from high to low according to the sorting results of the in-degree values ​​of the network nodes from large to small.

[0076] In some examples, the network nodes are sorted from large to small according to their corresponding in-degree values, and the gradient of the network nodes is divided in a descending order according to the sorting of the network nodes, further comprising:

[0077] S221: Add network nodes with the same in-degree values ​​to the same gradient array, and sort the gradient array according to the in-degree values.

[0078] Specifically, a gradient array is generated, network nodes with the same in-degree value are added to the same gradient array, and network nodes with different in-degree values ​​are added to different gradient arrays. At this time, one gradient array represents one in-degree value, and the gradient arrays are sorted according to the in-degree value. The larger the in-degree value, the higher the gradient corresponding to the gradient array. For example, the gradient array with the largest in-degree value is the first gradient array.

[0079] In some examples, a network node with the highest gradient is selected as a backup injection node, and a backup network path is established from the backup injection node as the starting node to the network nodes with a lower gradient or the same gradient, until all network nodes are traversed and the main network path is avoided to determine the backup network directed graph, which specifically includes:

[0080] S31: Select a network node from the network nodes with the highest gradient as a backup injection node.

[0081] Specifically, a network node is selected from among the network nodes with the highest gradient, or from the gradient array with the highest gradient, that is, a network node with the highest in-degree value is selected, and the network node is used as a backup injection node.

[0082] S32: Taking the backup injection node as the starting node, toward the network nodes with a low gradient or the network nodes with the same gradient, avoiding the main network path, and establishing a backup network path.

[0083] Specifically, with the backup injection node as the starting node, a backup network path is established to the network nodes with a low gradient or the network nodes with the same gradient; the backup network path can be established only from the network nodes with a high gradient to the network nodes with a low gradient until the tail network node is reached.

[0084] S33: After reaching the tail network node, return to the previous network node until there is a network node with a low gradient or the same gradient and no backup network path is established.

[0085] Specifically, when the tail network node is reached, the network node returns to the previous node in sequence from the tail network node until the previous network node has a low gradient or the same gradient and a network node with no backup network path established. In this process, the backup network path should be prevented from being repeated with the main network path.

[0086] S34: Determine whether a primary network path is included between the two network nodes. If there is no primary network path, establish a backup network path.

[0087] Specifically, in order to avoid duplication of the backup network path and the main network path, the main network path should be avoided when establishing the backup network path. When returning to the previous network node in sequence from the tail network node to find a network node with a low gradient or the same gradient and no backup network path established, it is also necessary to determine whether the main network path is included between the two network nodes. If the condition of a network node with a low gradient or the same gradient and no backup network path is established is met, but the condition of no main network path being established between the two network nodes is not met, then continue to return to the previous network node in sequence to find a network node that can establish a backup network path.

[0088] S35: traverse all network nodes, establish a backup network path, and determine a backup network directed graph.

[0089] Specifically, the above method is executed cyclically until all network nodes are traversed, so that all network nodes establish at least one backup network path. According to all backup network paths, a backup network directed graph is determined, and the backup network directed graph and the main network directed graph will not have repeated paths.

[0090] In order to more clearly illustrate a network path topology method in the present disclosure, a specific embodiment is provided below.

[0091] like Figure 2 As shown, the embodiment of the present disclosure includes 8 network nodes, and the 8 network nodes include a determined network node connection relationship. The following uses V0, V1, V2, V3, V4, V5, V6, and V7 to represent the 8 network nodes to illustrate this embodiment.

[0092] like Figure 3a-3cAs shown, V5 is selected as the main injection node, the main BI TS signal is injected, and starting from the main injection node, all network nodes are traversed and the main network path is established. First, an output path is established from the main injection node V5 to V2, an output path is established from V2 to V1, an output path is established from V1 to V4, an output path is established from V1 to V6, and an output path is established from V6 to V3; at this time, V3 is the tail network node, and an output path is established from V3 to V6, and from V6 to V7; at this time, V7 is the tail network node, and an output path is established from V7 to V6, from V6 to V4, from V4 to V1, and from V1 to V0; all main network paths are determined by the above method, and a main network directed graph is generated.

[0093] Continue to refer Figure 3c , it can be seen from the main network directed graph that the gradient is divided according to the input degree value of each network node, and the network node with the highest input and output degree value is divided into the first gradient, and the second gradient, the third gradient, and so on. In the embodiment of the present disclosure, the input and output degree values ​​of V1 and V6 are 3; the input and output degree values ​​of V2, V4 and V5 are 2; the input and output degree values ​​of V0, V3 and V7 are 1; therefore, the first gradient includes V1 and V6, the second gradient includes V2, V4 and V5; the third gradient includes V0, V3 and V7; in the network path topology system, the network nodes of each gradient are represented in array form, that is, the first gradient array is TD1[V1,V6]; the second gradient array is TD2[V2,V4,V5]; the third gradient array is TD3[V0,V3,V7].

[0094] like Figure 4a-4cAs shown, a network node is selected from the first gradient to be used as a standby injection node. In the embodiment of the present disclosure, V6 is selected as the standby injection node to inject a standby BI TS signal. At this time, the in-degree value of V6 is changed to 4 due to the addition of an input path. First, a standby network path is established in descending order of the in-degree values, and the in-degree values ​​decrease by 1 in sequence, that is, a network node with an in-degree value of 4 establishes a standby network path to a network node with an in-degree value of 3, a network node with an in-degree value of 3 establishes a standby network path to a network node with an in-degree value of 2, and a network node with an in-degree value of 2 establishes a standby network path to a network node with an in-degree value of 1. An output path is established from V6 to V1. Since there is a main network path between V1 and V2, an output path is established from V1 to V5, and an output path is established from V5 to V7, which is the closest node. At this time, since the main network path needs to be avoided, V7 is the tail network node. Return from V7 to V5, and establish an output path to the network nodes with the same gradient. Since there is a main network path between V5 and V2, an output path is established from V5 to V4, and an output path is established from V4 to V2 with the same gradient. At this time, since the main network path needs to be avoided, V2 is the tail network node, return from V2 to V4, and then from V4 to V5, establish an output path from V5 to V3, and establish an output path from V3 to V0. At this time, all network nodes have completed the traversal, and the backup network path is established.

[0095] like Figure 5 As shown, a backup network directed graph is determined according to the backup network path, and the backup network directed graph and the main network directed graph are merged to obtain a complete network directed graph.

[0096] Continue to refer Figure 5 , it is not necessary to establish network connections between all network nodes, so that when a network node fails, the entire network will not be disconnected, or there will be unfaulty network nodes disconnected from the network. It is understandable that the above connection method is only a specific example and is not a specific limitation. Personnel skilled in the relevant field can adjust it according to the actual number of network nodes and connection methods.

[0097] In the disclosed embodiment, in order to reasonably establish a backup network path, when selecting a backup network node, the network node with the highest in-degree value of the main network path is selected as the backup network node. Therefore, before establishing the backup network path, the in-degree value of each network node is clearly calculated and the echelons are divided according to the in-degree value. In order to prevent the main network path and the backup network path from being repeated, it is necessary to avoid the main network path when establishing the backup network path, that is, in the topological process of the backup network path, if there is a main network path between two network nodes, avoid the path and select other network nodes to establish the backup network path. When establishing the backup network path and traversing the network nodes, follow the establishment of the backup network path from the high-gradient network node to the same-gradient network node or the low-gradient network node.

[0098] In the second aspect, based on the same inventive concept, the embodiment of the present disclosure also provides a network path topology system, the system includes a main network path generation module, a calculation module, a backup network path generation module and a network path integration module; the main network path generation module is used to input the network nodes and the network node connection relationship, determine a network node as the main injection node, take the main injection node as the starting node, traverse all network nodes according to the network node connection relationship, and generate the main network path to determine the main network directed graph. The calculation module is used to calculate the number of main network paths of each network node, obtain the in-and-out degree value of each network node, and divide the gradient of the network node according to the in-and-out degree value of the network node. The backup network path generation module is used to select a network node with the highest gradient as the backup injection node, and take the backup injection node as the starting node, toward the network node with a low gradient or the network node with the same gradient, avoid the main network path, establish a backup network path, until all network nodes are traversed, and the backup network directed graph is determined. The network path integration module is used to merge the main network directed graph and the backup network directed graph to generate a complete network directed graph and determine the complete network path.

[0099] In some examples, the backup network path generation module includes: a backup injection node selection unit and a backup network path generation unit. The backup injection node selection unit is used to select a network node from the network nodes with the highest gradient as a backup injection node. The backup network path generation unit is used to take the backup injection node as the starting node, and to avoid the main network path and establish a backup network path toward the network nodes with low gradients or the same gradients; when reaching the tail network node, return to the previous network node until there is a network node with a low gradient or the same gradient, and no backup network path is established; determine whether the main network path is included between the two network nodes, and if there is no main network path, establish a backup network path; traverse all network nodes, establish a backup network path, and determine a backup network directed graph.

[0100] In some examples, the main injection node receives: a GPS signal or a BI TS signal; the backup injection node receives: a GPS signal or a BI TS signal, wherein the main injection node and the backup injection node receive the same type of signal.

[0101] On the third aspect, based on the same inventive concept, the embodiment of the present disclosure also provides a computer-readable storage medium, storing one or more programs, which, when executed, can implement the aforementioned network path topology method.

[0102] In a fourth aspect, based on the same inventive concept, an embodiment of the present disclosure further provides an electronic device, including a processor, a communication interface, a memory, and a communication bus. The processor, the communication interface, and the memory communicate with each other via the communication bus. The processor is used to execute the program stored in the aforementioned computer-readable storage medium.

[0103] It should be noted that the electrical connection between the above-mentioned units does not necessarily mean the connection between lines. An indirect connection method can be applied to the embodiments of the present disclosure as long as the purpose of the present disclosure is achieved.

[0104] Although the present disclosure has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present disclosure.

Claims

1. A network path topology method, characterized in that: The method comprises: Enter the network nodes and the connection relationship between the network nodes, determine a network node to be used as the main injection node, take the main injection node as the starting node, traverse all network nodes according to the connection relationship between the network nodes, generate a main network path, and determine the main network directed graph; Calculate the number of main network paths of each network node, obtain the in-degree value of each network node, and divide the gradient of the network node according to the in-degree value of the network node; Select a network node with the highest gradient as a backup injection node, and use the backup injection node as the starting node to move toward network nodes with low gradients or network nodes with the same gradient, avoiding the main network path, and establishing a backup network path until all network nodes are traversed to determine a backup network directed graph; The main network directed graph and the backup network directed graph are merged to generate a complete network directed graph, and a complete network path is determined.

2. The method according to claim 1, characterized in that The input network nodes and the network node connection relationship, determine a network node to be used as a main injection node, take the main injection node as the starting node, traverse all network nodes according to the network node connection relationship, generate a main network path, and determine a main network directed graph, specifically including: Entering network nodes and connection relationships between the network nodes, and determining a network node to be used as the main injection node; Taking the main injection node as the starting node, and sequentially establishing a main network path according to the connection relationship of the network nodes; When the tail network node is reached, the process returns to the previous network node until a network node that has not established a main network path exists according to the network node connection relationship, and the main network path is established; All network nodes are traversed, a main network path is established, and the main network directed graph is determined.

3. The method according to claim 1, characterized in that The method of calculating the number of main network paths of each network node, obtaining the in-degree value of each network node, and dividing the gradient of the network node according to the in-degree value of the network node specifically includes: Calculate the sum of the number of input paths and output paths of each network node to obtain the in-degree value of each network node; The network nodes are sorted from large to small according to their corresponding in-degree values, and the gradients of the network nodes are divided in order from high to low according to the sorting of the network nodes.

4. The method according to claim 3, characterized in that The method of sorting the network nodes from large to small according to their corresponding in-degree values, and dividing the gradients of the network nodes in a descending order according to the sorting of the network nodes, further includes: Add network nodes with the same in-degree values ​​to the same gradient array, and sort the gradient array according to the size of the in-degree values.

5. The method according to claim 1, characterized in that The method selects a network node with the highest gradient as a backup injection node, and takes the backup injection node as the starting node, moves toward network nodes with low gradients or network nodes with the same gradient, avoids the main network path, and establishes a backup network path until all network nodes are traversed to determine a backup network directed graph, specifically including: Select a network node from the network nodes with the highest gradient as the backup injection node; Taking the backup injection node as the starting node, toward the network node with a low gradient or the network node with the same gradient, avoiding the main network path, and establishing the backup network path; When reaching the tail network node, return to the previous network node until there is a network node with a low gradient or the same gradient and no backup network path is established; Determine whether the two network nodes include a primary network path. If there is no primary network path, establish a backup network path. All network nodes are traversed, a backup network path is established, and the backup network directed graph is determined.

6. A network path topology system, characterized in that: The system includes a main network path generation module, a calculation module, a backup network path generation module and a network path integration module; The main network path generation module is used to input network nodes and network node connection relationships, determine a network node to be used as a main injection node, take the main injection node as a starting node, traverse all network nodes according to the network node connection relationship, and generate a main network path to determine a main network directed graph; The calculation module is used to calculate the number of main network paths of each network node, obtain the in-degree value of each network node, and divide the gradient of the network node according to the in-degree value of the network node; The backup network path generation module is used to select a network node with the highest gradient as a backup injection node, and use the backup injection node as the starting node to avoid the main network path and establish a backup network path towards the network node with a low gradient or the network node with the same gradient, until all network nodes are traversed to determine the backup network directed graph; The network path integration module is used to merge the main network directed graph and the backup network directed graph to generate a complete network directed graph and determine a complete network path.

7. The system according to claim 6, characterized in that The backup network path generation module includes: a backup injection node selection unit and a backup network path generation unit; The backup injection node selection unit is used to select a network node from the network nodes with the highest gradient as the backup injection node; The backup network path generation unit is used to establish a backup network path with the backup injection node as the starting node, toward the network node with a low gradient or the network node with the same gradient, avoiding the main network path; when reaching the tail network node, return to the previous network node until there is a network node with a low gradient or the same gradient and no backup network path is established; determine whether the main network path is included between two network nodes, and if there is no main network path, establish a backup network path; traverse all network nodes, establish a backup network path, and determine a backup network directed graph.

8. The system according to claim 6, characterized in that The main injection node receives: GPS signal or BI TS signal; the backup injection node receives: GPS signal or BI TS signal.

9. A computer-readable storage medium storing one or more programs, characterized in that: When the one or more programs are executed, the network path topology method described in any one of claims 1-5 can be implemented.

10. An electronic device comprising a processor, a communication interface, the computer-readable storage medium of claim 9, and a communication bus; wherein: The processor, the communication interface, and the computer-readable storage medium communicate with each other via a communication bus; It is characterized in that The processor is configured to execute a program stored in a computer-readable storage medium.

Images