CN106817306B

CN106817306B - Method and device for determining target route

Info

Publication number: CN106817306B
Application number: CN201510850234.XA
Authority: CN
Inventors: 张奇
Original assignee: China Mobile Group Design Institute Co Ltd
Current assignee: China Mobile Group Design Institute Co Ltd
Priority date: 2015-11-27
Filing date: 2015-11-27
Publication date: 2019-12-27
Anticipated expiration: 2035-11-27
Also published as: CN106817306A

Abstract

The embodiment of the invention discloses a method and a device for determining a target route. In the embodiment of the invention, according to the attribution information of the network nodes, the network nodes of which the network resource states among the network nodes meet the set conditions are divided into the virtual nodes to be used, the virtual node route from the source virtual node where the source node is located to the destination virtual node where the destination node is located is determined according to the connection relation among the virtual nodes to be used, and then the target route from the source node to the destination node is determined according to the connection relation of the network nodes in the virtual node route and the transmission requirement from the source node to the destination node. In the embodiment of the invention, the network is simplified from two aspects of network resource states among network nodes and virtual node routing, so that the number of nodes in the traversal time is reduced, the computational complexity is simplified, and the efficiency of determining the target routing is improved.

Description

Method and device for determining target route

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for determining a target route.

Background

With the explosive growth of mobile terminals and contents, the wide application of service virtualization and the maturity of cloud network technologies and applications such as cloud storage and cloud computing, the flow and the flow direction of next-generation IT services have started to be changed to the directions of elasticity, dynamism, flexibility and the like. The network structure, bandwidth planning and scheduling configuration of the transport network as the basic bearer continue to bear the traditional rigid bandwidth and fixed office direction service for a long time. Although the introduction of new technology and the superposition of new planes meet the requirements of new services in terms of bandwidth bearing, the gradual swelling of network structures and the continuous increase of idle bandwidth resources of networks become bottlenecks in the development of the current transmission networks. Therefore, in the face of future development of transport networks, it is necessary to more fully, efficiently and flexibly exert network capabilities on the premise of meeting network quality.

In the existing ASON (automatic Switched Optical Network) technology, a Dijstra-based routing algorithm is mainly adopted for routing calculation, the number of nodes traversed is large, the calculation scale is in direct proportion to the Network complexity, and the method is not suitable for rapid calculation of large metropolitan area Network routing and service simulation pre-deployment analysis when Network planning is oriented. Although multi-domain path calculation is introduced in the development stage of the SDN technology, the calculation complexity can be properly simplified. But its core algorithm is still the same as ASON, and when the inter-domain connection is too much, the route splicing efficiency will be deteriorated, and its complexity is comparable to ASON technology.

Therefore, a method for determining a target route that can effectively simplify the computational complexity is needed.

Disclosure of Invention

The embodiment of the invention provides a method and a device for determining a target route, which are used for effectively reducing the computational complexity of determining the target route.

The method for determining the target route provided by the embodiment of the invention comprises the following steps:

dividing network nodes of which the network resource states among the network nodes in the first network topological graph meet set conditions into first virtual nodes to be used according to the attribution information of the network nodes; the first virtual node to be used comprises at least one network node;

determining a first virtual node route from a source virtual node where a source node is located to a destination virtual node where a destination node is located according to the connection relation between the first virtual nodes to be used;

and determining a target route from the source node to the sink node according to the connection relation of each network node in the first virtual node route and the first transmission requirement from the source node to the sink node.

Preferably, the network resource status between the network nodes is the resource availability of the link bandwidth between the network nodes;

the dividing, according to the attribution information of the network nodes, the network nodes whose network resource states among the network nodes meet the set conditions into the first virtual nodes to be used includes:

dividing network nodes with the same attribution information into a virtual node according to the attribution information of the network nodes;

and deleting the links between the network nodes of which the resource availability of the link bandwidth between the network nodes is smaller than a first threshold value to obtain the first virtual node to be used.

Preferably, the determining a target route from the source node to the sink node according to the connection relationship of each network node in the first virtual node route and the first transmission requirement from the source node to the sink node includes:

determining alternative target routes from the source node to the host node according to the connection relation of each network node in the virtual node route;

determining the score value of each alternative target route according to a first transmission requirement from the source node to the sink node; the first transmission requirement from the source node to the sink node comprises any one or any combination of network node routing hop count, first virtual node routing hop count and network resource bearing capacity of the alternative target route;

and determining the candidate target routes with the score values larger than or equal to a second threshold value as target routes according to the score values of the candidate target routes.

Preferably, after determining the candidate target route with the score value greater than or equal to the second threshold as the target route, the method further includes:

deleting links among network nodes related to the target route, and updating the first network topological graph to obtain a second network topological graph; or updating the first network topological graph according to the network resource state among the network nodes of the target route to obtain a second network topological graph;

according to the attribution information of the network nodes, dividing the network nodes of which the network resource states among the network nodes in the second network topological graph meet the set conditions into second virtual nodes to be used;

determining a second virtual node route from the source virtual node where the source node is located to the destination virtual node where the destination node is located according to the connection relation between the second virtual nodes to be used;

and determining a standby route from the source node to the sink node according to the connection relation of each network node in the second virtual node route and the second transmission requirement from the source node to the sink node.

