CN106817306A - A kind of method and device for determining target route - Google Patents
A kind of method and device for determining target route Download PDFInfo
- Publication number
- CN106817306A CN106817306A CN201510850234.XA CN201510850234A CN106817306A CN 106817306 A CN106817306 A CN 106817306A CN 201510850234 A CN201510850234 A CN 201510850234A CN 106817306 A CN106817306 A CN 106817306A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- route
- dummy
- alternative
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
Abstract
The embodiment of the invention discloses a kind of method and device for determining target route.In the embodiment of the present invention, according to the attaching information of network node, network resource status between network node are met the network node for imposing a condition and is divided into dummy node to be used, and according to the annexation between each dummy node to be used, the dummy node route of the place dummy node of source dummy node where determining source node to where destination node, and then according to the dummy node route in each network node annexation and the source node to the destination node transmission requirement, determine the source node to the destination node target route.Network is simplified in terms of the network resource status between network node and dummy node route two in present example, so as to reduce quantity during node traverses, computation complexity is simplified, the efficiency for determining target route is improve.
Description
Technical field
The present invention relates to communication technical field, more particularly to a kind of method and device for determining target route.
Background technology
With mobile terminal, the explosive growth of content, service virtualization extensive use and cloud storage, cloud meter
The maturation of cloud network technology and application such as calculate, IT business flow of future generation, flow direction have begun to elastification,
The directions such as mobilism, flexibility change.Based on carry transmission net, its network structure, Bandwidth plan,
Scheduling configuration but follows to conventional rigid bandwidth, bearing mode of the fixed office to business for a long time.Although new skill
The introducing of art, the bandwidth carrying aspect that is superimposed upon of new plane meet the demand of new business, but network structure
Increasingly too fat to move, network idle bandwidth resources be continuously increased the bottleneck as the development of nowadays transmission net.Therefore,
In face of following development of transmission net, it is necessary on the premise of network quality is met, more fully, more efficient, more
Neatly play network capabilities.
Existing ASON (Automatically Switched Optical Network, ASON)
For router-level topology mainly using the routing algorithm based on Dijstra in technology, node traverses quantity is more, meter
Calculation scale is proportional with network complexity, is not suitable for quick calculating and the network-oriented of large-scale Metropolitan Area Network (MAN) route
The pre- deployment analysis of service analogue during planning.Although the SDN technologies in developing stage introduce multi-domain path
Calculate, can suitably simplify computation complexity.But its core algorithm is still identical with ASON, and, work as domain
Between when connecting excessive, route splicing efficiency will deteriorate, and its complexity is suitable with ASON technologies.
Therefore, a kind of computation complexity that can effectively simplify is needed badly at present to set the goal really the method for route.
The content of the invention
The embodiment of the present invention provides a kind of method and device for determining target route, and mesh is determined effectively to reduce
Mark the computation complexity of route.
A kind of method for determining target route provided in an embodiment of the present invention, including：
According to the attaching information of network node, by the Internet resources shape between network node in first network topological diagram
State meets the network node for imposing a condition and is divided into the first dummy node to be used；Described first is to be used
Dummy node includes at least one network node；
According to the annexation between each first dummy node to be used, the source where determining source node is empty
The first dummy node route of the place dummy node where intending node to destination node；
According to the annexation and the source node of each network node in first dummy node route
To the first transmission requirement of the destination node, determine that the source node route to the target of the destination node.
It is preferred that network resource status between the network node can for the resource of link bandwidth between network node
Consumption；
Network resource status between network node are met setting bar by the attaching information according to network node
The network node of part is divided into the first dummy node to be used, including：
According to the attaching information of network node, attaching information identical network node is divided into a virtual section
Point；
Delete network node between link bandwidth resource availability less than first threshold network node between link,
Obtain the described first dummy node to be used.
It is preferred that it is described according to first dummy node route in each network node annexation and
The source node determines the source node to the mesh of the destination node to the first transmission requirement of the destination node
Mark route, including：
According to the annexation of each network node in dummy node route, the source node to institute is determined
State the alternative target route of destination node；
According to the first transmission requirement of the source node to the destination node, each alternative target road is determined
By score value；The source node route to the first transmission requirement of the destination node including the alternative target
Network node hop count, the first dummy node hop count and Internet resources bearing capacity in any
Item or any combination；
According to the score value that each described alternative target route, by the score value more than or equal to Second Threshold
Alternative target route is defined as target route.
It is preferred that described be defined as target by the score value more than or equal to the alternative target route of Second Threshold
After route, also include：
Link between the target route involved network node is deleted, the first network topological diagram is updated,
Obtain the second network topological diagram；Or, according to the network resource status between the network node that the target route,
The first network topological diagram is updated, the second network topological diagram is obtained；
According to the attaching information of network node, by the Internet resources shape between network node in the second network topological diagram
State meets the network node for imposing a condition and is divided into the second dummy node to be used；
According to the annexation between each second dummy node to be used, the source where determining source node is empty
The second dummy node route of the place dummy node where intending node to destination node；
According to the annexation and the source node of each network node in second dummy node route
To the second transmission requirement of the destination node, the source node to the alternate routing of the destination node is determined.
It is preferred that it is described according to second dummy node route in each network node annexation and
The source node determines the source node to the standby of the destination node to the second transmission requirement of the destination node
With route, including：
According to the annexation of each network node in second dummy node route, the source node is determined
To the alternative alternate routing of the destination node；
According to the second transmission requirement of the source node to the destination node, each alternative standby road is determined
By score value；The source node includes the alternative alternate routing to the second transmission requirement of the destination node
Identical route hop count, the network node hop count of the alternative alternate routing, the being route with the target
Any one of two dummy node hop counts and Internet resources bearing capacity or any combination；
According to the score value of each alternative alternate routing, by the score value more than or equal to the 3rd threshold value
Alternative alternate routing is defined as alternate routing.
It is preferred that the method also includes：
According to the score value that each described alternative target route, the scoring of each alternative target route is determined
In the case that value is respectively less than the Second Threshold, Internet resources bearing capacity sum is met into Internet resources and is carried
The a plurality of described alternative target route of Capability Requirement is defined as target route.
It is preferred that a plurality of alternative target route includes the 1st to N alternative targets route；
1st alternative target is routed through in the following manner determination：
According to the score value that each described alternative target route, using score value highest alternative target route as
1st alternative target route；
I-th (1<I≤N) alternative target be routed through in the following manner determination：
According to the network resource status between the network node that the i-th -1 target route, the i-th -1 network topological diagram is updated,
Obtain the i-th network topological diagram；
According to the attaching information of network node, by the network resource status between network node in the i-th network topological diagram
The network node that satisfaction imposes a condition is divided into the i-th dummy node to be used；
According to the annexation between each i-th dummy node to be used, the source where determining source node is virtual
The i-th dummy node route of the place dummy node where node to destination node；
Annexation and the source node according to each network node in i-th dummy node route are arrived
I-th transmission requirement of the destination node, determines that the source node route to the i-th target of the destination node.
The embodiment of the present invention provides a kind of device for determining target route, and the device includes：
Processing module, for the attaching information according to network node, by network node in first network topological diagram
Between network resource status meet the network node that imposes a condition and be divided into the first dummy node to be used；Institute
Stating the first dummy node to be used includes at least one network node；
First determining module, for according to the annexation between each first dummy node to be used, really
The first dummy node route of the place dummy node of source dummy node where determining source node to where destination node；
Second determining module, for being closed according to the connection of each network node in first dummy node route
System and the source node determine the source node to the Su Jie to the first transmission requirement of the destination node
The target route of point.
It is preferred that network resource status between the network node can for the resource of link bandwidth between network node
Consumption；
The processing module specifically for：
According to the attaching information of network node, attaching information identical network node is divided into a virtual section
Point；
Delete network node between link bandwidth resource availability less than first threshold network node between link,
Obtain the described first dummy node to be used.
It is preferred that second determining module specifically for：
According to the annexation of each network node in dummy node route, the source node to institute is determined
State the alternative target route of destination node；
According to the first transmission requirement of the source node to the destination node, each alternative target road is determined
By score value；The source node route to the first transmission requirement of the destination node including the alternative target
Network node hop count, the first dummy node hop count and Internet resources bearing capacity in any
Item or any combination；
According to the score value that each described alternative target route, by the score value more than or equal to Second Threshold
Alternative target route is defined as target route.
It is preferred that also including：Update module；The update module is used for：
Link between the target route involved network node is deleted, the first network topological diagram is updated,
Obtain the second network topological diagram；Or, according to the network resource status between the network node that the target route,
The first network topological diagram is updated, the second network topological diagram is obtained；
The processing module is additionally operable to：
According to the attaching information of network node, by the Internet resources shape between network node in the second network topological diagram
State meets the network node for imposing a condition and is divided into the second dummy node to be used；
First determining module is additionally operable to：
According to the annexation between each second dummy node to be used, the source where determining source node is empty
The second dummy node route of the place dummy node where intending node to destination node；
Second determining module is additionally operable to：
According to the annexation and the source node of each network node in second dummy node route
To the second transmission requirement of the destination node, the source node to the alternate routing of the destination node is determined.
It is preferred that second determining module specifically for：
According to the annexation of each network node in second dummy node route, the source node is determined
To the alternative alternate routing of the destination node；
According to the second transmission requirement of the source node to the destination node, each alternative standby road is determined
By score value；The source node includes the alternative alternate routing to the second transmission requirement of the destination node
Identical route hop count, the network node hop count of the alternative alternate routing, the being route with the target
Any one of two dummy node hop counts and Internet resources bearing capacity or any combination；
According to the score value of each alternative alternate routing, by the score value more than or equal to the 3rd threshold value
Alternative alternate routing is defined as alternate routing.
It is preferred that second determining module is additionally operable to：
According to the score value that each described alternative target route, the scoring of each alternative target route is determined
In the case that value is respectively less than the Second Threshold, Internet resources bearing capacity sum is met into Internet resources and is carried
The a plurality of described alternative target route of Capability Requirement is defined as target route.
It is preferred that a plurality of alternative target route includes the 1st to N alternative targets route；
Second determining module specifically for：
The 1st alternative target route is determined in the following manner：
According to the score value that each described alternative target route, using score value highest alternative target route as
1st alternative target route；
I-th (1 is determined in the following manner<I≤N) alternative target route：
According to the network resource status between the network node that the i-th -1 target route, the i-th -1 network topological diagram is updated,
Obtain the i-th network topological diagram；
According to the attaching information of network node, by the network resource status between network node in the i-th network topological diagram
The network node that satisfaction imposes a condition is divided into the i-th dummy node to be used；
According to the annexation between each i-th dummy node to be used, the source where determining source node is virtual
The i-th dummy node route of the place dummy node where node to destination node；
Annexation and the source node according to each network node in i-th dummy node route are arrived
I-th transmission requirement of the destination node, determines that the source node route to the i-th target of the destination node.
In the above embodiment of the present invention, according to the attaching information of network node, by first network topological diagram
Network resource status between network node meet the network node for imposing a condition and are divided into the first void to be used
Intend node；Described first dummy node to be used includes at least one network node；First treated according to each
Annexation between the dummy node for using, where the source dummy node to destination node where determining source node
Place dummy node the first dummy node route；According to each network section in first dummy node route
The annexation and the source node of point determine the source node to the first transmission requirement of the destination node
Target to the destination node route.In the embodiment of the present invention, first according to the Internet resources between network node
State, simplifies to network, reduces the complexity of overall router-level topology, is then route according to dummy node,
Network is simplified again, and then the network after simplifying can be based on and determine that target route；As can be seen here,
To network in terms of the network resource status between network node and dummy node route two in present example
Simplified, so as to significantly reduce quantity during node traverses, simplified computation complexity, improve really
The efficiency of the route that sets the goal.
Brief description of the drawings
Technical scheme in order to illustrate more clearly the embodiments of the present invention, institute in being described to embodiment below
The accompanying drawing for needing to use is briefly introduced, it should be apparent that, drawings in the following description are only of the invention
Some embodiments, for one of ordinary skill in the art, are not paying the premise of creative labor
Under, other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is the schematic flow sheet corresponding to a kind of method for determining target route provided in an embodiment of the present invention；
Fig. 2 is a kind of network topological diagram of the embodiment of the present invention；
Fig. 3 is stacked controlling mechanism and virtual network graph topology；
Fig. 4 a are link available bandwidth schematic diagram；
Fig. 4 b are the network topological diagram after being simplified according to link available bandwidth；
Fig. 4 c are the dummy node connection diagram simplified according to the annexation between dummy node；
Fig. 4 d are the network topological diagram simplified according to the annexation between dummy node；
Fig. 4 e are the network topological diagram in addition to primary route；
Fig. 5 is the schematic flow sheet of determination alternate routing in the embodiment of the present invention；
Fig. 6 shows to determine the flow of target route in the embodiment of the present invention by the way of multiple-job load is shared
It is intended to；
Fig. 7 is the schematic network structure of PTN network；
Fig. 8 is the interconnecting relation schematic diagram between network node；
Fig. 9 is primary router-level topology result schematic diagram；
Figure 10 is alternate routing schematic diagram of calculation result；
Figure 11 shares schematic diagram of calculation result for big bandwidth multirouting；
Figure 12 is a kind of structural representation of device for determining target route provided in an embodiment of the present invention.
Specific embodiment
In order that the object, technical solutions and advantages of the present invention are clearer, below in conjunction with accompanying drawing to this hair
It is bright to be described in further detail, it is clear that described embodiment is only a part of embodiment of the invention,
Rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art are not doing
Go out all other embodiment obtained under the premise of creative work, belong to the scope of protection of the invention.
Fig. 1 is the schematic flow sheet corresponding to a kind of method for determining target route provided in an embodiment of the present invention,
The method includes：
Step 101, according to the attaching information of network node, by between network node in first network topological diagram
Network resource status meet the network node for imposing a condition and are divided into the first dummy node to be used；Described
One dummy node to be used includes at least one network node；
Step 102, according to the annexation between each first dummy node to be used, determines source node
The first dummy node route of place dummy node of the source dummy node at place to where destination node；
Step 103, annexation and institute according to each network node in first dummy node route
Source node to the first transmission requirement of the destination node is stated, the source node to the target of the destination node is determined
Route.
In the embodiment of the present invention, first according to the network resource status between network node, network is simplified,
The complexity of overall router-level topology is reduced, is then route according to dummy node, network is simplified again,
And then can determine that target route based on the network after simplifying；As can be seen here, from network section in present example
Network resource status and dummy node between point route two aspects and network are simplified, so as to substantially reduce
Quantity during node traverses, simplifies computation complexity, improves the efficiency for determining target route.
In a step 101, the attaching information of network node can be belonged to by network node subnet information or
The regulatory domain information that network node is belonged to.In the embodiment of the present invention, can according to the attaching information of network node,
Attaching information identical network node is divided into a dummy node, will same subnet or same in network
Network node in management domain is divided into a dummy node, or, it is also possible to referred to as one Virtual NE or
One domain.Network resource status between network node can be the resource availability of link bandwidth between network node,
Time delay or the bit error rate etc..
Dummy node is illustrated by taking a simple network as an example below.As shown in Fig. 2 for network is patrolled
Collect connection diagram.The network includes network node c1-c5, d11-d12, d21, d31-d33, d41-d44,
According to the attaching information of each network node, c1-c5 can be divided into dummy node a, the dummy node
Also it is core virtual node, d11-d12 is divided into dummy node b, d21 is divided into dummy node c,
D31-d33 is divided into dummy node d, d41-d44 is divided into dummy node e.
In the embodiment of the present invention, the network element node of itself is only included in each dummy node, in dummy node
The connection that the connection of network node logic belongs in domain between connection, different dummy nodes belongs to cross-domain connection.This hair
Bright embodiment uses stacked controlling mechanism (Layered Domain Control).Each dummy node is controlled
Device is only capable of the routing iinformation for gathering, calculating in this dummy node, and logical relation is by more between cross-domain connection and domain
The dummy node controller administration on upper strata.Fig. 3 is stacked controlling mechanism and virtual network graph topology.As schemed
Shown in 3, global controller is used to manage logical relation between cross-domain connection and domain, the control of each dummy node
Device is respectively used to manage the routing iinformation in this dummy node.Certainly, can also be used in the embodiment of the present invention
Other controlling mechanisms, such as control the routing iinformation in all of dummy node with a controller.
Further, in order to be adapted using stacked management and data processing method with system, the present invention is real
The data storage applied in example is divided into two classes using multiple domain storage mode, i.e. storage file：The first kind is virtual section
Data storage file in point, Equations of The Second Kind is inter-domain link information storage file.Wherein, the first class file is by 1
Individual or multiple sheet compositions, each sheet represents a dummy node, the entitled dummy node names of sheet,
The information format stored in each sheet is as shown in table 1.
Table 1：Data memory format in dummy node
Table 1 is only a kind of example of the data file in dummy node.As shown in table 1, in dummy node
Data file is broadly divided into three parts：Part I is file the first row, in dummy node where for representing
The title of all-network node；Part II is used to represent that the link bandwidth in dummy node between network node is total
Capacity (xx regions part in table 1), the part represents in a matrix fashion, and each cell represents corresponding void
Intend the configuration capacity of network inter-node link in node；Part III is used to represent network node in dummy node
Between link bandwidth usage amount (yy regions part in table 1), each cell is represented in respective virtual node
The actually used situation of link bandwidth between network node.
Second class file (i.e. inter-domain link information storage file) is similar with the data file in dummy node,
But in view of between dummy node connection may with network structure difference and extreme complication, therefore, second
Class file abandon use matrix representation, but with each of the links branch represent, abridgment of table complexity and
It is readable.As shown in table 2, two end points between the 1st, 2 in form are classified as dummy node in link,
3rd, 4 row are respectively the configuration capacity and the actually used situation of link bandwidth of respective virtual inter-node link.
Table 2：Data memory format between dummy node
Further, for convenience of daily maintenance and access, above-mentioned file memory format may be configured as
Excel forms.
On the basis of cellular logic attachment structure, it is considered to network resource status (including link bandwidth or time delay etc.),
Heterogeneous networks paragraph has differences to the satisfaction degree of business.Therefore, the embodiment of the present invention turns this species diversity
It is changed to a kind of resource mobilism of network.Not only expression is connected between the network node in mobilism network to deposit really
Physical connection, and be also represented by disclosure satisfy that the connection of business demand.
By taking link bandwidth as an example, above-mentioned example network is equally continued to use, it is assumed that the network operation simultaneously carries certain scale
Business after, shown in every section of link available bandwidth such as Fig. 4 a (link available bandwidth schematic diagram) (unit Mbps).
When service bandwidth demand is for end-to-end (i.e. network node to network node) 450Mbps, from bandwidth angle
The network dynamic that the whole network can meet the demand is then changed into Fig. 4 b (networks after simplifying according to link available bandwidth
Topological diagram).
Specifically, by taking the connection of network node in the dummy node d where d31~d33 as an example.Such as table 3
It is shown, it is the connection matrix in dummy node d before dynamic is adjusted.
Table 3：Connection matrix in dummy 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 demand of d11 → d33 is 450Mbps, the connection matrix dynamic in dummy node d
Adjustment is as shown in table 4：
Table 4：Connection matrix in dummy 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 carrying belt is wider than greatly (450>1000-700), so as to cause network in dummy node d
Link between node cannot be carried, though network link is connected for entity, without any carrying meaning.From
And the network connection in dummy node d can be simplified according to the connection matrix after above-mentioned dynamic adjustment, together
Sample ground, also same renewal can be done for the connection between dummy node using aforesaid way, that is, delete network node
Between link bandwidth resource availability less than 450Mbps network node between link.
In a step 101, first threshold can be by those skilled in the art according to actual conditions for the embodiment of the present invention
It is configured.Using above-mentioned example network and aforesaid way, it is assumed that first threshold is 450Mbps, then can obtain
Dummy node to be used after to division is respectively dummy node a, dummy node b, dummy node c, void
Intend node d, dummy node e, and, the network connection in each dummy node has been simplified, and specifically may be used
Reference picture 4b.
In step 102, on the basis of the network structure after dynamically adjustment, according to the connection between dummy node
Relation, can obtain the connection relationship matrix of dummy node as shown in table 5.
Table 5：The connection relationship matrix of dummy node
| Dummy node b | Dummy node c | Dummy node d | Dummy node e | Dummy 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 |
There is the company for meeting service bandwidth transfer capability between representing dummy node in the numeral " 1 " in above table
Connect.
Assume that d11 is source node in the embodiment of the present invention, d33 is destination node.On the basis of above table,
By after the judgement of the dummy node where sourcesink node and static router-level topology, the virtual section where d11
The dummy node of the dummy node d where point b to d33 route：Dummy node b → dummy node a →
Dummy node d.Therefore, what dummy node connection relationship matrix can be related to by path between the dummy node is virtual
Node does further simplification, as shown in table 6 and table 7.
Table 6：The connection relationship matrix (one) of dummy node
| Dummy node b | Dummy node d | Dummy node a |
| 0 | 0 | 1 |
| 0 | 0 | 1 |
| 1 | 1 | 0 |
Table 7：The connection relationship matrix (two) of dummy node
The dummy node of the dummy node d where dummy node b to d33 where further can obtain d11
Between path be：D11 → dummy node a → d33, is according to the connection between dummy node as illustrated in fig. 4 c
The dummy node connection diagram that relation simplifies.As shown in figure 4d, it is to be closed according to the connection between dummy node
It is simplified network topological diagram.
In the embodiment of the present invention, using the network after simplification as the basis for determining target route, so as to substantially drop
Quantity during low node traverses, simplifies computation complexity, improves the efficiency for determining target route.
For further checking is simplified the effect above to be reached to network, now still with above-mentioned example network
As a example by, actual verification is done in system platform.
Checking one：
In the case where dummy node is determined according to the attaching information of network node, own between ergodic source destination node
Logic connecting link, the final traversal quantity of observation, when finding to travel through d11 → d33 completely, 40 roads altogether
By.
In the case where the attaching information not according to network node determines dummy node, institute between ergodic source destination node
There is logic connecting link, observation is final to travel through quantity, when finding to travel through d11 → d33 completely, 67 altogether
Route.
Therefore, dummy node is determined by the attaching information according to network node, router-level topology can be simplified
Scale, in this example, determining the mode of dummy node can reduce by 40% router-level topology amount.
Checking two：
The demand of link bandwidth between network node is appropriately arranged with, the demand of analog network inter-node link bandwidth exists
In the case of 10Mbps and 200Mbps, the traversal quantity of all logic connecting links between ergodic source destination node.
When the demand of link bandwidth between network node is set to 10Mbps, network link can be carried, complete
During full traversal d11 → d33,40 route altogether.
When the demand of link bandwidth between network node is set to 200Mbps, subnetwork link bearing capacity
Up to the upper limit, system excludes routing object automatically, and when traveling through d11 → d33 completely, 30 route altogether.
Therefore, can be realized according to present situation and demand using the router-level topology mode of resource sensitive mobilism
Dynamic becomes more meticulous and adjusts route complexity.
In step 103, according to the annexation of each network node in dummy node route, determine that source is saved
Point route to the alternative target of destination node；The first transmission requirement according to source node to destination node, determines each
The score value of alternative target route；According to the score value that each alternative target route, score value is more than or equal to
The alternative target route of Second Threshold is defined as target route.
Wherein, source node includes the network node route of alternative target route to the first transmission requirement of destination node
Any one of hop count, the first dummy node hop count and Internet resources bearing capacity or any combination；
It is the factor for considering various aspects in the embodiment of the present invention, preferred mode is：First transmission requirement bag
Network node hop count, the first dummy node hop count and the Internet resources for including alternative target route hold
Loading capability, and corresponding weight set by the factor in terms of for above three determine each alternative target road
By score value.Therefore, when there are multiple alternative target Route Selections, can be true according to appraisal result
Target route is made, for policymaker's reference.Can be that the target route determined sets one in real process
Individual mark, facilitates policymaker to select.Wanted because target route might not comply fully with the special operation of operator
Ask, therefore the target route for being given only is to recommend, policymaker also may be selected non-recommended route.
It is specifically introduced below for code of points.
In the embodiment of the present invention, the scoring interval that above-mentioned each factor can be set is [0,1], and 1 is full marks.
For factor k, score of the jth alternative target route on factor k is calculated using equation below：
... formula (1)
Wherein, αjkIt is score of the jth alternative target route on factor k；
xkIt is actual numerical value of the jth alternative target route on factor k；
xmaxIt is greatest measure of each alternative target route on factor k.
After determining score of the jth alternative target route in each factor (above three factor), pass through
Equation below determines the score value of jth alternative target route：
... formula (2)
Wherein, wkIt is the weighted value of factor k.P is the number of factor.
In the embodiment of the present invention, the weighted value of each factor rule of thumb can flexibly be set by those skilled in the art
Put, specifically can be depending on the degree of recognition or criticality according to operator to above-mentioned each factor.
For example, a kind of exemplary reference of the table 8 for setting weighted value.
Table 8：Weighted value allocation table
Further, in the embodiment of the present invention, after determining target route, to improve the stability of system,
Alternate routing can also be set.Specifically, link between the target route involved network node is deleted,
The first network topological diagram is updated, the second network topological diagram is obtained；Or, it is route according to the target
Network resource status between network node, update the first network topological diagram, obtain the second network topological diagram；
According to the attaching information of network node, the network resource status between network node in the second network topological diagram are expired
The network node that foot imposes a condition is divided into the second dummy node to be used；It is second to be used according to each
Annexation between dummy node, the place of source dummy node where determining source node to where destination node is empty
Intend the second dummy node route of node；According to the company of each network node in second dummy node route
Relation and the source node to the second transmission requirement of the destination node are connect, determines the source node described in
The alternate routing of destination node.
Alternate routing is impacted to avoid target route from going wrong, it is preferred in the embodiment of the present invention
Scheme is to route hop count without identical between alternate routing and target route.It is determined that during alternate routing, will count
Calculate the involved route hop count of the target route for determining and be all provided with being set at full capacity or unavailable, and readjust net
Logic connecting relation between network node, obtains the network topological diagram in addition to target route, i.e., using " one section "
Formula calculation determines alternate routing.For example, it is d11 → c2 → c5 → d33 to set the target route determined,
Then Fig. 4 e are the network topological diagram in addition to primary route.Now, then can be route as base with each bar shown in Fig. 4 e
Plinth, determines source node to the alternative alternate routing of destination node.The second transmission according to source node to destination node
It is required that, determine the score value of each alternative alternate routing, and then according to the score value of each alternative alternate routing,
The score value is defined as alternate routing more than or equal to the alternative alternate routing of the 3rd threshold value.Now, source section
Point may include that the network node of the alternative alternate routing route and jumps to the second transmission requirement of the destination node
Number, the second dummy node hop count and Internet resources bearing capacity；The scoring of each alternative alternate routing
Value can be obtained by above-mentioned formula (1) and formula (2).
Due to there is the factors such as network structure limitation, if based on each bar route shown in Fig. 4 e, it is impossible to
" two sections " formula calculation in the case of determining qualified alternate routing, can be started and determine standby road
By the calculation " done one's best ".Specifically, link band between the network node according to target route
The resource availability of link bandwidth between resource usage amount wide, renewal network node, and according to the net after renewal
The resource availability of network inter-node link bandwidth simplifies to network, the network topological diagram after being updated.
Alternative alternate routing is determined in the case where allowing with identical route segment, and then according to standby alternate routing
Score value, determine alternate routing.Now, source node includes to the second transmission requirement of the destination node
Identical route hop count, the network of the alternative alternate routing that the alternative alternate routing route with the target
Four factors such as node-routing hop count, the second dummy node hop count and Internet resources bearing capacity；Respectively
The score value of individual alternative alternate routing can be obtained by above-mentioned formula (1) and formula (2).
In the embodiment of the present invention, it is preferred to use above-mentioned " one-part form " mode determines alternate routing.If passing through " one
Segmentation " mode has determined that qualified alternate routing, then no longer determined using " two-period form " mode standby
With route；Only in the case where qualified alternate routing is not determined by using above-mentioned " one-part form " mode,
Alternate routing is determined using " two-period form " mode.
Fig. 5 is the schematic flow sheet of determination alternate routing in the embodiment of the present invention, with reference to Fig. 5 pairs of determination
The process of alternate routing is specifically described.
Step 501, determines that target route；
Step 502, the involved route hop count of target route is all provided with being set at full capacity or unavailable, is laid equal stress on
Logic connecting relation between new adjustment network node, obtains the network topological diagram in addition to target route；
Step 503, based on the network topological diagram in addition to target route obtained in step 502, determines standby
The score value of alternate routing is selected, the score value according to alternative alternate routing judges alternate routing；
Step 504, according to result of determination, it is determined whether there is qualified alternate routing, if not existing,
Then perform step 505；If in the presence of terminating flow；
Step 505, according to the actual bandwidth shared by each route segment that target route is related to, updates network
The resource availability of inter-node link bandwidth, and can according to the resource of link bandwidth between the network node after renewal
Consumption simplifies to network, the network topological diagram after being updated；
Step 506, based on the network topological diagram after the renewal obtained in step 505, by calculating and assessing
Determine alternate routing.
In the case of for big bandwidth demand, if there is a plurality of route, but no to destination node in source node
What one route can fully meet target route requirement (be specifically as follows target route service bandwidth hold
Carry require) when, can determine by the way of multiple-job load is shared target route, will service bandwidth hold
Loading capability sum is defined as target route more than or equal to a plurality of alternative target route of the Second Threshold.
A plurality of alternative target route includes the 1st to N alternative targets route.Specifically, according to each alternative mesh
The score value of route is marked, using score value highest alternative target route as the first alternative target route；Then,
According to the resource usage amount of link bandwidth between the network node that the 1st target route, the 1st network topological diagram is updated,
Obtain the 2nd network topological diagram；According to the attaching information of network node, by network node in the 2nd network topological diagram
Between network resource status meet the network node that imposes a condition and be divided into the 2nd dummy node to be used；Root
According to the annexation between each i-th dummy node to be used, the source dummy node where determining source node is arrived
The 2nd dummy node route of the place dummy node where destination node；According in the 2nd dummy node route
The annexation of each network node and the source node determine institute to the 2nd transmission requirement of the destination node
Source node is stated to be route to the 2nd target of the destination node.Specifically, the i-th target route can also be by using
Above-mentioned formula (1) and formula (2), and then determined according to score value.In the embodiment of the present invention, can basis
Concrete condition and different application scenarios set to the transmission requirement of source node to destination node.
After the 2nd target route is determined, the Internet resources for calculating the 1st target route and the 2nd target route hold
Loading capability sum, if Internet resources bearing capacity sum meets service bandwidth bearing requirements, can directly determine
1st target route and the 2nd target route is for target route；If Internet resources bearing capacity sum does not meet industry still
Business bandwidth bearing requirements, then can again update above-mentioned network topological diagram, by circulation according to the 2nd target route
Above-mentioned steps are performed, determine that the 3rd target route ... carries out, service bandwidth is met until determining successively
The N bars alternative target route of bearing requirements.
Further, to avoid Infinite Cyclic, in the embodiment of the present invention, the higher limit of N can be set, that is, works as
When N reaches higher limit, just end loop, now direct feedback be not determined by the result of target route.
Fig. 6 shows to determine the flow of target route in the embodiment of the present invention by the way of multiple-job load is shared
It is intended to, is specifically introduced with reference to Fig. 6.
Step 601, the route of source node to destination node is arranged according to the ascending order of hop count,
Probe-type calculates i-th route in sequence, and feeds back maximum traffic of i-th route under safe early warning value
Bandwidth bearing capacity；
Step 602, determines the maximum traffic bandwidth bearing capacity sum that i-th route route with preceding i-1 bars；
Step 603, judges whether the maximum traffic bandwidth bearing capacity sum obtained in step 602 meets bandwidth
It is required that, if so, can then be route what i bars route and preceding i-1 bars route as target, and perform step 606；
If it is not, then performing step 604；
Step 604, judges to route the higher limit of the route bar number whether bar number reaches setting, if so, then saying
It is bright to be not determined by qualified target route, and step 606 is performed, if it is not, then performing step 605；
Step 605, according to i-th routing update network topological diagram, and circulates execution step 601, calculates sequence
In i+1 bar route；
Step 606, feeds back final result.
The embodiment of the present invention can exist by the way of above-mentioned multiple-job load is shared according to network actual conditions
In the case of nobody intervenes altogether, a number of a plurality of network link is calculated automatically, function is shared in completion.And
And, the route quantity of calculating, the maximum traffic bandwidth bearing capacity of every route are system optimal judgement,
Surmount existing tranmission techniques and the supported pattern of route technology completely, truly form network intelligence energy
Power.
In order to be able to carry out introduction more fully, deep to the embodiment of the present invention, below with China Mobile Shanghai
Branch company's Packet Transport Network (Packet Transport Network, abbreviation PTN) network is research object.
Fig. 7 is the schematic network structure of PTN network.As shown in fig. 7, Shanghai Mobile's PTN network is divided into core
Central layer, convergence-level and Access Layer.Wherein, core layer part is divided into 2 sublayers (dispersion core according to function
Central layer, concentration core layer), and private line service and BTS service are corresponded to respectively.Convergence-level is mainly dredged, is converged
Poly- access service is interconnected with two core sublayers simultaneously to core layer.
In terms of network structure, core layer is regarded at service set with quasi- Mesh modes networking, Meshization degree
Depending on office point where reason network.Convergence-level is shaped with ring, chain with looped network mode networking, Access Layer to combination.
In terms of bandwidth, main between core layer node to be interconnected with multiple 10GE speed, convergence-level is mainly with single
10GE, Access Layer with GE be main networking.
The embodiment of the present invention is chosen can reflect innovative value and representative function carries out point-to-point exhibition
Show.
(1) network topological diagram shows
Network structure topological diagram and link flow are dredged busy situation and are combined by the embodiment of the present invention, with network node
Between have it is connectionless represent the interconnecting relation between network node, as shown in figure 8, for mutual between network node
Connection relation schematic diagram.Further, the bandwidth utilization rate situation between network element that illustrates can also be coloured with link, and
Green (≤30%), yellow (30%~50%), orange (50%~70%) and red (70%) are divided into,
It is no longer specific herein to illustrate and describe.
The partition functionality of dummy node is incorporated in Fig. 8, that is, divides domain-functionalities, specifically, with dashed box by network
It is divided into 2 core domains (Core1, Core2), 2 convergence territories (Metro1, Metro2) and 2 to connect
Enter domain (Access1, Access2).
(2) business flow field simulation (active/standby mode)
Selection access point A12 is source node, and access point A21 is link bandwidth between destination node, network node
Demand is 100Mbps.
The embodiment of the present invention uses " two-period form " calculation：Target route (i.e. primary route) is first calculated,
And confirm that one in multiple alternative target routes route as target according to Shanghai Mobile's network carrying strategy.
Fig. 9 is primary router-level topology result schematic diagram, as shown in figure 9, the primary route determined is：A12→
A13→M14→YP-1→QZ-1→M21→A21。
On the basis of primary route, dynamic restructuring network structure generates alternate routing.In the embodiment of the present invention,
Alternate routing is just separated when generating with primary route, is judged without further evaluation, there is provided high-quality main standby route
Scheme.Figure 10 is alternate routing schematic diagram of calculation result, and as shown in Figure 10, the alternate routing determined is：
A12→A11→M12→M11→WR-1→WS-1→M25→M24→M23→M22→A21。
(3) business flow field simulation (multirouting shares mode)
Selection core point WR-1 is source point, and WS-1 is place point, a width of 40Gbps of aggregate demand band.
By system queries function, this section of link capability upper limit 16G, surplus lines bearing capacity 10G.And
Required 40G portfolios are that the link can 4 times of bearing capacity.Coupling system flexible planning ability, this hair
Bright embodiment calculated in the case of no manual intervention, automatically and distribute 4 routes without identical route segment and
The suggestion path of load balancing, is used to share the bandwidth demand that the former link of carrying cannot meet.Figure 11 is big
Bandwidth multirouting shares schematic diagram of calculation result, and as shown in figure 11, a plurality of route of sharing determined is distinguished
For：WR-1→YR-1→QZ-1→WS-1；WR-1→PD-1→WS-1；WR-1→WS-1；
WR-1→CS-1→WS-1。
Current SDN technologies, router technology are also failed to reach to bandwidth allocation, share route quantity and each road
By the balance of many key elements such as a minimum shared risk, without the calculating or implementation intervened.And the present invention is real
Applying example can well annotate the meaning of traffic engineering, and realize the calculating for sharing carrying route of business.
(4) network disaster tolerance
On the basis of above-mentioned example (3), the situation after simulation many places link down.Successively respectively to { CS-1
- PD-1 }, { NJ-1-JQ-1 }, { NJ-1-YP-1 } carry out break simulation.The above two interrupt and can look for
To restoration route.But as middle broken strip number increases, after last time interruption display cannot successfully recover, be given
The data volume that can at utmost recover.
After simulation { CS-1-PD-1 } is interrupted, restoration path CS-1-NJ-1-JQ-1-PD-1 are can obtain；
After simulation { NJ-1-JQ-1 } is interrupted, restoration path NJ-1-QZ-1-JQ-1 is can obtain；
After simulation { NJ-1-YP-1 } is interrupted, restoration path NJ-1-QZ-1-JQ-1-YP-1 are can obtain, and
Internet resources bearing capacity according to restoration path, provides the data volume that can at utmost recover.
With reference to flexibly dredging for service traffics, on the basis of mobile dispatching principle is met, the embodiment of the present invention is carried
For analog network link down disaster-tolerant recovery scheme.Disaster Tolerant Scheme is according to network actual flow situation and interruption
Links location, calculates disaster-tolerant recovery path in real time.When failed recovery, the embodiment of the present invention also provides net
Network to be done one's best the degree of recovery, there is provided policymaker more selects information.
To sum up, the embodiment of the present invention merges SDN technical characterstics mainly from transmission net characteristic, passes through
Resource sensitive dynamic reorganization is carried out to existing network, Internet resources flexible allocation is quickly realized, it would be preferable to support
The unprotect of conversational traffic, the simulation of main-apparatus protection scene, while supporting multirouting in transmission net traffic engineering
Share, critical link disaster tolerance simulation etc. function, make transmission net no longer merely with business demand for driving, Xiang Zhi
Energyization makes the transition, the blank filled up between network actual disposition and MRP.It is embodied as：(1) net
Network topology rapid regeneration：Using graphic interface, network topology structure and inter-node link bandwidth are used into feelings
Condition is organically combined, and reproduces logic connecting relation between network element node, and presentation Internet usage emphasis area directly perceived
Domain.(2) data flow field simulation：According to source node and destination node, service bandwidth demand and SLA service etc.
Level, system provides point-to-point unprotect, main-apparatus protection and multirouting and shares transmission Three models.Wherein,
Main-apparatus protection mode not only provides complete different route suggestions, Er Qie in the case where network condition is good
Internet resources are not enough or not good enough environment under, there is provided the active/standby mode done one's best, and simultaneously analyze with route
Situations such as.Multirouting shares mode based on network real-time status, while providing various biographies between sourcesink node
Path is sent, equilibrium strategy is being provided with aspects such as route, bandwidth use, hop count scales, satisfaction is shared jointly
Business demand.(3) network disaster tolerance simulation：Using network traffic engineering theory, in analog network link many places
In the case of disconnected, former link bearer traffic dredges situation existing network, there is provided the sudden safe early warning of network
Mechanism, there is provided emphasis link disaster tolerance treatment strategy.
For above method flow, the embodiment of the present invention also provides a kind of device for determining target route, the dress
The particular content put is referred to above method implementation.
Figure 12 is a kind of structural representation of device for determining target route provided in an embodiment of the present invention, the dress
Put including：
Processing module 1201, for the attaching information according to network node, by network in first network topological diagram
Network resource status between node meet the network node for imposing a condition and are divided into the first virtual section to be used
Point；Described first dummy node to be used includes at least one network node；
First determining module 1202, for according to the annexation between each first dummy node to be used,
First dummy node road of the place dummy node of source dummy node where determining source node to where destination node
By；
Second determining module 1203, for the company according to each network node in first dummy node route
Relation and the source node to the first transmission requirement of the destination node are connect, determines the source node described in
The target route of destination node.
It is preferred that network resource status between the network node can for the resource of link bandwidth between network node
Consumption；
The processing module 1201 specifically for：
According to the attaching information of network node, attaching information identical network node is divided into a virtual section
Point；
Between deletion network node between the network node of the resource availability less than the first threshold of link bandwidth
Link, obtains the described first dummy node to be used.
It is preferred that second determining module 1203 specifically for：
According to the annexation of each network node in dummy node route, the source node to institute is determined
State the alternative target route of destination node；
According to the first transmission requirement of the source node to the destination node, each alternative target road is determined
By score value；The source node route to the first transmission requirement of the destination node including the alternative target
Network node hop count, the first dummy node hop count and Internet resources bearing capacity in any
Item or any combination；
According to the score value that each described alternative target route, by the score value more than or equal to Second Threshold
Alternative target route is defined as target route.
It is preferred that also including：Update module 1204；The update module 1204 is used for：
Link between the target route involved network node is deleted, the first network topological diagram is updated,
Obtain the second network topological diagram；Or, according to the network resource status between the network node that the target route,
The first network topological diagram is updated, the second network topological diagram is obtained；
The processing module 1201 is additionally operable to：
According to the attaching information of network node, by the Internet resources shape between network node in the second network topological diagram
State meets the network node for imposing a condition and is divided into the second dummy node to be used；
First determining module 1202 is additionally operable to：
According to the annexation between each second dummy node to be used, the source where determining source node is empty
The second dummy node route of the place dummy node where intending node to destination node；
Second determining module 1203 is additionally operable to：
According to the annexation and the source node of each network node in second dummy node route
To the second transmission requirement of the destination node, the source node to the alternate routing of the destination node is determined.
It is preferred that second determining module 1203 specifically for：
According to the annexation of each network node in second dummy node route, the source node is determined
To the alternative alternate routing of the destination node；
According to the second transmission requirement of the source node to the destination node, each alternative standby road is determined
By score value；The source node includes the alternative alternate routing to the second transmission requirement of the destination node
Identical route hop count, the network node hop count of the alternative alternate routing, the being route with the target
Any one of two dummy node hop counts and Internet resources bearing capacity or any combination；
According to the score value of each alternative alternate routing, by the score value more than or equal to the 3rd threshold value
Alternative alternate routing is defined as alternate routing.
It is preferred that second determining module 1203 is additionally operable to：
According to the score value that each described alternative target route, the scoring of each alternative target route is determined
In the case that value is respectively less than the Second Threshold, Internet resources bearing capacity sum is met into Internet resources and is carried
The a plurality of described alternative target route of Capability Requirement is defined as target route.
It is preferred that a plurality of alternative target route includes the 1st to N alternative targets route；
Second determining module 1203 specifically for：
The 1st alternative target route is determined in the following manner：
According to the score value that each described alternative target route, using score value highest alternative target route as
1st alternative target route；
I-th (1 is determined in the following manner<I≤N) alternative target route：
According to the network resource status between the network node that the i-th -1 target route, the i-th -1 network topological diagram is updated,
Obtain the i-th network topological diagram；
According to the attaching information of network node, by the network resource status between network node in the i-th network topological diagram
The network node that satisfaction imposes a condition is divided into the i-th dummy node to be used；
According to the annexation between each i-th dummy node to be used, the source where determining source node is virtual
The i-th dummy node route of the place dummy node where node to destination node；
Annexation and the source node according to each network node in i-th dummy node route are arrived
I-th transmission requirement of the destination node, determines that the source node route to the i-th target of the destination node.
It can be seen from the above：In the above embodiment of the present invention, according to the attaching information of network node,
Network resource status between network node in first network topological diagram are met the network node for imposing a condition to draw
It is divided into the first dummy node to be used；Described first dummy node to be used includes at least one network section
Point；According to the annexation between each first dummy node to be used, the source where determining source node is empty
The first dummy node route of the place dummy node where intending node to destination node；According to the described first virtual section
First transmission of the annexation and the source node of each network node in point route to the destination node
It is required that, determine that the source node route to the target of the destination node.In the embodiment of the present invention, basis first
Network resource status between network node, simplify to network, reduce the complexity of overall router-level topology,
Then it is route according to dummy node, network is simplified again, and then the network after simplifying can be based on and is determined
Go out target route；As can be seen here, from the network resource status between network node and virtual section in present example
Point two aspects of route simplify to network, so as to significantly reduce quantity during node traverses, simplify
Computation complexity, improves the efficiency for determining target route.
It should be understood by those skilled in the art that, embodiments of the invention can be provided as method or computer journey
Sequence product.Therefore, the present invention can use complete hardware embodiment, complete software embodiment or combine software
With the form of the embodiment of hardware aspect.And, the present invention can be used and wherein include meter at one or more
Calculation machine usable program code computer-usable storage medium (including but not limited to magnetic disk storage,
CD-ROM, optical memory etc.) on implement computer program product form.
The present invention is produced with reference to method according to embodiments of the present invention, equipment (system) and computer program
The flow chart and/or block diagram of product is described.It should be understood that can by computer program instructions realize flow chart and
/ or block diagram in each flow and/or the flow in square frame and flow chart and/or block diagram and/
Or the combination of square frame.These computer program instructions to all-purpose computer, special-purpose computer, insertion can be provided
The processor of formula processor or other programmable data processing devices is producing a machine so that by calculating
The instruction of the computing device of machine or other programmable data processing devices is produced for realizing in flow chart one
The device of the function of being specified in individual flow or multiple one square frame of flow and/or block diagram or multiple square frames.
These computer program instructions may be alternatively stored in can guide computer or the treatment of other programmable datas to set
In the standby computer-readable memory for working in a specific way so that storage is in the computer-readable memory
Instruction produce include the manufacture of command device, the command device realization in one flow of flow chart or multiple
The function of being specified in one square frame of flow and/or block diagram or multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices, made
Obtain and series of operation steps is performed on computer or other programmable devices to produce computer implemented place
Reason, so as to the instruction performed on computer or other programmable devices is provided for realizing in flow chart one
The step of function of being specified in flow or multiple one square frame of flow and/or block diagram or multiple square frames.
, but those skilled in the art once know base although preferred embodiments of the present invention have been described
This creative concept, then can make other change and modification to these embodiments.So, appended right will
Ask and be intended to be construed to include preferred embodiment and fall into having altered and changing for the scope of the invention.
Obviously, those skilled in the art can carry out various changes and modification without deviating from this hair to the present invention
Bright spirit and scope.So, if it is of the invention these modification and modification belong to the claims in the present invention and
Within the scope of its equivalent technologies, then the present invention is also intended to comprising these changes and modification.
Claims (14)
1. it is a kind of to determine the method that target route, it is characterised in that the method includes：
According to the attaching information of network node, by the Internet resources shape between network node in first network topological diagram
State meets the network node for imposing a condition and is divided into the first dummy node to be used；Described first is to be used
Dummy node includes at least one network node；
According to the annexation between each first dummy node to be used, the source where determining source node is empty
The first dummy node route of the place dummy node where intending node to destination node；
According to the annexation and the source node of each network node in first dummy node route
To the first transmission requirement of the destination node, determine that the source node route to the target of the destination node.
2. the method for claim 1, it is characterised in that the Internet resources shape between the network node
State is the resource availability of link bandwidth between network node；
Network resource status between network node are met setting bar by the attaching information according to network node
The network node of part is divided into the first dummy node to be used, including：
According to the attaching information of network node, attaching information identical network node is divided into a virtual section
Point；
Delete network node between link bandwidth resource availability less than first threshold network node between link,
Obtain the described first dummy node to be used.
3. the method for claim 1, it is characterised in that described according to the first dummy node road
By interior each network node annexation and the source node to the destination node the first transmission requirement,
Determine that the source node route to the target of the destination node, including：
According to the annexation of each network node in dummy node route, the source node to institute is determined
State the alternative target route of destination node；
According to the first transmission requirement of the source node to the destination node, each alternative target road is determined
By score value；The source node route to the first transmission requirement of the destination node including the alternative target
Network node hop count, the first dummy node hop count and Internet resources bearing capacity in any
Item or any combination；
According to the score value that each described alternative target route, by the score value more than or equal to Second Threshold
Alternative target route is defined as target route.
4. method as claimed in claim 3, it is characterised in that it is described by the score value more than or equal to the
The alternative target route of two threshold values is defined as after target route, also includes：
Link between the target route involved network node is deleted, the first network topological diagram is updated,
Obtain the second network topological diagram；Or, according to the network resource status between the network node that the target route,
The first network topological diagram is updated, the second network topological diagram is obtained；
According to the attaching information of network node, by the Internet resources shape between network node in the second network topological diagram
State meets the network node for imposing a condition and is divided into the second dummy node to be used；
According to the annexation between each second dummy node to be used, the source where determining source node is empty
The second dummy node route of the place dummy node where intending node to destination node；
According to the annexation and the source node of each network node in second dummy node route
To the second transmission requirement of the destination node, the source node to the alternate routing of the destination node is determined.
5. method as claimed in claim 4, it is characterised in that described according to the second dummy node road
By interior each network node annexation and the source node to the destination node the second transmission requirement,
Determine the source node to the alternate routing of the destination node, including：
According to the annexation of each network node in second dummy node route, the source node is determined
To the alternative alternate routing of the destination node；
According to the second transmission requirement of the source node to the destination node, each alternative standby road is determined
By score value；The source node includes the alternative alternate routing to the second transmission requirement of the destination node
Identical route hop count, the network node hop count of the alternative alternate routing, the being route with the target
Any one of two dummy node hop counts and Internet resources bearing capacity or any combination；
According to the score value of each alternative alternate routing, by the score value more than or equal to the 3rd threshold value
Alternative alternate routing is defined as alternate routing.
6. method as claimed in claim 3, it is characterised in that the method also includes：
According to the score value that each described alternative target route, the scoring of each alternative target route is determined
In the case that value is respectively less than the Second Threshold, Internet resources bearing capacity sum is met into Internet resources and is carried
The a plurality of described alternative target route of Capability Requirement is defined as target route.
7. method as claimed in claim 6, it is characterised in that a plurality of alternative target route bag
Include the 1st to N alternative targets route；
1st alternative target is routed through in the following manner determination：
According to the score value that each described alternative target route, using score value highest alternative target route as
1st alternative target route；
I-th (1<I≤N) alternative target be routed through in the following manner determination：
According to the network resource status between the network node that the i-th -1 target route, the i-th -1 network topological diagram is updated,
Obtain the i-th network topological diagram；
According to the attaching information of network node, by the network resource status between network node in the i-th network topological diagram
The network node that satisfaction imposes a condition is divided into the i-th dummy node to be used；
According to the annexation between each i-th dummy node to be used, the source where determining source node is virtual
The i-th dummy node route of the place dummy node where node to destination node；
Annexation and the source node according to each network node in i-th dummy node route are arrived
I-th transmission requirement of the destination node, determines that the source node route to the i-th target of the destination node.
8. it is a kind of to determine the device that target route, it is characterised in that the device includes：
Processing module, for the attaching information according to network node, by network node in first network topological diagram
Between network resource status meet the network node that imposes a condition and be divided into the first dummy node to be used；Institute
Stating the first dummy node to be used includes at least one network node；
First determining module, for according to the annexation between each first dummy node to be used, really
The first dummy node route of the place dummy node of source dummy node where determining source node to where destination node；
Second determining module, for being closed according to the connection of each network node in first dummy node route
System and the source node determine the source node to the Su Jie to the first transmission requirement of the destination node
The target route of point.
9. device as claimed in claim 8, it is characterised in that the Internet resources shape between the network node
State is the resource availability of link bandwidth between network node；
The processing module specifically for：
According to the attaching information of network node, attaching information identical network node is divided into a virtual section
Point；
Delete network node between link bandwidth resource availability less than first threshold network node between link,
Obtain the described first dummy node to be used.
10. device as claimed in claim 8, it is characterised in that second determining module specifically for：
According to the annexation of each network node in dummy node route, the source node to institute is determined
State the alternative target route of destination node；
According to the first transmission requirement of the source node to the destination node, each alternative target road is determined
By score value；The source node route to the first transmission requirement of the destination node including the alternative target
Network node hop count, the first dummy node hop count and Internet resources bearing capacity in any
Item or any combination；
According to the score value that each described alternative target route, by the score value more than or equal to Second Threshold
Alternative target route is defined as target route.
11. devices as claimed in claim 10, it is characterised in that also include：Update module；It is described more
New module is used for：
Link between the target route involved network node is deleted, the first network topological diagram is updated,
Obtain the second network topological diagram；Or, according to the network resource status between the network node that the target route,
The first network topological diagram is updated, the second network topological diagram is obtained；
The processing module is additionally operable to：
According to the attaching information of network node, by the Internet resources shape between network node in the second network topological diagram
State meets the network node for imposing a condition and is divided into the second dummy node to be used；
First determining module is additionally operable to：
According to the annexation between each second dummy node to be used, the source where determining source node is empty
The second dummy node route of the place dummy node where intending node to destination node；
Second determining module is additionally operable to：
According to the annexation and the source node of each network node in second dummy node route
To the second transmission requirement of the destination node, the source node to the alternate routing of the destination node is determined.
12. devices as claimed in claim 11, it is characterised in that second determining module specifically for：
According to the annexation of each network node in second dummy node route, the source node is determined
To the alternative alternate routing of the destination node；
According to the second transmission requirement of the source node to the destination node, each alternative standby road is determined
By score value；The source node includes the alternative alternate routing to the second transmission requirement of the destination node
Identical route hop count, the network node hop count of the alternative alternate routing, the being route with the target
Any one of two dummy node hop counts and Internet resources bearing capacity or any combination；
According to the score value of each alternative alternate routing, by the score value more than or equal to the 3rd threshold value
Alternative alternate routing is defined as alternate routing.
13. devices as claimed in claim 10, it is characterised in that second determining module is additionally operable to：
According to the score value that each described alternative target route, the scoring of each alternative target route is determined
In the case that value is respectively less than the Second Threshold, Internet resources bearing capacity sum is met into Internet resources and is carried
The a plurality of described alternative target route of Capability Requirement is defined as target route.
14. devices as claimed in claim 13, it is characterised in that a plurality of alternative target route
It is route including the 1st to N alternative targets；
Second determining module specifically for：
The 1st alternative target route is determined in the following manner：
According to the score value that each described alternative target route, using score value highest alternative target route as
1st alternative target route；
I-th (1 is determined in the following manner<I≤N) alternative target route：
According to the network resource status between the network node that the i-th -1 target route, the i-th -1 network topological diagram is updated,
Obtain the i-th network topological diagram；
According to the attaching information of network node, by the network resource status between network node in the i-th network topological diagram
The network node that satisfaction imposes a condition is divided into the i-th dummy node to be used；
According to the annexation between each i-th dummy node to be used, the source where determining source node is virtual
The i-th dummy node route of the place dummy node where node to destination node；
Annexation and the source node according to each network node in i-th dummy node route are arrived
I-th transmission requirement of the destination node, determines that the source node route to the i-th target of the destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510850234.XA CN106817306B (en) | 2015-11-27 | 2015-11-27 | Method and device for determining target route |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510850234.XA CN106817306B (en) | 2015-11-27 | 2015-11-27 | Method and device for determining target route |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106817306A true CN106817306A (en) | 2017-06-09 |
| CN106817306B CN106817306B (en) | 2019-12-27 |
Family
ID=59155489
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510850234.XA Active CN106817306B (en) | 2015-11-27 | 2015-11-27 | Method and device for determining target route |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106817306B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107465615A (en) * | 2017-08-03 | 2017-12-12 | 全球能源互联网研究院有限公司 | A kind of route determining methods and controller based on layering multiple domain |
| CN109104369A (en) * | 2017-11-30 | 2018-12-28 | 新华三技术有限公司 | A kind of routing resource and device |
| CN109361596A (en) * | 2018-10-26 | 2019-02-19 | 新华三技术有限公司合肥分公司 | Route computing method, device and electronic equipment |
| CN111817959A (en) * | 2020-07-16 | 2020-10-23 | 迈普通信技术股份有限公司 | Network path management method and device, SDN controller and readable storage medium |
| CN115333947A (en) * | 2022-08-03 | 2022-11-11 | 北京视界云天科技有限公司 | Route optimization method and device based on guidance, computer equipment and storage medium |
| CN115865783A (en) * | 2022-11-22 | 2023-03-28 | 中国联合网络通信集团有限公司 | Method and device for determining target node and computer readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100061231A1 (en) * | 2006-11-06 | 2010-03-11 | Janos Harmatos | Multi-domain network and method for multi-domain network |
| US20110242995A1 (en) * | 2010-03-31 | 2011-10-06 | Fujitsu Limited | Systems and methods for multi-domain routing |
| US8310935B1 (en) * | 2002-06-20 | 2012-11-13 | Signafor, Inc. | Communications failure recovery in data packet networks based on fast determination of alternate routes |
| CN103023774A (en) * | 2012-11-30 | 2013-04-03 | 中兴通讯股份有限公司 | Multi-domain routing computation method and apparatus, path computation unit and routing network |
| CN103379032A (en) * | 2012-04-24 | 2013-10-30 | 中兴通讯股份有限公司 | Acquisition method and device for cross-domain end-to-end route and secondary route computation element |
| CN105024844A (en) * | 2014-04-30 | 2015-11-04 | 中国电信股份有限公司 | Method, server and system for computing cross-domain routing |
-
2015
- 2015-11-27 CN CN201510850234.XA patent/CN106817306B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8310935B1 (en) * | 2002-06-20 | 2012-11-13 | Signafor, Inc. | Communications failure recovery in data packet networks based on fast determination of alternate routes |
| US20100061231A1 (en) * | 2006-11-06 | 2010-03-11 | Janos Harmatos | Multi-domain network and method for multi-domain network |
| US20110242995A1 (en) * | 2010-03-31 | 2011-10-06 | Fujitsu Limited | Systems and methods for multi-domain routing |
| CN103379032A (en) * | 2012-04-24 | 2013-10-30 | 中兴通讯股份有限公司 | Acquisition method and device for cross-domain end-to-end route and secondary route computation element |
| CN103023774A (en) * | 2012-11-30 | 2013-04-03 | 中兴通讯股份有限公司 | Multi-domain routing computation method and apparatus, path computation unit and routing network |
| CN105024844A (en) * | 2014-04-30 | 2015-11-04 | 中国电信股份有限公司 | Method, server and system for computing cross-domain routing |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107465615B (en) * | 2017-08-03 | 2020-05-05 | 全球能源互联网研究院有限公司 | Routing determination method based on layered multi-domain and controller |
| CN107465615A (en) * | 2017-08-03 | 2017-12-12 | 全球能源互联网研究院有限公司 | A kind of route determining methods and controller based on layering multiple domain |
| US11381497B2 (en) | 2017-11-30 | 2022-07-05 | New H3C Technologies Co., Ltd. | Path selection method and device |
| CN109104369A (en) * | 2017-11-30 | 2018-12-28 | 新华三技术有限公司 | A kind of routing resource and device |
| WO2019105469A1 (en) * | 2017-11-30 | 2019-06-06 | 新华三技术有限公司 | Path selection method and device |
| CN109104369B (en) * | 2017-11-30 | 2020-04-03 | 新华三技术有限公司 | Path selection method and device |
| CN109361596A (en) * | 2018-10-26 | 2019-02-19 | 新华三技术有限公司合肥分公司 | Route computing method, device and electronic equipment |
| CN109361596B (en) * | 2018-10-26 | 2021-07-06 | 新华三技术有限公司合肥分公司 | Route calculation method and device and electronic equipment |
| CN111817959A (en) * | 2020-07-16 | 2020-10-23 | 迈普通信技术股份有限公司 | Network path management method and device, SDN controller and readable storage medium |
| CN115333947A (en) * | 2022-08-03 | 2022-11-11 | 北京视界云天科技有限公司 | Route optimization method and device based on guidance, computer equipment and storage medium |
| CN115333947B (en) * | 2022-08-03 | 2024-04-16 | 北京视界云天科技有限公司 | Route optimization method, device, computer equipment and storage medium based on guidance |
| CN115865783A (en) * | 2022-11-22 | 2023-03-28 | 中国联合网络通信集团有限公司 | Method and device for determining target node and computer readable storage medium |
| CN115865783B (en) * | 2022-11-22 | 2024-04-09 | 中国联合网络通信集团有限公司 | Method and device for determining target node and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106817306B (en) | 2019-12-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106817306A (en) | A kind of method and device for determining target route | |
| CN107666412B (en) | The virtual network function dispositions method of service function chain | |
| CN108494596B (en) | Collaborative construction and SFC (Small form-factor computing) mapping method for dependency among multiple VNFs (virtual network configuration functions) | |
| CN110022230B (en) | Deep reinforcement learning-based service chain parallel deployment method and device | |
| CN105515987B (en) | A kind of mapping method based on SDN framework Virtual optical-fiber networks | |
| KR101676587B1 (en) | Method and apparatus for determining network topology structure | |
| CN103346979B (en) | Flow distribution method and equipment in SPBM network | |
| CN107332768A (en) | A kind of cross-domain path calculation method of multiple domain controller | |
| CN106452958A (en) | Flow control method and system, and centralized controller | |
| CN108718246B (en) | Resource scheduling method and system oriented to network function virtualization | |
| CN109639575A (en) | Route planning method based on link congestion coefficient | |
| CN104486194A (en) | Control system and control method for virtual network with multiple reliability levels | |
| CN104683488A (en) | Flow-type calculation system as well as dispatching method and dispatching device of flow-type calculation system | |
| CN105721192A (en) | Method and apparatus for realizing capacity planning | |
| CN106416157A (en) | A method to provide elasticity in transport network virtualization | |
| CN107306224A (en) | A kind of routed path update method and network administration apparatus | |
| CN107517155A (en) | A kind of software defined network, node, path calculation method and device | |
| CN109286528A (en) | A kind of SDN network multi-controller dispositions method based on time delay | |
| Mao et al. | Joint resource management and flow scheduling for SFC deployment in hybrid edge-and-cloud network | |
| CN108337179A (en) | Link flow control method and device | |
| CN107659426A (en) | Distribute the method and network side equipment of physical resource | |
| CN109672621A (en) | A kind of method and apparatus selecting transmission path for vpn service | |
| Key et al. | Distributed dynamic routing schemes | |
| CN105430538B (en) | A kind of inter-domain routing method based on optical-fiber network subtopology figure | |
| CN105847146A (en) | Mechanism for increasing hierarchically-distributed SDN (Software Defined Network) control plane routing efficiency |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |