Topology determination method and apparatus, processing device, and storage medium

Abstract

Embodiments of the present disclosure disclose a method and apparatus for determining a topology structure, a processing device and a storage medium. The method comprises: determining a node type of a first node in a first network based on attribute information of second nodes adjacent to the first node, wherein the attribute information comprises a node type and a number of the second nodes, and the node type comprises one of a link node type, a loop node type and a root node type; and determining a topology structure to which a node in the first network belongs based on the node type, wherein the topology structure comprises a loop structure and / or a link structure, and the topology structure is used for path planning for data transmission. In the embodiments of the present disclosure, the node type of the first node and the topology structure of the first network can be automatically and accurately determined according to the attribute information of the second nodes adjacent to the first node. Thus, the automation degree in the process of determining the node type and the topology structure can be improved.

Description

Technical Field

[0001] This invention relates to, but is not limited to, the field of information processing, and particularly to a method, apparatus, processing device, and storage medium for determining a topology. Background Technology

[0002] In applications where node types in a network are determined, manual classification of each node is typically required. This process involves a high degree of human involvement, and the manually assigned node types may deviate from the actual node types, leading to unreliable classifications. Furthermore, manual node classification is inefficient and labor-intensive. Summary of the Invention

[0003] In view of this, the present disclosure provides a method, apparatus, processing device, and storage medium for determining a topology.

[0004] According to a first aspect of the present disclosure, a method for determining a topology is provided, the method comprising:

[0005] Based on the attribute information of the second node adjacent to the first node in the first network, the node type of the first node is determined; wherein, the attribute information includes the node type and number of the second node, and the node type includes one of the following: the type of link node, the type of loop node, and the type of root node;

[0006] Based on the node type, the topology of the nodes in the first network is determined, and the topology includes a loop structure and / or a link structure; wherein, the topology is used for path planning of data transmission.

[0007] According to a second aspect of the present disclosure, a topology determination apparatus is provided, the apparatus comprising:

[0008] The determining module is configured to: determine the node type of the first node based on the attribute information of a second node adjacent to the first node in the first network; wherein the attribute information includes the node type and number of the second node, and the node type includes one of the following: link node type, loop node type, and root node type; and determine the topology to which the node in the first network belongs based on the node type, wherein the topology includes a loop structure and / or a link structure; wherein the topology is used for path planning of data transmission.

[0009] According to a third aspect of the present disclosure, a processing apparatus is provided, the processing apparatus comprising:

[0010] Memory, used to store executable programs;

[0011] When executing an executable program stored in the memory, the processor implements the method as described in any of the embodiments of this disclosure.

[0012] According to a fourth aspect of the present disclosure, a computer storage medium is provided, the computer storage medium storing an executable program, which, when executed by a processor, implements the method described in any of the embodiments of the present disclosure.

[0013] In this embodiment of the disclosure, the node type of the first node is determined based on the attribute information of the second node adjacent to the first node in the first network; wherein, the attribute information includes the node type and number of the second node, and the node type includes one of the following: the type of a link node, the type of a loop node, and the type of a root node; based on the node type, the topology to which the node in the first network belongs is determined, and the topology includes a loop structure and / or a link structure; wherein, the topology is used for path planning of data transmission.

[0014] Here, since the node type of the first node is determined based on the attribute information of the second node adjacent to the first node, and the first attribute information includes the node type and number of the second node, and the node type includes the type of link node, the type of loop node, and the type of root node, in this embodiment, on the one hand, the node type of the first node can be automatically determined based on the attribute information of the second node adjacent to the first node in the first network; and on the other hand, in the process of dividing the topology of the first network based on the node type, the topology of the first network can be automatically divided based on the automatically determined node type, thereby improving the automation level of determining the node type and topology and improving the efficiency of determining the node type and topology.

[0015] On the other hand, the node type of the first node can be adapted to the node type and number of the second node adjacent to the first node. At this time, information related to the node type can be referenced more comprehensively to determine the node type, so that the topology determined according to the node type can meet the needs of transmitting data using the topology in actual application scenarios, thereby ensuring the reliability of transmitting data using the topology.

[0016] Compared to related technologies that require manual classification of node types in a network, this embodiment of the present disclosure can automatically and accurately determine the node type of the first node based on the attribute information of the second node adjacent to the first node, and automatically determine the topology of the first network based on the node type. This improves the automation level in determining node types and topology, increases the efficiency of determining node types and topology, reduces manpower waste, and ensures the reliability of data transmission using the topology. Attached Figure Description

[0017] Figure 1 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0018] Figure 2 This is a schematic diagram illustrating a node of a first network according to an exemplary embodiment;

[0019] Figure 3 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0020] Figure 4 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0021] Figure 5 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0022] Figure 6 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0023] Figure 7 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0024] Figure 8 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0025] Figure 9 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0026] Figure 10 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0027] Figure 11 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0028] Figure 12This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0029] Figure 13 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0030] Figure 14 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0031] Figure 15 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0032] Figure 16 This is a schematic flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0033] Figure 17 This is a flowchart illustrating a method for determining a topology according to an exemplary embodiment;

[0034] Figure 18 This is a schematic diagram illustrating a display interface with a topological structure according to an exemplary embodiment;

[0035] Figure 19 This is a schematic diagram illustrating a display interface with a topological structure according to an exemplary embodiment;

[0036] Figure 20 This is a schematic diagram of a topology determination device according to an exemplary embodiment. Detailed Implementation

[0037] To make the objectives, technical solutions, and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. The described embodiments should not be regarded as limitations on the present invention. All other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0038] In the following description, references are made to “some embodiments,” which describe a subset of all possible embodiments. However, it is understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.

[0039] In the following description, the terms "first, second, third" are used merely to distinguish similar objects and do not represent a specific ordering of objects. It is understood that "first, second, third" may be interchanged in a specific order or sequence where permitted, so that the embodiments of the invention described herein can be implemented in an order other than that illustrated or described herein.

[0040] In the following description, the terms "greater than" and "less than" are used. It should be noted that in this disclosure, "greater than" can be used to indicate "greater than" or "equal to"; and "less than" can be used to indicate "less than" or "equal to".

[0041] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains. The terminology used herein is for the purpose of describing embodiments of the invention only and is not intended to limit the invention.

[0042] like Figure 1 As shown in the embodiments of this disclosure, a method for determining a topology is provided, the method comprising:

[0043] Step S0011: Based on the attribute information of the second node adjacent to the first node in the first network, determine the node type of the first node; wherein, the attribute information includes the node type and number of the second node, and the node type includes one of the following: the type of link node, the type of loop node, and the type of root node;

[0044] Step S0012: Based on the node type, determine the topology of the node in the first network, wherein the topology includes a loop structure and / or a link structure; wherein the topology is used for path planning of data transmission.

[0045] In one embodiment, the first network may include an access layer and / or an aggregation layer; wherein the access layer is used for accessing user equipment, and the aggregation layer is used for aggregating data from the access layer. The access layer may be connected to the aggregation core layer. The first network may be any network with a complex topology. Any two nodes in the first network may be directly or indirectly connected to transmit data between any two nodes.

[0046] In one embodiment, the first network may be a Secret Private Network (SPN), or the first network may be a Packet Transport Network (PTN).

[0047] In one embodiment, connection information can be obtained, which indicates the connection relationships between nodes in a first network. Based on this connection information, a second node adjacent to the first node can be determined. It is understood that, in this embodiment, a second node adjacent to the first node can refer to a node directly connected to the first node. A node directly connected to the first node can be a node directly connected to the first node through a predetermined interface.

[0048] In one embodiment, a node in the first network can be a transmission device capable of transmitting data. For example, a node can be a network element capable of transmitting data.

[0049] In one embodiment, any first node can be a second node of another first node.

[0050] For example, such as Figure 2 As shown, the first network may include nodes T, R, and S. Node R is adjacent to both nodes T and S, while nodes T and S are not adjacent. When node R is the first node, the second nodes adjacent to it include nodes T and S. When node T is the first node, the second node adjacent to it includes node R. In this case, node R can be either the first node or the second node adjacent to node T.

[0051] In one embodiment, a first node can be pre-determined from the nodes in a first network; wherein the first node is a node of the type to be determined in the first network.

[0052] In one embodiment, a node whose node type is to be determined in the first network may refer to a node whose node type has not been preset in the first network, or a node whose node type is to be determined in the first network may refer to a node whose node type has been preset in the first network and whose preset node type is to be updated.

[0053] In one embodiment, the first node can be all nodes in the first network; or, the first node can be some nodes in the first network.

[0054] In one embodiment, in response to the first node being all nodes in the first network, an initial value for the node type of the second node can be determined based on the number of nodes adjacent to the second node; wherein the second node is a node adjacent to the first node; the node type of the first node is determined based on the attribute information of the second nodes adjacent to the first node; wherein the attribute information includes the initial value and number of the node type of the second node. The initial value of the node type is used to indicate whether the node type of the second node is a link node, a loop node, or a root node.

[0055] In one embodiment, the node type of a specified node in the first network can be preset; the node type of the first node can be determined based on the node type of the specified node in the first network. In this case, the first node can be a node in the first network whose node type has not been preset. That is, the first node can be any node in the first network other than the specified node.

[0056] In one embodiment, the second node adjacent to the first node may include a designated node and / or a non-designated node. The designated node includes nodes in the first network with a pre-defined node type; the non-designated node includes nodes in the first network other than the designated node.

[0057] In one embodiment, the node type of the first node is determined based on the attribute information of the second node adjacent to the first node in the first network. The attribute information includes: the sum of the number of specified nodes and unspecified nodes adjacent to the first node, and the node types of the specified nodes and / or unspecified nodes adjacent to the first node.

[0058] In one embodiment, the node type of a non-specified node can be marked as a preset node type; the node type of the first node can be determined based on the attribute information of the second node adjacent to the first node in the first network; wherein the second node includes specified nodes and / or non-specified nodes; the attribute information includes: the preset node type corresponding to the non-specified node adjacent to the first node and / or the node type of the specified node adjacent to the first node, and the number of second nodes.

[0059] In one embodiment, in response to determining the node type of a non-specified node (i.e., the first node), the preset node type corresponding to the non-specified node is updated to the determined node type.

[0060] In one implementation, the root node can be a node that is in both the link structure and the loop structure, the link node can be a node that is only in the link structure, and the loop node can be a node that is only in the loop structure.

[0061] In one embodiment, such as Figure 2 As shown, nodes R, S, and T can be link nodes, while nodes A, B, C, D, E, F, G, H, M, O, P, and Q can be loop nodes. Node N can be the root node.

[0062] In one embodiment, in response to determining the node type of all first nodes in the first network, the topology to which the nodes in the first network belong is determined based on the node type of the nodes in the first network.

[0063] In one embodiment, the topology to be determined for the first network can be determined based on the type of the topology of the reference network. For example, if the topology of the reference network includes link structures and loop structures, then the topology to be determined for the first network includes both link structures and loop structures.

[0064] In one embodiment, the topology to be determined for the first network can be determined based on the types of topologies of at least two reference networks.

[0065] In one embodiment, the reference network may be of the same network type as the first network. For example, both the reference network and the first network may be transport networks used for transmitting data between different regions. For example, both the reference network and the first network may also be SPN networks. Alternatively, both the reference network and the first network may be PTN networks.

[0066] In this embodiment, the node type of the first node is determined based on the attribute information of a second node adjacent to the first node in the first network. The attribute information includes the node type and quantity of the second node, and the node type includes one of the following: link node type, loop node type, and root node type. Based on the node type, the topology to which the node in the first network belongs is determined, and the topology includes a loop structure and / or a link structure. The topology is used for path planning of data transmission. Here, since the node type of the first node is determined based on the attribute information of the second node adjacent to the first node, and the first attribute information includes the node type and quantity of the second node, and the node type includes link node type, loop node type, and root node type, this embodiment can automatically determine the node type of the first node based on the attribute information of the second node adjacent to the first node in the first network. In the process of dividing the topology of the first network based on the node type, the topology of the first network can be automatically divided based on the automatically determined node type, thereby improving the automation level and efficiency of determining the node type and topology. On the other hand, the determined node type of the first node can be adapted to the node types and number of the second nodes adjacent to the first node. In this case, more comprehensive reference to node type-related information can be made to determine the node type, ensuring that the topology determined based on the node type meets the needs of data transmission in practical application scenarios, thereby ensuring the reliability of data transmission using the topology. Compared to related technologies that require manual classification of node types in the network, this embodiment can automatically and accurately determine the node type of the first node based on the attribute information of the second nodes adjacent to the first node, and automatically determine the topology of the first network based on the node type. This improves the automation level in determining node types and topology, increases the efficiency of determining node types and topology, reduces manpower waste, and ensures the reliability of data transmission using the topology.

[0067] In one embodiment, such as Figure 3As shown, before determining the node type of the first node, the method further includes:

[0068] Step S0031: Set the node type of the nodes in the first network to a preset node type, wherein the nodes include the first node and the second node.

[0069] In one embodiment, the node type of all nodes in the first network can be set to a preset node type; the nodes include the first node and the second node. Based on the attribute information of the second node adjacent to the first node in the first network, the node type of the first node is determined; wherein, the attribute information includes the node type and number of the second node, and the node type includes one of the following: link node type, loop node type, and root node type. Based on the node type, the topology to which the nodes in the first network belong is determined, the topology including loop structure and / or link structure; wherein, the topology is used for data transmission path planning.

[0070] Here, since the node types of the first and second nodes in the first network are uniformly set to a preset node type, the process of determining the node type of the first node only needs to determine the actual node type of the first node for nodes whose actual node type differs from the preset node type. In some application scenarios, it is not necessary to determine the node type of nodes whose actual node type is the preset node type. This saves time in determining the node type, thereby improving the efficiency of determining the node type of nodes in the first network and the efficiency of partitioning the topology of the first network based on node type.

[0071] In one embodiment, a first node is determined from the nodes in a first network; wherein the first node is a node in the first network whose preset node type is to be updated. For the determined first node, the node type of the first node is determined based on the attribute information of a second node adjacent to the first node in the first network. Based on the node type, the topology to which the node in the first network belongs is determined.

[0072] In one embodiment, the node type of a node in the first network is set to a preset node type, where the node includes the first node and the second node. The probability that the target node type of a node in the first network is not the preset node type is determined. In response to a probability threshold being met, the node is identified as the first node, which is the node in the first network whose preset node type needs to be updated. For the first node, the target node type is determined based on attribute information of a second node adjacent to it. In response to a discrepancy between the target node type and the preset node type of the first node, the node type of the first node is updated from the preset node type to the target node type. Based on the preset node type and / or the target node type of the nodes in the first network, the topology to which the nodes in the first network belong is determined.

[0073] In one embodiment, in response to determining the node type of all first nodes, the topology of the nodes in the first network can be determined based on the node type of each node in the first network.

