WO2014205820A1

WO2014205820A1 - Service path calculating method and device

Info

Publication number: WO2014205820A1
Application number: PCT/CN2013/078469
Authority: WO
Inventors: 邹勇军; 聂国梁; 郑麒
Original assignee: 华为技术有限公司
Priority date: 2013-06-28
Filing date: 2013-06-28
Publication date: 2014-12-31
Also published as: CN105264833A; CN105264833B

Abstract

The present invention relates to the field of communications. Disclosed in an embodiment of the present invention are a service path calculating method and device, realizing service path calculation for a network in the planning stage, the method comprising: obtaining network topology information of a communication network; obtaining a ring network set of the communication network according to the network topology information, the ring network set comprising multiple contiguous ring networks; determining the subordination relationship between the multiple ring networks; a ring network in the multiple ring networks is subordinate to a ring network having the highest parent level in the ring networks contiguous with the ring network, a ring network where a starting node is located or a ring network where a termination node is located are ring networks having the highest parent level in the communication network; obtaining a service path between the starting node and the termination node according to the ring network set and the subordination relationship. The present invention is used in the process of calculating a service path in the network planning stage.

Description

Business path calculation method and device

The present invention relates to the field of communications, and in particular, to a service path calculation method and apparatus. Background technique

With the rapid growth of mobile network data services and the requirements for new types of services, the mobile bearer network has gradually evolved into an Internet Protocol (IP) bearer network. Due to the diversification of the transmission product types of the all-IP bearer network, in the early stage of network planning, the service path is planned for single-domain paths, and the planning of cross-domain paths is lacking, that is, the lack of base station to transmission to the core network convergence node If the plan is changed and the single-domain plan is changed, the impact on the cross-domain plan cannot be reflected. This will bring great difficulties to the subsequent planning network construction and capacity assessment.

The basic principle of obtaining the service path from the base station to the transmission to the core network aggregation node is: Find a reachable path from the service initiator to the service end for the service data flow through the known information. The calculation method of the service path from the base station to the transmission to the core network aggregation node provided in the prior art is mostly valid only for the existing network, and specifically, the calculation information is calculated according to the configuration information and routing information of the network equipment in the current network. The service path from the base station to the transmission to the core network aggregation node, but there is no calculation method for the service path of the network in the planning stage. Therefore, how to realize the calculation of the business path of the network in the planning stage has become a key research topic in this field. Summary of the invention

Embodiments of the present invention provide a service path calculation method and apparatus, which implements calculation of a service path for a network in a planning stage.

In order to achieve the above object, the embodiment of the present invention uses the following technical solutions:

A first aspect of the present invention provides a service path calculation method, which is applied to a communication network, where the communication network includes a start node and a termination node, and the method includes: Obtaining network topology information of the communication network;

Obtaining, according to the network topology information, a ring network set of the communication network, where the ring network set includes a plurality of connected ring networks, where the multiple connected ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs;

Determining a affiliation relationship of the plurality of ring networks; wherein the ring network in the plurality of ring networks belongs to a ring network of a highest parent level in a ring network connected to the ring network, The ring network to which the originating node belongs or the ring network to which the terminating node belongs is the ring network of the highest parent level in the communication network;

Obtaining a service path between the originating node and the terminating node according to the ring network set and the affiliation relationship.

With reference to the first aspect, in a possible implementation manner, the obtaining, according to the network topology information, the ring network set of the communication network, includes:

Determining, according to the network topology information, a set of branch nodes of the communication network, where the set of branch nodes includes a plurality of branch nodes, and the branch nodes are nodes having a link number greater than or equal to 3;

Acquiring, according to the network topology information, a ring network subset corresponding to each of the branch nodes; wherein the ring network subset corresponding to the branch node includes a ring network including the branch node;

According to the ring network subset corresponding to each of the branch nodes, the ring network set is obtained by removing the redundant ring network and removing the intersecting ring network.

With reference to the first aspect and the foregoing possible implementation manner, in another possible implementation manner, the obtaining, between the starting node and the terminating node, according to the ring network set and the affiliation relationship Business path, including:

Obtaining a shortest path between the starting node and the terminating node according to the ring network set and the belonging relationship.

In combination with the first aspect and the foregoing possible implementation manners, in another possible implementation manner, the method further includes:

The communication network is presented according to the ring network set and the attribution relationship. A second aspect of the present invention provides a network topology presentation method, which is applied to a communication network, where the communication network includes a start node and a termination node, and the method includes: acquiring a ring network extension in the communication network The set of the ring network topology includes a topology of a plurality of connected ring networks and a belonging relationship of the plurality of connected ring networks; wherein the plurality of connected ring networks The ring network to which the originating node belongs and the ring network to which the terminating node belongs, wherein the ring network in the plurality of ring networks belongs to the highest ring network connected to the ring network a ring network of the parent level, the ring network to which the originating node belongs or the ring network to which the terminating node belongs is the ring network of the highest parent level in the communication network;

A topology of the communication network is presented based on a home relationship of the plurality of connected ring networks and a topology of the plurality of connected ring networks.

In combination with the second aspect, in a possible implementation manner,

When the network element node belongs to the network element node on the topology of the ring network, the network element node and all network element nodes on the topology of the ring network are presented in a ring form; or

When the network element node does not belong to the network element node on the topology of the ring network, the network element node and all network element nodes subordinate to the network element node are presented in a tree form; or

When the network element node meets the preset condition, all the network element nodes subordinate to the network element node are clouded and presented;

The preset condition includes: the number of source nodes that belong to the network element node meets a preset display number threshold, or the number of hops of the service path through all the source nodes of the network element node to the network element node And satisfying the preset hop count threshold, or the device type of the network element node is a specified device type.

