WO2022253073A1

WO2022253073A1 - Ring network resource obtaining method, and data traffic statistics method, apparatus and device

Info

Publication number: WO2022253073A1
Application number: PCT/CN2022/094987
Authority: WO
Inventors: 苏春阳; 陆钱春; 齐进
Original assignee: 中兴通讯股份有限公司
Priority date: 2021-06-04
Filing date: 2022-05-25
Publication date: 2022-12-08
Also published as: CN115442245A

Abstract

The present application provides a ring network resource obtaining method, and a data traffic statistics method, apparatus and device. The ring network resource obtaining method comprises: processing obtained connection link information between network element nodes according to a preset path algorithm, and determining a ring system to which the network element nodes belong; and determining ring network resources according to obtained attribute information of the network element nodes and the ring system to which the network element nodes belong, the ring network resources representing resources of the ring system in a network.

Description

Ring network resource acquisition method, data traffic statistics method, device and equipment

Cross References to Related Applications

This application claims priority to Patent Application No. 202110623783.9 filed with the China Patent Office on June 4, 2021, the entire contents of which are hereby incorporated by reference.

technical field

This application relates to but not limited to the field of communication technology.

Background technique

In the process of analyzing the network performance of the communication network and integrating resources, since the configuration of the communication network by the operator's server is constantly changing, these changes may affect the level of the communication network to which each network element device belongs, and each network element device resource information etc.

If the networking environment of the operator's network changes, the operation and maintenance personnel cannot clearly know the affiliation relationship between each network element node and the resource information between each network element node, resulting in the inability to plan the resources in the communication network uniformly, reducing the improve the utilization efficiency of network resources.

Contents of the invention

The present application provides a method for acquiring ring network resources, a data flow statistics method, a device and equipment.

The present application provides a method for acquiring ring network resources, including: processing the obtained connection link information between network element nodes according to a preset path algorithm, and determining the ring system to which the network element node belongs; according to the obtained The attribute information of the network element node and the ring system to which the network element node belongs determine the ring network resource, and the ring network resource represents the resource of the ring system in the network.

This application provides a data flow statistics method, including: adopting any ring network resource acquisition method in this application to obtain ring network resources; according to the ring network resources, counting the data flow of each ring system in the network.

The present application provides a device for obtaining ring network resources, which includes: a ring system confirmation module configured to process the obtained connection link information between network element nodes according to a preset path algorithm, and determine the network element nodes The ring system to which it belongs; the ring network resource determining module, configured to determine the ring network resources according to the acquired attribute information of the network element node and the ring system to which the network element node belongs, and the ring network resources represent the resources of the ring system in the network.

The present application provides a data traffic statistics device, which includes: an acquisition module configured to acquire ring network resources by using any method for acquiring ring network resources in the present application; a statistical module configured to, according to the ring network resources, Collect statistics on the data traffic of each ring system in the network.

The present application provides a network management device, including: any device for acquiring ring network resources in the present application, and/or any data traffic statistics device in the present application.

The present application provides an electronic device, including: one or more processors; memory, on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, one or more The processor implements any method for acquiring ring network resources in this application, or implements any method for counting data traffic in this application.

The present application provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, any method for acquiring ring network resources in this application is realized, or any method in this application is realized. A data traffic statistics method.

Description of drawings

FIG. 1 shows a schematic diagram of the layered structure of the network topology in this application.

FIG. 2 shows a schematic flowchart of a method for acquiring ring network resources provided by the present application.

FIG. 3 shows a schematic flowchart of a method for acquiring ring network resources provided by the present application.

FIG. 4 shows a schematic flow chart of the method for counting data traffic provided by the present application.

FIG. 5 shows a structural diagram of a device for acquiring ring network resources provided by the present application.

FIG. 6 shows a structural diagram of the data traffic statistics device provided by the present application.

FIG. 7 shows a structural diagram of the network management equipment provided by the present application.

FIG. 8 shows a structural diagram of a system for acquiring ring network resources provided by the present application.

Fig. 9 shows a schematic flow chart of the derivation method of the ring system provided by the present application.

FIG. 10 shows a schematic diagram of the network topology of the network element nodes attached to the ring system provided by the present application.

FIG. 11 shows a schematic flowchart of a method for counting all network element nodes attached to a convergence ring system provided by the present application.

Fig. 12 shows a structural diagram of an exemplary hardware architecture of a computing device capable of implementing the method for acquiring ring network resources and the device thereof, or the method for counting data traffic and the device thereof according to the present application.

Detailed ways

In order to make the purpose, technical solution and advantages of the present application clearer, the implementation manner of the present application will be described in detail below in conjunction with the accompanying drawings. It should be noted that, in the case of no conflict, the implementation modes and the features in the implementation modes in the present application can be combined arbitrarily with each other.

FIG. 1 shows a schematic diagram of the layered structure of the network topology in this application. The hierarchical structure of network topology usually includes core ring system, aggregation ring system and access ring system. As shown in Figure 1, the core ring system is a closed-loop system. The core ring system includes: node A, node B, node C, node D, node E, and node F, as well as links between the above nodes; the aggregation ring system is An open-loop system, the converging ring system includes node G and node H, and a link between node E and node G, a link between node G and node H, and a link between node F and node H; The ring-entry system includes the following nodes and links between the following nodes: node I, node M, node L, node Q, node J, node K, node O, node P, node R, node S, node T, node U, Node V, Node X, Node W, Node Z, and Node Y. The core ring system, the aggregation ring system and the access ring system form an upper and lower layer relationship. It should be noted that, as a composite resource entity, the ring system includes basic resources such as network element nodes and links between nodes, and presents a network structure composed of network elements and links in the network management topology.

If the networking environment of the operator's network changes, these changes may affect the network layer it belongs to or the resources corresponding to the included network element nodes. Operation and maintenance personnel need to identify the corresponding change information from the network topology, and manually enter these change information into the ring system resource management function module of the network management device, which not only consumes human resources, but also cannot guarantee the correctness of the network topology changes . Moreover, the operation and maintenance personnel cannot quickly and accurately know the affiliation relationship between each network element node and the resource information between each network element node, resulting in the inability to uniformly plan the resources in the communication network and reducing the utilization efficiency of network resources . How to quickly and accurately identify ring network resources has become an urgent problem to be solved.

FIG. 2 shows a schematic flowchart of a method for acquiring ring network resources provided by the present application. The method for obtaining ring network resources can be applied to a device for obtaining ring network resources, and the device for obtaining ring network resources can be set in a network management device. As shown in FIG. 2 , the method for acquiring ring network resources in this application may include the following steps S201 and S202.

In step S201, the obtained connection link information between network element nodes is processed according to a preset path algorithm, and the ring system to which the network element nodes belong is determined.

