CN109412954A - Route determining methods, device and storage medium based on unordered joint constraint - Google Patents
Route determining methods, device and storage medium based on unordered joint constraint Download PDFInfo
- Publication number
- CN109412954A CN109412954A CN201710709437.6A CN201710709437A CN109412954A CN 109412954 A CN109412954 A CN 109412954A CN 201710709437 A CN201710709437 A CN 201710709437A CN 109412954 A CN109412954 A CN 109412954A
- Authority
- CN
- China
- Prior art keywords
- node
- dominator
- shortest path
- adjacency matrix
- path
- 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.)
- Pending
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/02—Topology update or discovery
-
- 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
-
- 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/18—Loop-free operations
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of route determining methods based on unordered joint constraint, device and storage medium, method therein includes: based on the first adjacency matrix of link establishment between network node and network node；By the exclusion node in the first adjacency matrix and the associated link removal of node is excluded, the second adjacency matrix is obtained after reconstruct；It determines in the second adjacency matrix between source node and destination node and by the shortest path of Dominator.Method, apparatus and storage medium of the invention, it can handle the combination restricted problem including excluding node and Dominator, support the constraint of unordered Dominator, the search space of routing issue is greatly decreased using thought of dividing and ruling, all nodes that can not pass through are handled using the method for first beta pruning or Dynamical Pruning, avoid invalid computation, reduce router-level topology expense, guarantee to converge to global optimum, it is low for large scale network complexity.
Description
Technical field
The present invention relates to network communication technology field more particularly to a kind of routing determination sides based on unordered joint constraint
Method, device and storage medium.
Background technique
The purpose of routing algorithm is to find the path of a satisfaction constraint from source node to destination node, is had proposed at present
A variety of classical routing algorithms, existing routing algorithm are mainly with the associated costs value such as shortest path, least cost, minimal time delay
Constraint, the constraint of shorter mention node.In field of optical transport network, it is contemplated that the need of single-point/multipoint fault and Dominator
It asks, router-level topology is often carried out under the premise of joint constraint, but existing classical routing algorithm is often no longer applicable in.Mesh
Before, although algorithm is excessively complicated in non-communicating subject branch about the research of joint constraint routing algorithm, and do not consider
Communication network field is to the requirement such as loop free, loop free of routing.It is true with joint constraint that therefore, it is necessary to one kind
Surely the method routed.
Summary of the invention
In view of this, the invention solves a technical problem to be to provide a kind of routing based on unordered joint constraint true
Determine method, apparatus and storage medium.
According to an aspect of the present invention, a kind of route determining methods based on unordered joint constraint are provided, comprising: be based on
The first adjacency matrix of link establishment between network node and network node；The network section is determined according to joint constraint condition
Exclusion node and Dominator in point；By in the first adjacency matrix the exclusion node and the exclusion node be associated
Link removal；First adjacency matrix by removal processing is reconstructed, the second adjacency matrix is obtained；Described
It determines in two adjacency matrix between source node and destination node and by the shortest path of the Dominator.
Optionally, described to be determined in second adjacency matrix between source node and destination node and pass through institute
The shortest path for stating Dominator includes: to obtain Dominator set, to all Dominators in the Dominator set
Fully intermeshing combination is carried out, the fully intermeshing set of Dominator is obtained；Dominator in the fully intermeshing set is arranged and is carried out
Traversal, according to Dominator arrangement between source node and destination node and by the path of all Dominators
It is segmented, segmentation shortest path corresponding to determining and each segmented paths；It is located at according to segmentation shortest path determination
Between source node and destination node and by the shortest path of all Dominators.
Optionally, the Dominator arrangement in the fully intermeshing set is traversed, according to the Dominator
It arranges and is segmented, determined and each divided between source node and destination node and by the path of all Dominators
The corresponding segmentation shortest path in section path includes: that the Dominator obtained in the fully intermeshing set is arranged as < a1,
a2,…,an-1,an>, wherein a1, a2,…,an-1,anFor Dominator；According to the Dominator in Dominator arrangement
It puts in order and generates n+1 node pair, determine each node to the shortest path between two nodes for being included；Wherein, institute
State n+1 node to include: n-1 node being made of two adjacent Dominators to, by first Dominator and institute
The node of source node composition is stated to, the node pair that is made of the last one Dominator and the destination node.
Optionally, each node of the determination includes: to obtain the n to the shortest path between two nodes for being included
One node of+1 node centering to the Dominator for being included, remaining necessary section is removed from second adjacency matrix
Point and link associated with remaining described Dominator；Weight is carried out to second adjacency matrix that have passed through removal processing
Structure obtains third adjacency matrix；In the third adjacency matrix determine this node between two nodes for being included most
Short path.
Optionally, if it is possible to determine the node to the shortest path between two nodes for being included, then most by this
Short path to corresponding segmentation shortest path and is stored as with the node.If not can determine that the node to being included
Two nodes between shortest path, then stop it is determining with remaining node to corresponding shortest path, also, carrying out institute
When stating traversal, if it is determined that being arranged in n+1 node pair generated according to a Dominator includes this node pair, then stops
Only to all processing of this Dominator arrangement, and carry out the traversal arranged next Dominator.
Optionally, after the traversal, based on segmentation shortest path be spliced into positioned at source node and destination node it
Between and by all Dominators shortest path.
Another invention according to the present invention provides a kind of routing determining device based on unordered joint constraint, comprising: topology
Module is established, for based on the first adjacency matrix of link establishment between network node and network node；Determining module is constrained,
For determining exclusion node and Dominator in the network node according to joint constraint condition；Node processing module is excluded,
For by the first adjacency matrix the exclusion node and the associated link of the exclusion node remove；Topology reconstruction mould
Block obtains the second adjacency matrix for first adjacency matrix by removal processing to be reconstructed；Shortest path determines
Module, for being determined in second adjacency matrix between source node and destination node and passing through the Dominator
Shortest path.
Optionally, the shortest path determining module, comprising: node arrangement units, it is right for obtaining Dominator set
All Dominators in the Dominator set carry out fully intermeshing combination, obtain the fully intermeshing set of Dominator；Path
Segmenting unit, for being traversed to the Dominator arrangement in the fully intermeshing set, according to Dominator arrangement pair
It is segmented between source node and destination node and by the path of all Dominators；Path-calculating element, for true
Segmentation shortest path corresponding to fixed and each segmented paths determines according to the segmentation shortest path and is located at source node and purpose
Between node and by the shortest path of all Dominators.
Optionally, the path segments unit, be arranged as obtaining the Dominator in the fully intermeshing set <
a1, a2,…,an-1,an>, wherein a1, a2,…,an-1,anFor Dominator；According to the necessary section in Dominator arrangement
Putting in order for point generates n+1 node pair；The path-calculating element, for determining each node to two sections for being included
Shortest path between point；Wherein, the n+1 node is to including: n-1 node being made of two adjacent Dominators
To, the node that is made of first Dominator and the source node to, by the last one Dominator and the destination node
The node pair of composition.
Optionally, the path-calculating element, for obtaining the node institute of the n+1 node centering to being included
Dominator, remaining Dominator and associated with remaining described Dominator is removed from second adjacency matrix
Link；Second adjacency matrix that have passed through removal processing is reconstructed, third adjacency matrix is obtained；It is adjacent in the third
It connects and determines this node to the shortest path between two nodes for being included in matrix.
Optionally, the path-calculating element, if for can determine the node to two nodes for being included it
Between shortest path, then to corresponding segmentation shortest path and stored using this shortest path as with the node.If no
It can determine that the node to the shortest path between two nodes for being included, then stops determining and remaining node to corresponding
Shortest path；The path segments unit, for when carrying out the traversal, if it is determined that institute is arranged according to a Dominator
Include this node pair in n+1 node pair of generation, then stops all processing arranged this Dominator, and carry out under
The traversal of one Dominator arrangement.
Optionally, the path-calculating element, for being spliced into position based on segmentation shortest path after the traversal
Between source node and destination node and by the shortest path of all Dominators.
According to another aspect of the invention, a kind of routing determining device based on unordered joint constraint is provided, comprising: storage
Device；And it is coupled to the processor of the memory, the processor is configured to the finger based on storage in the memory
It enables, executes the route determining methods as described above based on unordered joint constraint.
In accordance with a further aspect of the present invention, a kind of computer readable storage medium, the computer-readable storage medium are provided
Matter is stored with computer instruction, and the routing as described above based on unordered joint constraint is realized when described instruction is executed by processor
Determine method.
Route determining methods based on unordered joint constraint, device and storage medium of the invention, in above-described embodiment
The route determining methods based on unordered joint constraint, device and the storage medium provided, will abut against the exclusion node in matrix
And the associated link removal of node is excluded, new adjacency matrix is obtained after reconstruct, determination is located in new adjacency matrix
Between source node and destination node and by the shortest path of Dominator；To excluding after node makees taking-up processing, using point
It controls thought and evades local optimum problem, it is ensured that one surely converges to the overall situation most under the premise of qualified shortest path is existing
It is excellent, search space can be constantly reduced using existing information during searching for shortest path, reduce router-level topology expense, really
Guarantor can converge to global optimum, low for large scale network complexity.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only
Some embodiments of the present invention, for those of ordinary skill in the art, without any creative labor, also
Other drawings may be obtained according to these drawings without any creative labor.
Fig. 1 is the process signal of one embodiment of the route determining methods according to the present invention based on unordered joint constraint
Figure；
Fig. 2 is that the process of another embodiment of the route determining methods according to the present invention based on unordered joint constraint is shown
It is intended to；
Fig. 3 is in one embodiment of the route determining methods according to the present invention based on unordered joint constraint to necessary section
The algorithm flow schematic diagram of point processing；
Fig. 4 A to 4I is point of one embodiment of the route determining methods according to the present invention based on unordered joint constraint
The schematic diagram of section splicing routing；
Fig. 5 is the module signal of one embodiment of the routing determining device according to the present invention based on unordered joint constraint
Figure；
Fig. 6 is the shortest path in one embodiment of the routing determining device according to the present invention based on unordered joint constraint
The module diagram of diameter determining module；
Fig. 7 is that the module of another embodiment of the routing determining device according to the present invention based on unordered joint constraint is shown
It is intended to.
Specific embodiment
With reference to the accompanying drawings to invention is more fully described, wherein illustrating exemplary embodiment of the present invention.Under
Face will combine the attached drawing in the embodiment of the present invention, and technical scheme in the embodiment of the invention is clearly and completely described, show
So, described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Based on the reality in the present invention
Example is applied, every other embodiment obtained by those of ordinary skill in the art without making creative efforts all belongs to
In the scope of protection of the invention.
Fig. 1 is the process signal of one embodiment of the route determining methods according to the present invention based on unordered joint constraint
Figure, as shown in Figure 1:
Step 101, based on the first adjacency matrix of link establishment between network node and network node.
Step 102, exclusion node and the Dominator in network node are determined according to joint constraint condition.Joint constraint can
To be divided into, to exclude node and Dominator two ways, restraint joint may be single node, it is also possible to multiple nodes.
Step 103, it by the exclusion node in the first adjacency matrix and excludes the associated link of node and removes.
Step 104, the first adjacency matrix by removal processing is reconstructed, obtains the second adjacency matrix.
Step 105, it determines in the second adjacency matrix between source node and destination node and by Dominator
Shortest path.
" unordered " of unordered joint constraint in the present invention refers in specified node the not sequencing of restraint joint.
Shortest path can be obtained using a variety of methods.For example, Dominator set is obtained, to all necessary in Dominator set
Node carries out fully intermeshing combination, obtains the fully intermeshing set of Dominator.Dominator in fully intermeshing set is arranged and is carried out
Traversal is carried out according to Dominator arrangement between source node and destination node and by the path of all Dominators
Segmentation, determination and segmentation shortest path corresponding to each segmented paths.According to segmentation shortest path determine be located at source node and
Between destination node and by the shortest path of all Dominators.
The route determining methods based on unordered joint constraint in above-described embodiment, when must based on joint constraint condition determination
When palpus exclusion/process one or more node, different disposal branch is used for different joint constraint conditions, topological diagram is carried out
Reconstruct and decomposition reduce the search space of routing issue using thought of dividing and ruling, on the basis of meeting joint constraint condition, effectively
Select satisfactory loop-free shortest path.
Fig. 2 is that the process of another embodiment of the route determining methods according to the present invention based on unordered joint constraint is shown
It is intended to.The topological diagram of network node is G=(V, E), and wherein V indicates node set, and E indicates link set.Source node is denoted as s,
Destination node (destination node) is denoted as d.It is as shown in Figure 2:
Step 201, adjacency matrix W is constructed according to topological diagram G.
Step 202, the constraint for excluding node is judged whether there is, if so, 203 are entered step, if not provided, entering step
204。
Step 203, if excluding node involved in constraint condition, beta pruning processing is carried out to adjacency matrix W, removal is all
Exclusion node and and exclude the associated link of node, then reconstruct obtain adjacency matrix W1.
Step 204, Dominator constraint is judged whether there is, if so, 205 are then entered step, if it is not, entering step
Rapid 206.
Step 205, if Dominator involved in constraint condition, Dominator Processing Algorithm is executed.
Step 206, the shortest path P between s and d is solved using shortest path first.Shortest path first includes:
Dijkstra's algorithm, Floyd algorithm etc..
Step 207, satisfactory path is judged whether there is, if it is, entering step 208.
Step 208, it if shortest path P exists, returns the result, otherwise there is no the routings for meeting constraint requirements.
In one embodiment, Dominator Processing Algorithm can there are many.For example, obtaining necessary in fully intermeshing set
Node is arranged as < a1, a2,…,an-1,an>, a1, a2,…,an-1,anFor Dominator.According to Dominator arrange in it is necessary
Putting in order for node generates n+1 node pair, determines each node to the shortest path between two nodes for being included.n+
1 node to include: n-1 node being made of two adjacent Dominators to, by first Dominator and source node
The node of composition is to, the node pair that is made of the last one Dominator and destination node.
Obtain n+1 node centering a node to the node for being included, remove remaining from the second adjacency matrix
Node and link associated with remaining node.The second adjacency matrix that have passed through removal processing is reconstructed, obtains the
Three adjacency matrix.Determining this node to the shortest path between two nodes for being included in third adjacency matrix.
If can determine node to the shortest path between two nodes for being included, using this shortest path as with
Node is to corresponding segmentation shortest path and stores.If not can determine that node to most short between two nodes for being included
Path then stops determining and remaining node to corresponding shortest path.When being traversed, if it is determined that necessary according to one
It includes this node pair that node, which arranges in n+1 node pair generated, then stops handling the arrangement of this Dominator, and
Carry out the traversal arranged next Dominator.After traversal, it is spliced into based on segmentation shortest path positioned at source node
Between destination node and by the shortest path of all Dominators.
Fig. 3 is in one embodiment of the route determining methods according to the present invention based on unordered joint constraint to necessary section
The algorithm flow schematic diagram of point processing.If Dominator shares n, note Dominator collection is combined into X.Dominator set X and source
Destination node s, d collectively form new set X1.It is as shown in Figure 3:
Step 301, construct adjacency matrix W, Dominator set X, sourcesink node to<s, d>.
Step 302, fully intermeshing combination is carried out to all nodes in Dominator set X, obtains arrangement set Y.
Step 303, the arrangement in set Y is traversed, judges whether to complete the traversal to the arrangement in set Y, such as
Fruit is then to enter step 306, if not, entering step 304.
Step 304, not traversed arrangement is taken out from set Y.
Step 305, it is arranged according to the Dominator of taking-up, carries out path segments；
Step 306, there is no the shortest paths for meeting constraint.
Step 307, judge whether to complete the path computing of all segmentations, if so, 315 are entered step, if not, into
Step 308.
Step 308, not calculated segmentation is taken out from above-mentioned all segmentations.
Step 309, beta pruning processing is carried out to adjacency matrix W, rejects Dominator and sourcesink node other than segment end points,
Reconstruct adjacency matrix.
Step 310, shortest path first is executed.
Step 311 judges that this section of shortest path whether there is, if it is, 314 are entered step, if it is not, then entering step
Rapid 312.
Step 312, it is sequentially recorded the node pair having stepped through, record result is expressed as Ri.
Step 313, all rank results comprising Ri in arrangement set Y are rejected, set Y is updated.
Step 314, record segmentation calculated result.
Step 315, it is spliced into shortest path P.
In one embodiment, the process flow arrangement in set Y traversed are as follows: for any in set Y
I-th kind of arrangement, rank results Ti=< a1, a2,…,an-1,an>.Calculate node is to < S, a in order1>,<a1, a2>,…,<
an-1, an>,<an, D > between shortest path.
In calculating process, for arbitrary node pair, needs first to carry out beta pruning processing to topological diagram, remember that this constitutes node
Collection be combined into Z, then carry out beta pruning treated that node set is Vnew=v | v ∈ V-X1+ Z }, during rejecting node,
Also remove link associated therewith simultaneously, constitute new topological diagram, then shortest path first is recycled to calculate the node pair
Between path, and record.
In the process flow that the above-mentioned arrangement in set Y is traversed, for there are the node pair of shortest path, notes
Record segmentation calculated result.Such as the inner node pair for occurring can not find shortest path, then traversal is terminated, and be sequentially recorded and have stepped through
Record result is expressed as R by the node pair crossedi。
Rejecting all in arrangement set Y includes RiRank results, jump to the above-mentioned arrangement in set Y and traverse
Process flow continue to traverse.If after ergodic process, obtained it is all segmentation calculate as a result, if spliced
At shortest path P, as output result.
Fig. 4 A to 4I is point of one embodiment of the route determining methods according to the present invention based on unordered joint constraint
The schematic diagram of section splicing routing.As shown in Figure 4 A, the CR- LDP from A to G is calculated.Determine exclusion/necessary combination constraint are as follows: row
Except node is C, Dominator B, E, F, 3 points of Dominator B, E, F unordered.
As shown in Figure 4 B, beta pruning processing is carried out to topological diagram, C point is removed, while removing all sides being connected with C, located
It is as shown in Figure 4 C to manage result.Dominator set X be { B, E, F }, determine Dominator fully intermeshing set Y=FEB, FBE,
BEF, BFE, EBF, EFB }, Y set constitutes search space, and the Dominator sequence of final shortest path must be gathered herein
It is interior.
Set Y is traversed: the case where calculating FEB, the split result of router-level topology are as follows: A-F, F-E, E-B, B-G；Into
Row calculates paragraph by paragraph.Calculate A-F: first excluded when calculating EBG (for this sequence, do not allow by point), obtain unconnected graph, such as
Shown in Fig. 4 D, route unreachable.Because impossible sequence " F* " can not be rejected, " F* " indicates all F first through F point
The arrangement of beginning.
Arrangement set Y is updated to Y={ BEF, BFE, EBF, EFB }.The case where calculating BEF, the split result of router-level topology
Are as follows: A-B, B-E, E-F, F-G；Calculated paragraph by paragraph, such as exist it is unreachable, continue update arrangement set Y, Segment routing result:
{A,B},{B,E},{E,F},(F,G}.Fig. 4 E is to reject EFG, calculates the shortest route of A-B；Fig. 4 F is to reject AFG, calculates B-E
Shortest route；Fig. 4 G is to reject ABG, calculates the shortest route of E-F；Fig. 4 H is to reject ABE, calculates the shortest route of F-G.It spells
It connects to obtain qualified CR- LDP: A-B-E-F-G, as shown in fig. 41.
The route determining methods based on unordered joint constraint provided in above-described embodiment can handle including excluding node
With the combination restricted problem of Dominator, the constraint of unordered Dominator is supported, do not need the sequence for preassigning Dominator,
The search space of routing issue is greatly decreased using thought of dividing and ruling, using the method for first beta pruning or Dynamical Pruning handle it is all can not
The node that can pass through avoids invalid computation, reduces router-level topology expense, it is ensured that global optimum can be converged to, for extensive net
Network complexity is low.
In one embodiment, as shown in figure 5, the present invention provides a kind of routing determining device based on unordered joint constraint
50, comprising: topology establishes module 51, constraint determining module 52, excludes node processing module 53, topology reconstruction module 54 and most short
Path determination module 55.
Topology establishes module 51 based on the first adjacency matrix of link establishment between network node and network node.Constraint
Determining module 52 determines exclusion node and Dominator in network node according to joint constraint condition.Exclude node processing module
53 by the exclusion node in the first adjacency matrix and exclude the associated link of node and remove.54 pairs of topology reconstruction module processes
First adjacency matrix of removal processing is reconstructed, and obtains the second adjacency matrix.Shortest path determining module 55 is adjacent second
It determines in matrix between source node and destination node and by the shortest path of Dominator.
In one embodiment, as shown in fig. 6, shortest path determining module 55 includes: node arrangement units 551, path
Segmenting unit 552 and path-calculating element 553.Node arrangement units 551 obtain Dominator set, in Dominator set
All Dominators carry out fully intermeshing combination, obtain the fully intermeshing set of Dominator.
Path segments unit 552 traverses the Dominator arrangement in fully intermeshing set, is arranged according to Dominator
It is segmented between source node and destination node and by the path of all Dominators.Path-calculating element 553 is true
Segmentation shortest path corresponding to fixed and each segmented paths determines according to segmentation shortest path and is located at source node and destination node
Between and by all Dominators shortest path.
The Dominator that path segments unit 552 obtains in fully intermeshing set is arranged as < a1, a2,…,an-1,an>, wherein
a1, a2,…,an-1,anFor Dominator.Path segments unit 552 according to Dominator arrange in Dominator arrangement it is suitable
Sequence generates n+1 node pair.Path-calculating element 553 determines each node to the shortest path between two nodes for being included
Diameter, wherein n+1 node to include: n-1 node being made of two adjacent Dominators to, by first necessary section
The node that forms with source node of point is to, the node pair that is made of the last one Dominator with destination node.
Path-calculating element 553 obtain n+1 node centering a node to the Dominator for being included, from second
Remaining Dominator and link associated with remaining Dominator are removed in adjacency matrix.553 pairs of path-calculating element warps
The second adjacency matrix for having crossed removal processing is reconstructed, and obtains third adjacency matrix, this section is determined in third adjacency matrix
Point is to the shortest path between two nodes for being included.
If can determine node to the shortest path between two nodes for being included, path-calculating element 553 will
This shortest path to corresponding segmentation shortest path and is stored as with node.If not can determine that node to included two
Shortest path between a node, then path-calculating element 553 stops determining and remaining node to corresponding shortest path.Road
Diameter segmenting unit 552 is when being traversed, if it is determined that arranges n+1 node centering packet generated according to a Dominator
Containing this node pair, then stop all processing arranged this Dominator, and carry out time arranged next Dominator
It goes through.Path-calculating element 553 after traversal, based on segmentation shortest path be spliced into positioned at source node and destination node it
Between and by all Dominators shortest path.
Fig. 7 is that the module of another embodiment of the routing determining device according to the present invention based on unordered joint constraint is shown
It is intended to.As shown in fig. 7, the device may include memory 71, processor 72, communication interface 73 and bus 74.Memory 71 is used
In store instruction, processor 72 is coupled to memory 71, and processor 72 is configured as the instruction execution stored based on memory 71
Realize the above-mentioned route determining methods based on unordered joint constraint.
Memory 71 can be high speed RAM memory, nonvolatile memory (NoN-volatile memory) etc., deposit
Reservoir 71 is also possible to memory array.Memory 71 is also possible to by piecemeal, and block can be combined into virtually by certain rule
Volume.Processor 72 can be central processor CPU or application-specific integrated circuit ASIC (ApplicatioN Specific
INtegrated Circuit), or be arranged to implement the route determining methods of the invention based on unordered joint constraint
One or more integrated circuits.
In one embodiment, the present invention provides a kind of computer readable storage medium, and computer readable storage medium is deposited
Computer instruction is contained, the road based on unordered joint constraint in as above any one embodiment is realized when instruction is executed by processor
By determining method.
The route determining methods based on unordered joint constraint, device and the storage medium provided in above-described embodiment, will
The associated link removal of exclusion node and exclusion node in adjacency matrix, obtains new adjacency matrix, new after reconstruct
Adjacency matrix in determine positioned at source node and destination node between and by Dominator shortest path, to exclude section
After point makees taking-up processing, local optimum problem is evaded using thought of dividing and ruling, it is ensured that premise existing for qualified shortest path
It is next surely to converge to global optimum, it is empty search can constantly to be reduced using existing information during searching for shortest path
Between, reduce router-level topology expense.
The route determining methods based on unordered joint constraint, device and the storage medium provided in above-described embodiment, can
Include the combination restricted problem for excluding node and Dominator to handle, support the constraint of unordered Dominator, does not need in advance
The sequence of specified Dominator, the search space of routing issue is greatly decreased using thought of dividing and ruling, and is cut using first beta pruning or dynamic
The method of branch handles all nodes that can not pass through, and avoids invalid computation, reduces router-level topology expense, there is no fall into part
Optimal problem, it is ensured that global optimum can be converged to, find qualified path, and low for large scale network complexity.
Method and system of the invention may be achieved in many ways.For example, can by software, hardware, firmware or
Software, hardware, firmware any combination realize method and system of the invention.The said sequence of the step of for method is only
In order to be illustrated, the step of method of the invention, is not limited to sequence described in detail above, especially says unless otherwise
It is bright.In addition, in some embodiments, also the present invention can be embodied as to record program in the recording medium, these programs include
For realizing machine readable instructions according to the method for the present invention.Thus, the present invention also covers storage for executing according to this hair
The recording medium of the program of bright method.
Description of the invention is given for the purpose of illustration and description, and is not exhaustively or will be of the invention
It is limited to disclosed form.Many modifications and variations are obvious for the ordinary skill in the art.It selects and retouches
It states embodiment and is to more preferably illustrate the principle of the present invention and practical application, and those skilled in the art is enable to manage
The solution present invention is to design various embodiments suitable for specific applications with various modifications.
Claims (14)
1. a kind of route determining methods based on unordered joint constraint characterized by comprising
Based on the first adjacency matrix of link establishment between network node and network node；
Exclusion node and the Dominator in the network node are determined according to joint constraint condition；
By in the first adjacency matrix the exclusion node and the exclusion node associated link removal；
First adjacency matrix by removal processing is reconstructed, the second adjacency matrix is obtained；
It determines in second adjacency matrix between source node and destination node and by the most short of the Dominator
Path.
2. the method as described in claim 1, which is characterized in that described determine in second adjacency matrix is located at source node
Include: between destination node and by the shortest path of the Dominator
Dominator set is obtained, fully intermeshing combination is carried out to all Dominators in the Dominator set, acquisition must
Fully intermeshing set through node；
Dominator arrangement in the fully intermeshing set is traversed, according to Dominator arrangement to positioned at source node
It is segmented between destination node and by the path of all Dominators, it is determining to divide with corresponding to each segmented paths
Section shortest path；
It is determined according to the segmentation shortest path between source node and destination node and by the most short of all Dominators
Path.
3. method according to claim 2, which is characterized in that the Dominator in the fully intermeshing set arrange into
Row traversal is arranged according to the Dominator between source node and destination node and by the road of all Dominators
Diameter is segmented, determines that segmentation shortest path corresponding with each segmented paths includes:
The Dominator obtained in the fully intermeshing set is arranged as < a1, a2,…,an-1,an>, wherein a1, a2,…,
an-1,anFor Dominator；
N+1 node pair is generated according to the putting in order for Dominator in Dominator arrangement, determines each node pair
The shortest path between two nodes for being included；
Wherein, the n+1 node to include: n-1 node being made of two adjacent Dominators to, must by first
Node through node and source node composition is to, the node pair that is made of the last one Dominator and the destination node.
4. method as claimed in claim 3, which is characterized in that each node of determination is between two nodes for being included
Shortest path include:
Obtain a node of the n+1 node centering to the Dominator for being included, from second adjacency matrix
Remove remaining Dominator and link associated with remaining described Dominator；
Second adjacency matrix that have passed through removal processing is reconstructed, third adjacency matrix is obtained；
Determining this node to the shortest path between two nodes for being included in the third adjacency matrix.
5. method as claimed in claim 4, which is characterized in that further include:
If can determine the node to the shortest path between two nodes for being included, using this shortest path as with
The node is to corresponding segmentation shortest path and stores.
If not can determine that the node to the shortest path between two nodes for being included, stops determining and remaining node
To corresponding shortest path, also, when carrying out the traversal, if it is determined that generated according to a Dominator arrangement
Include this node pair in n+1 node pair, then stop all processing for arranging this Dominator, and carry out to it is next must
The traversal arranged through node.
6. method as claimed in claim 5, which is characterized in that further include:
After the traversal, it is spliced between source node and destination node based on segmentation shortest path and by institute
There is the shortest path of Dominator.
7. a kind of routing determining device based on unordered joint constraint characterized by comprising
Topology establishes module, for based on the first adjacency matrix of link establishment between network node and network node；
Determining module is constrained, for determining exclusion node and Dominator in the network node according to joint constraint condition；
Exclude node processing module, for by the first adjacency matrix the exclusion node and the exclusion node be associated
Link removal；
Topology reconstruction module obtains the second adjacent square for first adjacency matrix by removal processing to be reconstructed
Battle array；
Shortest path determining module, for being determined between source node and destination node, simultaneously in second adjacency matrix
By the shortest path of the Dominator.
8. device as claimed in claim 7, which is characterized in that
The shortest path determining module, comprising:
Node arrangement units carry out all Dominators in the Dominator set for obtaining Dominator set
Fully intermeshing combination, obtains the fully intermeshing set of Dominator；
Path segments unit, for being traversed to the Dominator arrangement in the fully intermeshing set, according to the necessary section
Point arrangement is segmented between source node and destination node and by the path of all Dominators；
Path-calculating element, it is most short according to the segmentation for segmentation shortest path corresponding to determining and each segmented paths
Path determines between source node and destination node and by the shortest path of all Dominators.
9. device as claimed in claim 8, which is characterized in that
The path segments unit is arranged as < a for obtaining the Dominator in the fully intermeshing set1, a2,…,
an-1,an>, wherein a1, a2,…,an-1,anFor Dominator；According to the arrangement of the Dominator in Dominator arrangement
It is sequentially generated n+1 node pair；
The path-calculating element, for determining each node to the shortest path between two nodes for being included；
Wherein, the n+1 node to include: n-1 node being made of two adjacent Dominators to, must by first
Node through node and source node composition is to, the node pair that is made of the last one Dominator and the destination node.
10. device as claimed in claim 9, which is characterized in that
The path-calculating element, for obtain the n+1 node centering a node to the Dominator for being included,
Remaining Dominator and link associated with remaining described Dominator are removed from second adjacency matrix；To process
Second adjacency matrix of removal processing is reconstructed, and obtains third adjacency matrix；In the third adjacency matrix really
This fixed node is to the shortest path between two nodes for being included.
11. device as claimed in claim 10, which is characterized in that further include:
The path-calculating element, if for can determine the node to the shortest path between two nodes for being included
Diameter then to corresponding segmentation shortest path and is stored using this shortest path as with the node.If not can determine that described
Node then stops determining and remaining node to corresponding shortest path to the shortest path between two nodes for being included；
The path segments unit, for when carrying out the traversal, if it is determined that generated according to a Dominator arrangement
N+1 node pair in include this node pair, then stop all processing for arranging this Dominator, and carry out to next
The traversal of Dominator arrangement.
12. device as claimed in claim 11, which is characterized in that
The path-calculating element, for after the traversal, be spliced into based on segmentation shortest path positioned at source node and
Between destination node and by the shortest path of all Dominators.
13. a kind of routing determining device based on unordered joint constraint characterized by comprising
Memory；And
It is coupled to the processor of the memory, the processor is configured to the instruction based on storage in the memory,
Execute such as the route determining methods described in any one of claims 1 to 6 based on unordered joint constraint.
14. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage has computer to refer to
It enables, such as the road described in any one of claims 1 to 6 based on unordered joint constraint is realized when described instruction is executed by processor
By determining method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710709437.6A CN109412954A (en) | 2017-08-18 | 2017-08-18 | Route determining methods, device and storage medium based on unordered joint constraint |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710709437.6A CN109412954A (en) | 2017-08-18 | 2017-08-18 | Route determining methods, device and storage medium based on unordered joint constraint |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109412954A true CN109412954A (en) | 2019-03-01 |
Family
ID=65455174
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710709437.6A Pending CN109412954A (en) | 2017-08-18 | 2017-08-18 | Route determining methods, device and storage medium based on unordered joint constraint |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109412954A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110430140A (en) * | 2019-08-07 | 2019-11-08 | 迈普通信技术股份有限公司 | Path processing method, device, equipment and storage medium |
| CN112445621A (en) * | 2020-11-30 | 2021-03-05 | 海光信息技术股份有限公司 | Static routing planning method and device, electronic equipment and storage medium |
| CN114928569A (en) * | 2022-04-28 | 2022-08-19 | 烽火通信科技股份有限公司 | Method and system for realizing shortest path containing multiple must-pass resources |
| CN115442293A (en) * | 2022-08-27 | 2022-12-06 | 武汉烽火技术服务有限公司 | Path finding method, device, equipment and readable storage medium |
| WO2024001210A1 (en) * | 2022-06-29 | 2024-01-04 | 中兴通讯股份有限公司 | Path calculation method, controller, and computer readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101621721A (en) * | 2009-08-06 | 2010-01-06 | 中兴通讯股份有限公司 | K-shortest path computing method and device |
| US20140099119A1 (en) * | 2012-10-08 | 2014-04-10 | Futurewei Technologies, Inc. | Transport Functions Virtualization for Wavelength Division Multiplexing (WDM)-based Optical Networks |
| CN104008431A (en) * | 2014-05-30 | 2014-08-27 | 南京富岛信息工程有限公司 | Crude oil tank farm scheduling method |
| CN105141524A (en) * | 2015-09-16 | 2015-12-09 | 武汉烽火技术服务有限公司 | Topological graph optimal route algorithm with constraint conditions |
| CN106503789A (en) * | 2016-11-08 | 2017-03-15 | 西安电子科技大学宁波信息技术研究院 | Loop-free shortest path searching method based on Di Jiesitela and minimax ant colony |
-
2017
- 2017-08-18 CN CN201710709437.6A patent/CN109412954A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101621721A (en) * | 2009-08-06 | 2010-01-06 | 中兴通讯股份有限公司 | K-shortest path computing method and device |
| US20140099119A1 (en) * | 2012-10-08 | 2014-04-10 | Futurewei Technologies, Inc. | Transport Functions Virtualization for Wavelength Division Multiplexing (WDM)-based Optical Networks |
| CN104008431A (en) * | 2014-05-30 | 2014-08-27 | 南京富岛信息工程有限公司 | Crude oil tank farm scheduling method |
| CN105141524A (en) * | 2015-09-16 | 2015-12-09 | 武汉烽火技术服务有限公司 | Topological graph optimal route algorithm with constraint conditions |
| CN106503789A (en) * | 2016-11-08 | 2017-03-15 | 西安电子科技大学宁波信息技术研究院 | Loop-free shortest path searching method based on Di Jiesitela and minimax ant colony |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110430140A (en) * | 2019-08-07 | 2019-11-08 | 迈普通信技术股份有限公司 | Path processing method, device, equipment and storage medium |
| CN112445621A (en) * | 2020-11-30 | 2021-03-05 | 海光信息技术股份有限公司 | Static routing planning method and device, electronic equipment and storage medium |
| CN114928569A (en) * | 2022-04-28 | 2022-08-19 | 烽火通信科技股份有限公司 | Method and system for realizing shortest path containing multiple must-pass resources |
| CN114928569B (en) * | 2022-04-28 | 2023-06-09 | 烽火通信科技股份有限公司 | Shortest path implementation method and system containing multiple necessary resources |
| WO2024001210A1 (en) * | 2022-06-29 | 2024-01-04 | 中兴通讯股份有限公司 | Path calculation method, controller, and computer readable storage medium |
| CN115442293A (en) * | 2022-08-27 | 2022-12-06 | 武汉烽火技术服务有限公司 | Path finding method, device, equipment and readable storage medium |
| CN115442293B (en) * | 2022-08-27 | 2023-06-06 | 武汉烽火技术服务有限公司 | Path finding method, device, equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109412954A (en) | Route determining methods, device and storage medium based on unordered joint constraint | |
| CN107888496B (en) | Method and apparatus for multiple path computation of label switched paths | |
| US10298488B1 (en) | Path selection and programming of multiple label switched paths on selected paths of multiple computed paths | |
| CN104266656B (en) | For the method for searching shortest route and device of road network | |
| US10148551B1 (en) | Heuristic multiple paths computation for label switched paths | |
| US20030161338A1 (en) | Network path selection based on bandwidth | |
| US10404576B2 (en) | Constrained shortest path determination in a network | |
| CN101611592A (en) | The dynamic routing of the light signal in the optical-fiber network | |
| US9794123B2 (en) | Highly reliable path accommodation design apparatus and method | |
| WO2016074738A1 (en) | Data routing with a machine learning-based routing model | |
| KR20190006066A (en) | Determination of route in communication network | |
| CN102420797B (en) | Topology mapping method and system | |
| JP5140161B2 (en) | COMPUTER DEVICE, ROUTE CALCULATION METHOD, AND PROGRAM | |
| Zheng et al. | Dependence-aware service function chain embedding in optical networks | |
| CN102210128A (en) | Path calculation order deciding method, program and calculating apparatus | |
| CN104468387B (en) | The distributed storage method of OSPF link-state informations in expandable route | |
| US11575440B2 (en) | Computing viable paths through an optical network | |
| US20170373750A1 (en) | A method and system for assigning performance indicators to objects of a network | |
| JP5898112B2 (en) | Network design apparatus and network design program | |
| CN107689916A (en) | A kind of method and system for seeking complete risk sharing link group disjoint paths pair | |
| CN111780762B (en) | Patrol path generation method and device and storage medium | |
| CN102907053A (en) | Wavelength division network planning method and equipment | |
| CN113099321B (en) | Method, device and computer readable storage medium for determining communication path | |
| EP2947818A1 (en) | A method and device for operating an optical transport network | |
| CN109428813A (en) | Heavy route method, device and storage medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190301 |
|
| RJ01 | Rejection of invention patent application after publication |