Method and device for determining shortest path, electronic equipment and storage medium

Abstract

The invention provides a shortest path determination method and device, electronic equipment and a storage medium, relates to the technical field of communication, and solves the technical problem that routing update / maintenance is difficult due to the fact that a transmission path of an optical signal needs to be manually managed and configured in related technologies. The method comprises the following steps: acquiring transmission information between each node in a plurality of nodes included in a target network and other nodes, wherein the other nodes are nodes having a connection relationship with each node; on the basis of the transmission information between each node and the other nodes, adjacent features between each node and the other nodes are determined, and the adjacent features are used for representing the data transmission capability between each node and the other nodes; and determining a first shortest path in the target network based on the adjacency characteristics between each node and the other nodes.

Description

Technical Field

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

[0002] In traditional fiber-optic transmission networks, the transmission paths of optical signals need to be manually managed and configured, which is time-consuming and labor-intensive, and the process of route update and maintenance is relatively difficult.

[0003] In addition, when a device or link in a fiber optic transmission network fails, it needs to be manually located and measures taken, and the fault recovery time is long. Summary of the invention

[0004] The present application provides a method, device, electronic device and storage medium for determining the shortest path, which solves the technical problem in the related art that the transmission path of the optical signal needs to be manually managed and configured, resulting in difficulty in route update / maintenance.

[0005] In a first aspect, the present application provides a method for determining the shortest path, comprising: obtaining transmission information between each node and other nodes among a plurality of nodes included in a target network, the other nodes being nodes having a connection relationship with each node; based on the transmission information between each node and the other nodes, determining the adjacency characteristics between each node and the other nodes, the adjacency characteristics being used to characterize the data transmission capacity between each node and the other nodes; based on the adjacency characteristics between each node and the other nodes, determining the first shortest path in the target network.

[0006] In a second aspect, the present application provides a device for determining the shortest path, comprising: an acquisition module and a determination module; the acquisition module is used to acquire transmission information between each node and other nodes among a plurality of nodes included in the target network, the other nodes being nodes having a connection relationship with each node; the determination module is used to determine the adjacency characteristics between each node and the other nodes based on the transmission information between each node and the other nodes, the adjacency characteristics being used to characterize the data transmission capacity between each node and the other nodes; the determination module is also used to determine the first shortest path in the target network based on the adjacency characteristics between each node and the other nodes.

[0007] In a third aspect, the present application provides an electronic device comprising: a processor and a memory configured to store processor executable instructions; wherein the processor is configured to execute the instructions to implement any one of the methods for determining the shortest path in the first aspect described above, optionally.

[0008] In a fourth aspect, the present application provides a computer-readable storage medium having instructions stored thereon. When the instructions in the computer-readable storage medium are executed by an electronic device, the electronic device is enabled to execute any one of the optional shortest path determination methods in the first aspect described above.

[0009] In a fifth aspect, the present application provides a computer program product, including a computer program or instructions, which, when executed on an electronic device, enables the electronic device to execute any one of the methods for determining the shortest path in the first aspect.

[0010] The present application provides a method, device, electronic device and storage medium for determining the shortest path. The electronic device can obtain the transmission information between each node and other nodes in the multiple nodes included in the target network, and determine the adjacency characteristics between each node and the other nodes based on the transmission information; finally, the first shortest path in the target network is determined based on the adjacency characteristics. Since the adjacency characteristics between each node and other nodes can characterize the data transmission capacity between each node and other nodes, the electronic device can determine the shortest path (i.e., the optimal transmission path) between any source node and any destination node based on the data transmission capacity between each node and other nodes, which can realize the automatic configuration and management of the transmission path, and improve the reliability of network management and routing configuration. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art are briefly introduced below.

[0012] Figure 1 A schematic diagram of a flow chart of a method for determining the shortest path provided in an embodiment of the present application;

[0013] Figure 2 A flowchart of another method for determining the shortest path provided in an embodiment of the present application;

[0014] Figure 3 A flowchart of another method for determining the shortest path provided in an embodiment of the present application;

[0015] Figure 4 A flowchart of another method for determining the shortest path provided in an embodiment of the present application;

[0016] Figure 5 A flowchart of another method for determining the shortest path provided in an embodiment of the present application;

[0017] Figure 6 A network topology diagram provided for an embodiment of the present application;

[0018] Figure 7 A schematic diagram of a process for selecting a primary path and a secondary path provided in an embodiment of the present application;

[0019] Figure 8 A schematic diagram of a process for performing routing update provided in an embodiment of the present application;

[0020] Fig. 9 A schematic diagram of the structure of a device for determining the shortest path provided in an embodiment of the present application;

[0021] Fig.10 A schematic diagram of the structure of another device for determining the shortest path provided in an embodiment of the present application. DETAILED DESCRIPTION

[0022] The following will describe in detail the method, device, electronic device and storage medium for determining the shortest path provided by the embodiments of the present application in conjunction with the accompanying drawings.

[0023] The terms "first" and "second" in the specification and drawings of this application are used to distinguish different objects rather than to describe a specific order of the objects. For example, the first shortest path and the second shortest path are used to distinguish different shortest paths rather than to describe a specific order of the shortest paths.

[0024] In addition, the terms "including" and "having" and any variations thereof mentioned in the description of the present application are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but may optionally include other steps or units that are not listed, or may optionally include other steps or units that are inherent to these processes, methods, products or devices.

[0025] It should be noted that in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0026] In the description of the present application, unless otherwise specified, “plurality” means two or more.

[0027] In traditional fiber-optic transmission networks, the transmission paths of optical signals need to be manually managed and configured. This is time-consuming and labor-intensive, and the process of route update and maintenance is relatively difficult, which also makes network upgrades and maintenance difficult. In addition, when a device or link in a fiber-optic transmission network fails, it needs to be manually located and measures taken, and the failure recovery time is long.

[0028] Automatically switched optical network (ASON) aims to realize automatic exchange and management of optical signals to provide higher network performance, reliability and flexibility. By introducing intelligent control and automation mechanisms, the network can more quickly adjust the transmission path and routing of optical signals to adapt to different transmission requirements and topology changes.

[0029] Since the network topology structure is constantly changing due to the addition and downtime of network nodes in the ASON self-organizing network, the reliability and practicality of the network are reduced. Therefore, routing technology, as the core technology in the ASON self-organizing network, plays a vital role in studying the shortest path between the source node and the destination node. Therefore, many scholars at home and abroad have designed improvements or optimizations on the single-source shortest path algorithm or the full-source shortest path algorithm in routing technology. The current mainstream shortest path algorithms include the Ford algorithm, the Dijkstra algorithm, and the A* algorithm. Among them, the Dijkstra algorithm is widely used in practical applications because of its relatively simple basic idea, easy to understand, easy to implement, and good performance and stability. The algorithm mainly solves the shortest path problem from one vertex to the remaining vertices.

[0030] Although many scholars at home and abroad have improved / optimized the above-mentioned single-source shortest path algorithm or all-source shortest path algorithm, there is a lot of computational redundancy in the improvement / optimization process and it does not meet the real-time requirements. At the same time, due to the phenomenon that nodes in the transmission path are down and need to re-discover the route, a link protection mechanism has been designed and improved, but this will increase the delay and overhead of the communication network and even cause network congestion. The more mainstream shortest path algorithm Dijkstra algorithm has defects such as low efficiency and high computational overhead. Relevant scholars have also improved the algorithm, but the improvement effect is not good and it is difficult to meet the needs in practical applications.

[0031] Based on the description in the background technology, in the related technology, it is necessary to manually manage and configure the transmission path of the optical signal. This is time-consuming and labor-intensive, and the process of routing update and maintenance is relatively difficult. Based on this, the embodiment of the present application provides a method, device, electronic device and storage medium for determining the shortest path. Since the adjacency characteristics between each node and other nodes can characterize the data transmission capacity between each node and other nodes, the electronic device can determine the shortest path (i.e., the optimal transmission path) between any source node and any destination node based on the data transmission capacity between each node and other nodes, and can realize the automatic configuration and management of the transmission path, thereby improving the reliability of network management and routing configuration.

[0032] Exemplarily, the electronic device that executes the method for determining the shortest path provided in the embodiment of the present application may be a mobile phone, a tablet computer, a desktop, a laptop, a handheld computer, a notebook computer, an ultra-mobile personal computer (UMPC), a netbook, a cellular phone, a personal digital assistant (PDA), an augmented reality (AR)\virtual reality (VR) device, and the embodiment of the present application does not impose any special restrictions on the specific form of the electronic device. It can interact with the user through one or more methods such as a keyboard, a touchpad, a touch screen, a remote control, voice interaction, or a handwriting device.

[0033] Optionally, the above-mentioned electronic device can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, network acceleration services (content delivery network, CDN), as well as big data and artificial intelligence platforms.

[0034] like Figure 1 As shown, the method for determining the shortest path provided in the embodiment of the present application may include S101-S103.

[0035] S101, obtaining transmission information between each of multiple nodes in a target network and other nodes.

[0036] The other nodes are nodes that have a connection relationship with each node.

[0037] It should be understood that the target network may be an ASON network, and the above-mentioned multiple nodes are network nodes included in the ASON network.

[0038] Optionally, the function of each of the above multiple nodes can be integrated on the server.

[0039] S102: Determine adjacency features between each node and other nodes based on transmission information between each node and other nodes.

[0040] The adjacency feature is used to characterize the data transmission capability between each node and other nodes.

[0041] Optionally, the transmission information between each node and other nodes may include a network delay between each node and other nodes, and the network delay may characterize a weight (or value) between each node and other nodes. The electronic device may determine the network delay between each node and other nodes as an adjacency feature between each node and other nodes.

[0042] S103: Determine a first shortest path in the target network based on adjacency features between each node and other nodes.

[0043] In an optional implementation, the above-mentioned determining the first shortest path in the target network based on the adjacency characteristics between each node and other nodes may specifically include step A.

[0044] Step A: For any source node and any destination node among the multiple nodes, determine the transmission path with the smallest characteristic value corresponding to the adjacency characteristic in at least one transmission path between the source node and the destination node as the first shortest path.

[0045] It should be understood that when the characteristic value corresponding to the adjacency characteristic of a transmission path between the source node and the destination node is the smallest, it means that the data transmission capacity corresponding to the transmission path (or the data transmission capacity between the nodes included in the transmission path) is the largest. At this time, the electronic device can determine the transmission path as the first shortest path, that is, the optimal transmission path between the source node and the destination node.

[0046] Optionally, for any transmission path, the adjacency feature of the transmission path may be the sum of the adjacency features between nodes included in the transmission path.

[0047] The technical solution provided by the above embodiment can at least bring the following beneficial effects: From S101-S103, it can be known that the electronic device can obtain the transmission information between each node and other nodes among the multiple nodes included in the target network, and determine the adjacency characteristics between each node and the other nodes based on the transmission information; finally, the first shortest path in the target network is determined based on the adjacency characteristics. Since the adjacency characteristics between each node and other nodes can characterize the data transmission capacity between each node and other nodes, the electronic device can determine the shortest path (i.e., the optimal transmission path) between any source node and any destination node based on the data transmission capacity between each node and other nodes, and can realize the automatic configuration and management of the transmission path, thereby improving the reliability of network management and routing configuration.

[0048] Combination Figure 1 ,like Figure 2In an implementation of the embodiment of the present application, the above-mentioned acquisition of transmission information between each of the multiple nodes in the target network and other nodes may specifically include S1011-S1012.

[0049] S1011. Obtain an initial network topology diagram of the target network.

[0050] The initial network topology structure diagram includes the above-mentioned multiple nodes and edges, and the edges are used to represent the transmission information between each node and other nodes.

[0051] It should be understood that an edge is used to connect two different nodes, and can also be understood as being used to represent the connection relationship between two different nodes.

[0052] S1012. Obtain transmission information between each node and other nodes from the initial network topology diagram.

[0053] It can be understood that since the edges in the initial network topology diagram are used to represent the transmission information between each node and other nodes, the electronic device can obtain the transmission information between each node and other nodes from the initial network topology diagram.

[0054] Combination Figure 1 ,like Figure 3 As shown, the method for determining the shortest path provided in the embodiment of the present application may also include S104-S107.

[0055] S104. Determine M cut points from multiple nodes.

[0056] Wherein, M is a positive integer.

[0057] In an optional implementation, if a certain node is a root node and the node has more than one child node, the electronic device may determine that the node is a cut point (ie, one of the M cut points).

[0058] In another optional implementation, if a certain node is a root node and the node is a leaf node, the electronic device may determine that the node is not a cut point.

[0059] S105. Delete N nodes from the initial network topology structure diagram to obtain a target network topology structure diagram.

[0060] The N nodes are nodes other than the source node, the destination node and the M cut points among the above multiple nodes, and N is a positive integer.

[0061] It should be understood that the N nodes are non-source nodes, non-destination nodes and non-cut points in the initial network topology diagram, that is, the target network topology diagram obtained by the electronic device only includes source nodes, destination nodes and M cut points.

[0062] S106: Determine, as the second shortest path, a transmission path having the smallest characteristic value corresponding to the adjacency characteristic in at least one transmission path between the source node and the destination node in the target network topology structure diagram.

[0063] It should be understood that the specific process of the electronic device determining the second shortest path is the same as or similar to the process of the electronic device determining the first shortest path, which will not be described in detail here.

[0064] S107: When the data transmission capacity corresponding to the second shortest path is higher than the data transmission capacity corresponding to the first shortest path, determine the first shortest path as an alternative path between the source node and the destination node.

[0065] It should be understood that when the data transmission capacity corresponding to the second shortest path is higher than the data transmission capacity corresponding to the first shortest path, it means that the optical signal (or data) is better transmitted on the second shortest path, while the optical signal is less effective transmitted on the first shortest path. At this time, the electronic device can determine the first shortest path as an alternative path (or secondary path) between the source node and the destination node.

[0066] Optionally, when the data transmission capacity corresponding to the second shortest path is higher than the data transmission capacity corresponding to the first shortest path, the electronic device may determine the second shortest path as the main path between the source node and the destination node. That is, the source node mainly transmits optical signals (or data) to the destination node through the second shortest path, and when a node in the second shortest path crashes or a link in the second shortest path is disconnected, the source node uses the first shortest path to transmit optical signals to the destination node.

[0067] In an optional implementation manner, the above-mentioned determining M cut points from multiple nodes may specifically include steps B to C.

[0068] Step B: Obtain the timestamp of when each node is first accessed and the timestamp of when the root node corresponding to each node is first accessed.

[0069] In the embodiment of the present application, the timestamp of the first access to the root node corresponding to a node can also be understood as the timestamp of the first access to the earliest ancestor node of the node that can be traced back.

[0070] Step C: determine the nodes that meet the preset conditions among the multiple nodes as M cut points.

[0071] The preset condition is that the timestamp when the root node corresponding to the adjacent node of the node is first accessed is greater than or equal to the timestamp when the node is first accessed.

[0072] It should be understood that for any node among the multiple nodes, if the timestamp of the first access to the root node corresponding to the adjacent node of the node is greater than or equal to the timestamp of the first access to the node, it means that there is no back edge from the adjacent node upward in the subtree of the node. That is, if the electronic device deletes the node, it cannot return to the root node corresponding to the adjacent node through the adjacent node. In this way, the electronic device can determine that the node is a cut point.

[0073] In one implementation of the embodiment of the present application, the transmission information between each node and other nodes may include the network delay between each node and other nodes, the average degree value of the target network, the degree value of each node, the queue length of each node, and the length of the data packet sent by each node per unit time. Figure 1 ,like Figure 4 As shown, the above-mentioned determination of the adjacency characteristics between each node and other nodes based on the transmission information between each node and other nodes may specifically include S1021-S1023.

[0074] S1021. Determine the transmission efficiency of each node based on the network delay between each node and other nodes.

[0075] It should be understood that the calculation of the transmission efficiency of a node is mainly through the average value of the sum of weight derivatives between all pairs of nodes in the target network.

[0076] Based on this, the transmission efficiency of any node satisfies the following formula:

[0077]

[0078] Among them, I k represents the transmission efficiency of node k, A i,j represents the network delay between node i and node j, n represents the number of nodes included in the target network, k,i,j=0,...,n-1, and n is a positive integer.

[0079] S1022: Determine the congestion level of each node based on the queue length of each node and the length of the data packet sent by each node in a unit time.

[0080] Specifically, the congestion degree of any node can satisfy the following formula:

[0081]

[0082] Among them, V j represents the congestion level of node j, C j represents the queue length of node j, E jIt represents the length of the data packet sent by node j in unit time, j=0,...,n-1, n is a positive integer, and n represents the number of nodes included in the target network.

[0083] S1023. Determine adjacency characteristics between each node and other nodes based on the network delay between each node and other nodes, the average degree value of the target network, the degree value of each node, the transmission efficiency of each node, and the congestion level of each node.

[0084] In an optional implementation, the adjacency feature between a node and other nodes may satisfy the following formula:

[0085]

[0086] Among them, A E represents the adjacency feature between node 0 and node n-1, A 0,n-1 represents the network delay between node 0 and node n-1, C n-1 represents the queue length of node n-1, d represents the average degree of the target network, and I n-1 represents the transmission efficiency of node n-1, D n-1 represents the degree value of node n-1, E n-1 Indicates the length of the data packet sent by node n-1 per unit time, Indicates the congestion level of node n-1, n indicates the number of nodes included in the target network, and n is a positive integer.

[0087] In another optional implementation, the electronic device may only consider the network delay between each node and other nodes and the degree value of each node in the process of determining the adjacency characteristics between each node and other nodes.

[0088] Based on this, the adjacency characteristics between a node and other nodes can also satisfy the following formula:

[0089]

[0090] Among them, A E represents the adjacency feature between node 0 and node n-1, A 0,n-1 represents the network delay between node 0 and node n-1, d represents the average degree of the target network, D n-1 Represents the degree value of node n-1, n represents the number of nodes included in the target network, and n is a positive integer.

[0091] In another optional implementation, the electronic device may consider the network delay between each node and other nodes, the degree value of each node, and the transmission efficiency of each node (i.e., without considering the congestion level of each node) when determining the adjacency characteristics between each node and other nodes.

[0092] Based on this, the adjacency characteristics between a node and other nodes can satisfy the following formula:

[0093]

[0094] Among them, A E represents the adjacency feature between node 0 and node n-1, A 0,n-1 1 represents the network delay between node 0 and node n-1, d represents the average degree of the target network, and I n-1 represents the transmission efficiency of node n-1, D n-1 Represents the degree value of node n-1, n represents the number of nodes included in the target network, and n is a positive integer.

[0095] The following is a complete example to illustrate the method for determining the shortest path provided by the embodiment of the present application. Figure 5 As shown, the method may specifically include S201-S207.

[0096] S201, construct an initial network topology diagram, define parameters and initialize them.

[0097] Specifically, real-time network data is obtained by broadcasting routing information and exchanging information between network nodes (or nodes), and a connected initial network topology structure G = (V, E, W) is obtained, where V represents the set of ASON network nodes, and V = {V0, V1, ..., V n-1},V i (i=0,...,n-1) represents the i-th ASON network node, n represents the total number of nodes in the ASON network, E={(V i ,V j )|i,j=0,...,n-1} represents the i-th node V i To the jth node V j undirected links between them. W represents the weight set between ASON network nodes, W i,j ={(V i ,V j )|i,j=0,...,n-1} represents the i-th node V i To the jth node V j The weight between them can be expressed as network delay, and {W i,j >0,W i,i =0} i,j＝0,...,n-1If the i-th node V i To the jth node V j If there is no link between i,j =∞. And define the initial hop number k<n.

[0098] For example, Figure 6 As shown, the initial network topology structure diagram provided in the embodiment of the present application includes 8 network nodes, namely network node 301, network node 302, network node 303, network node 304, network node 305, network node 306, network node 307 and network node 308.

[0099] S202: Acquire an ASON network source node set.

[0100] It should be understood that the electronic device can select t≤n source network nodes and form a source network node set V'={V'0,...,V' t-1}, where V' i (i=0,...,t-1) represents the i-th source node in the source network node set V'.

[0101] S203, constructing a network node vertex table and an adjacency matrix.

[0102] Specifically, the electronic device can establish a vertex table for recording the information of each network node and an adjacency matrix A for representing the relationship between each network node. n×n . The adjacency matrix can be defined as:

[0103]

[0104] Among them, W i,j represents the above weight (or value), (V i ,V j ) can be defined as the network delay. ∞ represents a value allowed by a computer that is greater than the weight of all links, i.e., an impossible limit value.

[0105] S204: Calculate the primary path from each source network node to each destination network node.

[0106] Among them, S204 may specifically include S2041-S2044.

[0107] S2041. Initialize i=0.

[0108] S2042: Let S be the set of endpoints of the shortest path, and VS be the network nodes of the undetermined shortest path. Then the initial S = {V i}, let D[j] be used to store the source network node V i Departure and arrival network node V jThe shortest path information mainly includes the weight D[j].value (initialized to ∞), the transmission path D[j].load (initialized to empty), and the number of hops D[j].hops (initialized to 0);

[0109] S2043. Initially, if the source network node V i To network node V j If there is a link, D[j].value is the weight A[i][j] on the link, otherwise it is ∞; D[j].load is {V i ,V j}, otherwise it is empty; D[j].hops is 1, otherwise it is 0.

[0110] Specifically, S2043 can be implemented through the following S2043a-S2043d.

[0111] S2043a, from V i Starting from, the shortest path with the shortest length is {V i ,V j}, that is, D[j].value=min{D[h]|V h ∈VS}. Then V j Add it to the set S and remove it from the set VS.

[0112] S2043b, modified from V i The length of the shortest path to all vertices in the set VS, that is, if D[j].value+A[j][h]<D[h].value(V h ∈VS), and D[j].hops+1≤k, then modify D[h].value=D[j].value+A[j][h], and D[h].load adds network node V to D[j].load j , D[h].hops=D[j].hops+1.

[0113] S2043c, select the path with the smallest length obtained in S2043b as the next shortest path, that is, D[j].value=min{D[h]|V h ∈VS}. Then, V j Add it to set S and remove it from set VS.

[0114] S2043d, repeat S2043b until the set VS is empty. If the shortest path of all network nodes is not found, the number of hops k+1<n.

[0115] S2044: add i+1 and repeat S2042 until the shortest paths from all source network nodes to other network nodes are found.

[0116] S205: In order to find two paths that are as different as possible, it is necessary to delete all nodes except the source network node, the destination network node and the cut point.

[0117] Specifically, if the cut point is deleted, the network topology diagram will be disconnected, and the source network node will be unable to reach the destination network node. Figure 6 As shown, after network node 305 is deleted, network node 308 cannot reach all the nodes that have not been deleted, so it is necessary to find and retain the cut points.

[0118] Among them, S205 may specifically include S2051-S2053.

[0119] S2051. Assume that dfs_num[v] represents the timestamp of the first visit of network node v, dfs_low[v] represents the value of dfs_num that the network node v can trace back to the earliest ancestor node, and is_cutpoint[v] is used to mark whether the network node v is a cutpoint. Initialize the timestamp to 0, and traverse each network node in the network topology diagram (if it has not been visited) to perform a depth-first search.

[0120] S2052: Perform operations S2052a-S2052d for each node v.

[0121] S2052a. Set both dfs_num[v] and dfs_low[v] to the current timestamp.

[0122] S2052b, traverse all neighboring network nodes w of network node v. If network node w has not been visited, treat it as a child node of v and perform a depth-first search recursive call.

[0123] S2052c. After the recursive call returns, update dfs_num[v]=min(dfs_num[v], dfs_num[w]).

[0124] S2052d. Increment the current timestamp.

[0125] S2053. Find the cut point according to dfs_num and dfs_low.

[0126] Specifically, S2053 can be implemented through the following S2053a-S2053c.

[0127] S2053a. If the root node has more than one child node, the root node is a cut point.

[0128] S2053b. If the root node is a leaf node, then the root node is not a cut point;

[0129] S2053c. For each network node v, if its child node w satisfies dfs_low[w]≥dfs_num[v], it means that there is no back edge from w in the subtree of node v, that is, after deleting node v, it is impossible to return to the ancestor of v through node w. Therefore, node v is a cut point, and is_cutpoint[v]=true is set.

[0130] S206: Calculate the secondary path from each source network node to each destination network node.

[0131] Among them, S206 may specifically include S2061-S2063.

[0132] S2061. Initialize i=0.

[0133] S2062: Let S be the set of endpoints of the shortest path, and VS be the network nodes whose shortest paths have not been determined. Then the initial S' = {V i}, let D'[j] be used to save and delete the D[j].load obtained in S204 except the source network node V i , Destination network node V j After the links and network nodes related to the cut points are obtained, the source network node V i and destination network node V j The shortest path information between them, that is, deleting the non-source network node V in the main path i , non-destination network node V j and non-cut point network nodes and links, if only the source network node V exists in the main path i and destination network node V j , and they are all non-cut points, then delete the source network node V i and destination network node V j The link between them is sufficient.

[0134] S2063. Regenerate the network topology diagram (ie, the target network topology diagram), execute S2043 and S2044, and obtain the secondary path.

[0135] S207: Compare the weights of the primary path and the secondary path, and select the path with the smaller weight as the primary path, otherwise, select the secondary path.

[0136] In this way, when a node in the primary path goes down or a link is broken, the secondary path can be used as an alternative path, improving the stability and reliability of the network.

[0137] For example, Figure 7 As shown, the electronic device can perform the following operations to obtain the above-mentioned primary path and secondary path.

[0138] First, at the beginning of the process, the electronic device can establish a network topology structure (specifically, an initial network topology structure), and then the electronic device performs a relaxation operation (i.e., determines the shortest path) based on the initial network topology structure. If the number of calculated shortest paths is greater than or equal to 2, the electronic device can directly select the two shortest paths as the main path and the secondary path, and the process ends.

[0139] If the number of the shortest paths is less than 2, the electronic device increases the number of hops by 1 and determines whether the number of newly generated paths is greater than or equal to 1. If the number of newly generated paths is greater than or equal to 1, the electronic device may also directly select the two shortest paths as the primary path and the secondary path, and the process ends.

[0140] If the number of newly generated paths is less than 1 after adding 1 to the number of hops, the electronic device determines whether the number of hops is less than the number of nodes. If the number of hops is less than the number of nodes, the electronic device will still add 1 to the number of hops to determine whether the number of newly generated paths is greater than or equal to 1. If the number of hops is greater than or equal to the number of nodes, the electronic device finds the cut point in the initial network topology diagram and calculates the shortest path.

[0141] In the embodiment of the present application, in the ASON self-organizing network, when the network node is down, the link is broken, and the transmission capacity of the network node changes, the network topology will change, which may reduce the reliability of the network. Therefore, it is valuable to perform regular maintenance on the route. The principle of the route maintenance stage is mainly to determine whether to update the route regularly by regularly detecting whether the network topology has changed. The specific process is as follows: Figure 8 As shown, it may include S401-S408.

[0142] S401: Determine whether there is any network node downtime.

[0143] If yes, then execute S402. If no, then execute S403.

[0144] S402: When a network node is down, update the network node in the shortest path that is in a down state.

[0145] S403: Determine whether there is a link disconnection.

[0146] If yes, then execute S404. If no, then execute S405.

[0147] S404: When a link is disconnected, update the network nodes in the shortest path that include the disconnected link.

[0148] S405: Whether the routing information is not updated within a fixed period of time.

[0149] If yes, then execute S406. If no, then end.

[0150] S406: If the routing information is not updated within a fixed time, update the routing information.

[0151] S407: Determine whether the data transmission capacity corresponding to the new path is greater than the data transmission capacity corresponding to the existing path.

[0152] If yes, then execute S408. If no, then end.

[0153] S408: If the data transmission capacity corresponding to the new path is greater than the data transmission capacity corresponding to the existing path, update the path.

[0154] The embodiment of the present application can divide the functional modules of the electronic device etc. according to the above method example. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiment of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation.

[0155] In the case of dividing each functional module into corresponding functional modules, Fig. 9 A possible structural diagram of the device for determining the shortest path involved in the above embodiment is shown. Fig. 9 As shown, the shortest path determination device 50 may include: an acquisition module 501 and a determination module 502 .

[0156] The acquisition module 501 is used to acquire transmission information between each node and other nodes among multiple nodes included in the target network, where the other nodes are nodes having a connection relationship with each node.

[0157] The determination module 502 is used to determine the adjacency feature between each node and the other node based on the transmission information between each node and the other node, and the adjacency feature is used to characterize the data transmission capacity between each node and the other node.

[0158] The determination module 502 is further configured to determine a first shortest path in the target network based on the adjacency feature between each node and the other nodes.

[0159] Optionally, the determination module 502 is specifically used to determine, for any source node and any destination node among the multiple nodes, a transmission path with the smallest characteristic value corresponding to the adjacency characteristic in at least one transmission path between the source node and the destination node as the first shortest path.

[0160] Optionally, the acquisition module 501 is specifically used to acquire an initial network topology diagram of the target network, where the initial network topology diagram includes the multiple nodes and edges, where the edges are used to represent transmission information between each node and the other nodes.

[0161] The acquisition module 501 is further specifically configured to obtain the transmission information between each node and the other nodes from the initial network topology structure diagram.

[0162] Optionally, the shortest path determination device 50 further includes a deletion module 503 .

[0163] The determination module 502 is further configured to determine M cut points from the multiple nodes, where M is a positive integer.

[0164] The deletion module 503 is used to delete N nodes in the initial network topology structure diagram to obtain a target network topology structure diagram; the N nodes are the nodes in the multiple nodes except the source node, the destination node and the M cut points, and N is a positive integer.

[0165] The determination module 502 is further configured to determine, among at least one transmission path between the source node and the destination node in the target network topology structure diagram, a transmission path having a minimum characteristic value corresponding to an adjacency characteristic as the second shortest path.

[0166] The determination module 502 is further configured to determine the first shortest path as a candidate path between the source node and the destination node when the data transmission capacity corresponding to the second shortest path is higher than the data transmission capacity corresponding to the first shortest path.

[0167] Optionally, the acquisition module 501 is further configured to acquire a timestamp when each node is first accessed and a timestamp when a root node corresponding to each node is first accessed.

[0168] The determination module 502 is specifically used to determine the nodes among the multiple nodes that meet the preset condition as the M cut points. The preset condition is that the timestamp of the first access of the root node corresponding to the adjacent node of the node is greater than or equal to the timestamp of the first access of the node.

[0169] Optionally, the transmission information includes the network delay between each node and the other nodes, the average degree of the target network, the degree of each node, the queue length of each node and the length of the data packet sent by each node per unit time.

[0170] The determination module 502 is specifically configured to determine the transmission efficiency of each node based on the network delay between each node and the other nodes.

[0171] The determination module 502 is further specifically configured to determine the congestion degree of each node based on the queue length of each node and the length of the data packet sent by each node in a unit time.

[0172] The determination module 502 is also specifically used to determine the adjacency characteristics between each node and the other nodes based on the network delay between each node and the other nodes, the average degree value of the target network, the degree value of each node, the transmission efficiency of each node and the congestion level of each node.

[0173] In the case of an integrated unit, Fig.10 A possible structural diagram of the device for determining the shortest path involved in the above embodiment is shown. Fig.10 As shown, the shortest path determination device 60 may include: a processing module 601 and a communication module 602. The processing module 601 may be used to control and manage the actions of the shortest path determination device 60. The communication module 602 may be used to support the communication between the shortest path determination device 60 and other entities. Fig.10 As shown, the shortest path determination device 60 may further include a storage module 603 for storing program codes and data of the shortest path determination device 60 .

[0174] The processing module 601 may be a processor or a controller. The communication module 602 may be a transceiver, a transceiver circuit or a communication interface, etc. The storage module 603 may be a memory.

[0175] When the processing module 601 is a processor, the communication module 602 is a transceiver, and the storage module 603 is a memory, the processor, the transceiver, and the memory may be connected via a bus. The bus may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc.

[0176] It should be understood that in the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0177] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0178] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

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

[0180] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using a software program, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loading and executing a computer program instruction on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website site, a computer, a server or a data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (Digital Subscriber Line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium may be any available medium that a computer can access or may contain one or more servers, data centers and other data storage devices that can be integrated with a medium. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (eg, a solid state disk (SSD)).

[0181] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A method for determining the shortest path, characterized in that: The method comprises: Acquire transmission information between each of a plurality of nodes included in the target network and other nodes, wherein the other nodes are nodes having a connection relationship with each of the nodes; Based on the transmission information between each node and the other nodes, determine the adjacency characteristics between each node and the other nodes, where the adjacency characteristics are used to characterize the data transmission capacity between each node and the other nodes; Based on the adjacency characteristics between each node and the other nodes, a first shortest path in the target network is determined.

2. The method according to claim 1, characterized in that The determining, based on the adjacency characteristics between each node and the other nodes, a first shortest path in the target network comprises: For any source node and any destination node among the multiple nodes, a transmission path having a minimum characteristic value corresponding to an adjacency characteristic in at least one transmission path between the source node and the destination node is determined as the first shortest path.

3. The method according to claim 1, characterized in that The obtaining of transmission information between each of the multiple nodes included in the target network and other nodes includes: Acquire an initial network topology structure diagram of the target network, wherein the initial network topology structure diagram includes the plurality of nodes and edges, wherein the edges are used to represent transmission information between each node and the other nodes; The transmission information between each node and the other nodes is obtained from the initial network topology structure diagram.

4. The method according to claim 3, characterized in that The method further comprises: Determine M cut points from the multiple nodes, where M is a positive integer; Deleting N nodes from the initial network topology structure diagram to obtain a target network topology structure diagram; the N nodes are nodes other than the source node, the destination node and the M cut points among the multiple nodes, and N is a positive integer; Determine, as the second shortest path, a transmission path having a minimum characteristic value corresponding to an adjacency characteristic in at least one transmission path between the source node and the destination node in the target network topology structure graph; When the data transmission capacity corresponding to the second shortest path is higher than the data transmission capacity corresponding to the first shortest path, the first shortest path is determined as an alternative path between the source node and the destination node.

5. The method according to claim 4, characterized in that The determining M cut points from the multiple nodes includes: Obtaining a timestamp of when each node is first accessed and a timestamp of when a root node corresponding to each node is first accessed; Nodes that meet a preset condition among the multiple nodes are determined as the M cut points, where the preset condition is that the timestamp of the first visit of the root node corresponding to the adjacent node of the node is greater than or equal to the timestamp of the first visit of the node.

6. The method according to any one of claims 1 to 5, characterized in that The transmission information includes the network delay between each node and the other nodes, the average degree value of the target network, the degree value of each node, the queue length of each node, and the length of the data packet sent by each node per unit time. The determining the adjacency characteristics between each node and the other nodes based on the transmission information between each node and the other nodes includes: Determining the transmission efficiency of each node based on the network delay between each node and the other nodes; Determine the congestion level of each node based on the queue length of each node and the length of the data packet sent by each node in a unit time; The adjacency characteristics between each node and the other nodes are determined based on the network delay between each node and the other nodes, the average degree value of the target network, the degree value of each node, the transmission efficiency of each node and the congestion level of each node.

7. A device for determining the shortest path, characterized in that: include: Get module and determine module; The acquisition module is used to acquire transmission information between each node and other nodes among a plurality of nodes included in the target network, wherein the other nodes are nodes having a connection relationship with each node; The determining module is used to determine the adjacency characteristics between each node and the other nodes based on the transmission information between each node and the other nodes, wherein the adjacency characteristics are used to characterize the data transmission capacity between each node and the other nodes; The determination module is further used to determine the first shortest path in the target network based on the adjacency characteristics between each node and the other nodes.

8. An electronic device, characterized in that: The electronic device comprises: processor; a memory configured to store instructions executable by the processor; The processor is configured to execute the instructions to implement the method for determining the shortest path according to any one of claims 1 to 6.

9. A computer-readable storage medium having instructions stored thereon, characterized in that: When the instructions in the computer-readable storage medium are executed by an electronic device, the electronic device is enabled to execute the method for determining the shortest path according to any one of claims 1 to 6.

10. A computer program product comprising instructions, characterized in that When the instruction is executed on an electronic device, the electronic device is enabled to execute the method for determining the shortest path according to any one of claims 1 to 6.

Images