Wherein, the preset path algorithm may be a link exclusion algorithm. The link exclusion algorithm is to select any determined link, and use the network element nodes at both ends of the link as the starting point and the end point of the path calculation. The method of performing calculations on the links between them. Since there may be many different transmission paths between the start point and the end point, the division algorithm of the ring system may also be diversified. The preset path algorithm may also include: a shortest path algorithm or a longest path algorithm. Wherein, the shortest path algorithm is an algorithm for calculating the minimum hop path between two network element nodes (that is, the number of network element nodes included in the path is the least), for example, the minimum link algorithm may be Dijkstra (Dijkstra) algorithm , Bellman-Ford (Bellman-Ford) algorithm, Floyd (Floyd) algorithm and shortest path fast algorithm (Shortest Path Faster Algorithm, SPFA) in any one or more. The longest path algorithm is an algorithm for calculating the longest path between two network element nodes. For example, find all transmission paths between two network element nodes, and then use a recursive method to find the longest path among all transmission paths. long transmission path. It should be noted that the preset path algorithm above is only an example, and can be set according to the actual situation. Other unexplained preset path algorithms are also within the scope of protection of this application, and will not be repeated here. .

In step S202, ring network resources are determined according to the acquired attribute information of the network element node and the ring system to which the network element node belongs.

Wherein, the ring network resources represent the resources of the ring system in the network. For example, ring network resources may include attribute information of network element nodes in a certain ring system, link connection information between network element nodes in the ring system, etc., wherein the attribute information of network element nodes may include network Any one or more of the identity of the element node, the parent node information of the network element node, and the child node information of the network element node. By identifying the ring network resources of different ring systems, it is convenient for the operation and maintenance personnel to manage each network element node in the network, and the operation and maintenance times of the operation and maintenance personnel are reduced.

In this embodiment, the obtained connection link information between network element nodes is processed through a preset path algorithm, and the ring system to which each network element node belongs can be quickly identified; according to the attribute information of the network element nodes and The ring system to which the network element node belongs determines the ring network resources, so that the operation and maintenance personnel can clearly know the ring network resources of each different ring system, which facilitates the management of each network element node in the network, reduces the number of operation and maintenance of the operation and maintenance personnel, and, According to the ring network resources, the operation and maintenance personnel can realize the unified planning of the resources in the network and improve the utilization efficiency of the ring network resources.

FIG. 3 shows a schematic flowchart of a method for acquiring ring network resources provided by the present application. As shown in FIG. 3 , the method for obtaining ring network resources can be applied to a device for obtaining ring network resources, and the device for obtaining ring network resources can be set in a network management device. As shown in FIG. 3 , the method for acquiring ring network resources in this application may include the following steps S301 to S304.

In step S301, when it is determined that the node type of the network element node is a core network node, it is determined that the ring system to which the core network node belongs is the first layer ring system, and the link between the core network nodes is marked as the first layer ring system Core network link.

Wherein, the attribute information of the network element node includes the node type. The node type may include any one or more of core network nodes, aggregation nodes and access nodes. If the network is divided into N layers, the node types of network element nodes can be nodes in the ring system of the first layer, nodes in the ring system of the second layer, ..., nodes in the ring system of the Nth layer, and N is greater than or An integer equal to 1.

Because there is only one core ring system in a city-level network topology diagram, when the node type of the network element node is determined to be a core network node, each core network node and the link between each core network node can be Roads are divided into core ring systems. In order to facilitate the division of other layer ring systems, the first layer ring system (that is, the core ring system) is determined as a closed-loop system.

In step S302, when it is determined that the node type of the network element node is not a core network node, a candidate link set is acquired.

It should be noted that the node type of the network element node corresponding to the candidate link in the candidate link set may be a convergence node or an access node, or a node in the second layer ring system, or a node in the third layer ring system. Any type of node, ..., node in the N-th layer ring system.

By obtaining the candidate link set, it is possible to conveniently process other network element nodes except the core network node, and determine the ring system to which the other network element nodes except the core network node belong.

In step S303, the candidate link information in the candidate link set is processed according to a preset path algorithm to determine the ring system to which the network element node belongs.

Wherein, the candidate link information may include any one or more of: the node type of the starting network element node corresponding to the candidate link, the node type of the terminating network element node corresponding to the candidate link, and the direction of the candidate link. Through the preset path algorithm to process the candidate link information in the candidate link set, the connection form between each network element node can be known, and then the ring system to which the network element node belongs can be determined, and the processing speed of the network element node can be accelerated. . The operation and maintenance personnel can quickly obtain the ring system to which each network element node belongs, and improve the management efficiency of network element nodes.

In step S304, ring network resources are determined according to the acquired attribute information of the network element node and the ring system to which the network element node belongs.

It should be noted that step S304 in this embodiment is the same as step S202 in the previous embodiment, and will not be repeated here.

In this embodiment, by determining that the node type of the network element node is a core network node, it is determined that the ring system to which the core network node belongs is the first layer ring system, which facilitates subsequent division of other layer ring systems; When the node type of the meta node is not a core network node, the candidate link set is obtained, and the candidate link set is obtained by screening, which can narrow the identification range, and further deduce the ring system for each candidate link in the candidate link set , to speed up the recognition speed of the ring system; according to the preset path algorithm, the candidate link information in the candidate link set is processed to determine the ring system to which the network element node belongs, so that it is convenient for the operation and maintenance personnel to identify the network elements in the corresponding ring system Nodes are managed to improve the management efficiency of network element nodes. According to the obtained attribute information of the network element node and the ring system to which the network element node belongs, the ring network resources are determined, and the resources in the network are planned uniformly through the ring network resources, so as to improve resource utilization efficiency.

In some exemplary embodiments, before marking the links between the core network nodes as the core network links in the first layer ring system, the method further includes: obtaining a set of core network links; The core network links in the core network link set are processed to determine the connection form of the core network links in the core network link set; according to the connection form of the core network links in the core network link set, determine whether to A virtual link is added between the core network nodes, and the virtual link is used to make the first-layer ring system form a connected body.

Wherein, the connected body means that there is a link between any two network element nodes in the slave ring system. A virtual link is a logical connection channel established between any two network element nodes, rather than an actual physical channel. By adding a virtual link between two core network nodes, the core ring system is transformed into a complete connected body, which facilitates the derivation of subsequent ring systems.

In some exemplary embodiments, processing the candidate link information in the candidate link set according to a preset path algorithm to determine the ring system to which the network element node belongs includes: according to the preset path algorithm and the obtained upper The outbound network element node of the layer-1 ring system screens the candidate links in the candidate link set to obtain the pending link set, and determines the connection form of the pending link set in the pending link set. The set of processing links includes k links to be processed, and k is an integer greater than or equal to 1; according to the connection form of the links to be processed in the set of links to be processed, determine the member nodes of the current ring system; determine the number of nodes in the current ring system Level value, and mark the level value of the ring system to which the member nodes of the current ring system belong is the level value of the current ring system; update the candidate link set according to the links between the member nodes of the current ring system; according to the preset path The algorithm and the outgoing network element nodes of the current ring system process the candidate link information in the updated candidate link set to determine the ring system to which the network element nodes in the updated candidate link set belong.

The candidate links in the candidate link set may be links that are not marked as core network links, or may be unmarked links corresponding to outgoing network element nodes of the upper ring system. The outbound network element nodes of the upper ring system represent the network element nodes connected to the upper ring system in the current ring system. For example, as shown in Figure 1, because node E and node F are connected to the core ring system of the upper layer and the current aggregation ring system at the same time, node E and node F can be called the outbound network elements of the core ring system node.

Filter the candidate links in the candidate link set through the preset path algorithm and the obtained outbound network element nodes of the upper layer ring system, and further filter the candidate links in the pending link set Process processing of links to be processed, determine the current ring system, and after completing the derivation of the current ring system, update the candidate link set according to the links between the member nodes of the current ring system, so that the updated candidate link set The number of candidate links is reduced, the processing range is further reduced, and the derivation speed of the next layer ring system is accelerated. By cyclically processing the candidate links in the updated candidate link set, the ring system to which each network element node belongs can be known, so that the operation and maintenance personnel can quickly identify the hierarchical results and connections between each network element node relationship, which facilitates the processing and maintenance of network element nodes, and improves the management efficiency of network element nodes.

In some exemplary implementations, according to the connection form of links to be processed in the set of links to be processed, determining the member nodes of the current ring system includes: determining that the link to be processed in the set of links to be processed is a ring In the case of connection in the form of , it is determined that the member nodes of the current ring system include the network element nodes corresponding to the links to be processed in the link set to be processed; In the case of connection, obtain all network element nodes attached to the link to be processed, and use the network element node corresponding to the link to be processed in the link set to be processed and all network element nodes connected to the link to be processed as Member nodes of the current ring system.

Among them, when it is determined that the links to be processed in the set of links to be processed are connected in the form of a ring, the links to be processed in the set of links to be processed can form a closed ring structure, which is convenient for confirming the ring. The outbound network element nodes of the system speed up the derivation of the next layer ring system. In the case that it is determined that the links to be processed in the set of links to be processed are connected in the form of chains, it indicates that the links to be processed in the set of links to be processed cannot form a closed loop, and the links in the set of links to be processed cannot form a closed loop. The link to be processed may be at the edge of the network. By obtaining all the network element nodes attached to the link to be processed, the network element nodes corresponding to the link to be processed in the set of links to be processed and all Network element nodes, as member nodes of the current ring system, can complete the ring system to which network element nodes at the edge of the network belong, avoid missing edge nodes, and ensure the integrity of the ring system.

In some exemplary embodiments, updating the candidate link set according to the links between the member nodes of the current ring system includes: deleting the links between the member nodes of the current ring system from the candidate link set to obtain The updated set of candidate links.

Among them, after the current ring system is determined, the links between the member nodes of the current ring system can be marked to clarify the links that have been processed; and then these marked links of the current ring system can be deleted from the candidate link set. Links between member nodes can further narrow the range of candidate links, speed up the processing of remaining candidate links, and avoid repeated processing of candidate links.

In some exemplary embodiments, after updating the set of candidate links according to the links between the member nodes of the current ring system, the method further includes: marking the upper ring system as the parent ring system of the current ring system; Determine parent ring information of the current ring system; wherein, the parent ring information of the current ring system includes an identifier of the parent ring system.

Among them, the parent ring information is used to represent the parent-child relationship between the current ring system and the upper ring system, and the child ring system can quickly find its parent ring system through the identification of the parent ring system. It is more clear and convenient for operators to manage network element nodes.

In some exemplary embodiments, determining the parent ring information of the current ring system includes: determining that the current ring system accesses different parent ring systems, determining that there are multiple parent ring systems in the current ring system; recording the current ring system Parent ring information of multiple parent ring systems.

Among them, the current ring system can have at most two parent ring systems. When it is determined that the current ring system has two parent ring systems, the parent ring information of the two parent ring systems needs to be recorded in the parent ring information of the current ring system .

For example, as shown in Figure 1, since the outbound node K and the outbound node O are connected to two different third-level ring systems, the fourth-level ring system corresponding to the outbound node K has two parent ring systems . It is necessary to record the parent ring information corresponding to the two parent ring systems, so as to facilitate the subsequent search of ring network resources.

In some exemplary implementations, determining the level value of the current ring system includes: determining the level value of the current ring system according to the bucket theory and node types of member nodes of the current ring system.

Among them, the barrel theory shows that how much water a barrel can hold does not depend on the tallest piece of wood on the barrel wall, but on the shortest piece of wood on the barrel wall.

Screen the node types of the member nodes of the current ring system through the barrel theory, so that the determined level value of the current ring system can be lower than the level value of the ring system of the previous layer, and ensure that the ring systems of each layer are the upper and lower levels The relationship is clear, which facilitates the management and maintenance of the ring systems of each layer.

In some exemplary embodiments, determining the level value of the current ring system according to the barrel theory and the node types of the member nodes of the current ring system includes: comparing the node types of each member node in the current ring system to obtain a comparison result; According to the barrel theory and comparison results, determine the level value of the current ring system.

Wherein, there may be multiple node types of the member nodes of the current ring system. For example, the node types of the current ring system include sink nodes and access nodes. Because the level value of the access node is smaller than the level value of the sink node, according to the barrel theory, the level value of the current ring system is determined by the level value corresponding to the access node Sure.

Avoid the phenomenon that the level value of the current ring system is greater than the level value of the upper ring system, ensure that the upper-lower relationship between the ring systems of each layer is clear, speed up the derivation of the ring system, and facilitate the management of operation and maintenance personnel.

In some exemplary embodiments, the current loop system is an open loop system.

It should be noted that the open-loop system means that the current loop system does not include the marked links and network element nodes in the upper-level ring system of the current loop system.

For example, as shown in Figure 1, the convergence ring system is an open-loop system, and the convergence ring system includes node G and node H, and the link between node E and node G, the link between node G and node H, The link between node F and node H. But the convergence ring system does not include node E and node F, and the link between node E and node F, because both node E and node F are already marked in the upper layer ring system (ie, the core ring system) network element node, and the link between node E and node F is also a marked link in the core ring system.

Using an open-loop system to represent the current ring system can avoid duplication of the ring systems to which network element nodes belong, avoid confusion among network element nodes, and facilitate management by operation and maintenance personnel.

In some exemplary implementations, after the core ring system and aggregation ring system in FIG. 1 are determined, the access ring system may be further divided. As shown in Figure 1, each link in the aggregation ring system is connected in the form of a ring, and the outbound network element nodes of the aggregation ring system include: node G and node H. According to the minimum link algorithm, the unmarked links corresponding to node G are first screened to obtain the first candidate link set, which includes: the link between node G and node I, The link between node I and node J, the link between node J and node K, the link between node K and node L, and the link between node L and node H. Similarly, the unmarked links corresponding to node H are screened to obtain a second set of candidate links, the second set of candidate links includes: the link between node G and node M, the link between node M and A link between nodes O, a link between node O and node P, a link between node P and node Q, and a link between node Q and node H.

If the core ring system is used as the first layer ring system and the aggregation ring system is used as the second layer ring system, then the ring system corresponding to the first candidate link set is the third layer ring system. Then the ring system corresponding to the second candidate link set is also a layer-3 ring system.

Further, proceed to the derivation of the next layer ring system for the outbound nodes of the third layer ring system (i.e. node J, node K, node O and node P), because through the calculation of the minimum link algorithm, it can be known that node J’s The hanging nodes include: node R, node S and node T, and the connection mode between node R, node S and node T and node J is connected in the form of a chain, so it can be seen that the fourth node corresponding to the outgoing edge node J The layer ring system includes: node R, node S and node T, and the link between node J and node R, the link between node R and node S, the link between node S and node T and node T link with node R.

With the same calculation method, it can be seen that the fourth-layer ring system corresponding to the outbound node K includes: node U, node V, node W, and node X, as well as the link between node K and node U, and the link between node U and node V. The link between node V and node W, the link between node W and node X, and the link between node X and node O.

It can be seen that the fourth layer ring system corresponding to the outbound node O and the outbound node P includes: node X, node W, node Y and node Z, as well as the link between node O and node X, and the link between node X and node W The link between node W and node Y, the link between node Y and node Z, and the link between node Z and node P.

In this embodiment, by further dividing the access ring system, the ring network resources included in the ring systems of each layer are clarified, so that the operation and maintenance personnel can clearly know the ring network resources of each different ring system, and it is convenient to Each network element node is managed to reduce the operation and maintenance times of the operation and maintenance personnel, and the operation and maintenance personnel can realize the unified planning of the resources in the network according to the ring network resources, and improve the utilization efficiency of the ring network resources.

FIG. 4 shows a schematic flow chart of the method for counting data traffic provided by the present application. The data flow counting method can be applied to a data flow counting device, and the data flow counting device can be set in a network management device. As shown in FIG. 4, the data traffic statistics method in this application may include the following steps S401 and S402.

In step S401, adopt any method for acquiring ring network resources in the embodiments of the present application to acquire ring network resources.

The ring network resources include attribute information of network element nodes in a certain ring system, link connection information between network element nodes in the ring system, and the like.

The attribute information of the network element node may include any one or more of the identifier of the network element node, the parent node information of the network element node, and the child node information of the network element node. By identifying the ring network resources of different ring systems, it is convenient for the operation and maintenance personnel to manage each network element node in the network, and the operation and maintenance times of the operation and maintenance personnel are reduced.

In step S402, according to the ring network resources, the data traffic of each ring system in the network is counted.

Wherein, the data traffic of the ring system includes: data traffic corresponding to all member nodes in the ring system.

Through the statistics of the data traffic of each ring system, it is possible to clarify the data traffic currently processed by the ring systems of each layer in the network, and to confirm whether there is any overloading of the ring systems of each layer. The data flow can be adjusted in time for the ring system to balance the use of resources and avoid waste of resources.

In some exemplary embodiments, according to the ring network resources, counting the data traffic of each ring system in the network includes: based on the ring network resources, obtaining the number of network element nodes and the attributes of the network element nodes in the m-th layer ring system information, m is an integer greater than or equal to 1; according to the number of network element nodes in the m-th layer ring system and the attribute information of the network element nodes, the data flow statistics are performed on each network element node in the m-th layer ring system, Obtain the data traffic of the m-th layer ring system.

It should be noted that the number of network element nodes in each ring system is different, and different network element nodes will also affect the data flow used by them due to their different attribute information.

According to the number of network element nodes and the attribute information of the network element nodes in the m-layer ring system, the statistics of the data flow of each network element node in the m-layer ring system can be carried out for each different network element in the m-layer ring system. Statistics are performed on the network element nodes to ensure the accuracy of the data flow obtained by the statistics. Furthermore, since m is an integer greater than or equal to 1, the data traffic of all ring systems in the network can be counted sequentially to clarify the distribution of data traffic in each layer of the ring system in the network, and to avoid excessive pressure on a certain layer of ring systems , which is convenient for operators to make timely adjustments to the ring system and improve the utilization rate of network resources.

In this embodiment, by using any one of the ring network resource acquisition methods in the embodiments of the present application, the ring network resources can be obtained, and different network element nodes can be reasonably divided, and the ring system to which each network node belongs can be determined, and then Make the operation and maintenance personnel clearly know the ring network resources of different ring systems, facilitate the management of each network element node in the network, and reduce the operation and maintenance times of the operation and maintenance personnel; Statistics of the data traffic, avoiding network congestion, and realizing unified planning of resources in the network.

In some exemplary implementations, the data traffic statistics method further includes: when it is determined that there are two parent ring systems in the m-th layer ring system, respectively acquiring the network elements attached to the first parent ring system of the m-th layer ring system The node set and the network element node set attached to the second parent ring system; according to the network element node set attached to the first parent ring system and the network element node set attached to the second parent ring system, the overlapping network element nodes are determined; The data flow of the overlapping network element nodes is counted to obtain the overlapping data flow; the overlapping data flow is equally divided.

Wherein, the data traffic corresponding to the overlapping network element nodes may belong to the data traffic corresponding to the first parent ring system, or may belong to the data traffic corresponding to the second parent ring system. The overlapping data traffic is obtained by counting the data traffic of the overlapping network element nodes; the overlapping data traffic is equally divided into two parent ring systems, which can ensure the fairness of data traffic division.

For example, as shown in Figure 1, since the outbound node K and the outbound node O are connected to two different third-level ring systems, the fourth-level ring system corresponding to the outbound node K has two parent ring systems (that is, the first parent ring system and the second parent ring system), and there are overlapping network element nodes between the network element node set attached to the first parent ring system and the network element node set attached to the second parent ring system, That is, overlapping network element nodes (ie, network element node X and network element node W) between the fourth layer ring system corresponding to the outgoing edge node K and the fourth layer ring system corresponding to the outgoing edge node O. Therefore, it is necessary to equally divide the data traffic of the network element node X and the data traffic of the network element node W obtained through statistics, so as to ensure the fairness of data traffic division.

FIG. 5 shows a structural diagram of a device for acquiring ring network resources provided by the present application. As shown in Figure 5. The device for obtaining ring network resources includes the following modules: a ring system confirmation module 501 configured to process the obtained connection link information between network element nodes according to a preset path algorithm, and determine the ring to which the network element node belongs The system; the ring network resource determination module 502 is configured to determine the ring network resources according to the obtained attribute information of the network element node and the ring system to which the network element node belongs, and the ring network resources represent the resources of the ring system in the network.

In this embodiment, the ring system confirmation module processes the obtained connection link information between network element nodes according to the preset path algorithm, and can quickly identify the ring system to which each network element node belongs; using the ring network The resource determination module determines the ring network resources according to the attribute information of the network element node and the ring system to which the network element node belongs, so that the operation and maintenance personnel can clearly know the ring network resources of each different ring system, and facilitate the management of each network element node in the network. The operation and maintenance times of the operation and maintenance personnel are reduced, and the operation and maintenance personnel can realize the unified planning of the resources in the network according to the ring network resources, and improve the utilization efficiency of the ring network resources.

FIG. 6 shows a structural diagram of the data traffic statistics device provided by the present application. As shown in Figure 6. The data traffic statistics device includes the following modules: an acquisition module 601 configured to acquire ring network resources by using any method for acquiring ring network resources in the embodiments of the present application; a statistical module 602 configured to, according to the ring network resources, Collect statistics on the data traffic of each ring system in the network.

In this embodiment, the acquisition module uses any one of the ring network resource acquisition methods in the embodiments of the present application to obtain ring network resources, which can reasonably divide different network element nodes and determine the ring to which each network node belongs. System, so that the operation and maintenance personnel can clearly know the ring network resources of different ring systems, facilitate the management of each network element node in the network, and reduce the operation and maintenance times of the operation and maintenance personnel; use the statistics module to realize the network resources according to the ring network resources. In it, the data flow of each ring system is counted to avoid network congestion and realize unified planning of resources in the network.

FIG. 7 shows a structural diagram of the network management equipment provided by the present application. As shown in Figure 7. The network management device 700 includes the following devices: any one of the ring network resource acquisition devices 701 in the embodiments of the present application, and/or any one of the data traffic statistics devices 702 in the embodiments of the present application.

In this embodiment, by using any one of the ring network resource acquisition devices in the embodiments of the present application, the ring network resources can be obtained, different network element nodes can be reasonably divided, and the ring system to which each network node belongs can be determined, and then Make the operation and maintenance personnel clearly know the ring network resources of each different ring system, facilitate the management of each network element node in the network, and reduce the operation and maintenance times of the operation and maintenance personnel; use any data flow statistics device in the implementation mode of this application According to the ring network resources, it can realize the statistics of the data flow of each ring system in the network, avoid data loss caused by network congestion, delay increase and throughput decrease, etc. Resources are planned in a unified manner.

FIG. 8 shows a structural diagram of a system for acquiring ring network resources provided by the present application. As shown in Figure 8. The system for obtaining ring network resources includes the following modules: a user network interface management entity 810 , an algorithm module 820 , a data analysis system 830 and a path calculation unit 840 .

Wherein, the user network interface management entity 810: is configured to obtain information of each network element node in the network (for example, the information of the network element node includes the prefecture-level city information to which the network element node belongs, the level information corresponding to the network element node, etc.), According to the information of each network element node, a network topology map is generated. Then, the algorithm module 820 is called to perform algorithm derivation, and the derivation result is obtained and saved. When the network topology changes, the user network interface management entity 810 can also automatically call the algorithm module 820 to deduce the ring system, and obtain the latest ring network resources by adjusting the change information of the front and rear ring systems.

Data analysis system 830: configured to collect statistics on traffic data in the network. For example, the data flow information of each network element node in each ring system is counted by taking each ring system as a unit, and the statistical results are recorded to facilitate the viewing of operation and maintenance personnel.

The path calculation unit 840 is configured to use the ring network resources in the ring system to prune links of different scales in the ring system, so as to speed up the path calculation speed of the path calculation unit.

The algorithm module 820 includes: a ring system derivation submodule 821 and a ring relationship identification submodule 822 .

Among them, the ring system derivation sub-module 821 is configured to deduce the relationship between the ring systems of each layer, and determine the parent-child relationship between the ring systems of each layer. From the macro level, the ring system can be divided into: core ring system, convergence ring system and access ring system. Since the core ring system is the highest level ring system, the core ring system has no parent ring system. Moreover, a low-level ring system cannot serve as a parent ring system for a high-level ring system. For example, the parent ring system of the aggregation ring can only be the core ring system or the aggregation ring system, while the parent ring system of the access ring system can be any one of the access ring system, aggregation ring system, and core ring system. From the microscopic level, there may be multiple ring systems between the aggregation ring system and the access ring system, and in the ring systems at the same level, there is still the situation that one ring system is connected to another ring system.

It should be noted that if the two ends of ring system A connected to the upper ring system are the same ring system (for example, ring system B), then the ring system B is the parent ring system of system A, and ring A The system has only one parent ring system. If the two ends of the A ring system are connected to different ring systems (for example, connected to the C ring system and the D ring system at the same time), then there are two parent ring systems of the A ring system at this time (that is, A The parent ring systems of the ring system include: the C ring system and the D ring system), and the information of the C ring system and the D ring system need to be stored in the A ring system as the parent ring information of the A ring system. Except for the core ring system, each ring system needs to record the information of its parent ring system.

Wherein, the network element node of the sub-ring system connected to the parent ring system is the access node of the sub-ring system, and the network element node of the parent ring system connected to the sub-ring system is the uplink node of the sub-ring system.

The ring relationship identification sub-module 822 is configured to identify the ring system of the incoming network topology, and fill in the corresponding information of the ring system (for example, the information of the ring system of a certain layer includes: the type of the ring system, the level of the ring system, Any one or more of the member nodes of the ring system, the uplink nodes of the ring system, and the access nodes of the ring system). The ring system derivation sub-module 821 is configured to derive the parent-child relationship between ring systems at different levels, and acquire and fill in the parent ring information of the corresponding ring system.

In an exemplary implementation, the ring relationship identification submodule 822 may adopt a ring system identification method based on a link exclusion algorithm. Among them, the link exclusion algorithm is a method for calculating the link between the starting point and the ending point by selecting any determined link, using the network element nodes at both ends of the link as the starting point and the ending point of path calculation. Since there may be many different transmission paths between the start point and the end point, the division algorithm of the ring system may also be diversified.

For example, the minimum link algorithm (for example, Dijkstra algorithm, Bellman-Ford algorithm, Floyd algorithm and SPFA algorithm, etc.) can be used to calculate the minimum hop path between two network element nodes (that is, the number of network element nodes included in the path minimum), the ring system determined by the minimum hop path is the smallest ring system formed by the network element nodes. It is also possible to use the longest path algorithm to calculate the longest path algorithm between two network element nodes, for example, to find out all transmission paths between two network element nodes, and then use a recursive method in all transmission paths Find the longest transmission path and determine the longest transmission path as a ring system. In an exemplary embodiment, the longest path algorithm may also calculate a transmission path with the longest survival time between two network element nodes, and the maximum survival time of each transmission path is determined by the minimum survival time of the transmission path Which side to decide. The link exclusion algorithm above is just an example, which can be set according to the actual situation. Other unexplained link exclusion algorithms are also within the scope of protection of this application, and will not be repeated here.

For example, there is only one core ring system in a city-level network topology diagram. Therefore, each core network node above the aggregation layer and links between core network nodes can be divided into core ring systems. The aggregation ring system and the access ring system are determined through the link exclusion algorithm, but the aggregation ring system and the access ring system are both open-loop systems, that is, the core network nodes in the aggregation ring system need to be excluded from the aggregation ring system, and the The aggregation device nodes in the access ring system are excluded from the access ring system, etc. If it is determined that the link to be processed is connected in the form of a chain when performing the operation of the link exclusion algorithm on a link to be processed, it is necessary to obtain all network element nodes connected to the link to be processed, and The network element node corresponding to the link to be processed and all network element nodes connected to the link to be processed are the member nodes of the current ring system,

It should be noted that if the network topology only changes locally, it can still be deduced through the derivation method of the global ring system in this application. It is also possible to compare the network topology before and after the change, and determine the ring network resources that need to be adjusted according to the comparison result.

According to the ring network resource acquisition system in this application, without manual intervention, the algorithm module is used to quickly perform global ring system information on the information of each network element node in the network obtained by the user network interface management entity. Derivation, generating the core ring system, aggregation ring system and access ring system, ensuring that the network element nodes with a number of tens of thousands of units can be deduced within seconds, and can automatically adjust and obtain ring Network resources; the path calculation unit can use the ring network resources in the ring system to prune the links in the ring system in different scales, so as to speed up the calculation speed of the path calculation unit. Through the data analysis system, the data flow information of each network element node in each ring system is counted, and the statistical results are recorded, which is convenient for the operation and maintenance personnel to view.

For the derivation of the ring systems of each layer, it can be derived from high to low. For example, the core ring system is firstly derived, then the aggregation ring system is derived, and the access ring system is finally derived. The connection relationship between various ring systems may include: the connection relationship between the parent ring and the child ring. The derivation method of the ring system can be implemented by the following steps S901 to S907.

In step S901, the core ring system is determined according to the minimum link algorithm and the core network devices in the network topology.

It should be noted that the network topology of a city has only one core ring. According to the grades of network element levels, the network element levels above the aggregation layer are all divided into core ring systems.

At the same time, it is necessary to ensure that the core ring system is a complete connected body, which means that there is a link between any two network element nodes in the slave ring system. If the core ring system is not a complete connected body, virtual links need to be added between core network nodes to transform the core ring system into a complete connected body.

In step S902, according to the outbound network element nodes of the upper ring system and the minimum link algorithm, a set of candidate links is obtained by screening.

Wherein, the candidate link includes a starting network element node and a terminating network element node.

In an exemplary embodiment, each candidate link can also be sorted according to the ring system level value of the terminating network element node corresponding to the candidate link in the candidate link set, and the candidate links in the candidate link set can be sorted according to the sorting result Candidate links are screened to facilitate further division of the candidate link set.

In step S903, it is judged whether the candidate link set is empty.

If it is determined that the candidate link set is not empty, execute step S904; otherwise, if it is determined that the candidate link set is empty, the process ends.

In step S904, the candidate links in the candidate link set are screened to obtain a pending link set, and the member nodes of the current ring system are determined according to the connection forms of the pending links in the pending link set.

For example, the candidate links in the candidate link set can be screened sequentially, and the obtained links to be processed in the pending link set can be used to calculate the path of the pending links in the pending link set using the Dijkstra algorithm. Determine that the links to be processed in the set of links to be processed can form a path connected in the form of a ring, then determine that the member nodes of the current ring system include the network element nodes corresponding to the links to be processed in the set of links to be processed ; If it is determined that the link to be processed in the set of links to be processed is a path connected in the form of a chain, then obtain all network element nodes connected to the link to be processed, and link the link to be processed in the set to be processed The corresponding network element node and all the network element nodes attached to the link to be processed are the member nodes of the current ring system.

It should be noted that, since the current ring system is an open-loop system, the current ring system does not include the marked links and network element nodes in the upper ring system of the current ring system.

In some exemplary implementations, after determining the member nodes of the current ring system, it is also necessary to mark the upper layer ring system as the parent ring system of the current ring system; and determine the parent ring information of the current ring system. Among them, the parent ring information of the current ring system includes: the type of the upper ring system, the level value of the upper ring system, the attribute information of the network element nodes in the upper ring system, and any One or more, the uplink node is the network element node of the upper ring system connected to the current ring system.

In some exemplary implementations, if a candidate link is deduced in the upper-layer ring system, and the start network element node and the end network element node of the candidate link are marked, then no further The candidate link is processed.

In step S905, the set of candidate links is updated according to the links between the member nodes of the current ring system.

In step S906, it is judged whether the updated set of candidate links is empty.

If it is determined that the updated link to be processed is not empty, execute step S907; otherwise, if it is determined that the updated link to be processed is empty, continue to execute step S902, that is, according to the output of the current ring system The edge network element nodes and the minimum link algorithm screen to obtain the candidate link set for the derivation of the next layer ring system, and the candidate link set does not include the marked links in the current ring system, simplifying The subsequent derivation of the ring system speeds up the derivation of the ring system.

In step S907, the level value of the current ring system is determined, and the level value of the ring system to which the member nodes of the current ring system belong is marked as the level value of the current ring system.

Among them, all ring systems except the core ring system are open-loop systems.

In an exemplary embodiment, the level value corresponding to each open-loop system is determined according to the barrel theory and the node type of each member node in the open-loop system. For example, if the node types of the member nodes in the current open-loop system include aggregation device nodes and access device nodes, then according to the barrel theory, the hierarchical value of the current open-loop system is determined to be the access layer ring system.

In an exemplary embodiment, after the current ring system is determined, each link in the current ring system needs to be marked, so as to facilitate the derivation of the subsequent ring system and speed up the derivation of the ring system.

After step S907 is executed, step S904 needs to be continued until the candidate paths in the candidate link set are processed.

In some exemplary implementations, if the network topology only changes locally, it can still be deduced through the derivation method of the global ring system in this application. It is also possible to compare the network topology before and after the change, determine the ring network resources that need to be adjusted according to the comparison results, and make partial modifications to the ring network resources to ensure the correctness of the ring network resources corresponding to the ring system.

In this embodiment, the core ring system is determined by using the minimum link algorithm to process the connection link information between the core network devices; , cyclically screen and process each subsequent link in the candidate link set, which can quickly identify the ring system to which each network element node belongs, ensure the accuracy of the ring system at each layer, and facilitate the identification of each network element node in the network Management can reduce the operation and maintenance times of the operation and maintenance personnel, and the operation and maintenance personnel can accurately manage each network element node according to the ring system to which each network element node belongs, and improve the management efficiency of the network element node.

FIG. 10 shows a schematic diagram of the network topology of the network element nodes attached to the ring system provided by the present application. As shown in Figure 10, network element nodes 1001 to 1004 are all core layer devices; network element nodes 1005 to 1008 are all aggregation layer devices; network element nodes 1009 to 1022 are all access layer devices equipment.

