Method, device and storage medium for analyzing topology of IP bearer network

Abstract

The application provides an IP bearer network topology analysis method, device, equipment and storage medium, which can be used in the field of computer network. The method comprises the following steps: obtaining a network networking topology of a target IP bearer network; wherein the network networking topology comprises a connection relationship between a plurality of device nodes in the target IP bearer network; performing path search on the network networking topology to obtain a plurality of search paths; performing path grouping on the search paths to obtain a loop group and a link group; performing path merging on the loop group and the link group to obtain a plurality of merged paths; performing path deduplication on each merged path to obtain a plurality of deduplicated paths; and determining the networking topology type of each deduplicated path based on the path attribute of the deduplicated path. The application realizes automatic analysis of the IP bearer network topology network structure based on the network topology link in the network networking topology of the IP bearer network, and quickly, dynamically and accurately identifies the non-standard networking topology in the wide-area IP bearer network.

Description

Technical Field

[0001] This application relates to the field of computer networks, and in particular to a method, apparatus, device, and storage medium for analyzing the topology of an IP bearer network. Background Technology

[0002] IP-based transport networks refer to network technologies that utilize the IP protocol as the transport layer protocol. Data packets are transmitted from one network node to another via network devices such as routers and switches, identified by IP addresses. Currently, IP-based transport networks are widely used across various industries. Their emergence has significantly changed network transmission methods, improved network reliability and security, and provided strong technical support for network development and applications.

[0003] In operator-local wide area IP bearer networks, such as intelligent metropolitan area networks and IPRAN (IP Radio Access Network), the network structure can be roughly divided into three network layers: core, aggregation, and access. To achieve advantages such as large-scale networking, faster convergence, fault isolation, and dual-route protection, standard ring network topologies are used in wide area IP bearer networks. However, because the network topology of the access layer network is most easily constrained by conditions such as optical cable resources and data center facilities, complex and frequently changing network structures emerge during network construction and maintenance, including non-standard network topologies such as ultra-large access rings, long single chains, ring-within-a-ring, and cross-domain access rings. Non-standard networking can lead to various network security risks. For example, in long single-chain network scenarios, the failure of a single uplink node can cause a large number of service interruptions; and in ring-within-a-ring network scenarios, network configuration complexity and the risk of traffic congestion due to detours increase. How to quickly, dynamically, and accurately identify non-standard network topologies in wide area IP bearer networks has become a major factor restricting the security of operator services.

[0004] In existing technologies, the analysis of the topology of IP bearer networks is mostly based on the network topology data. The topology information is used to assemble and generate ring and chain topology sets, but it cannot identify the types of non-standard network topologies and the list of nodes involved. Summary of the Invention

[0005] This application provides a method, apparatus, device, and storage medium for analyzing the topology of an IP bearer network, in order to solve the problem in the prior art that it is impossible to identify non-standard network topologies in a wide-area IP bearer network.

[0006] According to the first aspect disclosed in this application, this application provides a method for analyzing the topology of an IP bearer network, including:

[0007] Obtain the network topology of the target IP bearer network; wherein, the network topology includes the connection relationship between multiple device nodes in the target IP bearer network, and the device nodes include aggregation nodes and access nodes;

[0008] Perform a path search on the network topology to obtain several search paths;

[0009] The search path is grouped to obtain loop groups and link groups; wherein, the loop group includes several loop paths, and the link group includes several link paths.

[0010] Perform path merging on the loop group and the link group to obtain several merged paths;

[0011] Perform path deduplication on each merged path to obtain a number of deduplicated paths;

[0012] For each deduplication path, the network topology type of the deduplication path is determined based on the path attributes of the deduplication path; wherein, the path attributes include the node type of the first and last nodes in the deduplication path, the number of paths connecting the first and last nodes, and the number of links between the aggregation node and adjacent access nodes.

[0013] In one feasible implementation, a path search is performed on the network topology to obtain several search paths, including:

[0014] Obtain the aggregation node in the network topology;

[0015] For each aggregation node, starting from the aggregation node, the link paths connecting the preceding and following nodes are found to obtain several search paths.

[0016] In one feasible implementation, the search path is grouped to obtain loop groups and link groups, including:

[0017] For each search path, if both the first and last nodes of the search path are aggregation nodes, then the search path is determined to be a loop path and added to the loop group; if the first node of the search path is an aggregation node and the last node is an access node, then the search path is determined to be a link path and added to the link group.

[0018] In one feasible implementation, the method further includes:

[0019] For each access node in the aforementioned network topology:

[0020] If the access node is in the loop group, then the node attribute of the access node is determined to be in the loop;

[0021] If the access node is in the link group, then obtain the target link corresponding to the access node;

[0022] If the target link has other access nodes in the loop group, then the node attribute of the access node is determined to be a loop chain;

[0023] If the target link does not have other access nodes in the loop group, then the node attribute of the access node is determined to be a single chain.

[0024] In one feasible implementation, path merging is performed on the loop group and the link group to obtain several merged paths, including:

[0025] The loop paths in the loop group are grouped to obtain several grouped paths; among them, the loop paths with intersecting access nodes are grouped into one group;

[0026] The grouped paths are grouped with the link paths in the link group to obtain several merged paths; wherein, the grouped paths and link paths with intersecting access nodes are grouped together.

[0027] In one feasible implementation, path deduplication is performed on each merged path to obtain several deduplicated paths, including:

[0028] For each merging path, deduplication processing is performed on the link segments in the merging path to obtain a deduplicated path; wherein, the deduplication processing is to delete other link segments that are the same as the link segment in each link segment of the merging path.

[0029] In one feasible implementation, determining the network topology type of the deduplication path based on its path attributes includes:

[0030] If the first node and the last node in the deduplication path are two different aggregation nodes, and the number of paths connecting the first node and the last node is one, and the number of links between each aggregation node and the adjacent access node is one, then the network topology type of the deduplication path is determined to be a dual-homed ordinary ring.

[0031] If the first node and the last node in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first node and the last node, and each aggregation node has only one link to its adjacent access node, then the network topology type of the deduplication path is determined to be a dual-homed loop with a ring.

[0032] If the first node and the last node in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first node and the last node, and the number of links between the two aggregation nodes and the adjacent access nodes is at least three, then the network topology type of the deduplication path is determined to be a dual-homed cross-loop.

[0033] If the first node and the last node in the deduplication path are the same aggregation node, and there is one path connecting the first node and the last node, and two links between the aggregation node and the adjacent access node, then the network topology type of the deduplication path is determined to be a single-homed ordinary ring.

[0034] If the first node and the last node in the deduplication path are the same aggregation node, and there are multiple paths connecting the first node and the last node, and there are two links between the aggregation node and the adjacent access node, then the network topology type of the deduplication path is determined to be a single-homed ring with a ring.

[0035] If the first and last nodes in the deduplication path are the same aggregation node, and there are multiple paths connecting the first and last nodes, and the number of links between the aggregation node and the adjacent access node is at least three, then the network topology type of the deduplication path is determined to be a single-homed cross-loop.

[0036] If the first node in the deduplication path is a aggregation node and the last node is an access node, and the number of paths connecting the first node and the last node is one, and the number of links between the aggregation node and the adjacent access node is one, then the network topology type of the deduplication path is determined to be a single chain.

[0037] If the first node in the deduplication path is a convergence node, the last node includes both convergence nodes and access nodes, and there are multiple paths connecting the first and last nodes, then the network topology type of the deduplication path is determined to be a ring-chain.

[0038] According to a second aspect disclosed in this application, this application provides an IP bearer network topology analysis device, comprising:

[0039] The topology acquisition module is used to acquire the network topology of the target IP bearer network; wherein, the network topology includes the connection relationship between multiple device nodes in the target IP bearer network, and the device nodes include aggregation nodes and access nodes;

[0040] The path search module is used to perform path search on the network topology and obtain several search paths.

[0041] The path grouping module is used to group the search path to obtain loop groups and link groups; wherein, the loop group includes several loop paths, and the link group includes several link paths.

[0042] The path merging module is used to merge the loop group and the link group to obtain several merged paths.

[0043] The path deduplication module is used to deduplicat each merged path and obtain several deduplicated paths.

[0044] The path classification module is used to determine the network topology type of each deduplication path based on its path attributes. The path attributes include the node types of the first and last nodes in the deduplication path, the number of paths connecting the first and last nodes, and the number of links between the aggregation node and adjacent access nodes.

[0045] According to a third aspect disclosed in this application, an electronic device is provided, including a processor and a memory communicatively connected to the processor;

[0046] The memory stores computer-executed instructions;

[0047] The processor executes computer execution instructions stored in the memory to implement the method described in any one of the first aspects.

[0048] According to a fourth aspect disclosed in this application, a computer-readable storage medium is provided, wherein computer-executable instructions are stored therein, which, when executed by a processor, are used to implement the method described in any one of the first aspects.

[0049] According to the fifth aspect disclosed in this application, a computer program product is provided, comprising a computer program that, when executed by a processor, is used to implement the method described in any one of the first aspects.

[0050] Compared with the prior art, this application has the following advantages:

[0051] This application provides a method, apparatus, device, and storage medium for analyzing the topology of IP bearer networks. Based on the most basic network topology links in the IP bearer network topology, it achieves automatic analysis of the IP bearer network topology structure, quickly, dynamically, and accurately identifying non-standard network topologies in wide-area IP bearer networks. It boasts high efficiency and accuracy in identifying non-standard network topologies. Furthermore, this application can be applied to the IP bearer networks of major operators, particularly wide-area IP bearer networks such as IPRAN, intelligent metropolitan area networks, STN, and new metropolitan area networks, thus adapting to the analysis of non-standard network scenarios in various production environments and possessing the advantage of wide applicability. Attached Figure Description

[0052] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0053] Figure 1 A flowchart illustrating an IP bearer network topology analysis method provided in this application embodiment;

[0054] Figure 2 A flowchart illustrating another IP bearer network topology analysis method provided in this application embodiment;

[0055] Figure 3 This is a schematic diagram of the structure of an IP bearer network topology analysis device provided in an embodiment of this application;

[0056] Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application;

[0057] Figure 5 A topology diagram of a standard ring network topology provided for an embodiment of this application;

[0058] Figure 6 A topological schematic diagram of a dual-homed ordinary ring is provided for an embodiment of this application;

[0059] Figure 7 A topological diagram of a dual-loop band provided in an embodiment of this application;

[0060] Figure 8 This is a topological diagram of a dual-homing cross loop provided in an embodiment of this application;

[0061] Figure 9 This is a topological diagram of a dual-homing cross loop provided in an embodiment of this application;

[0062] Figure 10 This is a topological diagram of a dual-homing cross loop provided in an embodiment of this application;

[0063] Figure 11 A topological schematic diagram of a single-homed ordinary ring is provided for an embodiment of this application;

[0064] Figure 12 A schematic diagram of a single-loop topology with a loop is provided in an embodiment of this application;

[0065] Figure 13 This application provides a topology diagram of a single-homing cross loop.

[0066] Figure 14 A schematic diagram of a single-chain topology provided for an embodiment of this application;

[0067] Figure 15A topological schematic diagram of a ring chain provided in an embodiment of this application;

[0068] Figure 16 This is a schematic diagram of a network topology provided in an embodiment of this application.

[0069] The accompanying drawings illustrate specific embodiments of this application, which will be described in more detail below. These drawings and descriptions are not intended to limit the scope of the concept in any way, but rather to illustrate the concept of this application to those skilled in the art through reference to particular embodiments. Detailed Implementation

[0070] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.

[0071] IP-based transport networks refer to network technologies that utilize the IP protocol as the transport layer protocol. Data packets are transmitted from one network node to another via network devices such as routers and switches, identified by IP addresses. Currently, IP-based transport networks are widely used across various industries. Their emergence has significantly changed network transmission methods, improved network reliability and security, and provided strong technical support for network development and applications.

[0072] The main applications of IP bearer networks include: IP bearer networks enable cross-network data transmission, allowing data packets to be transmitted from one network node to another, facilitating data transmission between different networks; IP bearer networks enable routing, automatically selecting the optimal path based on the destination address of the data packet, enabling it to reach its destination faster; IP bearer networks enable data packet fragmentation and reassembly, fragmenting data packets when their size exceeds the network device's Maximum Transmission Unit (MTU) and then reassembling them at the destination, ensuring correct transmission; and IP bearer networks enable the transmission of various services, supporting multiple services such as voice, video, and data, allowing for more flexible transmission of various services.

[0073] In operator-local wide-area IP bearer networks, such as intelligent metropolitan area networks and IP RAN (IP Radio Access Network), the network structure can be roughly divided into three network layers: core, aggregation, and access. In wide-area IP bearer networks, to achieve advantages such as large-scale networking, faster convergence, fault isolation, and dual-route protection, a standard ring network topology is used (for its basic structure, see...). Figure 5 (As shown). However, because the network topology of the access layer network is most easily constrained by conditions such as optical cable resources and equipment room property, it presents a complex and frequently changing network structure during network construction and maintenance, with non-standard network topologies such as ultra-large access rings, long single chains, ring-within-a-ring, and cross-domain access rings.