A third aspect of the present invention provides a service path calculation apparatus, which is applied to a communication network, where the communication network includes a start node and a termination node, and the apparatus includes: a first acquisition unit, configured to acquire the communication network a network topology information, configured to acquire, according to the network topology information obtained by the first acquiring unit, a ring network set of the communication network; wherein, the ring network The set includes a plurality of connected ring networks, where the plurality of connected ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs; Determining a affiliation relationship of the plurality of ring networks obtained by the second acquiring unit, where a ring network in the plurality of ring networks belongs to a highest ring network connected to the ring network a ring network of the parent level, the ring network to which the originating node belongs or the ring network to which the terminating node belongs is the ring network of the highest parent level in the communication network;

a third obtaining unit, configured to acquire, according to the ring network set obtained by the second acquiring unit, the affiliation obtained by the determining unit, a service path between the starting node and the terminating node .

With reference to the third aspect, in a possible implementation manner, the second acquiring unit is specifically configured to:

With reference to the third aspect and the foregoing possible implementation manner, in another possible implementation manner, the third obtaining unit is specifically configured to:

In conjunction with the third aspect and the foregoing possible implementation manners, in another possible implementation manner, the apparatus further includes:

a presentation unit, configured to present the communication network according to the ring network collection obtained by the second obtaining unit and the attribution relationship obtained by the determining unit.

According to a fourth aspect of the present invention, a network topology presentation apparatus is provided for communication In the network, the communication network includes a start node and a termination node, and the device includes: an acquiring unit, configured to acquire a ring network topology set in the communication network, where the ring network topology set includes multiple a topology of the connected ring network and a affiliation relationship of the plurality of adjacent ring networks; wherein the plurality of adjacent ring networks includes a ring network to which the originating node belongs and Ending the ring network to which the node belongs, the ring network in the plurality of ring networks belongs to the ring network of the highest parent level in the ring network connected to the ring network, and the start node belongs to The ring network or the ring network to which the terminating node belongs is the ring network of the highest parent level in the communication network;

And a rendering unit, configured to present a topology of the communication network according to the attribution relationship of the plurality of connected ring networks obtained by the acquiring unit and the topology of the plurality of connected ring networks.

In combination with the fourth aspect, in another possible implementation manner,

According to a fifth aspect of the present invention, a service path calculation apparatus is provided, which is applied to a communication network, where the communication network includes a start node and a termination node, and includes: at least one processor, a memory, a communication interface, and a bus, where the at least one a processor, the memory and the communication interface are connected by the bus and complete communication with each other; The processor is configured to execute executable program code stored in a memory, specifically for performing the following operations:

The processor is configured to acquire network topology information of the communication network, and obtain a ring network set of the communication network according to the network topology information, where the ring network set includes multiple connections a ring network, where the plurality of adjacent ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs; determining a belonging relationship of the plurality of ring networks The ring network in the plurality of ring networks belongs to the ring network of the highest parent level in the ring network connected to the ring network, and the ring network or the node to which the start node belongs The ring network to which the terminating node belongs is the ring network of the highest parent level in the communication network; and the service between the starting node and the terminating node is obtained according to the ring network set and the belonging relationship path.

In combination with the fifth aspect, in a possible implementation manner,

The processor is further configured to: select, according to the network topology information, a set of branch nodes of the communication network; where the set of branch nodes includes multiple branch nodes, and the branch nodes are chains a node having a number of times greater than or equal to 3; obtaining, according to the network topology information, a ring network subset corresponding to each of the branch nodes; wherein the ring network subset corresponding to the branch node includes the a ring network of the branch nodes; according to the ring network subset corresponding to each of the branch nodes, the ring network group is obtained by removing the redundant ring network and removing the intersecting ring network.

In combination with the fifth aspect and the above possible implementation manners, in another possible implementation manner,

The processor is further configured to acquire a shortest path between the start node and the termination node according to the ring network set and the attribution relationship.

The processor is further configured to present the communication network according to the ring network set and the attribution relationship.

According to a sixth aspect of the present invention, a network topology rendering apparatus is provided for communication In the network, the communication network includes a start node and a termination node, including: at least one processor, a memory, a communication interface, and a bus, wherein the at least one processor, the memory, and the communication interface are connected by using the bus Complete mutual communication;

The processor is configured to execute executable program code stored in a memory, and is specifically configured to perform the following operations:

The processor is configured to acquire a ring network topology set in the communication network, where the ring network topology set includes a topology of a plurality of connected ring networks and the plurality of connected rings The affiliation of the type of network; wherein the plurality of connected ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs, and rings in the plurality of ring networks The type network belongs to the ring network of the highest parent level in the ring network connected to the ring network, and the ring network to which the start node belongs or the ring network to which the terminating node belongs is the communication network. a ring network of the highest parent level; presenting a topology of the communication network based on a belonging relationship of the plurality of connected ring networks and a topology of the plurality of connected ring networks.

In combination with the sixth aspect, in a possible implementation manner,

The method and device for calculating a service path according to an embodiment of the present invention firstly acquires a plurality of interfaces of the communication network according to network topology information in the obtained communication network. a ring network set of the ring network, and then determining the obtained ownership relationship of the plurality of ring networks, and finally obtaining the relationship between the start node and the terminating node according to the obtained ring network set and the ownership relationship of the plurality of ring networks The service path, thereby obtaining the service path between the sink node and the source node, so that the communication path for the planning phase can be realized only when the network device interconnection relationship can be obtained, or even the site-level interconnection planning information can be obtained. Calculation. DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below. Obviously, the drawings in the following description are only It is a certain embodiment of the present invention, and other drawings can be obtained from those skilled in the art without any inventive labor.

FIG. 1 is a flowchart of a service path calculation method according to an embodiment of the present invention; FIG. 2 is a flowchart of a network topology presentation method according to another embodiment of the present invention;

3 is a flow chart of a method for calculating a service path according to another embodiment of the present invention;

FIG. 4 is a schematic diagram of a topology of a communication network according to an embodiment of the present invention; FIG. 5 is a schematic diagram of a composition of a service path calculation apparatus according to another embodiment of the present invention;

FIG. 6 is a schematic diagram of another service path computing device according to another embodiment of the present invention;

FIG. 7 is a schematic diagram of a network topology rendering apparatus according to another embodiment of the present invention; FIG.

FIG. 8 is a schematic diagram showing another composition of a service path computing device according to another embodiment of the present invention; FIG.

FIG. 9 is a schematic structural diagram of another network topology rendering apparatus according to another embodiment of the present invention. detailed description

The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, but not all embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

An embodiment of the present invention provides a service path calculation method, which is applied to a communication network, where the communication network includes a start node and a termination node. As shown in FIG. 1, the method may include:

101. Obtain network topology information in a communication network.

The network topology information includes all the planning information, and may include, for example, link information, a site, a device type, and source node attribution information, and may also include a plurality of planning information, such as IP port planning information, routing planning information, and the like. The planning information of different devices may also include a lot, such as a device name, etc., which are not enumerated herein.

It should be noted that, the embodiment of the present invention only exemplifies the network topology information, and the embodiment of the present invention does not limit the specific content included in the network topology information.

102. Obtain a ring network collection of the communication network according to the network topology information.

After obtaining the network topology information of the communication network, the ring network set of the communication network may be obtained according to the obtained network topology information, where the ring network set includes multiple connected ring types. The network, and the plurality of connected ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs.

103. Determine a belonging relationship of multiple ring networks.

After obtaining the ring network set of the communication network according to the network topology information, determining a affiliation relationship of the plurality of ring networks included in the ring network set, wherein the ring network in the plurality of ring networks belongs to The ring network of the highest parent level in the ring network connected to the ring network, the ring network to which the originating node belongs or the terminating node belongs to The ring network is the highest parent-level ring network in the communication network.

104. Obtain a service path between the originating node and the terminating node according to the ring network set and the affiliation relationship.

After determining the attribution relationship of the plurality of ring networks included in the ring network set, the relationship between the start node and the terminating node may be obtained according to the determined attribution relationship and the acquired ring network set of the communication network. The service path, and since the initiating node is indirectly connected to the sink node directly or through the acyclic network, the terminating node is directly connected to the source node directly or through the acyclic network, so according to the obtained between the starting node and the terminating node With the service path, the service path between the sink node and the source node can be obtained.

It should be noted that the source node in the embodiment of the present invention is a network element node at the end of the communication network, and the sink node is a sink node in the communication network.

It should be noted that, in an application scenario, when a ring network is not included in the ring network set obtained according to the network topology information of the communication network, that is, the ring network does not exist in the communication network, then It can be understood that the service path between the originating node and the terminating node is unique, that is, the service path from the source node to the sink node is unique, and thus can be directly determined between the starting node and the terminating node. The service path is used to obtain the service path between the source node and the sink node. The method for obtaining the source node to the sink node service path in the application scenario is not described in detail in the embodiment of the present invention.

The service path calculation method provided by the embodiment of the present invention firstly obtains a ring network set including a plurality of connected ring networks according to the network topology information in the obtained communication network, and then determines the obtained multiple The ownership relationship of the ring network is finally obtained according to the obtained ring network set and the ownership relationship of the plurality of ring networks, and the service path between the start node and the terminating node is obtained, thereby obtaining the service path between the sink node and the source node. For the communication network in the planning stage, the calculation of the service path is realized only when the network device interconnection relationship can be obtained, and even the site-level interconnection planning information can be obtained.

An embodiment of the present invention provides a network topology rendering method, which is applied to a communication network. The communication network includes a start node and a termination node. As shown in FIG. 2, the method may include:

201. Acquire a ring network topology set in a communication network, where the ring network topology set includes a topology of multiple connected ring networks and a belonging relationship of multiple connected ring networks.

The plurality of connected ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs, and the ring network in the plurality of ring networks belongs to the ring network connected to the ring network. The ring network of the highest parent level, the ring network to which the originating node belongs or the ring network to which the terminating node belongs is the ring network of the highest parent level in the communication network, the sink node is the sink node in the communication network, and the source node is A network element node at the end of the communication network.

202. Presenting a topology of the communication network according to the belonging relationship of the plurality of connected ring networks and the topology of the plurality of connected ring networks.

After obtaining the ring network topology set in the communication network, the belonging relationship of the plurality of connected ring networks included in the ring network topology set and the topology of the plurality of connected ring networks may be Determining a critical node in the communication network, and treating all the source nodes of the service path through the critical node as one display unit, because the network element node data in the network topology map is relatively large, and the user can only present in batches. At this point, the service path can pass through all the source nodes of the same critical node as a display unit. After the user selects a display unit, all the network element nodes and critical nodes that have passed through the service path can be presented from the sink node or the network element node, wherein the critical node has aggregated the service paths of all the source nodes in the display unit. And the service path from the critical node to the source node is also the only one path, and starts from the network element node or the critical node, and sequentially displays all the network element nodes and the source node that pass through along the service path. Specifically, in the process of displaying, when the network element node belongs to the network element node on the topology of the ring network, all the network element nodes on the topology of the network element node and the ring network are presented in a ring form; or When the network element node does not belong to the network element node on the topology of the ring network, all the network element nodes of the network element node and the network element node are presented in a tree form; or when the network element node meets the preset condition, the network element node All network element nodes of the meta-node The preset condition includes: the number of source nodes of the home network element node meets a preset display number threshold, or the number of hops of the service path through all source nodes of the network element node to the network element node and the preset hopping The number threshold, or, the device type of the NE node is the specified device type, and so on. The network element node is a node other than the source node and the sink node in the communication network.

The network topology presentation method provided by the embodiment of the present invention acquires a ring network topology set in a communication network, and according to the topology of the plurality of connected ring networks included in the acquired ring network topology set The affiliation relationship of the multiple connected ring networks presents the topology of the communication network, so that the service path-based network in the large-scale network scenario in the planning stage is realized on the basis of the service path of the communication network in the planning stage. The presentation of the topology.