[0074] In one embodiment, in response to determining the node types of all first nodes and the absence of any newly added first nodes, the topology of the nodes in the first network can be determined based on the node types of each node in the first network.

[0075] In one embodiment, the newly added first node can be a first node determined based on a received input operation; alternatively, the newly added first node can be a node in the first network automatically calculated based on preset rules. The newly added first node can be a newly added node of a preset node type to be updated.

[0076] In one embodiment, the preset node type can be any one of the following: loop node type, link node type, or root node type.

[0077] In one embodiment, the preset node type can be the type of a loop node. In response to determining that the type of a node in the first network is not the type of a loop node, the preset node type is updated for the node to obtain an updated node type. The updated node type is the node type obtained after updating the preset node type, and the updated node type is either the type of a link node or the type of a root node.

[0078] In one embodiment, the preset node type can be the type of a link node. In response to determining that the type of a node in the first network is not the type of a link node, the preset node type is updated for the node to obtain an updated node type. The updated node type is the node type obtained after updating the preset node type, and the updated node type is either the type of a loop node or the type of a root node.

[0079] In one embodiment, the preset node type can be the root node type. In response to determining that the type of a node in the first network is not the root node type, the preset node type is updated for the node to obtain an updated node type. The updated node type is the node type obtained after updating the preset node type, and the updated node type is either the loop node type or the link node type.

[0080] In one embodiment, the node type of the second node includes the preset node type or the updated node type; the updated node type is the node type determined after updating the preset node type.

[0081] In one embodiment, the node type of all nodes in the first network can be set to a preset node type; the nodes include the first node and the second node. The node type of the first node is determined based on the attribute information of the second nodes adjacent to the first node in the first network; wherein, the attribute information may include: the node type of each second node and the number of second nodes. The node type of any second node can be a preset node type or an updated node type; the preset node type can be a link node type, a loop node type, or a root node type; the updated node type is the node type determined after updating the preset node type; the updated node type can be a link node type, a loop node type, or a root node type. Based on the node type, the topology to which the nodes in the first network belong is determined.

[0082] In one embodiment, in response to the node type determined after updating the preset node type of the second node being inconsistent with the preset node type, the node type corresponding to the second node in the attribute information is determined to be the updated node type, and the updated node type is the node type determined after updating the preset node type.

[0083] For example, the second nodes adjacent to the first node include nodes X, Y, and Z. The node types of nodes X, Y, and Z are set to a preset node type, which can be a loop node type. Here, if the node type determined after updating the preset node type for node Y is a link node type, and the node type determined after updating the preset node type for node Z is the root node type, then the attribute information of the second nodes adjacent to the first node can include: the loop node type corresponding to node X, the link node type corresponding to node Y, the root node type corresponding to node Z, and the number of second nodes.

[0084] Here, when the preset node type of the second node is updated to the updated node type, the node type of the first node can be determined based on a more accurate updated node type of the second node and the number of second nodes. This improves the accuracy of the node type of the first node.

[0085] In one embodiment, the attribute information is first attribute information, which includes the preset node type and quantity of the second node; or, the attribute information is second attribute information, which includes the updated node type and quantity of the second node, wherein the updated node type is a node type determined after updating the preset node type.

[0086] Here, if the preset node type of the second node is not updated, the node type of the first node can be quickly determined based on the preset node type and the number of second nodes pre-set in the first attribute information. In this case, it is not mandatory to determine the node type of the first node only after the actual node type of the second node has been determined. This improves the speed of determining the node type of the first node. If the preset node type of the second node is updated to an updated node type, the node type of the first node can be determined based on the more accurate node type and the number of second nodes in the second attribute information. This improves the accuracy of determining the node type of the first node.

[0087] like Figure 4 As shown, determining the node type of the first node based on the attribute information of the second node adjacent to the first node in the first network includes:

[0088] Step S0041: Based on the attribute information of the second node adjacent to the first node, determine the node type to which the first node is to be updated.

[0089] In one embodiment, the node type of all nodes in the first network can be set to a preset node type; the nodes include the first node and the second node. Based on the attribute information of the second node adjacent to the first node in the first network, the node type to which the first node is to be updated is determined; wherein, the attribute information includes the node type and number of the second node, and the node type includes one of the following: link node type, loop node type, and root node type. Based on the node type, the topology to which the nodes in the first network belong is determined, the topology including loop structure and / or link structure; wherein, the topology is used for path planning of data transmission.

[0090] In one embodiment, in response to a discrepancy between the node type to be updated to and a preset node type for the first node, the node type of the first node is updated from the preset node type to an updated node type; wherein, the updated node type is the node type to be updated to. Here, the first node may be a second node adjacent to other first nodes. When the first node is a second node adjacent to other first nodes, the updated node type corresponding to the first node can also be understood as the updated node type corresponding to any of the second nodes described in any of the embodiments of this disclosure.

[0091] In one embodiment, the preset node type is the type of the loop node, and the second node adjacent to the first node includes: a node whose update node type is the type of the link node.

[0092] In one embodiment, the node type of all nodes in the first network can be set to a preset node type; the nodes include a first node and a second node. The preset node type is the type of the loop node. Based on the attribute information of the second node adjacent to the first node in the first network, the node type to which the first node is to be updated is determined; wherein, the attribute information includes the node type and number of the second node, and the node type includes one of the following: the type of a link node, the type of a loop node, and the type of a root node, and the second node adjacent to the first node includes: the node whose updated node type is the type of the link node. Based on the node type, the topology to which the nodes in the first network belong is determined, the topology including a loop structure and / or a link structure; wherein, the topology is used for path planning of data transmission.

[0093] Here, since the preset node type is set to the type of a loop node, and the second nodes adjacent to the first node include nodes whose updated node type is the type of the link node, in the process of determining the node type of the first node, it is only necessary to determine the node type to be updated to for the first node adjacent to the link node. That is, it is only necessary to confirm the node type of the first node that may need to be updated to the preset node type. At this time, it is not necessary to repeatedly confirm the node type of all nodes. In this way, the efficiency of determining the node type of a node can be improved.

[0094] In one embodiment, the second node adjacent to the first node includes a node whose update node type is the type of the link node. Essentially, the first node can be understood as: the second node adjacent to the first node is a link node.

[0095] In one embodiment, the preset node type is the type of the loop node, and the second node adjacent to the first node includes: a node whose update node type is the type of the link node and / or a node whose update node type is the type of the root node.

[0096] In one embodiment, such as Figure 5 As shown, the method further includes:

[0097] Step S0051: In response to the fact that the number of nodes adjacent to the second node is one, determine that the updated node type of the second node is the type of the link node.

[0098] In one embodiment, such as Figure 5 As shown, the method further includes:

[0099] Step S0052, determine the first node; wherein, the second node adjacent to the first node includes: the node whose update node type is the type of the link node.

[0100] In one embodiment, the node type of all nodes in the first network can be set to a preset node type; the nodes include a first node and a second node. The preset node type is the type of the loop node. In response to the fact that the number of nodes adjacent to the second node is single, the updated node type of the second node is determined to be the type of the link node. Based on the attribute information of the second node adjacent to the first node in the first network, the node type to which the first node is to be updated is determined; wherein, the attribute information includes the node type and number of the second node, and the node type includes one of the following: the type of the link node, the type of the loop node, and the type of the root node; the second node adjacent to the first node includes nodes whose updated node type is the type of the link node. Based on the node type, the topology to which the nodes in the first network belong is determined, the topology including a loop structure and / or a link structure; wherein, the topology is used for path planning of data transmission.

[0101] Here, since the updated node type of the second node is determined to be the link node type in response to the fact that there is only one node adjacent to the second node, and the second nodes adjacent to the first node include nodes whose updated node type is the link node type, when the node type of all nodes in the first network is set to the loop node type, the second node with only one adjacent node can be quickly determined as a link node first, and then the first node can be quickly determined based on the already determined link node, thereby quickly completing the determination of the node type of the first node. This improves the efficiency of determining the node type of the first node.

[0102] In one embodiment, the link structure is used to access devices located outside the first network.

[0103] In one embodiment, the link structure includes a starting node, intermediate nodes, and an ending node. The starting node and the ending node are nodes at opposite ends of the link structure, respectively. In one embodiment, in response to determining that a node in the first network is any one of a starting node, intermediate node, or ending node, a node adjacent to the starting node, intermediate node, or ending node is determined as a first node.

[0104] In one embodiment, in response to the fact that the number of nodes adjacent to the second node is a single node, the second node can be determined as the starting node of the link structure.

[0105] In one embodiment, the node is determined to be an intermediate node in a link structure in response to a node in the first network being adjacent to the starting node and the node type of the node being updated to the type of a link node. Alternatively, the node is determined to be an intermediate node in a link structure in response to a node in the first network being adjacent to the intermediate node and the node type of the node being updated to the type of a link node.

[0106] In one embodiment, the node is determined to be the termination node of the link structure in response to a node in the first network being adjacent to the starting node and the node's node type being updated to the root node's type. Alternatively, the node is determined to be the termination node of the link structure in response to a node in the first network being adjacent to the intermediate node and the node's node type being updated to the root node's type.

[0107] In one embodiment, the node type of all nodes in the first network is set to the loop node type. In response to the attribute information of a second node adjacent to the first node indicating that there are two second nodes adjacent to the first node, it is determined that the node type of the first node is not a loop node type. The second nodes adjacent to the first node include nodes whose node type has been updated to the link node type. At this time, the node type of the first node can be a link node type, or the node type of the first node can be the root node type.

[0108] Here, by limiting the first node to those adjacent to the link node, if there are two second nodes adjacent to the first node, it can be directly determined that the first node is not a loop node. In this case, it is unnecessary to determine the node type of the first node by examining the node types of each of the second nodes adjacent to it; the node type can be determined directly based on the number of second nodes adjacent to the first node. This improves the efficiency of determining the node type of the first node.

[0109] In one embodiment, such as Figure 6 As shown, determining the node type of the first node based on the attribute information of the second node adjacent to the first node in the first network includes:

[0110] Step S0061: Determine the feature information of the first node based on the number of second nodes adjacent to the first node; wherein the feature information includes a first quantity feature and / or a second quantity feature; the first quantity feature is used to indicate that the number of second nodes adjacent to the first node is two; the second quantity feature is used to indicate that the number of second nodes adjacent to the first node is multiple.

[0111] Step S0062: Based on the feature information and the node type of the second node, determine the node type of the first node.

[0112] Here, since the feature information of the first node is determined based on the number of second nodes adjacent to the first node, and the node type of the first node is determined based on the feature information and the node type of the second node, in this embodiment of the disclosure, the feature information of the first node can be initially divided by the number of second nodes adjacent to the first node. After the feature information of the first node is initially divided, the node type of the first node can be accurately determined by combining the node type of the second node. This makes the determined node type of the first node adaptable to the number and type of the second nodes adjacent to the first node, thereby improving the accuracy of the determined node type of the first node.

[0113] like Figure 7 As shown, determining the node type of the first node based on the feature information and the node type of the second node includes:

[0114] Step S0071: For the first node whose feature information is the second quantity feature, determine whether there is a link node among the second nodes adjacent to the first node;

[0115] Step S0072: In response to determining that a link node exists in the second node, the node type of the first node is determined to be the type of the link node.

[0116] In one embodiment, for a first node whose feature information is a second quantity feature, it is determined whether there is a link node in a second node adjacent to the first node; in response to determining that there is no link node in the second node, it is determined that the node type of the first node is a loop node.

[0117] In one embodiment, a first node whose feature information is a second quantity feature can be added to a first node set, and the node type of each node in the node set can be determined directly in batches. In one embodiment, for nodes in the first node set, it can be determined in batches whether there are link nodes among the nodes adjacent to the nodes in the first node set. In response to determining that there are link nodes, the node type of the corresponding node in the first node set is determined to be the type of a link node.

[0118] Here, the node type of first nodes with the same feature information can be determined in batches, without having to switch back and forth between the node type determination steps for first nodes with different feature information, thereby improving the efficiency of determining the node type of the first node.

[0119] In one embodiment, in response to the addition of a first node in the first network that includes a first node with a first quantity feature, the node type of all first nodes with the first quantity feature is preferentially determined.

[0120] Here, since the node type of the first node whose feature information is the first quantitative feature is determined first, the process of determining the node type of the first node by the first quantitative feature point is relatively simple. Therefore, the node type of some first nodes in the first network can be quickly determined by simply determining the steps, and then the node type of other first nodes can be determined based on the node type of some first nodes. This speeds up the process of determining the node type of each first node in the first network and improves the efficiency of determining the node type and the efficiency of determining the topology based on the node type.

[0121] In one embodiment, in response to determining the node type of all first nodes in the first network whose feature information is a first quantity feature and there is no additional first node whose feature information is a first quantity feature, the node type of the first node whose feature information is a second quantity feature is determined.

[0122] In one embodiment, such as Figure 8 As shown,

[0123] Determining the node type of the first node based on the feature information and the node type of the second node includes:

[0124] Step S0081: Based on the feature information and the number of first preset nodes in the second node, determine the node type of the first node; wherein, the first preset node includes nodes whose node type is the type of the loop node and / or whose node type is the type of the root node.

[0125] Here, the determined node type of the first node can be adapted to the feature information of the first node and the number of first preset nodes among the second nodes adjacent to the first node. Therefore, given that the first preset node can be identified, the node type of the first node can be accurately determined based on the number of first preset nodes. This improves the accuracy of determining the node type of the first node.

[0126] In one embodiment, the node types of the nodes in the first network are not set. After the link nodes and root nodes in the first network are determined, the nodes other than the link nodes and root nodes can be batch-set as loop nodes.

[0127] In one embodiment, for the first node whose characteristic information is a first quantity characteristic, it is determined whether the number of the first preset nodes is equal to a predetermined value. The predetermined value can be 2. In response to determining that the number of the first preset nodes is equal to the predetermined value, the node type of the first node is determined to be a link node type; in response to determining that the number of the first preset nodes is less than the predetermined value, the node type of the first node is determined.

[0128] In one embodiment, for each first node, feature information of the first node is determined based on the number of first nodes adjacent to it; wherein the feature information of the first node includes at least one of the following: a first feature, a second feature, a third feature, and a fourth feature; the first feature indicates that the number of nodes adjacent to the first node is one, the second feature indicates that the number of nodes adjacent to the first node is two, the third feature indicates that the number of nodes adjacent to the first node is three, and the fourth feature indicates that the number of nodes adjacent to the first node is more than three. In one embodiment, the node type of the node with the first feature, the node type of the node with the second feature, the node type of the node with the third feature, and the node type of the node with the third feature can be determined sequentially.

[0129] In one embodiment, such as Figure 9 As shown, determining the node type of the first node based on the feature information and the number of the first preset nodes in the second node includes:

[0130] Step S0091: For the first node whose feature information is the second quantity feature, determine whether the number of the first preset nodes is less than the quantity threshold.