[0074] Non-standard network topologies can lead to various network security risks. For example, in long single-chain network scenarios, the failure of a single upstream node can cause a large number of service interruptions. In ring-ring network scenarios, network configuration complexity and the risk of traffic congestion due to detours increase. How to quickly, dynamically, and accurately identify non-standard network topologies in wide-area IP bearer networks has become a major factor restricting the security of operators' services.

[0075] In existing technologies, the topology analysis of IP bearer networks can be performed manually or through automated algorithms. However, since a city-level IP bearer network typically involves hundreds to thousands of devices, manually classifying and identifying the network topology of a wide-area IP bearer network suffers from high error rates and low efficiency. While most known automated algorithms use network topology as the basic data, assembling ring and chain topology sets from topology information, they cannot identify non-standard network types or the list of involved nodes. Furthermore, they cannot dynamically analyze the network topology of a wide-area IP bearer network, nor can they quickly assess the network health status.

[0076] To address the aforementioned technical issues, this application proposes an IP bearer network topology analysis method. Based on the most basic network topology link in the IP bearer network topology, it enables automatic analysis of the IP bearer network topology structure, quickly, dynamically, and accurately identifying non-standard network topologies in wide area IP bearer networks.

[0077] Figure 1 A flowchart illustrating an IP bearer network topology analysis method provided in this application embodiment is shown below. Figure 1 In some embodiments, the process of this IP bearer network topology analysis method includes the following steps:

[0078] S101, Obtain the network topology of the target IP bearer network; wherein, the network topology includes the connection relationship between multiple device nodes in the target IP bearer network, and the device nodes include aggregation nodes and access nodes.

[0079] Specifically, since devices in an IP bearer network generally support SNMP or LLDP data collection protocols, link topology information related to each device can be collected via SNMP or LLDP. Alternatively, the link topology information of the entire IP bearer network can be collected uniformly through the northbound topology interface of the unified IP network management system.

[0080] S102, perform path search on the network topology to obtain several search paths.

[0081] Specifically, a path search is performed on the network topology to obtain several search paths, including: obtaining the aggregation nodes in the network topology; for each aggregation node, starting from the aggregation node, finding the link paths that connect the preceding and following nodes in sequence to obtain several search paths.

[0082] In network topology, path search starts from a cluster node and proceeds along the sequentially connected access nodes until the link reaches the cluster node again or there is no next-hop access node. The resulting link path is the search path.

[0083] S103, group the search paths to obtain loop groups and link groups; wherein, the loop group includes several loop paths and the link group includes several link paths.

[0084] Specifically, the search paths are grouped to obtain loop groups and link groups. This includes: for each search path, if both the first and last nodes of the search path are aggregation nodes, the search path is determined to be a loop path and added to the loop group; if the first node of the search path is an aggregation node and the last node is an access node, the search path is determined to be a link path and added to the link group.

[0085] In network topology, there are two basic structures: loops and links. A loop defines the range of an access ring, starting from a sink node, passing through one or more access nodes, and ending at a sink node. A link defines the range of a single chain, starting from a sink node, passing through one or more access nodes, and ending at a terminal access node. Specifically, for a loop path, the sink nodes of the first and last nodes of the search path can be the same or different.

[0086] Therefore, based on the definitions of loops and links, the search paths are grouped into loop groups and link groups.

[0087] Preferably, for each access node in the network topology, the node attributes of the access node are determined, including: if the access node is in a loop group, the node attribute of the access node is determined to be in a loop; if the access node is in a link group, the target link corresponding to the access node is obtained; if there are other access nodes in the loop group on the target link, the node attribute of the access node is determined to be a ring-linked link; if there are no other access nodes in the loop group on the target link, the node attribute of the access node is determined to be a single link.

[0088] Each access node is defined with a node attribute, which can be used for extended network security analysis. From a network security perspective, the security of access nodes, from highest to lowest, is "in a ring," "ring with chain," and "single chain." Therefore, a preliminary assessment of the security of access nodes can be made using the node attribute.

[0089] S104, perform path merging on the loop group and link group to obtain several merged paths.

[0090] Specifically, path merging is performed on loop groups and link groups to obtain several merged paths, including: grouping loop paths in loop groups to obtain several grouped paths; where loop paths with intersecting access nodes are grouped into one group; grouping the grouped paths with link paths in link groups to obtain several merged paths; where grouped paths and link paths with intersecting access nodes are grouped into one group.

[0091] The merged path is obtained by grouping and merging the paths in the loop group and the link group.

[0092] S105, perform path deduplication on each merged path to obtain several deduplicated paths.

[0093] Specifically, path deduplication is performed on each merge path to obtain several deduplicated paths. This includes: for each merge path, deduplication processing is performed on the link segments in the merge path to obtain deduplicated paths; wherein, the deduplication processing is to delete other link segments that are the same as the link segments in each merge path.

[0094] In each merging path, there are multiple occurrences of the same link segment. These duplicate link segments need to be deduplicated, with only one instance of the same link segment retained to avoid link segment duplication.

[0095] S106. For each deduplication path, determine the network topology type of the deduplication path based on the path attributes of the deduplication path; wherein, the path attributes include the node type of the first and last nodes in the deduplication path, the number of paths connecting the first and last nodes, and the number of links between the aggregation node and the adjacent access node.

[0096] Preferably, the network topology type of the deduplication path is determined based on the path attributes of the deduplication path, including:

[0097] If the first and last nodes in the deduplication path are two different aggregation nodes, and there is one path connecting the first and last nodes, and one link between each aggregation node and its adjacent access node, then the network topology type of the deduplication path is determined to be a dual-homed ordinary ring.

[0098] For the basic structure of the dual-track ordinary ring, please refer to [reference needed]. Figure 6 .

[0099] If the first and last nodes in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first and last nodes, and each aggregation node has only one link to its adjacent access node, then the network topology type of the deduplication path is determined to be a dual-homed loop with a ring.

[0100] For the basic structure of the double-loop belt ring, please refer to [reference needed]. Figure 7 .

[0101] If the first and last nodes in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first and last nodes, and the number of links between the two aggregation nodes and adjacent access nodes is at least three, then the network topology type of the deduplication path is determined to be a dual-homed cross-ring.

[0102] For the basic structure of the double-regression cross loop, please refer to [link / reference]. Figure 8 , Figure 9 , Figure 10 .

[0103] If the first and last nodes in the deduplication path are the same aggregation node, and there is one path connecting the first and last nodes, and two links between the aggregation node and the adjacent access node, then the network topology type of the deduplication path is determined to be a single-homed ordinary ring.

[0104] For the basic structure of a single-ring ordinary ring, please refer to [link / reference]. Figure 11 .