Another embodiment of the present invention provides a service path calculation method, which is used in a communication network, where the communication network includes a start node and a termination node. As shown in FIG. 3, the method may include:

301. Obtain network topology information of a communication network.

302. Obtain a ring network collection of the communication network according to the network topology information. After obtaining the network topology information of the communication network, the ring network set of the communication network may be obtained according to the acquired network topology information, and the ring network set includes multiple connected ring networks. The plurality of connected ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs.

Specifically, the specific method for obtaining the ring network set of the communication network may include Next step 302a - step 302c.

302a. Select a branch node set of the communication network according to the network topology information. The branch node set includes multiple branch nodes, and the branch node is a node with a link number greater than or equal to 3. Specifically, after obtaining the network topology information of the communication network, all the branch nodes in the communication network with the number of links greater than or equal to 3 can be selected according to the network topology information, and all the branch nodes form a set of branch nodes. For example, as shown in FIG. 4, a topology diagram of a communication network, where node A, node B, node D, node G, node H, and node I in FIG. 4 are branch nodes of the communication network, such The way nodes form a set of branch nodes of the communication network.

302b. Obtain, according to the network topology information, a ring network subset corresponding to each branch node.

After obtaining the set of branch nodes of the communication network according to the network topology information, one of the plurality of branch nodes included in the set of branch nodes may be used as the first node. Obtaining a subset of the ring network corresponding to the branch node, and obtaining, for each branch node of the at least one branch node included in the set of branch nodes, a corresponding subset of the ring network, where The ring network subset corresponding to the road node includes a ring network including branch nodes.

According to the network topology information, the specific process of obtaining the ring network subset corresponding to each branch node may be:

First, the screening rules are determined. For example, the filtering rules may include: a network element type, a link type, a routing domain plan, an interface IP, a link cost, a routing protocol, and the like.

It should be noted that the selection rule described in the embodiment of the present invention may be obtained according to the priority in the planning information provided by the customer. For example, the planning information provided by the customer indicates that the filtering is preferentially performed according to the network element type. The screening rule is a network element type, and the embodiment of the present invention is not limited herein, or the specific screening rule may be determined according to the actual application scenario and the network topology information, and the screening rule is determined in the embodiment of the present invention. For example, a simple example is provided, and the selection rule is selected for the deep traversal, and may be determined according to the requirements of the actual application scenario. For the specific selection rule to perform the deep traversal, the embodiment of the present invention is not limited herein. Then, for each branch node in the set of branch nodes, the branch node is taken as the first node, and the deep traversal is performed according to the selection rule, and the ring network subset corresponding to the branch node is obtained according to the traversal process. For each of the plurality of branch nodes included in the set of branch nodes, after the screening rule is determined, the branch node may be used as the first node to perform deep traversal according to the determined screening rule, and Obtaining a subset of the ring network corresponding to the branch node according to the traversal process until a subset of the ring network corresponding to each of the plurality of branch nodes included in the set of branch nodes is obtained, wherein the deep traversal is performed The algorithm used in the time may be a deep traversal algorithm, and the related details of the deep traversal algorithm include a link back-off, a state record, and the like. The algorithm is a mature algorithm in the prior art, and the algorithm is specific to the algorithm in the embodiment of the present invention. Details will not be described in detail. Specifically, it may be: for each of the plurality of branch nodes included in the set of branch nodes, first, the branch node is taken as the first node, and the first link of the branch node is used according to the screening rule. Depth traversing until returning to the branch node, and then re-taking the branch node as the first node, and performing deep traversal according to the screening rule from the second link of the branch node until the branch node is returned, repeating the depth traversal The process, until all the links of the branch node are traversed, wherein during the traversal process, the ring network is recorded according to the traversal process, and the ring network subset corresponding to the branch node is obtained according to all traversal processes. In this way, a ring network subset corresponding to each of the plurality of branch nodes included in the set of branch nodes can be obtained, wherein the first link is any of all the links of the branch node. One link, the second link is any one of the other links of the node except the first link.

For example, as shown in the topology of the communication network shown in FIG. 4, and using the deep traversal algorithm for deep traversal, it can be seen from step 302a that the branch nodes included in the branch node set of the communication network are: node A, node B. , node D, node G, node H, node I. For node A, select one of the links AC to start traversing, ACD, because node D is a branch node, you can select one of the branches to continue traversal according to the filtering rule. If the filtering rule is device type, the device of the same type is preferentially selected. To traverse, then depending on the device type, the DG can be preferentially selected to continue traversing. Point G is also a branch node and satisfies the filtering condition. Node G is added to the traversal branch node sequence of node A, and then a link is randomly selected to continue traversing. Here, GKLMN-0-H can be randomly selected, since node H is also As the branch node and satisfying the filtering condition, the node H is also added to the traversal branch node sequence of the node A. If the HG is traversed at this time and found to return to the traversed node G, it is rolled back to the nearest branch. The road node, that is, falls back to node H, then traverses the next link HIJBA, returns to node A, records the ring network of ACDGKLMN-0-HIJBA in the current traversal process, and then needs to traverse the branch node corresponding to node A. The record in the sequence is rolled back to the last traversal branch node H to see if there is any traversal link. If not, it is rolled back to the previous tributary node G. It is found that there is no traversal of the link GH, and then the link is randomly selected, and finally obtained. New ring network ACDGHIJBA. The added node in the sequence of traversing branch nodes is used when the link is backed up. Then, another link of the node A is selected to repeat the process of the deep traversal until all the links of the branch node are traversed, and all the ring networks are recorded, and a ring network subset corresponding to the node A is obtained, which includes Two ring networks, the other 'J is ACDGKLMN-0-HIJBA, ACDGHIJBA. After all the links of the node A are completed in all traversal, the deep traversal of the next node D may be continued to obtain a ring network subset corresponding to the node D, wherein during the traversal of the node D, the traversal node may not be recorded and traversed. A obtained ring network repeating ring network, then the ring network included in the ring network subset corresponding to node D obtained at this time is DEFD, and the ring network included in the ring network subset corresponding to the same node G For GKLMN-0-HG, node H has no corresponding new ring network, and the ring network included in the ring network subset corresponding to node I is IPQRSI.

It should be noted that, in the ring network subset corresponding to all the branch nodes that are finally obtained, the ring network subset corresponding to different branch nodes may include the same ring network, or may be recorded in the ring network. When it is determined that the newly acquired ring network has been recorded, the recording may not be repeated.

302c. Obtain a ring network set by removing the redundant ring network and removing the intersecting ring network according to the ring network subset corresponding to each branch node. After obtaining the ring network subset corresponding to each of the plurality of branch nodes included in the set of branch nodes, according to the obtained plurality of branch nodes included in the set of branch nodes A subset of the ring network corresponding to each branch node obtains a ring network set of the communication network by removing the redundant ring network and removing the intersecting ring network.

Specifically, the method for obtaining the ring network set in the communication network may be: First, determining the selection rule according to the network topology information. The selection rules include: preferentially selecting a ring network with the largest link bandwidth and preferentially selecting a ring network with the lowest link cost.

It should be noted that, in the embodiment of the present invention, only the selection rule is simply exemplified. In the actual application process, the selection rule may be determined according to the network topology information and the actual application scenario. There is no restriction on the selection rules here.

Then, according to the selection rule and the ring network subset corresponding to each branch node, the ring network collection is obtained by removing the redundant ring network and removing the intersecting ring network. Specifically, after the selection rule is determined according to the network topology information, the redundant ring network can be removed according to the determined selection rule and each branch segment, and the intersecting ring type is removed. Network, in an application scenario, if all the branch nodes corresponding to the branch nodes in step 302b correspond to the ring network subset, and the different ring nodes corresponding to the ring network subset contain the same ring network, then It is necessary to remove the same ring network repeated ring network included in the ring network subset corresponding to different branch nodes, and remove the intersecting ring networks included in the ring network subset corresponding to different branch nodes. For example, if the selection rule is a ring network with the lowest priority link cost, then if the link on a ring network is on a different selected ring network, and there is no new link, the ring type network needs to be deleted. For example, the ring network ACDGKLMN-0-HIJBA obtained in step 303b can be covered by two smaller ring networks ACDGHIJBA and GKLMN-0-HG, that is, the link on the ring network ACDGKLMN-0-HIJBA is On the ring network ACDGHIJBA, and GKLMNOHG, and there is no new link, then the ring network ACDGKLMN-0-HIJBA can be removed at that time, then The ring network included in the ring network collection in the obtained network is:

A-C-D-G-H-I-J-B-A, D-E-F-D, G-K-L-M-N-O-H-G, I-P-Q-R-S-I. In another application scenario, if all the branch nodes corresponding to the branch nodes are finally obtained in step 302b, the ring network subset corresponding to the different branch nodes does not include the same ring network. Then, it is only necessary to judge whether there are intersecting ring networks in all ring networks, and remove the intersecting ring networks according to the selection rules, and finally obtain a ring network set of the communication network.

303. Determine a affiliation relationship of multiple ring networks.

After obtaining the ring network set of the communication network, the attribution relationship of the plurality of ring networks in the ring network set can be determined, and the ring network in the plurality of ring networks belongs to the ring network. The ring network of the highest parent level in the ring network, the ring network to which the originating node belongs or the ring network to which the terminating node belongs is the ring network of the highest parent level in the communication network. For example, a ring network that is directly or indirectly connected to a sink node through an acyclic network may be defined as a level 0 ring, a ring network that is directly connected to a level 0 ring through an acyclic network, or connected to a level 0 ring. A level 1 ring, a ring network directly connected to a class 1 ring through an acyclic network or connected to a level 1 ring, defined as a level 2 ring, and so on, until multiple ring patterns in the ring network set are obtained The affiliation relationship of the network, where the connection includes intersecting or tangential, and the ring link that has no link connection relationship with the sink node may be defined as a ring. For example, as shown in the network topology shown in FIG. 4, the radio network controller (RNC) is a sink node, and the first ring network connected to the RNC can be obtained as BACGHIJB, and the ring network BACGHIJB can be defined as The 0 ring, the remaining three ring networks IPQRSI, GKLMNOHG, DEFD and the ring network BACGHIJB, then these three ring networks can be defined as a level 1 ring.

It should be noted that the multiple ring networks in the ring network set may be the same or different based on different home nodes.

304. Obtain a service path between the originating node and the terminating node according to the ring network set and the affiliation relationship.

Wherein, when determining the attribution relationship of the plurality of ring networks in the ring network set After that, the service path between the start node and the terminating node may be obtained according to the ring network set and the affiliation relationship of the plurality of ring networks, which may be based on the ring network set and the affiliation relationship of the plurality of ring networks. Obtaining the shortest path between the starting node and the terminating node, and since the starting node is directly connected to the sink node through the acyclic network, the terminating node is directly connected to the source node directly or through the acyclic network, so The service path between the originating node and the terminating node can obtain the service path between the sink node and the source node.

Specifically, the method for obtaining the shortest path between the start node and the end node may be: when the service path between the source node and the sink node needs to be acquired, the termination node connected to the source node may be acquired first, The terminating node is located on the ring network, and is directly connected to the source node, or is indirectly connected to the source node through the acyclic network. After obtaining the terminating node connected to the source node, the ring network may be determined according to step 303. A affiliation relationship of the plurality of ring networks in the set, obtaining a shortest path between the start node and the terminating node, and further a service path between the source node and the sink node, where the network path information may be determined according to network topology information The condition to get the shortest path is also to get the shortest path directly with the shortest hop count. Moreover, when obtaining the shortest path between the initiating node and the terminating node, the basic information of the shortest link may be saved, and the basic information may include link basic information, such as link identifier, type, link end-to-end node information, and the like. The link ring identifier, for example, is the affiliation relationship between the ring network and the ring network. The link end and end nodes can store related key information, such as the network element identifier, type, board port, IP, according to the network topology information. Port type, etc.

For example, as shown in FIG. 4, when it is required to acquire the service path of the base station node B 1 (NodeB l ) under the control of the RNC to the RNC, it may first traverse up to the node M hop by hop, and the node M is the terminating node, and then calculate The shortest path from M to the upper ring network is MNOH, and the traversal is continued to obtain the node H to the node B, that is, the shortest link of the starting node is HI-JB, thereby acquiring the service from the base station NodeB l to the RNC. The path is NodeB l -MN-0-HIJB-RNC, and the hop-by-hop link flag can be recorded, such as the affiliation relationship between the ring network member and the ring network, and the acyclic network. Other base stations under the control of the RNC, such as NodeB2, can also obtain the shortest service path. For the NodeB2-QPIJB-RNC, for example, the shortest service path to the RNC of the Base Transceiver Station 1 (BTS 1) can be obtained. In order to determine the service path of all the source nodes to the sink nodes in the network, after traversing all the base stations in the RNC, the service path of all the base stations under the next base station controller (B SC ) can be traversed and recorded. save.

It should be noted that, in order to obtain the service paths from all the source nodes to the sink nodes in the network, all the source nodes under the control of the sink nodes can be traversed one by one, so that the service paths of all the source nodes to the sink nodes in the network can be determined.

Moreover, when acquiring the ring network set of the communication network, only the ring network subset of the node whose link number is greater than or equal to 3 is obtained, which reduces the complexity of acquiring the ring network and improves the performance.

It should be noted that the method for calculating the service path and the network topology presentation method provided by the embodiments of the present invention support the capacity simulation calculation of the entire network in the planning phase and the BOQ export of the entire network device, and specifically, the hop link can be calculated. The number of network elements at the end, such as the number of base stations, and according to the capacity bandwidth requirement of the end network element, according to the capacity calculation formula, such as the convergence calculation formula, automatically calculates the network element bandwidth requirement of the link, and automatically calculates according to the interface type. The hardware specification requirements of the outbound network element are calculated, and finally the hardware specification list of the network elements of all nodes in the whole network is calculated, and the whole network BOQ is derived, which provides data support for the cost evaluation before the bidding. And when the network planning adjustment is changed, the method provided by the embodiment of the present invention can automatically present the influence on the periphery, such as the automatic update calculation and presentation of the entire network capacity after the update. And can also be applied to the dynamic presentation of the entire network rolling planning data and the current network review In the scenario of the analysis, the entry of the existing network data and the new service to the capacity of the end network element, and the automatic analysis of whether the bottleneck node of the current network supports the future business development, the embodiments of the present invention are not listed here.

Another embodiment of the present invention provides a service path calculation apparatus, which is applied to a communication network, where the communication network includes a start node and a termination node. As shown in FIG. 5, the apparatus includes: a first acquisition unit 41, The second obtaining unit 42, the determining unit 43, and the third obtaining unit 44.

The first obtaining unit 41 is configured to acquire network topology information of the communication network. The second obtaining unit 42 is configured to acquire, according to the network topology information obtained by the first acquiring unit 41, a ring network set of the communication network, where the ring network set includes multiple connected a ring network, where the plurality of connected ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs.

a determining unit 43, configured to determine a affiliation relationship of the plurality of ring networks obtained by the second acquiring unit 42, where a ring network in the plurality of ring networks belongs to the ring network The ring network of the highest parent level in the ring network, the ring network to which the originating node belongs or the ring network to which the terminating node belongs is the ring network of the highest parent level in the communication network.

a third obtaining unit 44, configured to acquire, according to the ring network set obtained by the second acquiring unit 42 and the attribution relationship obtained by the determining unit 43, between the starting node and the terminating node Business path.

Further, as shown in FIG. 6, the second obtaining unit 42 is specifically configured to: select, according to the network topology information, a set of branch nodes of the communication network; wherein, the branch node set includes A plurality of branch nodes, wherein the branch nodes are nodes having a link number greater than or equal to 3.

Obtaining, according to the network topology information, a ring network subset corresponding to each of the branch nodes; wherein the ring network subset corresponding to the branch node includes a ring network including the branch node.

According to the ring network subset corresponding to each of the branch nodes, by removing redundant The ring network and the intersecting ring network are removed such that the ring network set is obtained. Further, the third obtaining unit 44 is specifically configured to:

Further, the device may further include: a presentation unit 45.

The presentation unit 45 is configured to present the communication network according to the ring network set obtained by the second obtaining unit 42 and the attribution relationship obtained by the determining unit 43.

The service path computing device provided by the embodiment of the present invention first obtains a ring network set including a plurality of connected ring networks according to the network topology information in the obtained communication network, and then determines the obtained multiple The ownership relationship of the ring network is finally obtained according to the obtained ring network set and the ownership relationship of the plurality of ring networks, and the service path between the start node and the terminating node is obtained, thereby obtaining the service path between the sink node and the source node. For the communication network in the planning stage, the calculation of the service path is realized only when the network device interconnection relationship can be obtained, and even the site-level interconnection planning information can be obtained.

Another embodiment of the present invention provides a network topology rendering apparatus, which is applied to a communication network, where the communication network includes a start node and a termination node. As shown in FIG. 7, the apparatus includes: an acquiring unit 5 1 , presenting Unit 52.

The acquiring unit 5 1 is configured to acquire a ring network topology set in the communication network, where the ring network topology set includes a topology of multiple connected ring networks and the multiple connected rings The affiliation of the type of network; wherein the plurality of connected ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs, and rings in the plurality of ring networks The type network belongs to the ring network of the highest parent level in the ring network connected to the ring network, and the ring network to which the start node belongs or the ring network to which the terminating node belongs is the communication network. Medium highest parent Ring network.

a presentation unit 52, configured to present, according to the ownership relationship of the multiple connected ring networks obtained by the obtaining unit 51, and the topology of the multiple connected ring networks, presenting the extension of the communication network Park.

Further, when the network element node belongs to the network element node on the topology of the ring network, all the network element nodes on the topology of the network element node and the ring network are presented in a ring form; or When the network element node does not belong to the network element node on the topology of the ring network, the network element node and all network element nodes subordinate to the network element node are presented in a tree form; or when When the network element node meets the preset condition, all the network element nodes subordinate to the network element node are clouded and presented.

The network topology presenting apparatus provided by the embodiment of the present invention acquires a ring network topology set in a communication network, and according to the topology of the plurality of connected ring networks included in the acquired ring network topology set The affiliation relationship of the multiple connected ring networks presents the topology of the communication network, so that the service path-based network in the large-scale network scenario in the planning stage is realized on the basis of the service path of the communication network in the planning stage. The presentation of the topology.

Another embodiment of the present invention provides a service path computing device. As shown in FIG. 8, the method includes: at least one processor 61, a memory 62, a communication interface 63, and a bus 64. The at least one processor 61, the memory 62, and the communication interface 63 is connected via bus 64 and completes communication with each other, wherein:

The bus 64 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (ESA) bus. The bus 64 can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line table is used in Figure 8. Show, but does not mean that there is only one bus or one type of bus.

The memory 62 is for storing executable program code, the program code including computer operating instructions. The memory 62 may include a high speed RAM memory and may also include a non-volatile memory such as at least one disk memory.

The processor 61 may be a Central Processing Unit (CPU), or an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present invention. .

The communication interface 63 is mainly used to implement communication between devices of the embodiment. The processor 61 is configured to execute executable program code stored in the memory 62, specifically for performing the following operations:

The processor 61 is configured to acquire network topology information of the communication network, and acquire, according to the network topology information, a ring network set of the communication network, where the ring network set includes multiple phases. a ring network in which the plurality of connected ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs; determining the attribution of the plurality of ring networks a ring network in the plurality of ring networks belongs to a ring network of a highest parent level in a ring network connected to the ring network, and the ring network to which the start node belongs or The ring network to which the terminating node belongs is the ring network of the highest parent level in the communication network; according to the ring network set and the affiliation relationship, acquiring between the starting node and the terminating node Business path.

Further, the processor 61 is further configured to: select, according to the network topology information, a set of branch nodes of the communication network; where the set of branch nodes includes multiple branch nodes, and the branch The node is a node having a link number greater than or equal to 3; obtaining, according to the network topology information, a ring network subset corresponding to each of the branch nodes; wherein the branch network node corresponding to the ring network subset Include a ring network including the branch node; according to a ring network subset corresponding to each of the branch nodes, by removing redundant ring networks and removing intersecting ring networks, so that the rings are obtained Type network collection. Further, the processor 6 1 is further configured to acquire, according to the ring network set and the affiliation relationship, a shortest path between the start node and the terminating node.

Further, the processor 6 1 is further configured to present the communication network according to the ring network set and the attribution relationship.

Another embodiment of the present invention provides a network topology rendering apparatus, as shown in FIG. 9, including: at least one processor 71, a memory 72, a communication interface 73, and a bus 74, the at least one processor 71 and the memory 72. And the communication interface 73 is connected through the bus 74 and completes communication with each other, wherein:

The bus 74 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EI SA) bus. . The bus 74 can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 9, but it does not mean that there is only one bus or one type of bus.

The memory 72 is for storing executable program code, the program code including computer operating instructions. Memory 72 may contain high speed RAM memory and may also include non-volatile memory, such as at least one disk memory.

The processor 7 1 may be a central processor (Central Proce s sing) Unit, CPU), or an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present invention.

The communication interface 73 is mainly used to implement communication between devices of the embodiment. The processor 71 is configured to execute executable program code stored in the memory 72, specifically for performing the following operations:

The processor 71 is configured to acquire a ring network topology set in the communication network, where the ring network topology set includes a topology of a plurality of connected ring networks and the plurality of connected a locating relationship of the ring network; wherein the plurality of adjacent ring networks include a ring network to which the originating node belongs and a ring network to which the terminating node belongs, in the plurality of ring networks The ring network belongs to the ring network of the highest parent level in the ring network connected to the ring network, and the ring network to which the start node belongs or the ring network to which the terminating node belongs is the communication a ring network of the highest parent level in the network; presenting a topology of the communication network according to the attribution relationship of the plurality of connected ring networks and the topology of the plurality of connected ring networks.

The network topology presenting apparatus provided by the embodiment of the present invention acquires a ring network topology set in a communication network, and according to the topology of the plurality of connected ring networks included in the acquired ring network topology set The attribution relationship of the plurality of connected ring networks presents the topology of the communication network, so that the basis of the service path of the communication network in the planning stage is obtained. On the basis of this, the presentation of the network topology based on the service path is realized under the large-scale network scenario in the planning stage.

Through the description of the above embodiments, those skilled in the art can clearly understand that the present invention can be implemented by means of software plus necessary general hardware, and of course, by hardware, but in many cases, the former is a better implementation. . Based on such understanding, the technical solution of the present invention, which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a readable storage medium, such as a floppy disk of a computer. A hard disk or optical disk or the like includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present invention.

The above is only the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any change or replacement that can be easily conceived by those skilled in the art within the technical scope of the present invention is All should be covered by the scope of the present invention. Therefore, the scope of protection of the present invention should be protected by the scope of the claims

Claims

claims

1. A service path calculation method applied in a communication network. The communication network includes a starting node and a ending node, and is characterized by including:

Obtain network topology information of the communication network;

According to the network topology information, a ring network set of the communication network is obtained; wherein the ring network set includes a plurality of connected ring networks, wherein the multiple connected ring networks include The starting node, the ring network to which it belongs and the ring network to which the termination node belongs;

Determine the belonging relationship of the plurality of ring networks; wherein, the ring network in the plurality of ring networks belongs to the ring network with the highest parent level among the ring networks connected to the ring network, so The ring network to which the starting node belongs or the ring network to which the termination node belongs is the ring network with the highest parent level in the communication network;

According to the ring network set and the belonging relationship, the service path between the starting node and the ending node is obtained.

2. The service path calculation method according to claim 1, characterized in that: obtaining a ring network set of the communication network according to the network topology information includes:

According to the network topology information, select a branch node set of the communication network; wherein, the branch node set includes multiple branch nodes, and the branch node is a node with a number of links greater than or equal to 3;

According to the network topology information, obtain a ring network subset corresponding to each branch node; wherein, the ring network subset corresponding to the branch node includes a ring network including the branch node;

According to the ring network subset corresponding to each branch node, the ring network set is obtained by removing redundant ring networks and removing intersecting ring networks.

3. The service path calculation method according to claim 1 or 2, characterized in that, according to the ring network set and the belonging relationship, the service between the starting node and the ending node is obtained. Path, including:

According to the ring network set and the belonging relationship, obtain the starting node and all The shortest path between the terminal nodes.

4. The service path calculation method according to any one of claims 1 to 3, characterized in that it also includes:

The communication network is presented according to the ring network set and the belonging relationship.

5. A network topology presentation method, applied to a communication network. The communication network includes a starting node and a ending node, characterized in that it includes:

Obtaining a ring network topology set in the communication network, the ring network topology set includes the topology of multiple connected ring networks and the ownership relationships of the multiple connected ring networks; wherein , the plurality of connected ring networks include a ring network to which the starting node belongs and a ring network to which the termination node belongs, and the ring network in the plurality of ring networks belongs to the The ring network with the highest parent level among the ring networks connected to the ring network. The ring network to which the starting node belongs or the ring network to which the termination node belongs is the ring network with the highest parent level in the communication network. network;

The topology of the communication network is presented according to the belonging relationships of the plurality of connected ring networks and the topology of the plurality of connected ring networks.

6. The network topology presentation method according to claim 5, characterized in that, when a network element node belongs to a network element node on the topology of the ring network, the network element node and the ring type All network element nodes on the network topology are presented in the form of a ring; or

When the network element node does not belong to the network element node in the topology of the ring network, the network element node and all network element nodes subordinate to the network element node are presented in a tree form; or

When the network element node meets the preset conditions, all network element nodes subordinate to the network element node are presented in the cloud;

The preset conditions include: the number of source nodes belonging to the network element node meets a preset display number threshold, or, the number of hops from all the source nodes that the service path passes through the network element node to the network element node. and satisfy the preset hop count threshold, or, the device type of the network element node is a specified device type.

7. A service path calculation device, applied in a communication network, the communication network Including a start node and a termination node, characterized in that it includes: at least one processor, a memory, a communication interface and a bus, and the at least one processor, the memory and the communication interface are connected to each other through the bus and complete the communication between them. Communication;

The processor is used to execute executable program codes stored in the memory, and is specifically used to perform the following operations:

The processor is configured to obtain network topology information of the communication network; obtain a ring network set of the communication network according to the network topology information; wherein the ring network set includes multiple connected A ring network, wherein the plurality of connected ring networks include a ring network to which the starting node belongs and a ring network to which the termination node belongs; determining the ownership relationship of the plurality of ring networks ; Wherein, the ring network among the plurality of ring networks belongs to the ring network with the highest parent level among the ring networks connected to the ring network, and the ring network to which the starting node belongs or the ring network to which the starting node belongs The ring network to which the termination node belongs is the ring network with the highest parent level in the communication network; according to the ring network set and the belonging relationship, the business between the start node and the termination node is obtained path.

8. The service path calculation device according to claim 7, wherein the processor is further configured to select a set of branch nodes of the communication network according to the network topology information; wherein, the branch The road node set contains multiple branch nodes, and the branch nodes are nodes with a number of links greater than or equal to 3; according to the network topology information, obtain a ring network subset corresponding to each branch node; Wherein, the ring network subset corresponding to the branch node includes a ring network including the branch node; according to the ring network subset corresponding to each branch node, by removing redundant ring networks and remove intersecting ring networks to obtain the set of ring networks.

9. The service path calculation device according to claim 7 or 8, characterized in that the processor is further configured to obtain the starting node and the attribution relationship according to the ring network set and the belonging relationship. The shortest path between terminating nodes.

10. The service path calculation device according to any one of claims 7-9, characterized in that,

The processor is also configured to present a Now the communication network.

1 1. A network topology presentation device used in a communication network. The communication network includes a start node and a termination node. It is characterized in that it includes: at least one processor, memory, communication interface and bus, the at least A processor, the memory and the communication interface are connected through the bus and communicate with each other;

The processor is configured to obtain a ring network topology set in the communication network. The ring network topology set includes the topology of multiple connected ring networks and the multiple connected ring networks. The ownership relationship of the ring network; wherein, the plurality of connected ring networks include the ring network to which the starting node belongs and the ring network to which the termination node belongs, and the rings in the plurality of ring networks The ring network belongs to the ring network with the highest parent level among the ring networks connected to the ring network, and the ring network to which the starting node belongs or the ring network to which the termination node belongs is the communication network The ring network with the highest parent level in

12. The network topology presentation device according to claim 11, characterized in that when a network element node belongs to a network element node on the topology of the ring network, the network element node and the ring All network element nodes on the network topology are presented in the form of a ring; or