Among them, the core ring system core<1> includes: network element nodes 1001 to 1004, and the links between these four network element nodes; the aggregation layer has two ring systems: aggregation ring system aggr<1> and Converging ring system aggr<2>, where,

The aggregation ring system aggr<1> includes: network element node 1005 and network element node 1006, and the link between network element node 1003 and network element node 1005, the link between network element node 1005 and network element node 1006, A link between the network element node 1006 and the network element node 1004.

The aggregation ring system aggr<2> includes: network element node 1007 and network element node 1008, and the link between network element node 1003 and network element node 1007, the link between network element node 1007 and network element node 1008, A link between the network element node 1008 and the network element node 1004.

In an exemplary embodiment, it is necessary to count the number of network element nodes and the number of links connected to the aggregation ring system aggr<1>. FIG. 11 shows a schematic flowchart of a method for counting all network element nodes attached to a convergence ring system provided by the present application. As shown in FIG. 11 , the method of counting all network element nodes attached to the aggregation ring system aggr<1> can be realized by following steps S1101 to S1105.

In step S1101, the aggregation layer device in the aggregation ring system aggr<1> is determined according to the network topology schematic diagram of the network element nodes attached to the ring system shown in FIG. 10 .

Wherein, the aggregation layer devices in the aggregation ring system aggr<1> include the network element node 1005 and the network element node 1006 .

In step S1102, the network element node 1005 and the network element node 1006 are added to the processing queue.

In step S1103, the sub-ring systems corresponding to the network element node 1005 and the network element node 1006 are searched in turn to obtain the sub-ring system access<1> and the sub-ring system access<3>.

Among them, the sub-ring system access<1> includes: NE node 1009 and NE node 1011, the link between NE node 1005 and NE node 1009, and the link between NE node 1009 and NE node 1011 Road, link between network element node 1011 and network element node 1006. The sub-ring system access<2> includes: NE node 1010, NE node 1012, NE node 1015, and NE node 1016, and the link between NE node 1005 and NE node 1010, NE node 1010 and Links between network element nodes 1015, links between

network element nodes

1015 and 1016, links between

network element nodes

1016 and 1012, and links between

network element nodes

1012 and 1006 link between.

In step S1104, continue to process the sub-ring system access<1> and the sub-ring system access<3>, search for the next-level sub-ring system of the sub-ring system access<1> and the sub-ring system access<3>, and obtain the sub-ring system Access<1> is the sub-ring system access<2>, and it is determined that the sub-ring system access<3> has no sub-ring system.

Among them, the sub-ring system access<2> of the next layer includes: NE node 1013 and NE node 1014, and the link between NE node 1009 and NE node 1013, and the link between NE node 1013 and NE node 1014. The link between the network element node 1014 and the network element node 1011.

It should be noted that, through the loop processing of steps S1102 to S1103, it can be determined that the aggregation ring system aggr<1> includes the following three sub-ring systems: sub-ring system access<1>, sub-ring system access<3>, and sub-ring system access<3> The next sub-ring system access<2> of the system access<1>.

In step S1105, all the network element nodes in the sub-ring system access<1>, the sub-ring system access<3>, and the sub-ring system access<2> under the sub-ring system access<1> are used as the aggregation ring system The network element node attached to aggr<1>.

In this embodiment, by using the processing queue, the

network element nodes

1005 and 1006 belonging to the same level are sequentially processed to obtain the sub-ring system access<1> and sub-ring System access<3>, further, continue to process the sub-ring system access<1> and sub-ring system access<3>, and search for the sub-rings of the sub-ring system access<1> and sub-ring system access<3> system, so that all sub-ring systems corresponding to network element nodes of the same level and the sub-ring systems of the next layer can be found out step by step, ensuring the accuracy of sub-ring systems at all levels, and at the same time speeding up the search for network element nodes of the same level Processing speed, clarify the attribution of all network element nodes connected to the ring system, and ensure the accuracy of the connected nodes.

It should be clear that the present application is not limited to the specific configurations and processes described in the above embodiments and shown in the figures. For the convenience and brevity of description, detailed descriptions of known methods are omitted here, and for the specific working process of the above-described systems, modules and units, reference may be made to the corresponding processes in the foregoing method implementations, and details are not repeated here.

As shown in FIG. 12 , a computing device 1200 includes an input device 1201 , an input interface 1202 , a central processing unit 1203 , a memory 1204 , an output interface 1205 , and an output device 1206 . Wherein, the input interface 1202, the central processing unit 1203, the memory 1204, and the output interface 1205 are connected to each other through the bus 1207, and the input device 1201 and the output device 1206 are respectively connected to the bus 1207 through the input interface 1202 and the output interface 1205, and then connected to the computing device 1200 other component connections.

Specifically, the input device 1201 receives input information from the outside, and transmits the input information to the central processing unit 1203 through the input interface 1202; the central processing unit 1203 processes the input information based on computer-executable instructions stored in the memory 1204 to generate output information, temporarily or permanently store the output information in the memory 1204, and then transmit the output information to the output device 1206 through the output interface 1205; the output device 1206 outputs the output information to the outside of the computing device 1200 for the user to use.

In one embodiment, the computing device shown in FIG. 12 may be implemented as an electronic device, and the electronic device may include: a memory configured to store a program; a processor configured to run the program stored in the memory to Execute the method for acquiring ring network resources described in the foregoing embodiments.

In one embodiment, the computing device shown in FIG. 12 may be implemented as a ring network resource acquisition system, and the ring network resource acquisition system may include: a memory configured to store a program; a processor configured to The program stored in the memory is run to execute the method for acquiring ring network resources described in the above embodiments.

In one embodiment, the computing device shown in FIG. 12 may be implemented as an electronic device, and the electronic device may include: a memory configured to store a program; a processor configured to run the program stored in the memory to Execute the data traffic statistics method described in the above implementation manner.

In one embodiment, the computing device shown in FIG. 12 can be implemented as a data traffic statistics system, and the data traffic statistics system can include: a memory configured to store programs; a processor configured to run the programs stored in the memory. A program to execute the data flow statistics method described in the above embodiments.

The above descriptions are merely exemplary implementations of the present application, and are not intended to limit the protection scope of the present application. In general, various embodiments of the present application can be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software, which may be executed by a controller, microprocessor or other computing device, although the application is not limited thereto.

The embodiments of the present application can be realized by a data processor of a mobile device executing computer program instructions, for example in a processor entity, or by hardware, or by a combination of software and hardware. Computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code written in any combination of one or more programming languages or object code.

Any logic flow block diagrams in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions. Computer programs can be stored on memory. The memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random-access memory (RAM), optical memory devices and systems (digital versatile disc DVD or CD), etc. Computer readable media may include non-transitory storage media. The data processor can be of any type suitable for the local technical environment, such as but not limited to general purpose computer, special purpose computer, microprocessor, digital signal processor (DSP), application specific integrated circuit (ASIC), programmable logic device (FGPA) and processors based on multi-core processor architectures.

The foregoing has provided a detailed description of exemplary embodiments of the present application, by way of exemplary and non-limiting examples. However, considering the accompanying drawings and the claims, various modifications and adjustments to the above embodiments are obvious to those skilled in the art, but do not depart from the scope of the present application. Therefore, the proper scope of the application will be determined from the claims.

Claims

A method for acquiring ring network resources, comprising:

Processing the obtained connection link information between network element nodes according to a preset path algorithm, and determining the ring system to which the network element nodes belong;

According to the acquired attribute information of the network element node and the ring system to which the network element node belongs, a ring network resource is determined, and the ring network resource represents a resource of a ring system in the network.
The method according to claim 1, wherein the attribute information of the network element node includes: node type;

The processing of the obtained connection link information between network element nodes according to a preset path algorithm, and determining the ring system to which the network element nodes belong includes:

When it is determined that the node type of the network element node is a core network node, determine that the ring system to which the core network node belongs is a first-layer ring system, and mark the link between the core network nodes as the first layer ring system Core network links in the layer ring system;

When it is determined that the node type of the network element node is not the core network node, obtain a candidate link set, and process the candidate link information in the candidate link set according to the preset path algorithm , to determine the ring system to which the network element node belongs.
The method according to claim 2, wherein, before marking the link between the core network nodes as a core network link in the first layer ring system, the method further comprises:

Obtain a set of core network links;

Process the core network links in the core network link set according to the preset path algorithm, and determine the connection form of the core network links in the core network link set;

According to the connection form of the core network links in the core network link set, determine whether a virtual link needs to be added between the core network nodes, and the virtual link is used to make the first layer ring system form a connected body.
The method according to claim 2, wherein said processing the candidate link information in the candidate link set according to the preset path algorithm to determine the ring system to which the network element node belongs includes:

According to the preset path algorithm and the obtained outbound network element nodes of the upper layer ring system, filter the candidate links in the candidate link set to obtain the pending link set, and determine the Describe the connection form of the links to be processed in the set of links to be processed, the set of links to be processed includes k links to be processed, and k is an integer greater than or equal to 1;

Determine the member nodes of the current ring system according to the connection form of the links to be processed in the set of links to be processed;

determining the level value of the current ring system, and marking the level value of the ring system to which the member nodes of the current ring system belong is the level value of the current ring system;

updating the set of candidate links according to the links between the member nodes of the current ring system;

According to the preset path algorithm and the outbound network element nodes of the current ring system, process the candidate link information in the updated candidate link set, and determine the updated candidate link set The ring system to which the NE node belongs.
The method according to claim 4, wherein said determining the member nodes of the current ring system according to the connection form of the links to be processed in the set of links to be processed comprises:

When it is determined that the links to be processed in the set of links to be processed are connected in the form of a ring, determine that the member nodes of the current ring system include network elements corresponding to the links to be processed in the set of links to be processed node;

When it is determined that the links to be processed in the set of links to be processed are connected in the form of chains, obtain all network element nodes connected to the links to be processed, and add the links in the set of links to be processed to The network element node corresponding to the link to be processed and all network element nodes connected to the link to be processed are used as member nodes of the current ring system.
The method according to claim 4, wherein said updating said set of candidate links according to the links between member nodes of said current ring system comprises:

From the candidate link set, delete the links between the member nodes of the current ring system to obtain the updated candidate link set.
The method according to claim 4, wherein, after updating the set of candidate links according to the links between the member nodes of the current ring system, the method further comprises:

marking the upper ring system as the parent ring system of the current ring system;

Determine parent ring information of the current ring system, where the parent ring information of the current ring system includes an identifier of the parent ring system.
The method according to claim 7, wherein said determining the parent ring information of the current ring system comprises:

When it is determined that the current ring system is connected to different parent ring systems, determine that there are multiple parent ring systems in the current ring system;

Record parent ring information of multiple parent ring systems of the current ring system.
The method according to claim 4, wherein said determining the level value of said current ring system comprises:

Determine the level value of the current ring system according to the bucket theory and the node types of the member nodes of the current ring system.
The method according to claim 9, wherein said determining the level value of the current ring system according to the barrel theory and the node types of the member nodes of the current ring system comprises:

Comparing the node types of each of the member nodes in the current ring system to obtain a comparison result;

Determine the level value of the current ring system according to the barrel theory and the comparison result.
The method of claim 4, wherein the current loop system is an open loop system.
The method according to any one of claims 1 to 11, wherein the preset path algorithm comprises: a shortest path algorithm or a longest path algorithm.
The method according to any one of claims 1 to 11, wherein the attribute information of the network element node further includes: the identifier of the network element node, the parent node information of the network element node, and the network Any one or more of the child node information of the meta node.
A data traffic statistics method, comprising:

Obtaining ring network resources by adopting the method for obtaining ring network resources according to any one of claims 1 to 13;

According to the ring network resources, the data flow of each ring system in the network is counted.
The method according to claim 14, wherein said counting the data traffic of each ring system in the network according to the ring network resources comprises:

Based on the ring network resources, acquire the number of network element nodes in the m-th layer ring system and the attribute information of the network element nodes, where m is an integer greater than or equal to 1;

According to the number of network element nodes in the m-th layer ring system and the attribute information of the network element nodes, perform statistics on the data traffic of each network element node in the m-th layer ring system, and obtain the m-th layer Data traffic of the layer ring system.
The method of claim 14, further comprising:

In the case of determining that there are two parent ring systems in the m-th layer ring system, respectively obtain the network element node set attached to the first parent ring system and the network elements attached to the second parent ring system of the m-th layer ring system collection of nodes;

determining overlapping network element nodes according to the set of network element nodes attached to the first parent ring system and the set of network element nodes attached to the second parent ring system;

performing statistics on the data traffic of the overlapping network element nodes to obtain overlapping data traffic;

The overlapping data traffic is equally divided.
A device for acquiring ring network resources, comprising:

The ring system confirmation module is configured to process the obtained connection link information between network element nodes according to a preset path algorithm, and determine the ring system to which the network element node belongs;

The ring network resource determination module is configured to determine ring network resources according to the acquired attribute information of the network element node and the ring system to which the network element node belongs, and the ring network resource represents a resource of a ring system in the network .
A data flow statistics device, which includes:

The acquisition module is configured to acquire ring network resources by adopting the acquisition method of ring network resources according to any one of claims 1 to 13;

The statistical module is configured to count the data traffic of each ring system in the network according to the ring network resources.
A network management device, comprising:

The device for acquiring ring network resources as claimed in claim 17, and/or the device for counting data traffic as claimed in claim 18.
An electronic device comprising:

one or more processors;

a memory having stored thereon one or more programs which, when executed by said one or more processors, cause said one or more processors to implement claims 1-13, or , the method according to any one of claims 14-16.
A computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the method according to any one of claims 1-13, or, any one of claims 14-16 is realized.