[0105] If the first and last nodes in the deduplication path are the same aggregation node, and there are multiple paths connecting the first and last nodes, and two links between the aggregation node and the adjacent access node, then the network topology type of the deduplication path is determined to be a single-homed loop with a ring.

[0106] For the basic structure of the single-loop belt ring, please refer to [reference needed]. Figure 12 .

[0107] If the first and last nodes in the deduplication path are the same aggregation node, and there are multiple paths connecting the first and last nodes, and the aggregation node has at least three links to adjacent access nodes, then the network topology type of the deduplication path is determined to be a single-homed cross-loop.

[0108] For the basic structure of a single-path cross loop, please refer to [link / reference]. Figure 13 .

[0109] If the first node in the deduplication path is a aggregation node and the last node is an access node, and there is one path connecting the first node and the last node, and one link between the aggregation node and the adjacent access node, then the network topology type of the deduplication path is determined to be a single chain.

[0110] For the basic structure of a single chain, please refer to [link / reference]. Figure 14 .

[0111] If the first node in the deduplication path is a convergence node, the last node includes both convergence and access nodes, and there are multiple paths connecting the first and last nodes, then the network topology type of the deduplication path is determined to be a ring-chain.

[0112] For the basic structure of the ring chain, please refer to [link / reference]. Figure 15 .

[0113] Specifically, among the network topology types mentioned above, dual-homed ordinary ring is the standard network topology, while the others are non-standard network topologies.

[0114] In this embodiment, based on the most basic network topology links in the IP bearer network topology, automatic analysis of the IP bearer network topology structure is achieved. This allows for rapid, dynamic, and accurate identification of non-standard network topologies in wide-area IP bearer networks, demonstrating high efficiency and accuracy in identifying non-standard topologies. Furthermore, this application can be applied to the IP bearer networks of major operators, particularly wide-area IP bearer networks such as IPRAN, intelligent metropolitan area networks, STN, and new metropolitan area networks, thus adapting to the analysis of non-standard network scenarios in various production environments and possessing the advantage of wide applicability.

[0115] Furthermore, after analyzing the topology of the IP bearer network, the results can be analyzed to quickly identify structural problems within the overall network of the wide-area IP bearer network, providing a basis for scoring the overall network health and robustness, which is beneficial for the overall network health and robustness analysis. Combined with the overall network robustness, it is helpful to effectively manage the security of service access; for example, services requiring protection are temporarily not allowed to access long single-chain nodes that lack loop protection. The analysis of the overall network topology facilitates the rapid identification of key weaknesses, enabling targeted allocation of network protection resources and optimization. It can improve network security early warning capabilities, respond promptly to changes in the network, and provide accurate resource information for multiple application scenarios such as analysis of large loop / chain vulnerabilities, early warning of large-scale site outages, fault cause determination, and network self-healing. Furthermore, through cross-professional resource association between the local IP bearer network and wireless base stations, automatic perception of service status can be achieved.

[0116] exist Figure 1 Based on the embodiments shown, the following is combined with Figure 2 The technical solution of the above-mentioned IP bearer network topology analysis method will be further introduced.

[0117] Figure 2 A flowchart illustrating another IP bearer network topology analysis method provided in this application embodiment is shown below. Figure 2 In some embodiments, the process of this IP bearer network topology analysis method includes the following steps:

[0118] S201, Obtain the network topology of the target IP bearer network; wherein, the network topology includes the connection relationship between multiple device nodes in the target IP bearer network, and the device nodes include aggregation nodes and access nodes.

[0119] For example, with Figure 16 Taking the network topology in the example as an example, it includes two aggregation nodes, 1A and 21U, and access nodes 2B, 3C, 4D, 5E, 6F, 7G, 8H, 9L, 10M, 11N, 12O, 13P, 14N, 15Q, 16P, 17Q, 18R, 19S, and 20T.

[0120] S202, obtain the aggregation node in the network topology.

[0121] Specifically, obtain the aggregation nodes 1A and 21U.

[0122] S203: For each aggregation node, starting from the aggregation node, find the link paths that connect the preceding and following nodes in sequence to obtain several search paths.

[0123] For example, "Path(A end = ..., Z end = ...)" represents a link from node A to node B. Multiple Paths concatenated together represent a single path. Multiple Paths within the same path are unique. Each path is assigned a unique sequence number for easy processing in subsequent steps.

[0124] Specifically, path searches were performed starting from aggregation nodes 1A and 21U respectively, and the resulting search paths are as follows:

[0125] There are 8 paths starting from the 1A aggregation node, as follows:

[0126] 1. Path(A end = 1A, Z end = 14N), Path(A end = 14N, Z end = 15O), Path(A end = 15O, Z end = 17Q), Path(A end = 17Q, Z end = 21U).

[0127] 2. Path(A end = 1A, Z end = 14N), Path(A end = 14N, Z end = 15O), Path(A end = 15O, Z end = 16P), Path(A end = 16P, Z end = 21U).

[0128] 3. Path(A end = 1A, Z end = 18R), Path(A end = 18R, Z end = 19S), Path(A end = 19S, Z end = 20T).

[0129] 4. Path(A end = 1A, Z end = 2B), Path(A end = 2B, Z end = 3C), Path(A end = 3C, Z end = 4D), Path(A end = 4D, Z end = 5E), Path(A end = 5E, Z end = 1A).

[0130] 5. Path(A end = 1A, Z end = 5E), Path(A end = 5E, Z end = 4D), Path(A end = 4D, Z end = 3C), Path(A end = 3C, Z end = 2B), Path(A end = 2B, Z end = 1A).

[0131] 6. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 12L), Path(A end = 12L, Z end = 13M), Path(A end = 13M, Z end = 21U).

[0132] 7. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 11K).

[0133] 8. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 10J).

[0134] There are 7 paths starting from the 21U aggregation node, as follows:

[0135] 9. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 11K).

[0136] 10. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 10J).

[0137] 11. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 7G), Path(A end = 7G, Z end = 6F), Path(A end = 6F, Z end = 1A).

[0138] 12. Path(A end = 21U, Z end = 17Q), Path(A end = 17Q, Z end = 15O), Path(A end = 15O, Z end = 14N), Path(A end = 14N, Z end = 1A).

[0139] 13. Path(A end = 21U, Z end = 17Q), Path(A end = 17Q, Z end = 15O), Path(A end = 15O, Z end = 16P), Path(A end = 16P, Z end = 21U).

[0140] 14. Path(A end = 21U, Z end = 16P), Path(A end = 16P, Z end = 15O), Path(A end = 15O, Z end = 17Q), Path(A end = 17Q, Z end = 21U).

[0141] 15. Path(A end = 21U, Z end = 16P), Path(A end = 16P, Z end = 15O), Path(A end = 15O, Z end = 14N), Path(A end = 14N, Z end = 1A).

[0142] S204. For each search path, if both the first and last nodes of the search path are aggregation nodes, then the search path is determined to be a loop path and the search path is added to the loop group; if the first node of the search path is an aggregation node and the last node is an access node, then the search path is determined to be a link path and the search path is added to the link group.

[0143] Specifically, based on the above search paths, the resulting loop paths and link paths are as follows:

[0144] a) The loop paths in the loop group include:

[0145] 1. Path(A end = 1A, Z end = 14N), Path(A end = 14N, Z end = 15O), Path(A end = 15O, Z end = 17Q), Path(A end = 17Q, Z end = 21U).

[0146] 2. Path(A end = 1A, Z end = 14N), Path(A end = 14N, Z end = 15O), Path(A end = 15O, Z end = 16P), Path(A end = 16P, Z end = 21U).

[0147] 4. Path(A end = 1A, Z end = 2B), Path(A end = 2B, Z end = 3C), Path(A end = 3C, Z end = 4D), Path(A end = 4D, Z end = 5E), Path(A end = 5E, Z end = 1A).

[0148] 5. Path(A end = 1A, Z end = 5E), Path(A end = 5E, Z end = 4D), Path(A end = 4D, Z end = 3C), Path(A end = 3C, Z end = 2B), Path(A end = 2B, Z end = 1A).

[0149] 6. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 12L), Path(A end = 12L, Z end = 13M), Path(A end = 13M, Z end = 21U).

[0150] 11. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 7G), Path(A end = 7G, Z end = 6F), Path(A end = 6F, Z end = 1A).

[0151] 12. Path(A end = 21U, Z end = 17Q), Path(A end = 17Q, Z end = 15O), Path(A end = 15O, Z end = 14N), Path(A end = 14N, Z end = 1A).

[0152] 13. Path(A end = 21U, Z end = 17Q), Path(A end = 17Q, Z end = 15O), Path(A end = 15O, Z end = 16P), Path(A end = 16P, Z end = 21U).

[0153] 14. Path(A end = 21U, Z end = 16P), Path(A end = 16P, Z end = 15O), Path(A end = 15O, Z end = 17Q), Path(A end = 17Q, Z end = 21U).

[0154] 15. Path(A end = 21U, Z end = 16P), Path(A end = 16P, Z end = 15O), Path(A end = 15O, Z end = 14N), Path(A end = 14N, Z end = 1A).

[0155] b) The link paths in the link group include:

[0156] 3. Path(A end = 1A, Z end = 18R), Path(A end = 18R, Z end = 19S), Path(A end = 19S, Z end = 20T).

[0157] 7. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 11K).

[0158] 8. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 10J).

[0159] 9. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 11K).

[0160] 10. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 10J).

[0161] S205, group the loop paths in the loop group to obtain several grouped paths; among them, the loop paths with intersecting access nodes are grouped into one group.

[0162] Specifically, an intersection access node refers to an access node that is shared by multiple paths.

[0163] Specifically, after grouping the loop paths, the grouped paths are as follows:

[0164] (1) The first group path includes:

[0165] 1. Path(A end = 1A, Z end = 14N), Path(A end = 14N, Z end = 15O), Path(A end = 15O, Z end = 17Q), Path(A end = 17Q, Z end = 21U).

[0166] 2. Path(A end = 1A, Z end = 14N), Path(A end = 14N, Z end = 15O), Path(A end = 15O, Z end = 16P), Path(A end = 16P, Z end = 21U).

[0167] 12. Path(A end = 21U, Z end = 17Q), Path(A end = 17Q, Z end = 15O), Path(A end = 15O, Z end = 14N), Path(A end = 14N, Z end = 1A).

[0168] 13. Path(A end = 21U, Z end = 17Q), Path(A end = 17Q, Z end = 15O), Path(A end = 15O, Z end = 16P), Path(A end = 16P, Z end = 21U).

[0169] 14. Path(A end = 21U, Z end = 16P), Path(A end = 16P, Z end = 15O), Path(A end = 15O, Z end = 17Q), Path(A end = 17Q, Z end = 21U).

[0170] 15. Path(A end = 21U, Z end = 16P), Path(A end = 16P, Z end = 15O), Path(A end = 15O, Z end = 14N), Path(A end = 14N, Z end = 1A).

[0171] (2) The second grouping path includes:

[0172] 4. Path(A end = 1A, Z end = 2B), Path(A end = 2B, Z end = 3C), Path(A end = 3C, Z end = 4D), Path(A end = 4D, Z end = 5E), Path(A end = 5E, Z end = 1A).

[0173] 5. Path(A end = 1A, Z end = 5E), Path(A end = 5E, Z end = 4D), Path(A end = 4D, Z end = 3C), Path(A end = 3C, Z end = 2B), Path(A end = 2B, Z end = 1A).

[0174] (3) The third grouping path includes:

[0175] 6. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 12L), Path(A end = 12L, Z end = 13M), Path(A end = 13M, Z end = 21U).

[0176] 11. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 7G), Path(A end = 7G, Z end = 6F), Path(A end = 6F, Z end = 1A).

[0177] S206, group the grouped paths and the link paths in the link group to obtain several merged paths; among them, the grouped paths and link paths with intersecting access nodes are grouped together.

[0178] Specifically, after the loop path is grouped, the grouped path is grouped with the link path, and the resulting merged path is as follows:

[0179] (1) The first merge path includes:

[0180] 1. Path(A end = 1A, Z end = 14N), Path(A end = 14N, Z end = 15O), Path(A end = 15O, Z end = 17Q), Path(A end = 17Q, Z end = 21U).

[0181] 2. Path(A end = 1A, Z end = 14N), Path(A end = 14N, Z end = 15O), Path(A end = 15O, Z end = 16P), Path(A end = 16P, Z end = 21U).

[0182] 12. Path(A end = 21U, Z end = 17Q), Path(A end = 17Q, Z end = 15O), Path(A end = 15O, Z end = 14N), Path(A end = 14N, Z end = 1A).

[0183] 13. Path(A end = 21U, Z end = 17Q), Path(A end = 17Q, Z end = 15O), Path(A end = 15O, Z end = 16P), Path(A end = 16P, Z end = 21U).

[0184] 14. Path(A end = 21U, Z end = 16P), Path(A end = 16P, Z end = 15O), Path(A end = 15O, Z end = 17Q), Path(A end = 17Q, Z end = 21U).

[0185] 15. Path(A end = 21U, Z end = 16P), Path(A end = 16P, Z end = 15O), Path(A end = 15O, Z end = 14N), Path(A end = 14N, Z end = 1A).

[0186] (2) The second merge path includes:

[0187] 4. Path(A end = 1A, Z end = 2B), Path(A end = 2B, Z end = 3C), Path(A end = 3C, Z end = 4D), Path(A end = 4D, Z end = 5E), Path(A end = 5E, Z end = 1A).

[0188] 5. Path(A end = 1A, Z end = 5E), Path(A end = 5E, Z end = 4D), Path(A end = 4D, Z end = 3C), Path(A end = 3C, Z end = 2B), Path(A end = 2B, Z end = 1A).

[0189] (3) The third merging path includes:

[0190] 6. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 12L), Path(A end = 12L, Z end = 13M), Path(A end = 13M, Z end = 21U).

[0191] 11. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 7G), Path(A end = 7G, Z end = 6F), Path(A end = 6F, Z end = 1A).

[0192] 7. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 11K).

[0193] 8. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 10J).

[0194] 9. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 11K).

[0195] 10. Path(A end = 21U, Z end = 13M), Path(A end = 13M, Z end = 12L), Path(A end = 12L, Z end = 8H), Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 10J).

[0196] (4) The fourth merging path includes:

[0197] 3. Path(A end = 1A, Z end = 18R), Path(A end = 18R, Z end = 19S), Path(A end = 19S, Z end = 20T).

[0198] S207, For each merging path, perform deduplication processing on the link segments in the merging path to obtain a deduplicated path; wherein, the deduplication processing is to delete other link segments that are the same as the link segment in each link segment in the merging path to remove duplicates.

[0199] Specifically, the merged paths are deduplicated, and the deduplicated paths are as follows:

[0200] (1) The first deduplication path includes:

[0201] 1. Path(A end = 1A, Z end = 14N), Path(A end = 14N, Z end = 15O), Path(A end = 15O, Z end = 17Q), Path(A end = 17Q, Z end = 21U).

[0202] 2. Path (A end = 15O, Z end = 16P), Path (A end = 16P, Z end = 21U) (Link segment Path is repeated, delete part of the Path).

[0203] 12. (Duplicate link segment path, delete the entire path).

[0204] 13. (Duplicate link segment path, delete the entire path).

[0205] 14. (Duplicate link segment path, delete the entire path).

[0206] 15. (Duplicate path segment, delete the entire path).

[0207] (2) The second deduplication path includes:

[0208] 4. Path(A end = 1A, Z end = 2B), Path(A end = 2B, Z end = 3C), Path(A end = 3C, Z end = 4D), Path(A end = 4D, Z end = 5E), Path(A end = 5E, Z end = 1A)

[0209] 5. (Delete duplicate links / paths).

[0210] (3) The third deduplication path includes:

[0211] 6. Path(A end = 1A, Z end = 6F), Path(A end = 6F, Z end = 7G), Path(A end = 7G, Z end = 8H), Path(A end = 8H, Z end = 12L), Path(A end = 12L, Z end = 13M), Path(A end = 13M, Z end = 21U).

[0212] 11. (Duplicate link segment path, delete the entire path).

[0213] 7. Path(A end = 8H, Z end = 9I), Path(A end = 9I, Z end = 11K) (Link segment Path is repeated, delete part of the Path).

[0214] 8. Path (A end = 9I, Z end = 10J) (Paths in the link segment are duplicated, delete part of the path).

[0215] 9. (Duplicate path segment, delete the entire path).

[0216] 10. (Duplicate link segment path, delete the entire path).

[0217] (4) The fourth deduplication path includes:

[0218] 3. Path(A end = 1A, Z end = 18R), Path(A end = 18R, Z end = 19S), Path(A end = 19S, Z end = 20T).

[0219] S208. For each deduplication path, determine the network topology type of the deduplication path based on the path attributes of the deduplication path; wherein, the path attributes include the node type of the first and last nodes in the deduplication path, the number of paths connecting the first and last nodes, and the number of links between the aggregation node and the adjacent access node.

[0220] Specifically, by dividing the four deduplication paths analyzed above according to the preset network topology type rules, the corresponding structure types can be obtained as follows, including the corresponding ring chain type and the corresponding node list:

[0221] (1) The first deduplication path: a double-homed cross-loop, which meets the conditions that "the first node and the last node in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first node and the last node, and the number of links between the two aggregation nodes and the adjacent access nodes is at least three".

[0222] (2) The second deduplication path is a single-origin ordinary ring that meets the conditions that "the first and last nodes in the deduplication path are the same aggregation node, and the number of paths connecting the first and last nodes is one, and the number of links between the aggregation node and the adjacent access node is two".

[0223] (3) The third deduplication path: a ring chain, which meets the condition that "the first node of the deduplication path is a convergence node, the last node includes a convergence node and an access node, and the number of paths connecting the first node and the last node is multiple".

[0224] (4) Fourth deduplication path: single chain, which meets the conditions that "the first node in the deduplication path is the aggregation node, the last node is the access node, and the number of paths connecting the first node and the last node is one, and the number of links between the aggregation node and the adjacent access node is one".

[0225] In this embodiment, the method for analyzing the topology of an IP bearer network is explained in conjunction with a specific network topology.

[0226] Figure 3 This is a schematic diagram of the structure of an IP bearer network topology analysis device provided in an embodiment of this application. (See attached diagram.) Figure 3The IP bearer network topology analysis device includes various functional modules for implementing the aforementioned IP bearer network topology analysis method. Any functional module can be implemented by software and / or hardware.

[0227] In some embodiments, the IP bearer network topology analysis device 300 includes a topology acquisition module 301, a path search module 302, a path grouping module 303, a path merging module 304, a path deduplication module 305, and a path classification module 306. Wherein:

[0228] The topology acquisition module 301 is used to acquire the network topology of the target IP bearer network; wherein, the network topology includes the connection relationship between multiple device nodes in the target IP bearer network, and the device nodes include aggregation nodes and access nodes;

[0229] The path search module 302 is used to perform path search on the network topology and obtain several search paths;

[0230] The path grouping module 303 is used to group the search path to obtain loop groups and link groups; wherein, the loop group includes several loop paths and the link group includes several link paths.

[0231] The path merging module 304 is used to merge loop groups and link groups to obtain several merged paths.

[0232] The path deduplication module 305 is used to deduplicat each merged path and obtain several deduplicated paths.

[0233] The path classification module 306 is used to determine the network topology type of each deduplication path based on its path attributes. The path attributes include the node types of the first and last nodes in the deduplication path, the number of paths connecting the first and last nodes, and the number of links between the aggregation node and adjacent access nodes.

[0234] In some embodiments, the path search module 302 is specifically used for:

[0235] Obtain the aggregation node in the network topology;