Preferably, the determining a backup route from the source node to the sink node according to the connection relationship of each network node in the second virtual node route and the second transmission requirement from the source node to the sink node includes:

determining an alternative standby route from the source node to the host node according to the connection relation of each network node in the second virtual node route;

determining the credit value of each alternative standby route according to a second transmission requirement from the source node to the sink node; the second transmission requirement from the source node to the sink node comprises any one or any combination of the number of the same route segments of the alternative standby route and the target route, the network node routing hop number of the alternative standby route, the second virtual node routing hop number and the network resource bearing capacity;

and determining the alternative standby route with the score value larger than or equal to a third threshold value as the standby route according to the score value of each alternative standby route.

Preferably, the method further comprises:

and determining a plurality of alternative target routes which meet the requirement of network resource bearing capacity by the sum of the network resource bearing capacity as target routes under the condition that the score values of the alternative target routes are smaller than the second threshold value according to the score values of the alternative target routes.

Preferably, the candidate target routes include the 1 st to nth candidate target routes;

the 1 st alternative target route is determined by:

according to the score value of each alternative target route, taking the alternative target route with the highest score value as the 1 st alternative target route;

the ith (1< i ≦ N) candidate target route is determined by:

updating the ith-1 network topological graph according to the network resource state among the network nodes of the ith-1 target route to obtain the ith network topological graph;

dividing the network nodes of which the network resource states among the network nodes in the ith network topology graph meet set conditions into ith virtual nodes to be used according to the attribution information of the network nodes;

determining the ith virtual node route from the source virtual node where the source node is located to the destination virtual node where the destination node is located according to the connection relation between the ith virtual nodes to be used;

and determining the ith target route from the source node to the sink node according to the connection relation of each network node in the ith virtual node route and the ith transmission requirement from the source node to the sink node.

The embodiment of the invention provides a device for determining a target route, which comprises:

the processing module is used for dividing the network nodes of which the network resource states among the network nodes in the first network topological graph meet the set conditions into first virtual nodes to be used according to the attribution information of the network nodes; the first virtual node to be used comprises at least one network node;

the first determining module is used for determining a first virtual node route from a source virtual node where a source node is located to a destination virtual node where a destination node is located according to the connection relation between the first virtual nodes to be used;

a second determining module, configured to determine a target route from the source node to the sink node according to a connection relationship between network nodes in the first virtual node route and a first transmission requirement from the source node to the sink node.

the processing module is specifically configured to:

Preferably, the second determining module is specifically configured to:

Preferably, the method further comprises the following steps: an update module; the update module is to:

the processing module is further configured to:

the first determination module is further to:

the second determination module is further to:

Preferably, the second determining module is specifically configured to:

Preferably, the second determining module is further configured to:

the second determining module is specifically configured to:

determining the 1 st alternate target route by:

determining an i-th (1< i ≦ N) candidate target route by:

In the above embodiment of the present invention, according to the attribution information of the network nodes, the network nodes whose network resource states among the network nodes in the first network topology map satisfy the set condition are divided into the first virtual nodes to be used; the first virtual node to be used comprises at least one network node; determining a first virtual node route from a source virtual node where a source node is located to a destination virtual node where a destination node is located according to the connection relation between the first virtual nodes to be used; and determining a target route from the source node to the sink node according to the connection relation of each network node in the first virtual node route and the first transmission requirement from the source node to the sink node. In the embodiment of the invention, firstly, the network is simplified according to the network resource state among the network nodes, the complexity of the overall routing calculation is reduced, then, the network is simplified again according to the virtual node routing, and further, the target routing can be determined based on the simplified network; therefore, in the embodiment of the invention, the network is simplified from two aspects of network resource states among network nodes and virtual node routing, so that the number of nodes in the traversal process is obviously reduced, the calculation complexity is simplified, and the efficiency of determining the target routing is improved.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.

Fig. 1 is a schematic flowchart corresponding to a method for determining a target route according to an embodiment of the present invention;

FIG. 2 is a network topology diagram according to an embodiment of the present invention;

FIG. 3 is a diagram of a stacked control mechanism and a virtual network topology;

FIG. 4a is a schematic diagram of the available bandwidth of a link;

FIG. 4b is a simplified network topology based on the available bandwidth of the link;

FIG. 4c is a simplified schematic diagram of virtual node connections based on the connection relationships between virtual nodes;

FIG. 4d is a simplified network topology based on the connection relationships between virtual nodes;

FIG. 4e is a network topology diagram except for the primary route;

FIG. 5 is a flow chart illustrating the determination of an alternate route according to an embodiment of the present invention;

fig. 6 is a schematic flow chart illustrating a process of determining a target route by using a multi-service load sharing manner in the embodiment of the present invention;

fig. 7 is a schematic network structure diagram of a PTN network;

FIG. 8 is a schematic diagram of the interconnection relationship between network nodes;

FIG. 9 is a diagram illustrating a calculation result of a primary router;

FIG. 10 is a diagram illustrating the results of backup route calculation;

FIG. 11 is a diagram illustrating the result of the calculation of the large bandwidth multi-routing sharing;

fig. 12 is a schematic structural diagram of an apparatus for determining a target route according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

Fig. 1 is a schematic flowchart corresponding to a method for determining a target route according to an embodiment of the present invention, where the method includes:

step 101, dividing network nodes of which the network resource states among the network nodes in a first network topological graph meet set conditions into first virtual nodes to be used according to the attribution information of the network nodes; the first virtual node to be used comprises at least one network node;

step 102, determining a first virtual node route from a source virtual node where a source node is located to a destination virtual node where a destination node is located according to the connection relation between all first virtual nodes to be used;

step 103, determining a target route from the source node to the sink node according to the connection relationship of each network node in the first virtual node route and the first transmission requirement from the source node to the sink node.

In the embodiment of the invention, firstly, the network is simplified according to the network resource state among the network nodes, the complexity of the overall routing calculation is reduced, then, the network is simplified again according to the virtual node routing, and further, the target routing can be determined based on the simplified network; therefore, in the embodiment of the invention, the network is simplified from two aspects of network resource states among network nodes and virtual node routing, so that the number of nodes in the traversal process is obviously reduced, the calculation complexity is simplified, and the efficiency of determining the target routing is improved.

In step 101, the attribution information of the network node may be subnet information to which the network node belongs or administrative domain information to which the network node belongs. In the embodiment of the present invention, according to the attribution information of the network nodes, the network nodes with the same attribution information may be divided into one virtual node, that is, the network nodes in the same subnet or the same management domain in the network may be divided into one virtual node, or may also be referred to as one virtual network element or one domain. The network resource status between the network nodes may be resource availability, time delay or error rate of link bandwidth between the network nodes.

The following describes a virtual node by taking a simple network as an example. Fig. 2 is a schematic diagram of network logical connection. The network comprises network nodes c1-c5, d11-d12, d21, d31-d33 and d41-d44, according to attribution information of each network node, c1-c5 can be divided into virtual nodes a, the virtual nodes are also core virtual nodes, d11-d12 are divided into virtual nodes b, d21 is divided into virtual nodes c, d31-d33 is divided into virtual nodes d, and d41-d44 is divided into virtual nodes e.

In the embodiment of the invention, each virtual node only comprises the network element node of the virtual node, the network node logic connection in the virtual node belongs to intra-domain connection, and the connection between different virtual nodes belongs to cross-domain connection. The embodiment of the invention adopts a stacked Domain Control mechanism. Each virtual node controller can only collect and calculate the routing information in the virtual node, and the cross-domain connection and inter-domain logic relationship are governed by the upper virtual node controller. FIG. 3 is a diagram of a stacked control mechanism and a virtual network topology. As shown in fig. 3, the global controller is used to manage cross-domain connection and inter-domain logical relationship, and each virtual node controller is used to manage the routing information in the virtual node. Of course, other control mechanisms may be adopted in the embodiments of the present invention, such as using one controller to control the routing information in all the virtual nodes.

Further, in order to adapt to a system adopting a stacked management and data processing mode, the data storage in the embodiment of the present invention adopts a multi-domain storage mode, that is, storage files are divided into two types: the first type is a data storage file in the virtual node, and the second type is an inter-domain link information storage file. The first type of file consists of 1 or more sheets, each sheet represents a virtual node, the name of the sheet is the name of the virtual node, and the information format stored in each sheet is shown in table 1.

Table 1: data storage format in virtual node

Table 1 is merely one example of a data file within a virtual node. As shown in table 1, the data files in the virtual nodes are mainly divided into three parts: the first part is a first line of the file and is used for representing the names of all network nodes in the virtual node; the second part is used for representing the total bandwidth capacity of links among the network nodes in the virtual nodes (xx area part in the table 1), the part is represented in a matrix mode, and each cell represents the configuration capacity of the links among the network nodes in the corresponding virtual node; the third part is used for representing the usage amount of the link bandwidth between the network nodes in the virtual node (yy area part in table 1), and each cell represents the actual usage condition of the link bandwidth between the network nodes in the corresponding virtual node.

The second type of file (i.e., inter-domain link information storage file) is similar to the data file in the virtual node, but considering that the inter-virtual node connection may be extremely complicated according to the network structure, the second type of file abandons the matrix representation, and represents the files in rows of each link, thereby simplifying the table complexity and readability. As shown in table 2, columns 1 and 2 in the table are two end points in the link between the virtual nodes, and columns 3 and 4 are the configuration capacity and the actual usage of the link bandwidth of the corresponding link between the virtual nodes, respectively.

Table 2: data storage format between virtual nodes

Furthermore, in order to facilitate daily maintenance and reference, the file storage format can be set to be an Excel format.

On the basis of a network logical connection structure, the service satisfaction degrees of different network paragraphs are different in consideration of network resource states (including link bandwidth or time delay and the like). Thus, embodiments of the present invention translate this difference into a resource dynamism of the network. The connections between network nodes in a dynamic network not only represent physical connections that do exist, but also connections that can meet the traffic demands.

Taking the link bandwidth as an example, the network of the above example is also used, and after the network operates and carries a certain scale of traffic, the available bandwidth of each link is as shown in fig. 4a (a schematic diagram of the available bandwidth of the link) (unit Mbps). When the traffic bandwidth requirement is 450Mbps from end to end (i.e. from network node to network node), the network dynamic that the whole network can meet the requirement from the bandwidth point of view becomes fig. 4b (a network topology simplified according to the available bandwidth of the link).

Specifically, the connection of network nodes within the virtual nodes d of d31 to d33 is taken as an example. As shown in table 3, the connection matrix in the virtual node d is set before dynamic adjustment.