[0131] Step S0092, in response to determining that the number of the first preset nodes is less than the number threshold, determine that the node type of the first node is the type of the link node; or, step S0093, in response to determining that the number of the first preset nodes is greater than the number threshold, determine that the node type of the first node is the type of the root node.

[0132] Here, for a first node whose feature information is the second quantity feature, the determined node type of the first node can be adapted to the relationship between the number of first preset nodes and the quantity threshold among the second nodes adjacent to the first node. Therefore, when the first preset node can be determined, the node type of the first node can be accurately determined based on the relationship between the number of first preset nodes and the quantity threshold. This improves the accuracy of determining the node type of the first node.

[0133] In one embodiment, the quantity threshold can be 2.

[0134] In one embodiment, such as Figure 10 As shown, the method further includes:

[0135] Step S1001: Determine the first quantity, the second quantity, and the third quantity respectively; wherein, the first quantity is the number of nodes in the first network whose node type is the link node type; the second quantity is the number of nodes in the first network whose node type is the loop node type; and the third quantity is the number of nodes in the first network whose node type is the root node type.

[0136] Determining the topology of a node in the first network based on the node type includes:

[0137] Step S1002: In response to the fact that the values ​​of the first quantity, the second quantity, and the third quantity have not changed within a predetermined time, the topology is determined based on the node type.

[0138] In one embodiment, the node type of the first node is determined based on attribute information of a second node adjacent to the first node in the first network; wherein the attribute information includes the node type and quantity of the second node, and the node type includes one of the following: link node type, loop node type, and root node type. A first quantity, a second quantity, and a third quantity are determined respectively; wherein the first quantity is the number of nodes in the first network whose node type is the link node type; the second quantity is the number of nodes in the first network whose node type is the loop node type; and the third quantity is the number of nodes in the first network whose node type is the root node type. In response to the fact that the values ​​of the first quantity, the second quantity, and the third quantity do not change within a predetermined time, the topology is determined based on the node type, the topology including a loop structure and / or a link structure; wherein the topology is used for path planning of data transmission.

[0139] Here, the topology is determined based on node type only if the values ​​of the first, second, and third quantities remain unchanged within a predetermined time. Therefore, the topology of each node is determined based on a stable node type only if the node types of the link nodes, loop nodes, and root nodes in the first network remain unchanged. This ensures the reliability of the determined topology.

[0140] In one embodiment, after determining the node type of the first node, the node type of the first node is re-determined in response to a change in the attribute information of the second node adjacent to the first node. Here, re-determining the node type of the first node can mean re-determining the node type of the first node based on the changed attribute information of the second node adjacent to the first node.

[0141] In one embodiment, in response to a change in the node type of any of the second nodes adjacent to the first node, it is determined that the attribute information of the second node adjacent to the first node has changed.

[0142] Understandably, if the node type of the newly determined first node is inconsistent with the node type of the first node determined before the attribute information changes, at least two of the values ​​of the first quantity, the second quantity, and the third quantity will change. In this case, the topology to which the node in the first network belongs cannot be determined based on the node type.

[0143] In one embodiment, the scheduled time can be determined based on the number of nodes in the first network.

[0144] In one embodiment, the scheduled time can be positively correlated with the number of nodes in the first network.

[0145] In one embodiment, the predetermined time can be determined based on historical experience data. This historical experience data can be used to indicate the time taken to determine the node type of nodes in the second network. The first network can be a network obtained by adjusting the nodes in the second network. For example, the first network can be a network obtained by deleting nodes from the second network, or a network obtained by adding nodes to the second network. The second network can also be a network of the same type as the first network. For example, the second network can be an SPN network different from the first network, or a PTN network different from the first network.

[0146] In one embodiment, such as Figure 11 As shown, determining the topology of a node in the first network based on the node type includes:

[0147] Step S1101: Determine the loop structure based on the first preset node in the first network; wherein the first preset node includes a node of type loop node and / or a node of type root node; and / or, determine the link structure based on the second preset node in the first network; wherein the second preset node includes a node of type link node and / or a node of type root node.

[0148] Here, compared to the method in related technologies that requires manual topology division, the embodiments of this disclosure can automatically divide the loop structure and link structure in the first network based on the first preset node and the second preset node in the first network. In this way, the efficiency of topology division can be improved.

[0149] In one embodiment, a second preset node can be added to a first data table, and a second preset node can be added to a second data table. The link structure can be determined based on the nodes in the first data table. The loop structure can be determined based on the nodes in the second data table.

[0150] In one embodiment, in response to determining all topologies in the first network, duplicate topologies in the determined topologies are deleted to obtain the target topology.

[0151] In one embodiment, the target topology can be displayed.

[0152] In one embodiment, determining the loop structure based on the first preset nodes in the first network may refer to determining the loop structure corresponding to each first preset node based on first connection information. The first connection information is used to indicate the connection relationships between the first preset nodes in the first network. The first preset nodes include nodes of type link node and nodes of type root node.

[0153] In one embodiment, there can be one or more loop structures. Multiple loop structures can be directly connected through a first preset node, or indirectly connected through a second preset node. A first preset node can belong to only one loop structure, or it can belong to multiple loop structures. Here, the specific structure of the loop structure and the first preset node within the loop structure is not limited.

[0154] In one embodiment, determining the link structure based on second preset nodes in the first network may refer to determining the link structure corresponding to each second preset node based on second connection information. The second connection information can be used to indicate the connection relationships between the second preset nodes in the first network. The second preset nodes include nodes whose node type is either a link node or a root node.

[0155] In one embodiment, there can be one link structure or multiple link structures. Multiple link structures can be directly connected through a second preset node, or multiple loop structures can be indirectly connected through a first preset node. A second preset node can belong to only one link structure, or it can be in multiple link structures simultaneously. Here, the specific structure of the link structure and the second preset node within it is not limited.

[0156] In one embodiment, link structures and loop structures can be connected by nodes of type root node.

[0157] In one embodiment, the overall topology of the first network can be constructed based on the link structure and loop structure. In the overall topology of the first network, any two nodes of the first network can be directly or indirectly connected.

[0158] In one embodiment, such as Figure 12 As shown, determining the loop structure based on the first preset node in the first network includes:

[0159] Step S1201: Determine a predetermined number of endpoint node sets from the first preset nodes; wherein, the endpoint node set includes two endpoint nodes used to determine the loop structure;

[0160] Step S1202: Determine the loop structure corresponding to the endpoint node set; wherein, the loop structure includes the structure of the loop in which two endpoint nodes in the endpoint node set are located.

[0161] In this embodiment, a predetermined number of endpoint node sets are first determined from a first set of preset nodes. Each endpoint node set includes two nodes used to determine the loop structure. After determining the endpoint node set, the loop structure of the first network can be determined by identifying the structure of the loop shared by the two endpoint nodes in the endpoint node set. Compared to related technologies that require determining the connection relationships between each node and other nodes to determine the topology of the first network, this embodiment eliminates the need to determine the connection relationships between each node and other nodes. The loop structure of the first network can be determined by identifying the structure of the loop shared by the two endpoint nodes in the selected endpoint node set. This simplifies the operation of determining the loop structure of the first network and improves the efficiency of determining the loop structure of the first network.

[0162] In one embodiment, a predetermined algorithm can be used to determine the structure of the loop in which two endpoint nodes in the endpoint node set are located.

[0163] In one embodiment, a predetermined algorithm is used to calculate all loops in which the two endpoint nodes are located, and at least one node in each different loop is different.

[0164] In one embodiment, the predetermined algorithm can be the shortest distance algorithm, which is used to calculate all shortest paths between two endpoint nodes.

[0165] In one embodiment, a loop containing the two endpoint nodes can be obtained based on any combination of two non-repeating shortest paths.

[0166] In one embodiment, the loop structure includes at least one of the following:

[0167] A first loop structure, wherein the first loop structure is used to access devices located outside the first network; and...

[0168] The second loop structure is used to aggregate the data transmitted by the nodes in the first loop structure.

[0169] Here, by dividing the loop structure into a first loop structure and a second loop structure, it is possible to distinguish between the loop structure used for devices accessing the first network and the loop structure used for aggregating data transmitted by nodes in the first loop structure. This allows for precise transmission of data from devices outside the first network or data transmitted by nodes within the first loop structure using the appropriate loop structure. This ensures the reliability of data transmission using the loop structure.

[0170] In one embodiment, the link structure is used to access devices located outside the first network. The first loop structure can be used to access the link structure and / or devices located outside the first network.

[0171] In one embodiment, the first loop structure and the second loop structure can be connected via endpoint nodes.

[0172] In one embodiment, the topology to be determined for the first network can be determined based on the type of the topology of the reference network. For example, if the topology of the reference network includes a first loop structure and a second loop structure, then the topology to be determined for the first network includes both the first loop structure and the second loop structure. In this case, the nodes in the first network can be divided into first loop structures and / or second loop structures based on node type.

[0173] In one embodiment, such as Figure 13 As shown, the method further includes:

[0174] Step S1301: Determine a first set of endpoint nodes from the predetermined number of endpoint node sets; wherein, the first set of endpoint nodes includes two nodes adjacent to the third node; the third node is a node in the first preset node set; the number of nodes adjacent to the third node is two.

[0175] Determining the loop structure corresponding to the endpoint node set includes:

[0176] Step S1302: Determine the loop structure in which the endpoint nodes in the first endpoint node set and the third node are located as the first loop structure.

[0177] Here, in situations where the third node can only aggregate data transmitted by two nodes, or cannot aggregate data transmitted by multiple nodes, the loop structure shared by the endpoint nodes in the first endpoint set and the third node can be defined as the first loop structure. In this case, devices outside the first network can be accessed through the endpoint nodes in the first endpoint set and the third node, without utilizing the third node to aggregate data transmitted by multiple nodes, thus ensuring the reliability of the aggregated data.

[0178] In one embodiment, such as Figure 14 As shown, the method further includes:

[0179] Step S1401: Determine a second set of endpoint nodes from the predetermined number of endpoint node sets; wherein the second set of endpoint nodes includes a first endpoint node and a second endpoint node; the number of nodes adjacent to the first endpoint node is multiple, and the number of nodes adjacent to the second endpoint node is two;

[0180] Determining the loop structure corresponding to the endpoint node set includes:

[0181] Step S1402: Determine the loop structure in which the endpoint nodes in the second set of endpoint nodes are located as the first loop structure.

[0182] Here, since there are only two nodes adjacent to the second endpoint node, the second endpoint node can only aggregate data transmitted by two nodes; it cannot aggregate data transmitted by multiple nodes. Therefore, the loop structure shared by the first and second endpoint nodes in the second endpoint set can be defined as the first loop structure. In this way, devices outside the first network can be accessed through the second endpoint node in the second endpoint node set, without using the second endpoint node to aggregate data transmitted by multiple nodes, thus ensuring the reliability of the aggregated data.

[0183] In one embodiment, the first endpoint node and the second endpoint node are determined to be used together to connect the first loop structure and the second loop structure.

[0184] In one embodiment, such as Figure 15 As shown, the method further includes:

[0185] Step S1501: Determine a third set of endpoint nodes from the predetermined number of endpoint node sets; wherein, the number of nodes adjacent to the endpoint nodes in the third set of endpoint nodes is multiple;

[0186] Determining the loop structure corresponding to the endpoint node set includes:

[0187] Step S1502: Determine that the loop structure in which the endpoint nodes in the third endpoint node set are located is the second loop structure.

[0188] Here, since there are multiple nodes adjacent to the endpoint nodes in the third endpoint node set, the endpoint nodes in the third endpoint node set can be used to aggregate data transmitted by multiple nodes. In this case, the loop structure shared by the endpoint nodes in the third endpoint node set can be defined as the second loop structure. Thus, data transmitted by multiple nodes can be aggregated through the endpoint nodes in the third endpoint node set, thereby ensuring reliability during the aggregation of data transmission using the second loop structure.

[0189] To better understand the technical solutions in the embodiments of this disclosure, please refer to Figure 16 , Figure 16 An exemplary flowchart illustrating a process for determining the node type of a node in a first network is shown below:

[0190] Step S1601: Perform a preprocessing operation on the number of fiber connections between any two adjacent nodes in the first network;

[0191] The preprocessing operation includes setting the fiber count between two adjacent nodes to 1; any two adjacent nodes are connected by optical fibers; the fiber count can refer to the number of optical fibers connected between two adjacent nodes.

[0192] Here, connection information can be collected through the northbound interface. This connection information indicates the connection relationships between nodes in the first network. The connection information may include information about the interfaces used for connection between interconnected nodes and the number of fiber connections. The number of fiber connections refers to the number of optical fibers connecting two adjacent nodes.

[0193] Here, it can be understood that the number of fibers corresponding to a node can also be used to indicate the number of nodes adjacent to that node.

[0194] Step S1602: Set the node type of all nodes in the first network to the type of loop node.

[0195] Step S1603: For each node, determine the node's feature information based on the number of nodes adjacent to the node.

[0196] The node's feature information includes at least one of the following: a first feature, a second feature, a third feature, and a fourth feature; the first feature indicates that the node has one fiber connection direction, the second feature indicates that the node has two fiber connection directions, the third feature indicates that the node has three fiber connection directions, and the fourth feature indicates that the node has more than three fiber connection directions.

[0197] Step S1604: In response to the node's feature information being the first feature, the node type of the node is updated from the type of loop node to the type of link node, and the node is the starting node in the link structure.

[0198] Step S1605: Query the feature information of the nodes adjacent to the starting node;

[0199] Step S1606: In response to the query result being a second feature, update the node type of the query result to the type of the link node.

[0200] Here, following step S1606, after obtaining all fourth nodes through querying, the node type of the fourth node can be updated to the type of the link node; the fourth node includes nodes whose feature information is the second feature and which are adjacent to the link node.

[0201] Step S1607: In response to updating the node type of all the fourth nodes from the type of loop node to the type of link node, the fifth node can be queried; the fifth node includes nodes adjacent to the link nodes and nodes whose feature information is the third feature.

[0202] Step S1608: For the queried fifth node, in response to the number of link nodes among the nodes adjacent to the fifth node being greater than 1, determine to update the node type of the fifth node to the type of a link node; or, in response to the number of link nodes among the nodes adjacent to the fifth node being less than 2, determine to update the node type of the fifth node to the type of the root node.

[0203] Repeat step S1608 until the total number of nodes of various node types remains unchanged before and after step S1608, confirming that the query has obtained all nodes of the fifth node type that are either link nodes or root nodes.

[0204] Step S1609: Query the nodes whose feature information is the fourth feature from the nodes adjacent to the link node;

[0205] Step S1610: In response to the number of first preset nodes among the nodes adjacent to the node with the fourth feature being greater than the number threshold, the node type of the node with the fourth feature being updated to the type of the root node; or, in response to the number of first preset nodes among the nodes adjacent to the node with the fourth feature being less than the number threshold, the node type of the node with the fourth feature being updated to the type of the link node.

[0206] Repeat step 1610 until the total number of nodes of various node types remains unchanged before and after step 1610, thus confirming the completion of updating the node types of all nodes.

[0207] Please see Figure 17 , Figure 17 An exemplary flowchart illustrating a process for determining the topology to which a node belongs in a first network is shown below:

[0208] Step S1701: Store all second preset nodes in the first data table; wherein, the second preset nodes include nodes whose node type is the type of the link node and / or nodes whose node type is the type of the root node;

[0209] Step S1702: Starting from the node in the second data table whose node type is the root node, construct all the link structures according to the connection information;

[0210] The connection information includes the connection interface and fiber count of the nodes in the first network. The connection interface is used to connect other nodes, and the fiber count refers to the number of optical fibers between two adjacent nodes connected by optical fibers.

[0211] Step S1703: Determine the type of loop structure of the first network topology based on the topology of the second network;

[0212] The topology of the second network includes a first loop structure, a second loop structure, and a third loop structure.

[0213] Here, the topology of the second network can be modeled and decomposed to obtain the first ring structure and the second ring structure. The first ring structure is used to access devices outside the first network; the second ring structure is used to aggregate data transmitted by nodes in the first ring structure. Here, the first ring structure can be called the access ring, and the second ring structure can be called the aggregation ring. The first ring structure can include a first type of ring and a second type of ring structure. The first type of ring structure can be a ring structure containing two-fiber nodes and other nodes; the second type of ring structure can be a ring structure containing two-fiber nodes and multi-fiber nodes; the second ring structure can be a ring structure containing multi-fiber nodes. A two-fiber node can be a node with two connected fibers; a multi-fiber node can be a node with more than two connected fibers.

[0214] Step S1704: Store all first preset nodes into the second data table;

[0215] Step S1705: Obtain two fiber nodes from the second data table, and obtain two endpoint nodes adjacent to the two fiber nodes; using the two endpoint nodes as origins and destinations, call the shortest distance algorithm to determine the loop structure where the two endpoint nodes and the two fiber nodes are located as the first type of loop structure;

[0216] Step S1706: Obtain the loop data of a partial loop of a node whose first end is a two-fiber node and whose second end is a three-fiber node from the second data table. Using the two-fiber node corresponding to the first end and the three-fiber node corresponding to the second end as the origin and destination, determine all the shortest paths where the nodes in the loop data are located as the second type of loop structure. The first end can be one end of a partial loop in the second type of loop structure, and the second end can be the other end of a partial loop in the second type of loop structure.

[0217] Step S1707: Delete all data of two-fiber nodes in the second data table, arrange and combine all multi-fiber nodes in the second data table, calculate the shortest path based on any two multi-fiber nodes, and determine all the shortest paths obtained by calculation as the second loop structure.

[0218] Step S1708: Store the first type of loop structure, the second type of loop structure, and the third type of loop structure into the third data table, and delete the duplicate loop structures in the third data table;

[0219] Step S1709: Based on the connection information obtained through the northbound interface, construct the ring network structure according to the pre-calculated ring structure. The ring network structure can be used to indicate the connection relationships between ring structures.

[0220] In one embodiment, the topology of the nodes in the first network is determined based on the node type of the first network; the determined topology is then displayed.

[0221] For example, such as Figure 18 As shown, based on the node types of the first network, nine topologies were determined (see [link to diagram]). Figure 18 The system lists nine topologies, numbered 1 to 9 (with the system name being the specific name of the topology). These topologies can be displayed. Specifically, topologies numbered 1 to 7 are loop structures, while those numbered 8 and 9 are link structures.

[0222] In one embodiment, system information of the topology to be displayed can be shown; wherein, the system information may include at least one of the following: system name, province, city, OperationsMaintenance Center (OMC), ring link attribute, system type, system level, and system designed capacity. The ring link attribute can be used to indicate whether the topology is a loop structure or a link structure.

[0223] In one embodiment, the system name may be determined by the names of the nodes that make up the topology to be displayed.

[0224] For example, such as Figure 18The topology corresponding to sequence number 1 can consist of 5 nodes, and the names of the 5 nodes can be 51-35, 51-260, 51-263, 51-262, and 51_258. In this case, the system name of the topology corresponding to sequence number 1 can be: 51-35_51-260_51-263_51-262_51_258.

[0225] In one embodiment, the topology to be displayed can be shown on the display interface.

[0226] In one embodiment, a predefined control can be set in the display interface, which is used to trigger the execution of a predefined operation.

[0227] For example, please see again Figure 18 The predefined controls may include controls for inputting system information corresponding to the topology. The system information may include at least one of the following: system name, province, city, affiliated OMC, ring link attribute, system type, system level, and system design capacity. The ring link attribute can be used to indicate whether the topology is a loop structure or a link structure.

[0228] For example, please see again Figure 18 The predefined controls may include at least one of the following: a query control for querying topology structures, an add control for adding new topology structures, a modify control for modifying topology structures, a delete control for deleting topology structures, a topology view control for generating topology views, an export control for exporting topology structures, and a settings control for setting topology structures.

[0229] In one embodiment, node information for any node included in any topology can be displayed. A node can be a network element. The node information includes at least one of the following: network element name, network element model, network element type, and gateway name. The gateway name can refer to the name of the OMC to which the node belongs.

[0230] For example, such as Figure 19 As shown, the topology of system 51-35_51-260_51-283_51-263_51_258 includes 5 network elements, and the node information of the 5 nodes included in this topology can be displayed (e.g., Figure 19 The node information of the network elements corresponding to serial numbers 1 to 5 is shown.

[0231] For example, such as Figure 19As shown, for the network element corresponding to sequence number 1 in the topology structure of system name 51-35_51-260_51-283_51-263_51_258, the network element name, network element model, network element type, and gateway name of the network element are displayed. Specifically, the network element name is 51-35-aggregation layer-PTN7900-1. The network element name is Op6xPTN 7900-32, the network element type is PTN, and the network management name is XJ-NCE-1-P.

[0232] like Figure 20 As shown, this disclosure provides a topology determination apparatus, the apparatus comprising:

[0233] The determining module 201 is configured to: determine the node type of the first node based on the attribute information of a second node adjacent to the first node in the first network; wherein the attribute information includes the node type and number of the second node, and the node type includes one of the following: link node type, loop node type, and root node type; and determine the topology to which the node in the first network belongs based on the node type, wherein the topology includes a loop structure and / or a link structure; wherein the topology is used for path planning of data transmission.

[0234] This disclosure provides a processing apparatus, the processing apparatus comprising:

[0235] Memory, used to store executable programs;

[0236] When executing an executable program stored in the memory, the processor implements the method as described in any of the embodiments of this disclosure.

[0237] It is understood that memory can be volatile or non-volatile, or both. Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), ferromagnetic random access memory (FRAM), flash memory, magnetic surface memory, optical disc, or compact disc read-only memory (CD-ROM); magnetic surface memory can be disk storage or magnetic tape storage. Volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), SyncLink Dynamic Random Access Memory (SLDRAM), and Direct Rambus Random Access Memory (DRRAM).The memories described in the embodiments of this application are intended to include, but are not limited to, these and any other suitable types of memories.

[0238] The method for determining the topology disclosed in this invention can be applied to or implemented by the processor. The processor can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the topology determination method can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The processor can be a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The processor can implement or execute the methods, steps, and logic block diagrams disclosed in this invention. A general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in this invention can be directly represented as execution by a hardware decoding processor, or as execution by a combination of hardware and software modules in the decoding processor. The software modules can be located in a storage medium, specifically a memory. The processor reads information from the memory and, in conjunction with its hardware, completes the steps of the topology determination method provided in this application.

[0239] This invention also provides a computer storage medium storing an executable program. When executed by a processor, the executable program implements the method for determining a topology as described in any of the embodiments of this disclosure. Specifically, it may be a computer-readable storage medium, such as a memory including a computer program that can be executed by a processor of a processing device to complete the steps described in the methods of the embodiments of this application. The computer-readable storage medium may be a ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface memory, optical disc, or CD-ROM, etc.

[0240] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A method for determining a topology, characterized in that, The method includes: Based on the attribute information of the second node adjacent to the first node in the first network, the node type of the first node is determined; wherein, the attribute information includes the node type and number of the second node, and the node type includes one of the following: the type of link node, the type of loop node, and the type of root node; Based on the node type, the topology of the nodes in the first network is determined, and the topology includes a loop structure and / or a link structure; wherein, the topology is used for path planning of data transmission; The step of determining the node type of the first node based on the attribute information of the second node adjacent to the first node in the first network includes: Based on the number of second nodes adjacent to the first node, the characteristic information of the first node is determined; wherein, the characteristic information includes a first quantity feature and / or a second quantity feature; the first quantity feature is used to indicate that the number of second nodes adjacent to the first node is two; the second quantity feature is used to indicate that the number of second nodes adjacent to the first node is multiple. Based on the feature information and the node type of the second node, the node type of the first node is determined.

2. The method according to claim 1, characterized in that, Before determining the node type of the first node, the method further includes: Set the node type of the nodes in the first network to a preset node type, wherein the nodes include the first node and the second node.

3. The method according to claim 2, characterized in that, The node type of the second node includes the preset node type or the updated node type; the updated node type is the node type determined after updating the preset node type.

4. The method according to claim 2, characterized in that, The step of determining the node type of the first node based on the attribute information of the second node adjacent to the first node in the first network includes: Based on the attribute information of the second node adjacent to the first node, the type of node to which the first node is to be updated is determined.

5. The method according to claim 4, characterized in that, The preset node type is the type of the loop node, and the second node adjacent to the first node includes: the node whose update node type is the type of the link node.

6. The method according to claim 5, characterized in that, The method further includes: In response to the fact that the number of nodes adjacent to the second node is a single one, the updated node type of the second node is determined to be the type of the link node.

7. The method according to claim 1, characterized in that, Determining the node type of the first node based on the feature information and the node type of the second node includes: For the first node whose feature information is the second quantity feature, determine whether there is a link node among the second nodes adjacent to the first node; In response to determining that a link node exists in the second node, the node type of the first node is determined to be the type of the link node.

8. The method according to claim 1, characterized in that, Determining the node type of the first node based on the feature information and the node type of the second node includes: Based on the feature information and the number of first preset nodes in the second node, the node type of the first node is determined; wherein, the preset nodes include nodes whose node type is the type of the loop node and / or whose node type is the type of the root node.

9. The method according to claim 8, characterized in that, Determining the node type of the first node based on the feature information and the number of the first preset nodes in the second node includes: For the first node whose feature information is the second quantity feature, determine whether the number of the first preset nodes is less than a quantity threshold; In response to determining that the number of the first preset nodes is less than the number threshold, the node type of the first node is determined to be the type of the link node; or, in response to determining that the number of the first preset nodes is greater than the number threshold, the node type of the first node is determined to be the type of the root node.

10. The method according to claim 1, characterized in that, The method further includes: The first quantity, the second quantity, and the third quantity are determined respectively; wherein, the first quantity is the number of nodes in the first network whose node type is the link node; the second quantity is the number of nodes in the first network whose node type is the loop node; and the third quantity is the number of nodes in the first network whose node type is the root node. Determining the topology of a node in the first network based on the node type includes: In response to the fact that the values ​​of the first quantity, the second quantity, and the third quantity have not changed within a predetermined time, the topology is determined based on the node type.

11. The method according to claim 1, characterized in that, Determining the topology of a node in the first network based on the node type includes: Based on the first preset node in the first network, the loop structure is determined; wherein, the first preset node includes a node of type loop node and a node of type root node; And / or, The link structure is determined based on the second preset node in the first network; wherein the second preset node includes a node whose node type is the type of the link node and / or a node whose node type is the type of the root node.

12. The method according to claim 11, characterized in that, The link structure is used to access devices located outside the first network; the loop structure includes at least one of the following: a first loop structure, which is used to access devices located outside the first network; and a second loop structure, which is used to aggregate data transmitted by nodes in the first loop structure.

13. The method according to claim 12, characterized in that, Determining the loop structure based on the first preset node in the first network includes: A predetermined number of endpoint node sets are determined from the first preset nodes; wherein, the endpoint node set includes two endpoint nodes used to determine the loop structure; Determine the loop structure corresponding to the endpoint node set; wherein, the loop structure includes the structure of the loop in which two endpoint nodes in the endpoint node set are located.

14. The method according to claim 13, characterized in that, The method further includes: A first set of endpoint nodes is determined from the predetermined number of endpoint nodes; wherein the first set of endpoint nodes includes two endpoint nodes adjacent to a third node; the third node is a node in the first preset node; and the number of nodes adjacent to the third node is two. Determining the loop structure corresponding to the endpoint node set includes: The loop structure in which the endpoint nodes in the first set of endpoint nodes and the third node are located is defined as the first loop structure.

15. The method according to claim 13, characterized in that, The method further includes: A second set of endpoint nodes is determined from the predetermined number of endpoint node sets; wherein the second set of endpoint nodes includes a first endpoint node and a second endpoint node; the number of nodes adjacent to the first endpoint node is multiple, and the number of nodes adjacent to the second endpoint node is two; Determining the loop structure corresponding to the endpoint node set includes: The loop structure in which the endpoint nodes in the second set of endpoint nodes are located is determined to be the first loop structure.

16. The method according to claim 13, characterized in that, The method further includes: A third set of endpoint nodes is determined from the predetermined number of endpoint node sets; wherein, the number of nodes adjacent to the endpoint nodes in the third set of endpoint nodes is multiple; Determining the loop structure corresponding to the endpoint node set includes: The loop structure in which the endpoint nodes in the third set of endpoint nodes are located is determined to be the second loop structure.

17. A device for determining a topology, characterized in that, The device includes: The determining module is configured to: determine the node type of the first node based on the attribute information of a second node adjacent to the first node in the first network; wherein the attribute information includes the node type and number of the second node, and the node type includes one of the following: link node type, loop node type, and root node type; and determine the topology to which the node in the first network belongs based on the node type, wherein the topology includes a loop structure and / or a link structure; wherein the topology is used for path planning of data transmission. The determining module is further configured to determine the feature information of the first node based on the number of second nodes adjacent to the first node; wherein the feature information includes a first quantity feature and / or a second quantity feature; the first quantity feature is used to indicate that the number of second nodes adjacent to the first node is two; the second quantity feature is used to indicate that the number of second nodes adjacent to the first node is multiple; and the node type of the first node is determined based on the feature information and the node type of the second node.

18. A processing apparatus, characterized in that, The processing equipment includes: Memory, used to store executable programs; A processor, when executing an executable program stored in the memory, implements the method as described in any one of claims 1 to 16.

19. A computer storage medium, characterized in that, The computer storage medium stores an executable program, which, when executed by a processor, implements the method as described in any one of claims 1 to 16.

Images