[0236] For each aggregation node, starting from the aggregation node, find the link paths that connect the preceding and following nodes in sequence to obtain several search paths.

[0237] In some embodiments, the path grouping module 303 is specifically used for:

[0238] For each search path, if both the first and last nodes of the search path are aggregation nodes, then the search path is determined to be a loop path and added to the loop group; if the first node of the search path is an aggregation node and the last node is an access node, then the search path is determined to be a link path and added to the link group.

[0239] In some embodiments, the path grouping module 303 is further configured to:

[0240] For each access node in the network topology:

[0241] If the access node is in the loop group, then the node attribute of the access node is determined to be in the loop;

[0242] If the access node is in the link group, then obtain the target link corresponding to the access node;

[0243] If the target link has other access nodes in the loop group, then the node attribute of the access node is determined to be a loop chain;

[0244] If the target link does not have other access nodes in the loop group, then the node attribute of the access node is determined to be a single chain.

[0245] In some embodiments, the path merging module 304 is specifically used for:

[0246] The loop paths in the loop group are grouped to obtain several grouped paths; among them, the loop paths with intersecting access nodes are grouped together.

[0247] Group the grouped paths and the link paths in the link group to obtain several merged paths; among them, the grouped paths and link paths with overlapping access nodes are grouped together.

[0248] In some embodiments, the path deduplication module 305 is specifically used for:

[0249] For each merging path, deduplication is performed on the link segments in the merging path to obtain a deduplicated path; the deduplication process involves deleting other link segments that are identical to the link segment in each link segment of the merging path.

[0250] In some embodiments, the path classification module 306 is specifically used for:

[0251] If the first and last nodes in the deduplication path are two different aggregation nodes, and the number of paths connecting the first and last nodes is one, and the number of links between each aggregation node and its adjacent access node is one, then the network topology type of the deduplication path is determined to be a dual-homed ordinary ring.

[0252] If the first and last nodes in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first and last nodes, and each aggregation node has only one link to its adjacent access node, then the network topology type of the deduplication path is determined to be a dual-homed loop with a ring.

[0253] If the first and last nodes in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first and last nodes, as well as multiple links between the aggregation nodes and adjacent access nodes, then the network topology type of the deduplication path is determined to be a dual-homed cross-ring.

[0254] If the first and last nodes in the deduplication path are two different aggregation nodes, and there is one path connecting the first and last nodes, and two links between the aggregation node and the adjacent access node, then the network topology type of the deduplication path is determined to be a single-homed ordinary ring.

[0255] If the first and last nodes in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first and last nodes, and two links between the aggregation node and the adjacent access node, then the network topology type of the deduplication path is determined to be a single-homed loop with a ring.

[0256] If the first and last nodes in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first and last nodes, and the number of links between the aggregation nodes and adjacent access nodes is at least three, then the network topology type of the deduplication path is determined to be a single-homed cross-loop.

[0257] If the node type of the tail node in the deduplication path is an access node, and the number of paths connecting the head node and the tail node is one, and the number of links between each aggregation node and the adjacent access node is one, then the network topology type of the deduplication path is determined to be a single chain.

[0258] If the node type of the tail node in the deduplication path is a convergence node or an access node, then the network topology type of the deduplication path is determined to be a ring-chain.

[0259] The IP bearer network topology analysis device 300 provided in this application embodiment is used to execute the technical solution provided in the aforementioned IP bearer network topology analysis method embodiment. Its implementation principle and technical effect are similar to those in the aforementioned method embodiment, and will not be repeated here.

[0260] It should be noted that the division of the various modules in the above device is merely a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, these modules can be implemented entirely in software via processing elements, entirely in hardware, or partially in software via processing elements and partially in hardware. For example, the path search module can be a separate processing element, or it can be integrated into a chip within the device. Alternatively, it can be stored as program code in the device's memory, invoked and executed by a processing element. The implementation of other modules is similar. Moreover, these modules can be fully or partially integrated together, or implemented independently. The processing element here can be an integrated circuit with signal processing capabilities. During implementation, each step of the above method or each of the above modules can be completed through integrated logic circuits in the processor element or through software instructions.

[0261] Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. (See attached diagram.) Figure 4 The electronic device 400 includes: a processor 401, and a memory 402 communicatively connected to the processor 401;

[0262] Memory 402 stores instructions executed by the computer;

[0263] The processor 401 executes the computer execution instructions stored in the memory 402 to implement the technical solution of the aforementioned IP bearer network topology analysis method.

[0264] In the aforementioned electronic device 400, the memory 402 and the processor 401 are electrically connected directly or indirectly to achieve data transmission or interaction. For example, these components can be electrically connected to each other through one or more communication buses or signal lines, such as bus connections. The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. Buses can be classified as address buses, data buses, control buses, etc., but this does not mean that there is only one bus or one type of bus. The memory 402 stores computer execution instructions that implement the aforementioned IP bearer network topology analysis method, including at least one software functional module that can be stored in the memory 402 in the form of software or firmware. The processor 401 executes various functional applications and data processing by running the software programs and modules stored in the memory 402.

[0265] The memory 402 includes at least one type of readable storage medium, not limited to Random Access Memory (RAM), Read Only Memory (ROM), Programmable Read-Only Memory (PROM), Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), etc. The memory 402 stores programs, which are executed by the processor 401 upon receiving execution instructions. Furthermore, the software programs and modules within the memory 402 may also include an operating system, which may include various software components and / or drivers for managing system tasks (e.g., memory management, storage device control, power management, etc.) and can communicate with various hardware or software components to provide an operating environment for other software components.

[0266] Processor 401 can be an integrated circuit chip with signal processing capabilities. The aforementioned processor 401 can be a general-purpose processor, including a Central Processing Unit (CPU), a Network Processor (NP), a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor, or processor 401 can be any conventional processor.

[0267] The electronic device 400 is used to execute the technical solution provided in the aforementioned IP bearer network topology analysis method embodiment. Its implementation principle and technical effect are similar to those in the aforementioned method embodiment, and will not be repeated here.

[0268] This application also provides a computer-readable storage medium storing computer-executable instructions. When a processor executes the computer-executable instructions, it implements the technical solution of the aforementioned IP bearer network topology analysis method.

[0269] The aforementioned computer-readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk, or optical disk. The computer-readable storage medium can be any available medium accessible to a general-purpose or special-purpose computer.

[0270] An exemplary readable storage medium is coupled to a processor, enabling the processor to read information from and write information to the readable storage medium. Alternatively, the readable storage medium can be an integral part of the processor. The processor and the readable storage medium can reside in an Application Specific Integrated Circuit (ASIC). Alternatively, the processor and the readable storage medium can exist as discrete components within the control unit of an IP bearer network topology analysis device.

[0271] This application also provides a computer program product, including a computer program that, when executed by a processor, is used to implement the technical solution of the aforementioned IP bearer network topology analysis method.

[0272] In the above embodiments, those skilled in the art will understand that the above method embodiments can be implemented entirely or partially by software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented entirely or partially in the form of a computer program product. A computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the flow or function according to the embodiments of the present invention is generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless network, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state drives (SSDs)).

[0273] In the above embodiments, the descriptions of each embodiment have their own emphasis. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions of other embodiments. The technical features of the above embodiments can be combined arbitrarily. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as the combination of these technical features does not contradict each other, it should be considered within the scope of this specification.

[0274] Other embodiments of this application will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of this application that follow the general principles of this application and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this application are indicated by the following claims.

[0275] It should be understood that this application is not limited to the precise structure described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of this application is limited only by the appended claims.

Claims

1. A method for analyzing the topology of an IP bearer network, characterized in that, include: Obtain the network topology of the target IP bearer network; wherein, the network topology includes the connection relationship between multiple device nodes in the target IP bearer network, and the device nodes include aggregation nodes and access nodes; Perform a path search on the network topology to obtain several search paths; For each search path, if both the first and last nodes of the search path are aggregation nodes, then the search path is determined to be a loop path and added to a loop group; if the first node of the search path is an aggregation node and the last node is an access node, then the search path is determined to be a link path and added to a link group; wherein, the loop group includes several loop paths and the link group includes several link paths; For each access node in the network topology, determine the node attributes of the access node. The node attributes include ring, ring with chain, and single chain. The node attributes can be used to make a preliminary assessment of the security of the access node. The loop paths in the loop group are grouped to obtain several grouped paths; wherein, the loop paths with intersecting access nodes are grouped into one group; the grouped paths are grouped with the link paths in the link group to obtain several merged paths; wherein, the grouped paths and link paths with intersecting access nodes are grouped into one group. For each merging path, deduplication is performed on the link segments in the merging path to obtain a deduplicated path; wherein, the deduplication process involves deleting other link segments that are identical to the link segment in each link segment of the merging path. For each deduplication path, the network topology type of the deduplication path is determined based on the path attributes of the deduplication path; wherein, the path attributes include the node type of the first and last nodes in the deduplication path, the number of paths connecting the first and last nodes, and the number of links between the aggregation node and adjacent access nodes.

2. The method according to claim 1, characterized in that, Perform a path search on the network topology to obtain several search paths, including: Obtain the aggregation node in the network topology; For each aggregation node, starting from the aggregation node, the link paths connecting the preceding and following nodes are found to obtain several search paths.

3. The method according to claim 1, characterized in that, The step of determining the node attributes of each access node in the network topology includes: If the access node is in the loop group, then the node attribute of the access node is determined to be in the loop; If the access node is in the link group, then obtain the target link corresponding to the access node; If the target link has other access nodes in the loop group, then the node attribute of the access node is determined to be a loop chain; If the target link does not have other access nodes in the loop group, then the node attribute of the access node is determined to be a single chain.

4. The method according to claim 1, characterized in that, Based on the path attributes of the deduplication path, the network topology type of the deduplication path is determined, including: If the first node and the last node in the deduplication path are two different aggregation nodes, and the number of paths connecting the first node and the last node is one, and the number of links between each aggregation node and the adjacent access node is one, then the network topology type of the deduplication path is determined to be a dual-homed ordinary ring. If the first node and the last node in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first node and the last node, and each aggregation node has only one link to its adjacent access node, then the network topology type of the deduplication path is determined to be a dual-homed loop with a ring. If the first node and the last node in the deduplication path are two different aggregation nodes, and there are multiple paths connecting the first node and the last node, and the number of links between the two aggregation nodes and the adjacent access nodes is at least three, then the network topology type of the deduplication path is determined to be a dual-homed cross-loop. If the first node and the last node in the deduplication path are the same aggregation node, and there is one path connecting the first node and the last node, and two links between the aggregation node and the adjacent access node, then the network topology type of the deduplication path is determined to be a single-homed ordinary ring. If the first node and the last node in the deduplication path are the same aggregation node, and there are multiple paths connecting the first node and the last node, and there are two links between the aggregation node and the adjacent access node, then the network topology type of the deduplication path is determined to be a single-homed ring with a ring. If the first and last nodes in the deduplication path are the same aggregation node, and there are multiple paths connecting the first and last nodes, and the number of links between the aggregation node and the adjacent access node is at least three, then the network topology type of the deduplication path is determined to be a single-homed cross-loop. If the first node in the deduplication path is a aggregation node and the last node is an access node, and the number of paths connecting the first node and the last node is one, and the number of links between the aggregation node and the adjacent access node is one, then the network topology type of the deduplication path is determined to be a single chain. If the first node in the deduplication path is a convergence node, the last node includes both convergence nodes and access nodes, and there are multiple paths connecting the first and last nodes, then the network topology type of the deduplication path is determined to be a ring-chain.

5. An IP bearer network topology analysis device, characterized in that, include: The topology acquisition module is used to acquire the network topology of the target IP bearer network; wherein, the network topology includes the connection relationship between multiple device nodes in the target IP bearer network, and the device nodes include aggregation nodes and access nodes; The path search module is used to perform path search on the network topology and obtain several search paths. The path grouping module is used to determine the following for each search path: if both the first and last nodes of the search path are aggregation nodes, the search path is identified as a loop path and added to a loop group; if the first node of the search path is an aggregation node and the last node is an access node, the search path is identified as a link path and added to a link group; wherein, the loop group includes several loop paths, and the link group includes several link paths. For each access node in the network topology, determine the node attributes of the access node. The node attributes include ring, ring with chain, and single chain. The node attributes can be used to make a preliminary assessment of the security of the access node. The path merging module is used to group the loop paths in the loop group to obtain several grouped paths; wherein, loop paths with intersecting access nodes are grouped into one group; the grouped paths are grouped with the link paths in the link group to obtain several merged paths; wherein, grouped paths and link paths with intersecting access nodes are grouped into one group. The path deduplication module is used to perform deduplication processing on the link segments in the merged path for each merged path to obtain a deduplicated path; wherein, the deduplication processing is to delete other link segments that are the same as the link segment in each link segment in the merged path. The path classification module is used to determine the network topology type of each deduplication path based on its path attributes. The path attributes include the node types of the first and last nodes in the deduplication path, the number of paths connecting the first and last nodes, and the number of links between the aggregation node and adjacent access nodes.

6. An electronic device, characterized in that, include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory to implement the method as described in any one of claims 1 to 4.

7. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any one of claims 1 to 4.

Images