Network topology logical identification method, device, equipment, medium and product
By identifying the three-way network elements in complex nested rings and recursively sorting them, the problem of topological logic identification in networks is solved, achieving efficient and accurate topology structure parsing and improving the level of intelligent network management.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- CHINA MOBILE GRP FUJIAN CO LTD
- Filing Date
- 2026-03-13
- Publication Date
- 2026-07-03
Smart Images
Figure CN122339974A_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to the field of transmission network technology, and in particular to a method, apparatus, device, medium and product for network topology logical identification. Background Technology
[0002] In conventional communication network architecture design, transmission networks generally adopt a layered networking mode of "aggregation layer + access layer". This architecture achieves orderly routing and management of network traffic through clear hierarchical division. From the perspective of basic deployment form, the aggregation layer and access layer are usually based on a ring structure as the topology.
[0003] The ring topology of a transmission network is fundamental to daily operation and maintenance. When handling network faults, the repair sequence of sites must be rationally arranged according to the topological logical order between network elements to ensure efficient and orderly repair work. However, with the continuous expansion of network scale, complex nested rings that deviate from conventional ring structures have gradually formed in existing networks. While such complex nested rings enhance the network's fault tolerance and load balancing to some extent, they also make the topology structure more complex, making it difficult to identify the topological logical order between network elements within the complex nested ring, posing challenges to fault location and resource scheduling. Summary of the Invention
[0004] In view of the above problems, this disclosure is made to provide a network topology logical identification method, apparatus, device, medium and product.
[0005] According to one aspect of this disclosure, a network topology logical identification method is provided, comprising: Obtain the target ring network link to be identified, and identify whether there is a three-way network element in the target ring network link; wherein, the target ring network link includes multiple network elements, and the three-way network element is a network element that connects at least three links; In response to the presence of three-way network elements, the shared and non-shared links of the target ring network are identified, the non-shared links are divided into the first sub-link and the second sub-link, and the network elements in the second sub-link are included in the exclusion array. Recursively sort the network elements in the shared link and the first sub-link to obtain the first sub-ring; replace the network elements in the first sub-link with the network elements in the exclusion array, and recursively sort the network elements in the shared link and the exclusion array to obtain the second sub-ring. Based on the first and second sub-rings, the topological logic of the target ring network links is identified.
[0006] The beneficial effects of this scheme are as follows: the existence of three-way network elements indicates that the target ring network link belongs to a complex nested ring. By performing a first recursive sorting on the network elements in the common link and the first sub-link, and then replacing the first sub-link with network elements in the exclusion array for a second recursive sorting, the complex nested ring is effectively decomposed. This avoids the erroneous identification problems such as loops and detours that are prone to occur in traditional recursive algorithms, and is conducive to the accurate analysis of the topological logic of complex nested rings.
[0007] Furthermore, according to a network topology logical identification method of one aspect of this disclosure, network elements in the shared link and the first sub-link are recursively sorted to obtain the first sub-ring, including: Obtain the first and last nodes of the target ring network link; Based on the first node, a predefined recursive function is called to recursively sort the network elements in the shared link and the first sub-link to obtain the first sub-ring.
[0008] In one or more embodiments, the beneficial effects of this solution are as follows: by constructing a topology logic sorting mechanism through recursive functions, it is beneficial to realize the fully automated identification process from data collection to topology logic identification, which greatly improves the identification efficiency and accuracy of topology logic and helps to provide network structure views for operation and maintenance personnel efficiently.
[0009] Furthermore, according to a network topology logical identification method of one aspect of this disclosure, network elements in the shared link and the second sub-link are recursively sorted to obtain the second sub-ring, including: Obtain the first and last nodes of the target ring network link; Based on the first node, a predefined recursive function is called to recursively sort the network elements in the shared link and the second sub-link to obtain the second sub-ring.
[0010] Furthermore, according to one aspect of the network topology logical identification method of this disclosure, the first and last nodes of the target ring network link are obtained, including: Identify the aggregation node in the target ring network link; where the aggregation node is a network element that connects to the upper layer network; Based on the number of links connected to the aggregation node, the first and last nodes of the target ring network links are determined.
[0011] In one or more embodiments, the beneficial effect of this solution is that by identifying the number of links connected to the aggregation node, the first and last nodes of the target ring network link can be effectively determined, which is conducive to improving topology accuracy and efficiency.
[0012] Furthermore, according to one aspect of the network topology logic identification method of this disclosure, the topology logic of the target ring network links is identified based on the first sub-ring and the second sub-ring, including: Using an elliptical layout, draw the topology diagram of the first and second sub-rings; Based on the topology diagrams of the first and second sub-rings, the topological logic of the target ring network links is obtained.
[0013] Furthermore, according to one aspect of the network topology logical identification method of this disclosure, the target ring network link to be identified is obtained, including: Layer 2 link data is extracted from the network management system, preprocessed and normalized to obtain standard link data; wherein, the Layer 2 link data includes at least one of network element information, port information and link field information; Obtain network elements from standard link data and establish a mapping relationship between the physical ports of each network element and the connected links; Based on standard link data and mapping relationships, the target ring network links to be identified are obtained.
[0014] According to another aspect of this disclosure, a network topology logical identification device is provided, comprising: The three-way network element identification module is used to acquire the target ring network link to be identified and to identify whether a three-way network element exists in the target ring network link; wherein, the target ring network link includes multiple network elements, and the three-way network element is a network element that connects at least three links; The link segmentation module is used to identify the shared and non-shared links of the target ring network in response to the existence of three-way network elements, divide the non-shared links into the first sub-link and the second sub-link, and add the network elements in the second sub-link to the exclusion array. The recursive sorting module is used to recursively sort the network elements in the shared link and the first sub-link to obtain the first sub-ring; and to recursively sort the network elements in the shared link and the excluded array by replacing the network elements in the first sub-link with the network elements in the excluded array to obtain the second sub-ring. The topology identification module is used to identify the topology logic of the target ring network links based on the first sub-ring and the second sub-ring.
[0015] According to another aspect of this disclosure, a computer device is provided, including a memory, a processor, and a computer program stored in the memory, the processor executing the computer program to implement the method of one aspect above.
[0016] According to another aspect of this disclosure, a computer-readable storage medium is provided having a computer program stored thereon that, when executed by a processor, implements the method of one aspect above.
[0017] According to another aspect of this disclosure, a computer program product is provided, including a computer program that, when executed by a processor, implements the method of the above-described aspect.
[0018] It should be understood that both the foregoing general description and the following detailed description are exemplary and intended to provide further illustration of the claimed technology. Attached Figure Description
[0019] The above and other objects, features, and advantages of this disclosure will become more apparent from the more detailed description of the embodiments thereof in conjunction with the accompanying drawings. The drawings are provided to further illustrate the embodiments of this disclosure and form part of the specification. They are used together with the embodiments of this disclosure to explain the disclosure and do not constitute a limitation thereof. In the drawings, the same reference numerals generally represent the same components or steps.
[0020] Figure 1 This is a system architecture diagram illustrating a network topology logical identification method according to an embodiment of the present disclosure.
[0021] Figure 2 This is a link diagram of the access ring network[0] according to an embodiment of the present disclosure.
[0022] Figure 3 This is a flowchart illustrating an application example according to an embodiment of this disclosure.
[0023] Figure 4 This is a topology diagram illustrating the application of a first sub-ring R1 and a second sub-ring R2 according to an embodiment of this disclosure.
[0024] Figure 5 This is a flowchart illustrating a network topology logical identification method according to an embodiment of the present disclosure.
[0025] Figure 6 This is a schematic diagram of the structure of a network topology logic identification device according to an embodiment of the present disclosure.
[0026] Figure 7 This is a schematic diagram illustrating the structure of a computer device according to an embodiment of the present disclosure.
[0027] Figure 8 This is a schematic diagram illustrating a computer program product according to an embodiment of the present disclosure. Detailed Implementation
[0028] To make the objectives, technical solutions, and advantages of this disclosure more apparent, exemplary embodiments according to this disclosure will now be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are merely some embodiments of this disclosure, and not all embodiments of this disclosure. It should be understood that this disclosure is not limited to the exemplary embodiments described herein.
[0029] In conventional communication network architecture design, transmission networks generally adopt a layered networking mode of "aggregation layer + access layer". This architecture achieves orderly routing and management of network traffic through clear hierarchical division. From the perspective of basic deployment form, the aggregation layer and access layer are usually based on a ring structure as the topology.
[0030] The ring topology of a transmission network is fundamental to daily operation and maintenance. When handling network faults, the repair sequence of sites must be rationally arranged according to the topological logical order between network elements to ensure that the repair work is carried out efficiently and orderly. However, with the continuous expansion of network scale, complex nested rings that break through the conventional ring structure have gradually formed in the existing network. Some of these complex nested rings are caused by geographical location and optical cable structure limitations, while others are gradually built to improve redundancy protection in extreme disaster scenarios.
[0031] While complex nested rings enhance network fault tolerance and load balancing to some extent, they also complicate the topology, making it difficult to identify the logical order of network elements within the nested ring. This poses challenges for fault location and resource scheduling. Therefore, intelligent topology identification methods are needed, capable not only of identifying conventional ring networks but also of systematically disassembling and analyzing complex nested rings to reconstruct the true network topology and provide fundamental data support for subsequent network optimization and management.
[0032] The above description, with reference to the accompanying drawings, illustrates a network topology logic identification method, apparatus, device, medium, and product according to embodiments of the present disclosure. By constructing a sorting algorithm among network elements using recursive functions, intelligent identification of conventional ring network topology logic is achieved. By introducing a step-by-step recursive sorting algorithm based on a three-way network element identification and exclusion array, complex nested rings can be parsed. This method is suitable for transmission access ring network environments such as PTN / SPN (Slicing Packet Network), which helps improve the accuracy and intelligence level of network topology identification, ensuring the stable operation and efficient management of the transmission network.
[0033] To facilitate understanding of this embodiment, a detailed description of the network topology logic identification method disclosed in this disclosure is provided first. The execution entity of the network topology logic identification method provided in this disclosure is generally a computer device with certain computing capabilities. This computer device may include, for example, a terminal device, a server, or other processing devices. The terminal device may be a user equipment (UE), mobile device, user terminal, terminal, cellular phone, cordless phone, handheld device, computing device, vehicle-mounted device, wearable device, etc. In some possible implementations, this network topology logic identification method can be implemented by a processor calling computer-readable instructions stored in memory.
[0034] like Figure 1 The diagram shown is a system architecture diagram of the network topology logic identification method provided in this embodiment of the disclosure. It includes a data processing module 1, a topology logic intelligent identification module 2, and a complex nested ring parsing module 3. These three modules work together to achieve intelligent identification of the transmission access ring network topology logic in all scenarios. The following is a detailed description of each module: Data Processing Module 1: This module preprocesses and standardizes information collected from the communication network management system, establishing a data foundation for topology analysis of conventional ring networks and complex nested networks. Specifically, it includes: Data Acquisition: Layer 2 link data is collected from the communication network management system. This data includes at least one of the following: network element information, port information, and link field information, such as network element ID, port information, and link name. The data acquisition method involves extracting real-time Layer 2 link data from the network management system via the SNMP protocol or API interface. The data format is structured data, such as CSV or XML.
[0035] Data preprocessing: Data cleaning is performed to remove duplicate, invalid, or erroneous link records. For example, if a Layer 2 link is named "Access Single Link" or is a virtual link without a first or last node, it is considered abnormal data and removed. Secondly, the link data is normalized by standardizing the port naming rules of different vendors' equipment to a standard format for easier subsequent algorithm processing. A function to extract ring network names is defined. For all Layer 2 link data, access rings with names containing typical names such as "Access...Ring" or "BBU Pool Ring" are selected, invalid records are removed, and the results are stored in the `network` array. The algorithm logic is as follows: def extract_ring(unique_values) Data normalization processing: For the physical port statistics method in SPN networks, this embodiment introduces a correction mechanism based on "port-link" mapping. It queries the link table for Layer 2 links where the source and destination network elements are the same, and takes the one with the smallest port number as the physical port, thus correcting the "port-link" mapping. Specifically, a one-to-one correspondence is established between the physical ports of each network element and the connected links, and the link names are normalized to eliminate statistical biases caused by device differences. The algorithm logic is as follows: def extract_pyhsical_port(df, start_node, end_node) Data Dimensionality Reduction: Principal Component Analysis (PCA) is used to compress high-dimensional link features and extract key features affecting the logical identification of ring network topology, such as the number of connected links and network element types. This reduces the computational complexity of subsequent algorithms and improves processing efficiency. The algorithm logic is as follows: def query_ne_type(element) def count_links(ne_node) Topology Logic Intelligent Recognition Module 2: Used to construct a sorting mechanism for network elements and links based on recursive functions. Specifically, it includes: First and last node identifier: This identifies the first and last nodes through a traversal function, serving as the basis for recursive sorting. Its algorithm includes: defining the `query_model` function to identify the aggregation network elements; traversing all network elements in the Layer 2 link data with the ring name `network[X]`, calling the `count_links` function to calculate the number of links connected between the two aggregation network elements in the ring; selecting the aggregation network element with 1 link as the first node, and the other aggregation network element as the last node; if the two aggregation network elements have the same number of links, randomly selecting one as the first node and the other as the last node.
[0036] Logical Topology Sorting: Define a recursive function that starts from the first node and terminates at the last node to complete the logical arrangement of network element topology. The algorithm flow includes: defining a recursive function `build_order`, continuously calling the recursive function from the first node, updating the `start_node` network element based on the next hop of the connected links, and ending the recursive call when the last node is identified. The algorithm logic is as follows: def query_model(node) def build_order(start_node) Network Topology Drawer: Draws network topology diagrams based on sorting results, supplementing the physical connections between the first and last nodes. An elliptical layout enhances the readability and intuitiveness of the topology diagram. By distributing network elements using an elliptical layout, the display of the logical topology diagram is optimized, making the network structure clearer and easier to understand. This facilitates maintenance personnel's quick understanding of network connections and improves the efficiency of fault location and service load assessment.
[0037] Complex Nested Ring Parsing Module 3: Used to identify three-way network elements in the access ring, and to perform recursive topology splitting of network elements based on the exclusion array, specifically including: The three-way network element identifier identifies whether a network element connects to at least three links. If so, it is marked as a three-way network element, indicating that this access ring is a complex nested ring. Its algorithm is as follows: iterate through the network element's `value_counts`, where `value_counts` is the number of links connected to the network element. If `count=3`, it is marked as a three-way network element. Figure 2 As shown, B1 and B4 are connected to three links, which constitute a three-way network element.
[0038] Optionally, in this embodiment, if no three-way network element exists, it indicates that the access ring is a conventional ring network. In this case, a recursive function can be directly called to recursively sort the nodes starting from the first node to obtain the topology logic of the access ring. This scenario is not the focus of this embodiment and will not be elaborated further.
[0039] Branch Link Identifier: This function identifies non-shared links in complex nested rings with three-way network elements as branch branches, placing them into an exclusion array for secondary sorting and identification. The algorithm is as follows: Define the branch link function `exclusion_mapping`, randomly select one non-shared link from the access ring with three-way network elements as a branch, and add it to the exclusion array as a branch branch not identified in the first sorting.
[0040] Step-by-step recursive sorting: First, a subset of network elements is recursively sorted. Then, network elements from the exclusion array are used to replace them for a second sort. This effectively decomposes complex nested loops, avoiding errors in loop and detour identification that are common in traditional recursive algorithms, thus achieving accurate analysis of all network scenarios. The algorithm flow is as follows: First sort: Remove network elements from the exclusion array, and call the recursive function build_order on the remaining network elements to generate the first sub-ring R1.
[0041] Secondary sorting: The network elements in the exclusion array are concatenated with the shared links. The shared links where the first node is located are concatenated first. The recursive function build_order is called to generate the second sub-ring R2.
[0042] The expression for this algorithm is: # Traverse the value_counts dictionary and store the three-way network element array. for index, count in value_counts.items(): if count == 3: three_way.append(index) exclusion_mapping(start_node,rusult_df) def link_mapping(start_node) def second_mapping(start_node) The technical effects of the above embodiments include: (1) This embodiment is based on a recursive function to build a topology logic sorting mechanism, which realizes the full-process automated identification from data collection to topology logic identification, greatly improving identification efficiency and accuracy, and can provide network structure view for operation and maintenance personnel.
[0043] (2) The non-shared links in the access ring are separated into branches that are not identified in the first sorting and put into the exclusion array for secondary sorting and identification; after removing the network elements in the exclusion array, the remaining network elements are recursively sorted; and then the network elements in the exclusion array are replaced and the second sorting is performed. This achieves effective splitting of complex nested rings, avoids the erroneous identification problems such as loops and detours that are easy to occur in traditional recursive algorithms, and achieves accurate parsing of complex nested rings.
[0044] (3) This embodiment can effectively solve the key problem of topology logic identification of transmission access ring networks in all scenarios, including complex nested rings, and significantly improve the intelligence level and reliability of network operation and maintenance.
[0045] (4) This embodiment is not only applicable to transmission access ring network environments such as PTN / SPN, but can also be flexibly adapted to different network scenarios by replacing open source models (such as GNN), communication protocols (such as MQTT) or deployment architectures (such as microservices). It has good scalability and adaptability and meets the needs of the continuous evolution of future network structures.
[0046] Based on the above embodiments, this embodiment provides an application example. Assume that the access ring named network[0] in a certain SPN network is a complex nested ring, such as... Figure 2 The diagram shown is a link diagram of the access ring network[0]. Taking this complex nested ring as an example, the topology logic identification process of this embodiment will be specifically analyzed. Figure 3 The diagram shown is a flowchart of an application example, including: S301: Data Acquisition and Processing.
[0047] Extract all Layer 2 link information from the network management system, including network element IDs, port information, and link names. Clean the data, remove invalid links, and standardize the port information to obtain the target ring network links to be identified.
[0048] S302: Identify the first node, the last node, and the three-way network element.
[0049] Identify the aggregation network elements in the target ring network link and calculate the number of links connected to each aggregation network element. It is found that aggregation network elements A1 and A2 can both be used as the first node. Therefore, A1 is randomly selected as the first node and A2 as the last node. The number of links connected to network elements B1 and B4 is identified as 3, and they are marked as three-way network elements.
[0050] S303: Identify branching links.
[0051] Define the fork link function exclusion_mapping to identify the shared links in network[0] as [A1-B1] and [B4-B5-A2], and the non-shared links as [B2-B3] and [C1-C2]. Randomly divide the non-shared links into the first sub-link and the second sub-link. For example, take [B2-B3] as the first sub-link and [C1-C2] as the second sub-link. Put network elements C1 and C2 into the exclusion array exclusion for secondary sorting and identification.
[0052] S304: Perform a recursive sort to obtain the first sub-cycle.
[0053] In this process, after removing the network elements in the exclusion array, the recursive function build_order is called on the network elements in the shared link and the first sub-link to sort them sequentially from the first node A1 to the last node A2. The topological logical order of the first sub-ring R1 is identified as: A1-B1-B2-B3-B4-B5-A2.
[0054] S305: Perform a second recursive sort to obtain the second sub-cycle.
[0055] Specifically, the network element C1-C2 in the excluded array is concatenated with two shared links A1-B1 and B4-B5-A2. The shared link A1-B1, where the first node is located, is concatenated first, followed by C1-C2, and finally B4-B5-A2. After recursive sorting, the topological logical order of the second sub-ring R2 is: A1-B1-C1-C2-B4-B5-A2.
[0056] S306: Based on the elliptical layout, draw the topology diagrams of the first and second sub-rings to obtain the topological logic of the target ring network links.
[0057] Specifically, such as Figure 4 The diagram shown is a topology diagram of the first sub-ring R1 and the second sub-ring R2. Figure 4 It can accurately analyze the topological logic of this complex nested ring. By distributing network elements in an elliptical layout and connecting the first and last nodes, the topology diagram is displayed in an optimized way, making the network structure clearer and easier to understand. This allows maintenance personnel to quickly understand the network connection relationships and improves the efficiency of fault location and service carrying capacity assessment.
[0058] Based on the above embodiments, this embodiment also provides a network topology logical identification method, such as... Figure 5 The diagram shows a flowchart of the network topology logical identification method, including S501-S504: S501: Obtain the target ring network link to be identified, and identify whether there is a three-way network element in the target ring network link.
[0059] The target ring network link includes multiple network elements, and the three-way network element is a network element that connects at least three links.
[0060] S502: In response to the presence of three-way network elements, identify the shared links and non-shared links of the target ring network link, divide the non-shared links into the first sub-link and the second sub-link, and add the network elements in the second sub-link to the exclusion array.
[0061] S503: Recursively sort the network elements in the shared link and the first sub-link to obtain the first sub-ring; replace the network elements in the first sub-link with the network elements in the exclusion array, and recursively sort the network elements in the shared link and the exclusion array to obtain the second sub-ring.
[0062] S504: Based on the first and second sub-rings, identify the topology logic of the target ring network links.
[0063] In one or more embodiments, recursively sorting the network elements in the shared link and the first sub-link to obtain the first sub-ring includes: Obtain the first and last nodes of the target ring network link; Based on the first node, a predefined recursive function is called to recursively sort the network elements in the shared link and the first sub-link to obtain the first sub-ring.
[0064] In one or more embodiments, recursively sorting the network elements in the shared link and the second sub-link to obtain the second sub-ring includes: Obtain the first and last nodes of the target ring network link; Based on the first node, a predefined recursive function is called to recursively sort the network elements in the shared link and the second sub-link to obtain the second sub-ring.
[0065] In one or more embodiments, obtaining the first and last nodes of the target ring network link includes: Identify the aggregation node in the target ring network link; where the aggregation node is a network element that connects to the upper layer network; Based on the number of links connected to the aggregation node, the first and last nodes of the target ring network links are determined.
[0066] In one or more embodiments, the topological logic of the target ring network links is identified based on the first sub-ring and the second sub-ring, including: Using an elliptical layout, draw the topology diagram of the first and second sub-rings; Based on the topology diagrams of the first and second sub-rings, the topological logic of the target ring network links is obtained.
[0067] In one or more embodiments, obtaining the target ring network link to be identified includes: Layer 2 link data is extracted from the network management system, preprocessed and normalized to obtain standard link data; wherein, the Layer 2 link data includes at least one of network element information, port information and link field information; Obtain network elements from standard link data and establish a mapping relationship between the physical ports of each network element and the connected links; Based on standard link data and mapping relationships, the target ring network links to be identified are obtained.
[0068] According to another aspect of the embodiments of this disclosure, a network topology logical identification device is provided, such as... Figure 6 As shown, the device includes: The three-way network element identification module 601 is used to acquire the target ring network link to be identified and to identify whether a three-way network element exists in the target ring network link; wherein, the target ring network link includes multiple network elements, and the three-way network element is a network element that connects at least three links; The link division module 602 is used to identify the shared links and non-shared links of the target ring network in response to the existence of three-way network elements, divide the non-shared links into the first sub-link and the second sub-link, and add the network elements in the second sub-link to the exclusion array. The recursive sorting module 603 is used to recursively sort the network elements in the shared link and the first sub-link to obtain the first sub-ring; and to recursively sort the network elements in the shared link and the excluded array by replacing the network elements in the first sub-link with the network elements in the excluded array to obtain the second sub-ring. The topology identification module 604 is used to identify the topology logic of the target ring network links based on the first sub-ring and the second sub-ring.
[0069] In one or more embodiments, the recursive sorting module 603 is used to: Obtain the first and last nodes of the target ring network link; Based on the first node, a predefined recursive function is called to recursively sort the network elements in the shared link and the first sub-link to obtain the first sub-ring.
[0070] In one or more embodiments, the recursive sorting module 603 is used to: Obtain the first and last nodes of the target ring network link; Based on the first node, a predefined recursive function is called to recursively sort the network elements in the shared link and the second sub-link to obtain the second sub-ring.
[0071] In one or more embodiments, the recursive sorting module 603 is further configured to: Identify the aggregation node in the target ring network link; where the aggregation node is a network element that connects to the upper layer network; Based on the number of links connected to the aggregation node, the first and last nodes of the target ring network links are determined.
[0072] In one or more embodiments, the topology identification module 604 is used for: Using an elliptical layout, draw the topology diagram of the first and second sub-rings; Based on the topology diagrams of the first and second sub-rings, the topological logic of the target ring network links is obtained.
[0073] In one or more embodiments, the three-way network element identification module 601 is used for: Layer 2 link data is extracted from the network management system, preprocessed and normalized to obtain standard link data; wherein, the Layer 2 link data includes at least one of network element information, port information and link field information; Obtain network elements from standard link data and establish a mapping relationship between the physical ports of each network element and the connected links; Based on standard link data and mapping relationships, the target ring network links to be identified are obtained.
[0074] The network topology logic identification device and the network topology logic identification method provided in this disclosure are based on the same inventive concept and have the same beneficial effects as the methods they adopt, operate or implement.
[0075] This disclosure also provides a computer device for performing the network topology logical identification method described above. Please refer to... Figure 7 It illustrates a schematic diagram of a computer device provided by some embodiments of this disclosure. For example... Figure 7 As shown, the computer device 7 includes: a processor 700, a memory 701, a bus 702, and a communication interface 703. The processor 700, the communication interface 703, and the memory 701 are connected via the bus 702. The memory 701 stores a computer program that can run on the processor 700. When the processor 700 runs the computer program, it executes the network topology logical identification method provided in any of the foregoing embodiments of this disclosure.
[0076] The memory 701 may include high-speed random access memory (RAM) or non-volatile memory, such as at least one disk storage device. Communication between the device network element and at least one other network element is achieved through at least one communication interface 703 (which can be wired or wireless), such as the Internet, wide area network, local area network, metropolitan area network, etc.
[0077] Bus 702 can be an ISA bus, PCI bus, or EISA bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. The memory 701 is used to store programs. After receiving an execution instruction, the processor 700 executes the program. The network topology logic identification method disclosed in any of the foregoing embodiments of this disclosure can be applied to the processor 700, or implemented by the processor 700.
[0078] The processor 700 may be an integrated circuit chip with signal processing capabilities. In implementation, each step of the above method can be completed by the integrated logic circuitry in the hardware of the processor 700 or by software instructions. The processor 700 may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPTA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this disclosure. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this disclosure can be directly embodied in the execution of a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules may reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. The storage medium is located in memory 701. Processor 700 reads the information in memory 701 and, in conjunction with its hardware, completes the steps of the above method.
[0079] The computer device provided in this disclosure and the network topology logical identification method provided in this disclosure are based on the same inventive concept and have the same beneficial effects as the methods they adopt, operate or implement.
[0080] This disclosure also provides a computer-readable storage medium corresponding to the network topology logic identification method provided in the foregoing embodiments. The computer-readable storage medium is an optical disc, on which a computer program (i.e., a computer program product) is stored. When the computer program is run by a processor, it executes the network topology logic identification method provided in any of the foregoing embodiments.
[0081] It should be noted that examples of the computer-readable storage medium may also include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other optical and magnetic storage media, which will not be elaborated here.
[0082] The computer-readable storage medium provided in the above embodiments of this disclosure and the network topology logical identification method provided in the embodiments of this disclosure are based on the same inventive concept and have the same beneficial effects as the methods adopted, run or implemented by the applications stored therein.
[0083] This disclosure also provides a computer program product; please refer to [reference needed]. Figure 8 The computer program product 800 carries program code, namely computer program 801. The instructions included in the computer program 801 can be used to execute the steps of the network topology logical identification method described in the above method embodiments. For details, please refer to the above method embodiments, which will not be repeated here.
[0084] The aforementioned computer program product can be implemented through hardware, software, or a combination thereof. In one optional embodiment, the computer program product is specifically embodied in a computer storage medium; in another optional embodiment, the computer program product is specifically embodied in a software product, such as a software development kit (SDK), etc.
[0085] The basic principles of this disclosure have been described above with reference to specific embodiments. However, it should be noted that the advantages, benefits, and effects mentioned in this disclosure are merely examples and not limitations, and should not be considered as essential features of each embodiment of this disclosure. Furthermore, the specific details disclosed above are for illustrative and facilitative purposes only, and are not limitations. These details do not limit the scope of this disclosure to the necessity of employing the aforementioned specific details for implementation.
[0086] The block diagrams of devices, apparatuses, devices, and systems disclosed herein are merely illustrative examples and are not intended to require or imply that they must be connected, arranged, or configured in the manner shown in the block diagrams. As those skilled in the art will recognize, these devices, apparatuses, devices, and systems can be connected, arranged, and configured in any manner. Words such as “comprising,” “including,” “having,” etc., are open-ended terms meaning “including but not limited to,” and are used interchangeably with them. The terms “or” and “and” as used herein refer to the terms “and / or,” and are used interchangeably with them unless the context clearly indicates otherwise. The term “such as” as used herein refers to the phrase “such as but not limited to,” and is used interchangeably with it.
[0087] Additionally, as used herein, the "or" used in a list of items beginning with "at least one" indicates a separate list, such that a list of, for example, "at least one of A, B, or C" means A or B or C, or AB or AC or BC, or ABC (i.e., A and B and C). Furthermore, the word "exemplary" does not imply that the described example is preferred or better than other examples.
[0088] It should also be noted that in the systems and methods of this disclosure, the components or steps can be decomposed and / or recombined. These decompositions and / or recombinations should be considered as equivalent solutions to this disclosure.
[0089] Various changes, substitutions, and modifications can be made to the technology described herein without departing from the teachings defined by the appended claims. Furthermore, the scope of the claims of this disclosure is not limited to the specific aspects of the processes, machines, manufactures, events, means, methods, and actions described above. Currently existing or later-developed processes, machines, manufactures, events, means, methods, or actions that perform substantially the same function or achieve substantially the same result as the corresponding aspects described herein can be utilized. Therefore, the appended claims include such processes, machines, manufactures, events, means, methods, or actions within their scope.
[0090] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use this disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects without departing from the scope of this disclosure. Therefore, this disclosure is not intended to be limited to the aspects shown herein, but rather to be carried out within the widest scope consistent with the principles and novel features disclosed herein.
[0091] The above description has been given for purposes of illustration and description. Furthermore, this description is not intended to limit the embodiments of this disclosure to the forms disclosed herein. Although numerous exemplary aspects and embodiments have been discussed above, those skilled in the art will recognize certain variations, modifications, alterations, additions, and sub-combinations therein.
Claims
1. A network topology logical identification method, characterized in that, include: Obtain the target ring network link to be identified, and identify whether there is a three-way network element in the target ring network link; wherein, the target ring network link includes multiple network elements, and the three-way network element is a network element that connects at least three links; In response to the existence of the three-way network element, the shared link and non-shared link of the target ring network link are identified, the non-shared link is divided into a first sub-link and a second sub-link, and the network element in the second sub-link is included in the exclusion array. The network elements in the shared link and the first sub-link are recursively sorted to obtain the first sub-ring; the network elements in the first sub-link are replaced by the network elements in the exclusion array, and the network elements in the shared link and the exclusion array are recursively sorted to obtain the second sub-ring. Based on the first sub-ring and the second sub-ring, the topological logic of the target ring network link is identified.
2. The network topology logical identification method as described in claim 1, characterized in that, The network elements in the shared link and the first sub-link are recursively sorted to obtain the first sub-ring, including: Obtain the first and last nodes of the target ring network link; Based on the first node, a predefined recursive function is invoked to recursively sort the network elements in the shared link and the first sub-link to obtain the first sub-ring.
3. The network topology logical identification method as described in claim 1, characterized in that, The network elements in the shared link and the second sub-link are recursively sorted to obtain the second sub-ring, including: Obtain the first and last nodes of the target ring network link; Based on the first node, a predefined recursive function is invoked to recursively sort the network elements in the shared link and the second sub-link to obtain the second sub-ring.
4. The network topology logical identification method as described in claim 2 or 3, characterized in that, Obtaining the first and last nodes of the target ring network link includes: Identify the aggregation node in the target ring network link; wherein, the aggregation node is a network element connecting to the upper layer network; Based on the number of links connected to the aggregation node, the first and last nodes of the target ring network link are determined.
5. The network topology logical identification method as described in claim 1, characterized in that, Based on the first sub-ring and the second sub-ring, the topological logic of the target ring network link is identified, including: Using an elliptical layout, draw the topology diagram of the first sub-ring and the second sub-ring; Based on the topology diagrams of the first and second sub-rings, the topological logic of the target ring network links is obtained.
6. The network topology logical identification method as described in claim 1, characterized in that, Obtain the target ring network links to be identified, including: Layer 2 link data is extracted from the network management system, and the Layer 2 link data is preprocessed and normalized to obtain standard link data; wherein, the Layer 2 link data includes at least one of network element information, port information and link field information; Obtain the network elements in the standard link data, and establish a mapping relationship between the physical ports of each network element and the connected links; Based on the standard link data and the mapping relationship, the target ring network link to be identified is obtained.
7. A network topology logic identification device, characterized in that, include: The three-way network element identification module is used to acquire the target ring network link to be identified and to identify whether a three-way network element exists in the target ring network link; wherein, the target ring network link includes multiple network elements, and the three-way network element is a network element that connects at least three links; The link division module is used to identify the shared links and non-shared links of the target ring network link in response to the existence of the three-way network element, divide the non-shared link into a first sub-link and a second sub-link, and add the network element in the second sub-link to the exclusion array. The recursive sorting module is used to recursively sort the network elements in the shared link and the first sub-link to obtain the first sub-ring; and to recursively sort the network elements in the shared link and the first sub-link by replacing the network elements in the first sub-link with the network elements in the exclusion array to obtain the second sub-ring. The topology identification module is used to identify the topological logic of the target ring network link based on the first sub-ring and the second sub-ring.
8. A computer embedded device, comprising a memory, a processor, and a computer program stored in the memory, characterized in that, The processor executes the computer program to implement the method according to any one of claims 1 to 6.
9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the method described in any one of claims 1 to 6.
10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the method described in any one of claims 1 to 6.