Table 3: connection matrix in virtual node d (before dynamic adjustment)

d31	d32	d33
			0	1000	0
1000	0	1000
			0	1000	0
0	700	0
			700	0	700
0	700	0

When the transmission bandwidth requirement of d11 → d33 is 450Mbps, the connection matrix in virtual node d is dynamically adjusted as shown in Table 4:

table 4: connection matrix in virtual node d (after dynamic adjustment)

d31	d32	d33
			0	1000	0
1000	0	1000
			0	1000	0
0	0	0
			0	0	0
0	0	0

It can be seen that, because the bearer bandwidth is too large (450> 1000-. Therefore, the network connection in the virtual node d can be simplified according to the dynamically adjusted connection matrix, and similarly, the connection between the virtual nodes can be updated in the same manner, that is, the link between the network nodes with the resource availability of the link bandwidth between the network nodes being less than 450Mbps is deleted.

In step 101, the first threshold may be set by a person skilled in the art according to actual situations. With the above exemplary network and the above manner, assuming that the first threshold is 450Mbps, the divided virtual nodes to be used are the virtual node a, the virtual node b, the virtual node c, the virtual node d, and the virtual node e, respectively, and the network connection in each virtual node is simplified, which can be referred to in detail in fig. 4 b.

In step 102, based on the dynamically adjusted network structure, a connection relationship matrix of the virtual nodes as shown in table 5 can be obtained according to the connection relationship between the virtual nodes.

Table 5: connection relation matrix of virtual nodes

Virtual node b	Virtual node c	Virtual node d	Virtual node e	Virtual node a
					0	0	0	0	1
0	0	0	0	1
					0	0	0	0	1
0	0	0	0	1
					1	1	1	1	0

The number "1" in the above table represents that there is a connection between the virtual nodes that satisfies the traffic bandwidth transfer capability.

In the embodiment of the present invention, d11 is assumed to be a source node, and d33 is assumed to be a sink node. Based on the above table, after the determination of the virtual node where the source/sink node is located and the staticized routing calculation, the virtual node routes of the virtual node d where the virtual nodes b to d33 where d11 are located are: virtual node b → virtual node a → virtual node d. Therefore, the virtual node connection relationship matrix can be further simplified by the virtual nodes involved in the path between the virtual nodes, as shown in tables 6 and 7.

Table 6: connection relation matrix of virtual node (I)

Virtual node b	Virtual node d	Virtual node a
			0	0	1
0	0	1
			1	1	0

Table 7: connection relation matrix of virtual node

Further, the path between the virtual node b where d11 is located and the virtual node d where d33 is located is: d11 → virtual node a → d33, as shown in FIG. 4c, is a simplified schematic diagram of virtual node connection based on the connection relationship between the virtual nodes. Fig. 4d is a simplified network topology diagram according to the connection relationship between the virtual nodes.

In the embodiment of the invention, the simplified network is used as the basis for determining the target route, thereby obviously reducing the number of node traversal time, simplifying the computational complexity and improving the efficiency of determining the target route.

To further verify the above effect achieved by simplifying the network, the above example network is used as an example, and the actual verification is performed on the system platform.

Verification one:

and in the case of determining the virtual nodes according to the attribution information of the network nodes, traversing all the logical connection links between the source and destination nodes, observing the final traversal quantity, and totally calculating 40 routes when the d11 → d33 is completely traversed.

And under the condition that the virtual node is not determined according to the attribution information of the network node, traversing all the logical connection links between the source node and the destination node, observing the final traversal quantity, and totally calculating 67 routes when the complete traversal d11 → d33 is found.

Therefore, by determining the virtual node from the home information of the network node, the scale of the route calculation can be simplified, and in this example, the way of determining the virtual node can reduce the route calculation amount by 40%.

And (5) verifying:

the requirement of the bandwidth of the link between the network nodes is properly set, and the traversal quantity of all the logic connection links between the source node and the destination node is traversed under the conditions of 10Mbps and 200Mbps by simulating the requirement of the bandwidth of the link between the network nodes.

When the demand of the link bandwidth among the network nodes is set to be 10Mbps, the network links can carry, and when the d11 → d33 are completely traversed, the total number of routes is 40.

When the demand of the link bandwidth among the network nodes is set to 200Mbps, the bearing capacity of partial network links reaches the upper limit, the system automatically excludes the route objects, and totally traverses d11 → d33 to obtain 30 routes in total.

Therefore, the routing complexity can be dynamically and finely adjusted by adopting a routing calculation mode with dynamic resource sensitivity according to the current situation and the requirement.

In step 103, determining an alternative target route from the source node to the destination node according to the connection relationship of each network node in the virtual node route; determining the score value of each alternative target route according to a first transmission requirement from a source node to a host node; and determining the alternative target routes with the score values larger than or equal to a second threshold value as target routes according to the score values of all the alternative target routes.

The first transmission requirement from the source node to the sink node comprises any one or any combination of network node routing hop count, first virtual node routing hop count and network resource bearing capacity of the alternative target route; in the embodiment of the invention, in order to comprehensively consider factors of various aspects, the preferable mode is as follows: the first transmission requirement comprises the network node routing hop count, the first virtual node routing hop count and the network resource bearing capacity of the alternative target routes, and the scoring value of each alternative target route is determined by setting corresponding weights for the three factors. Therefore, when a plurality of candidate target route selection items appear, the target route can be determined according to the grading result and is referred by a decision maker. In the actual process, an identifier can be set for the determined target route, so that a decision maker can conveniently select the target route. Because the target route does not necessarily completely meet the special operation requirements of the operator, the given target route is only recommended, and a decision maker can also select a non-recommended route.

The scoring rules are described in detail below.

In the embodiment of the present invention, the scoring intervals of each factor are all set to be [0,1], and 1 is a full score. And calculating the score of the j alternative target route on the factor k by adopting the following formula according to the factor k:

… … formula (1)

Wherein alpha is_jkThe score of the jth alternative target route on the factor k;

x_kthe actual value of the factor k for the jth candidate target route;

x_maxthe maximum value of the factor k is routed for each candidate target.

After the scores of the jth candidate target route on the factors (the three factors) are determined, the score value of the jth candidate target route is determined through the following formula:

… … formula (2)

Wherein, w_kIs the weight value of the factor k. P is the number of factors.

In the embodiment of the present invention, the weighted value of each factor can be flexibly set by a person skilled in the art according to experience, and specifically can be determined according to the recognition degree or the criticality of an operator for each factor.

For example, table 8 is an exemplary reference for setting the weight values.

Table 8: weight value distribution table

Further, in the embodiment of the present invention, after the target route is determined, in order to improve the stability of the system, a standby route may be further set. Specifically, deleting the link between the network nodes related to the target route, and updating the first network topology map to obtain a second network topology map; or updating the first network topological graph according to the network resource state among the network nodes of the target route to obtain a second network topological graph; according to the attribution information of the network nodes, dividing the network nodes of which the network resource states among the network nodes in the second network topological graph meet the set conditions into second virtual nodes to be used; determining a second virtual node route from the source virtual node where the source node is located to the destination virtual node where the destination node is located according to the connection relation between the second virtual nodes to be used; and determining a standby route from the source node to the sink node according to the connection relation of each network node in the second virtual node route and the second transmission requirement from the source node to the sink node.

In order to avoid the influence on the standby route caused by the problem of the target route, the preferred scheme in the embodiment of the invention is that the standby route and the target route do not have the same number of route segments. When the standby route is determined, the number of route segments related to the calculated and determined target route is set to be full load or unavailable, and the logical connection relation between the network nodes is readjusted to obtain a network topological graph except the target route, namely, the standby route is determined by adopting a one-segment calculation mode. For example, if the determined target route is d11 → c2 → c5 → d33, fig. 4e is a network topology diagram except the primary route. At this time, an alternative backup route from the source node to the destination node may be determined based on the routes shown in fig. 4 e. And determining the score value of each alternative standby route according to a second transmission requirement from the source node to the host node, and further determining the alternative standby route with the score value larger than or equal to a third threshold value as the standby route according to the score value of each alternative standby route. At this time, the second transmission requirement from the source node to the sink node may include the network node routing hop count, the second virtual node routing hop count, and the network resource carrying capacity of the alternative backup route; the scoring value of each alternative backup route can be obtained by the above formula (1) and formula (2).

Due to the network structure limitation, if the backup route meeting the condition cannot be determined based on each route shown in fig. 4e, the "two-stage" calculation method, i.e., the "best effort" calculation method, may be started to determine the backup route. Specifically, the resource availability of the link bandwidth between the network nodes is updated according to the resource availability of the link bandwidth between the network nodes of the target route, and the network is simplified according to the updated resource availability of the link bandwidth between the network nodes, so that an updated network topology map is obtained. And determining an alternative standby route under the condition that the same route segment is allowed, and further determining the standby route according to the grade value of the standby route. At this time, the second transmission requirement from the source node to the sink node includes four factors, such as the number of route segments of the alternative standby route, which are the same as the number of route segments of the target route, the network node route hops of the alternative standby route, the number of second virtual node route hops, and the network resource carrying capacity; the scoring value of each alternative backup route can be obtained by the above formula (1) and formula (2).

In the embodiment of the present invention, the standby route is preferably determined in the above-mentioned "one-stage" manner. If the standby route meeting the conditions is determined in the one-section mode, the standby route is not determined in the two-section mode; and determining the standby route in a two-section mode only when the standby route meeting the conditions is not determined in the one-section mode.

Fig. 5 is a schematic flowchart of determining a backup route according to an embodiment of the present invention, and a process of determining a backup route is specifically described below with reference to fig. 5.

Step 501, determining a target route;

step 502, setting the number of route segments related to the target route to be full load or unavailable, and readjusting the logical connection relationship between the network nodes to obtain a network topology map except the target route;

step 503, determining the score value of the alternative standby route based on the network topology map obtained in step 502 except the target route, and judging the standby route according to the score value of the alternative standby route;

step 504, according to the determination result, determining whether a standby route meeting the condition exists, if not, executing step 505; if yes, ending the flow;

step 505, updating the resource availability of the link bandwidth between the network nodes according to the actual bandwidth occupied by each route segment related to the target route, and simplifying the network according to the updated resource availability of the link bandwidth between the network nodes to obtain an updated network topology map;

step 506, determining a backup route by calculation and evaluation based on the updated network topology map obtained in step 505.

For the case of large bandwidth requirement, if there are multiple routes from the source node to the destination node, but none of the routes can completely satisfy the requirement of the target route (specifically, the service bandwidth carrying requirement of the target route), the target route may be determined by using a multi-service load sharing manner, that is, multiple candidate target routes whose sum of service bandwidth carrying capacities is greater than or equal to the second threshold are determined as the target route.

The plurality of candidate target routes includes the 1 st to nth candidate target routes. Specifically, according to the score value of each candidate target route, the candidate target route with the highest score value is used as the first candidate target route; subsequently, updating the 1 st network topological graph according to the resource usage amount of the link bandwidth between the network nodes of the 1 st target route to obtain a2 nd network topological graph; dividing the network nodes of which the network resource states among the network nodes in the 2 nd network topological graph meet the set conditions into the 2 nd virtual nodes to be used according to the attribution information of the network nodes; determining a2 nd virtual node route from a source virtual node where the source node is located to a destination virtual node where the destination node is located according to the connection relation between the ith virtual nodes to be used; and determining a2 nd target route from the source node to the sink node according to the connection relation of each network node in the 2 nd virtual node route and the 2 nd transmission requirement from the source node to the sink node. Specifically, the ith target route may also be determined according to the score value by using the above formula (1) and formula (2). In the embodiment of the invention, the transmission requirement from the source node to the sink node can be set according to specific conditions and different application scenes.

After the 2 nd target route is determined, calculating the sum of the network resource bearing capacity of the 1 st target route and the 2 nd target route, and if the sum of the network resource bearing capacity meets the service bandwidth bearing requirement, directly determining the 1 st target route and the 2 nd target route as the target routes; if the sum of the network resource carrying capacity does not meet the service bandwidth carrying requirement, the network topology map may be updated again according to the 2 nd target route, and the 3 rd target route … … is determined to be sequentially performed by circularly performing the above steps until N candidate target routes meeting the service bandwidth carrying requirement are determined.

Further, in order to avoid infinite loop, in the embodiment of the present invention, an upper limit value of N may be set, that is, when N reaches the upper limit value, the loop is ended, and at this time, a result that the target route is not determined is directly fed back.

Fig. 6 is a schematic flow chart illustrating a process of determining a target route by using a multi-service load sharing manner in an embodiment of the present invention, which is described in detail below with reference to fig. 6.

601, arranging routes from a source node to a destination node in a sequence from small to large, calculating an ith route in the sequence in a probe mode, and feeding back the maximum service bandwidth carrying capacity of the ith route under a safety early warning value;

step 602, determining the sum of the maximum service bandwidth carrying capacity of the ith route and the first i-1 routes;

step 603, determining whether the sum of the maximum service bandwidth carrying capacity obtained in step 602 meets the bandwidth requirement, if yes, taking the i routes and the first i-1 routes as target routes, and executing step 606; if not, go to step 604;

step 604, judging whether the number of routes reaches the upper limit value of the set number of routes, if so, indicating that the target route meeting the conditions is not determined, and executing step 606, otherwise, executing step 605;

step 605, updating the network topology map according to the ith route, and circularly executing step 601 to calculate the (i + 1) th route in the sequence;

and step 606, feeding back a final result.

The embodiment of the invention adopts the multi-service load sharing mode, can automatically calculate a plurality of network links according to the actual network condition under the condition of no human intervention, and finishes the sharing function. Moreover, the calculated number of routes and the maximum service bandwidth carrying capacity of each route are both judged by the system optimization, and completely surpass the supportable modes of the existing transmission technology and routing technology, thereby forming the network intelligent capacity in a real sense.

In order to introduce the embodiments of the present invention more comprehensively and deeply, a Packet Transport Network (PTN) Network of china shanghai branch company is used as a research object. Fig. 7 is a schematic network structure diagram of the PTN network. As shown in fig. 7, the shanghai mobile PTN network is divided into a core layer, a convergence layer, and an access layer. The core layer part is divided into 2 sub-layers (a dispersed core layer and a concentrated core layer) according to functions, and the sub-layers correspond to a private line service and a base station service respectively. The convergence layer is mainly used for dredging and converging access services to the core layer and is simultaneously interconnected with the two core sublayers.

In the aspect of network structure, the core layer is networked in a quasi-Mesh mode, and the Mesh degree depends on the local point where the service centralized processing network is located. The convergence layer is networked in a ring network mode, and the access layer is formed by combining a ring direction and a chain direction. In the aspect of bandwidth, the nodes of the core layer are mainly interconnected at a plurality of 10GE rates, the convergence layer mainly uses a single 10GE, and the access layer mainly uses GE as a main network.

The embodiment of the invention selects the representative functions which can reflect the innovative value to carry out point-to-point display.

(1) Network topology map display

The embodiment of the invention combines a network structure topological graph and a link flow busy condition, and represents the interconnection relationship between network nodes by the existence of connection between the network nodes, as shown in fig. 8, the embodiment is a schematic diagram of the interconnection relationship between the network nodes. Further, the bandwidth utilization rate between network elements can be illustrated by link coloring, and can be distinguished into green (less than or equal to 30%), yellow (30% -50%), orange (50% -70%) and red (70%), which is not specifically illustrated and described herein.

In fig. 8, a division function of the virtual nodes, that is, a domain division function, is integrated, and specifically, the network is divided into 2 Core domains (Core1, Core2), 2 aggregation domains (Metro1, Metro2) and 2 Access domains (Access1, Access2) in a virtual frame.

(2) Service flow simulation (Main and standby mode)

The access point A12 is selected as a source node, the access point A21 is selected as a sink node, and the requirement of the link bandwidth between the network nodes is 100 Mbps.

The embodiment of the invention adopts a two-stage type calculation mode: firstly, a target route (namely, a main route) is calculated, and one of a plurality of alternative target routes is confirmed as the target route according to the Shanghai mobile network bearing strategy. Fig. 9 is a schematic diagram of a calculation result of the primary route, and as shown in fig. 9, the determined primary route is: a12 → A13 → M14 → YP-1 → QZ-1 → M21 → A21.

And dynamically reconstructing a network structure on the basis of the main route to generate a standby route. In the embodiment of the invention, the standby route is separated from the main route when being generated, subsequent evaluation and judgment are not needed, and a high-quality main and standby route scheme is provided. Fig. 10 is a schematic diagram of a calculation result of the backup route, and as shown in fig. 10, the determined backup route is: a12 → A11 → M12 → M11 → WR-1 → WS-1 → M25 → M24 → M23 → M22 → A21.

(3) Traffic flow simulation (Multi-route sharing mode)

Core point WR-1 is selected as a source point, WS-1 is selected as a sink point, and the total required bandwidth is 40 Gbps.

Through the system query function, the link capacity upper limit of the segment is 16G, and the remaining service carrying capacity is 10G. And the required 40G traffic is 4 times the bearable capacity of the link. By combining the flexible planning capability of the system, the embodiment of the invention automatically calculates and allocates 4 routes without the same route segment and load-balanced proposed paths without manual intervention so as to share and bear bandwidth requirements which cannot be met by the original link. Fig. 11 is a schematic diagram of a result of the calculation for sharing the large bandwidth multi-route, and as shown in fig. 11, the determined multiple sharing routes are respectively: WR-1 → YR-1 → QZ-1 → WS-1; WR-1 → PD-1 → WS-1; WR-1 → WS-1; WR-1 → CS-1 → WS-1.

At present, the SDN technology and the router technology have not yet achieved a balanced and non-intervention calculation or implementation manner for multiple factors such as bandwidth allocation, number of shared routes, and minimized sharing risk among routes. The embodiment of the invention can well interpret the significance of the traffic engineering and realize the calculation of the sharing bearing route of the service.

(4) Network disaster tolerance

On the basis of the above example (3), the situation after a plurality of link interruptions is simulated. Respectively carrying out interruption simulation on { CS-1-PD-1 }, { NJ-1-JQ-1 }, and { NJ-1-YP-1 }. The first two interruptions can find a restoration route. However, as the number of interrupts increases, the amount of data that can be recovered to the maximum extent is given after the last interrupt indicates that recovery was not successful.

After the interruption of { CS-1-PD-1 } is simulated, a recovery path CS-1-NJ-1-JQ-1-PD-1 can be obtained;

after interruption of the { NJ-1-JQ-1 } is simulated, a recovery path NJ-1-QZ-1-JQ-1 can be obtained;

after interruption of { NJ-1-YP-1 } is simulated, a recovery path NJ-1-QZ-1-JQ-1-YP-1 can be obtained, and data volume capable of being recovered to the maximum extent is given according to the network resource bearing capacity of the recovery path.

The embodiment of the invention provides a disaster recovery scheme for simulating network link interruption on the basis of meeting the mobile scheduling principle by combining flexible grooming of service flow. And the disaster recovery scheme calculates the disaster recovery path in real time according to the actual flow condition of the network and the position of the interrupted link. When the recovery is not successful, the embodiment of the invention also provides the maximum recovery degree of the network, and provides more selection information for a decision maker.

To sum up, the embodiment of the present invention mainly starts from the characteristics of the transport network, integrates the technical characteristics of the SDN, and quickly achieves flexible network resource allocation by dynamically recombining the resource sensitivity of the existing network, so as to support the simulation of the unprotected and active-standby protection scenarios of the conventional service, and simultaneously support the functions of multi-route sharing, key link disaster tolerance simulation and the like in the traffic engineering of the transport network, so that the transport network is no longer driven by the service requirement, is transformed to the intelligent type, and fills the gap between the actual configuration of the network and the resource planning. The concrete embodiment is as follows: (1) fast regeneration of network topology: and a graphical interface is adopted, the network topology structure is organically combined with the use condition of the link bandwidth between the nodes, the logical connection relation between the network element nodes is reproduced, and the use key area of the network resources is visually presented. (2) Data flow simulation: according to the source node, the destination node, the service bandwidth requirement and the SLA service level, the system provides three modes of point-to-point unprotected, primary-standby protection and multi-route sharing transmission. The master-slave protection mode not only provides complete different route suggestions under the condition of good network conditions, but also provides a best-effort master-slave mode under the environment of insufficient or poor network resources, and simultaneously analyzes the conditions of the same route and the like. The multi-route sharing mode is based on the real-time state of the network, simultaneously provides various transmission paths among source and destination nodes, provides a balance strategy in the aspects of the same route, bandwidth use, hop scale and the like, and shares together to meet the service requirement. (3) Network disaster tolerance simulation: by using the network flow engineering concept, under the condition of simulating multiple interruption of a network link, the dredging condition of the original link bearing service in the existing network is simulated, a network emergent safety early warning mechanism is provided, and a key link disaster tolerance processing strategy is provided.

For the above method flow, an embodiment of the present invention further provides a device for determining a target route, and the specific content of the device may be implemented with reference to the above method.

Fig. 12 is a schematic structural diagram of an apparatus for determining a target route according to an embodiment of the present invention, where the apparatus includes:

a processing module 1201, configured to divide, according to the attribution information of the network nodes, the network nodes whose network resource states among the network nodes in the first network topology graph meet a set condition into first virtual nodes to be used; the first virtual node to be used comprises at least one network node;

a first determining module 1202, configured to determine, according to a connection relationship between each first to-be-used virtual node, a first virtual node route from a source virtual node where a source node is located to a sink virtual node where a sink node is located;

a second determining module 1203, configured to determine a target route from the source node to the sink node according to a connection relationship between network nodes in the first virtual node route and a first transmission requirement from the source node to the sink node.

the processing module 1201 is specifically configured to:

and deleting the links between the network nodes of which the resource availability of the link bandwidth between the network nodes is smaller than the first threshold value to obtain the first virtual node to be used.

Preferably, the second determining module 1203 is specifically configured to:

Preferably, the method further comprises the following steps: an update module 1204; the update module 1204 is configured to:

the processing module 1201 is further configured to:

the first determination module 1202 is further configured to:

the second determining module 1203 is further configured to:

Preferably, the second determining module 1203 is specifically configured to:

Preferably, the second determining module 1203 is further configured to:

the second determining module 1203 is specifically configured to:

determining the 1 st alternate target route by:

determining an i-th (1< i ≦ N) candidate target route by:

From the above, it can be seen that: in the above embodiment of the present invention, according to the attribution information of the network nodes, the network nodes whose network resource states among the network nodes in the first network topology map satisfy the set condition are divided into the first virtual nodes to be used; the first virtual node to be used comprises at least one network node; determining a first virtual node route from a source virtual node where a source node is located to a destination virtual node where a destination node is located according to the connection relation between the first virtual nodes to be used; and determining a target route from the source node to the sink node according to the connection relation of each network node in the first virtual node route and the first transmission requirement from the source node to the sink node. In the embodiment of the invention, firstly, the network is simplified according to the network resource state among the network nodes, the complexity of the overall routing calculation is reduced, then, the network is simplified again according to the virtual node routing, and further, the target routing can be determined based on the simplified network; therefore, in the embodiment of the invention, the network is simplified from two aspects of network resource states among network nodes and virtual node routing, so that the number of nodes in the traversal process is obviously reduced, the calculation complexity is simplified, and the efficiency of determining the target routing is improved.

It should be apparent to those skilled in the art that embodiments of the present invention may be provided as a method, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims

1. A method of determining a target route, the method comprising:

determining a first virtual node route from a source virtual node where a source node is located to a destination virtual node where a destination node is located according to the connection relation between the first virtual nodes to be used; determining alternative target routes from the source node to the host node according to the connection relation of each network node in the virtual node route; determining the score value of each alternative target route according to a first transmission requirement from the source node to the sink node; the first transmission requirement from the source node to the sink node comprises any one or any combination of network node routing hop count, first virtual node routing hop count and network resource bearing capacity of the alternative target route; and determining the candidate target routes with the score values larger than or equal to a second threshold value as target routes according to the score values of the candidate target routes.

2. The method of claim 1, wherein the network resource status between network nodes is a resource availability amount of link bandwidth between network nodes;

3. The method of claim 1, wherein after determining the alternative target route having the score value greater than or equal to a second threshold value as the target route, further comprising:

4. The method of claim 3, wherein the determining the backup route from the source node to the sink node according to the connection relationship of the network nodes in the second virtual node route and the second transmission requirement from the source node to the sink node comprises:

5. The method of claim 1, further comprising:

6. The method of claim 5, wherein said plurality of said alternate target routes includes 1 st through Nth alternate target routes;

the 1 st alternative target route is determined by:

the ith candidate target route is determined by the following method, wherein 1< i ≦ N:

7. An apparatus for determining a target route, the apparatus comprising:

a second determining module, configured to determine, according to a connection relationship between each network node in the virtual node route, an alternative target route from the source node to the sink node; determining the score value of each alternative target route according to a first transmission requirement from the source node to the sink node; the first transmission requirement from the source node to the sink node comprises any one or any combination of network node routing hop count, first virtual node routing hop count and network resource bearing capacity of the alternative target route; and determining the candidate target routes with the score values larger than or equal to a second threshold value as target routes according to the score values of the candidate target routes.

8. The apparatus of claim 7, wherein the network resource status between network nodes is a resource availability amount of link bandwidth between network nodes;

the processing module is specifically configured to:

9. The apparatus of claim 7, further comprising: an update module; the update module is to:

the processing module is further configured to:

the first determination module is further to:

the second determination module is further to:

10. The apparatus of claim 9, wherein the second determining module is specifically configured to:

11. The apparatus of claim 7, wherein the second determining module is further to:

12. The apparatus of claim 11, wherein the plurality of the alternative target routes comprises 1 st through nth alternative target routes;

the second determining module is specifically configured to:

determining the 1 st alternate target route by:

determining an ith candidate target route by: