CN102487355A - Route inquiring method and device - Google Patents
Route inquiring method and device Download PDFInfo
- Publication number
- CN102487355A CN102487355A CN2010105723776A CN201010572377A CN102487355A CN 102487355 A CN102487355 A CN 102487355A CN 2010105723776 A CN2010105723776 A CN 2010105723776A CN 201010572377 A CN201010572377 A CN 201010572377A CN 102487355 A CN102487355 A CN 102487355A
- Authority
- CN
- China
- Prior art keywords
- link
- route
- constraints
- mark
- protection type
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
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 route inquiring method and a route inquiring device. The route inquiring method comprises the following steps of: when route query is performed by using a constraint condition that service attribute is strictly matched and then is subjected to downward compatible match, setting a first link mark for a link in the multiple links to be inquired, wherein the service attribute of the link is completely matched with that in the constraint condition, and setting a second link mark for the link of which the service attribute is incompletely matched with that in the constraint condition; and determining the route satisfying the constraint condition according to the first link mark and the second link mark. Through the method and the device, the route satisfying the constraint condition can be obtained through query for only one time, so the query times are reduced, and the route query efficiency is obviously improved.
Description
Technical field
The present invention relates to the communications field, in particular to a kind of method for searching route and device.
Background technology
At present; When utilization routing inquiry interface issues routing inquiry request in the diverse network; Usually subsidiary many constraintss; For example: strict get rid of, share, seize, must mate and constraints such as backward compatible coupling through the strictness of, link protection type, to satisfy different routing inquiry demands with loose eliminating.With ASON (Automatic Switched Optical Network, ASON) is example, because the increasing of constraints during routing inquiry makes the routing inquiry efficient of ASON reduce gradually.
In ASON, when being the constraints of routing inquiry with the shortest path, it is mainly realized through CSPF (Constrained Shortest Path First, SPF) constraint formula SPF module.The CSPF module adopts Dijkstra (Di Jiesitela) algorithm to calculate shortest path; And dijkstra's algorithm is industry a kind of algorithm of asking single source shortest path commonly used; I.e. shortest path from a point to every other point, its basic principle is: point that distance is the shortest of each new expansion, upgrade the distance of the point that is adjacent; When all limit weights all are correct time; Owing to can there not be a point of not expanding that distance is shorter,, thereby guaranteed algorithm validity so the distance of this point is changed never again.
If on the basis of shortest path; Also require in routing inquiry about backward compatible matching constraint after the strict earlier coupling of link protection type; As shown in Figure 1, ASON issues the shortest path that inquiry 1-4 is ordered, and supposes that the query requests that ASON issues also requires the strictness earlier of link protection type to mate the backward compatible coupling in back; Be that link protection type on the shortest path is preferably mated with the protection type of business fully; If not having such path, the link protection type on the shortest path also can be not exclusively to mate with the protection type of business, but the protection type of all links on the path will be higher than professional protection type.At this moment, traditional CSPF module utilization dijkstra's algorithm realizes that the routing inquiry process of this constraints is following:
(1), return the link protection type of all links and the shortest path that the service protection type is mated fully, otherwise the path query failure.
(2), when the path query of (1) failure, inquiry again, returning not is the link protection type and the shortest path that the service protection type is mated fully of all link, otherwise path query is failed.
Thus it is clear that, in the above-mentioned path query process, when the shortest path that do not have link protection type and service protection type to mate fully, need to carry out at least twice inquiry to the CSPF module and just can find the route that satisfies this constraint through readjustment.And behind readjustment, all are available and be not the link protection type of all link when having many with shortest path that the service protection type is mated fully, then also will repeatedly inquire about and could finally confirm to satisfy the route that retrains.This makes that route query times are more when carrying out the routing inquiry of belt restraining condition, and search efficiency is lower.
Summary of the invention
Main purpose of the present invention is to provide a kind of method for searching route and device, and above-mentioned when carrying out the routing inquiry of belt restraining condition to solve at least, route query times are more, the problem that search efficiency is lower.
According to an aspect of the present invention; A kind of method for searching route is provided; Comprise: in the backward compatible coupling in earlier strict coupling back with service attribute is that constraints is when carrying out routing inquiry; The link that matees fully for the service attribute that exists in the multilink to be checked and the service attribute in the constraints is provided with the first link mark, for the incomplete link of coupling is provided with the second link mark; Confirm to satisfy the route of constraints according to the first link mark and the second link mark.
According to a further aspect in the invention; A kind of routing inquiring device is provided; Comprise: module is set; Being used in the backward compatible coupling in earlier strict coupling back with service attribute is constraints when carrying out routing inquiry, and the link that matees fully for service attribute and the service attribute in the constraints that exists in the multilink to be checked is provided with the first link mark, for the link that not exclusively matees is provided with the second link mark; Enquiry module is used for confirming to satisfy according to the first link mark and the second link mark route of constraints.
Through the present invention, be adopted as the link that matees fully the first link mark is set, for the link that not exclusively matees is provided with the second link mark; Make when carrying out the routing inquiry of belt restraining condition, can at first judge whether the route of coupling fully according to the link mark, if do not have; Then select to satisfy the route of constraints, and needn't adjust back inquiry, thereby it is more to have solved route query times according to the first link mark and the second link mark; The problem that search efficiency is lower; And then only reached and need one query just can obtain the route that satisfies constraints, make inquiry times reduce, improved the effect of routing inquiry efficient significantly.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 is according to the route sketch map in a kind of method for searching route of correlation technique;
Fig. 2 is the flow chart of steps according to a kind of method for searching route of the embodiment of the invention one;
Fig. 3 is according to the flow chart of steps in a kind of method for searching route of the embodiment of the invention two;
Fig. 4 is according to the route sketch map in a kind of method for searching route of the embodiment of the invention three;
Fig. 5 is according to the route sketch map in a kind of method for searching route of the embodiment of the invention four;
Fig. 6 is the structured flowchart according to a kind of routing inquiring device of the embodiment of the invention five.
Embodiment
Hereinafter will and combine embodiment to specify the present invention with reference to accompanying drawing.Need to prove that under the situation of not conflicting, embodiment and the characteristic among the embodiment among the application can make up each other.
With reference to Fig. 2, show flow chart of steps according to a kind of method for searching route of the embodiment of the invention one, may further comprise the steps:
Step S202: in the backward compatible coupling in earlier strict coupling back with service attribute is that constraints is when carrying out routing inquiry; The link that matees fully for the service attribute that exists in the multilink to be checked and the service attribute in the constraints is provided with the first link mark, for the incomplete link of coupling is provided with the second link mark;
Present embodiment is applicable to that the backward compatible coupling in strict earlier coupling back with service attribute is the routing inquiry of constraints.Through in carrying out the routing inquiry process; Need from a plurality of nodes, select the route that satisfies condition; And all can have a link between any two nodes that directly link to each other, then there is multilink between a plurality of nodes, in this step; For the link of those service attributes of existing in the multilink and the service attribute in the constraints (promptly coupling) fully in full accord is provided with the first link mark, for the link of not quite identical (promptly not exclusively mating) is provided with the second link mark.
Wherein, the service attribute when service attribute can be for arbitrarily suitable Route Selection, like the link protection type, perhaps, like the level of security of link etc.
Step S204: the route of confirming to satisfy constraints according to the first link mark and the second link mark.
In this step, the link mark according to being provided with comprises the first link mark and the second link mark, confirms to satisfy the strict earlier route of mating the backward compatible matching constraints in back of service attribute.As, because of a route possibly comprise a plurality of links, so in a plurality of available routes; Select those all link marks wherein to be that route of the first link mark; As the route that satisfies constraints, if there is not such route, then from all available routes; Select one according to setting rule, like the minimum rule of link cost etc.
In the correlation technique, when carrying out the routing inquiry of belt restraining condition, when not fully during the route of coupling, need readjustment inquiry again once more, thereby inquiry times is more, search efficiency is lower.Through present embodiment, be adopted as the link that matees fully the first link mark is set, for the link that not exclusively matees is provided with the second link mark; Make when carrying out the routing inquiry of belt restraining condition, can at first judge whether the route of coupling fully according to the link mark, if do not have; Then select to satisfy the route of constraints, and needn't adjust back inquiry, thereby it is more to have solved route query times according to the first link mark and the second link mark; The problem that search efficiency is lower; And then only reached and need one query just can obtain the route that satisfies constraints, make inquiry times reduce, improved the effect of routing inquiry efficient significantly.
With reference to Fig. 3, show flow chart of steps according to a kind of method for searching route of the embodiment of the invention two.In the present embodiment; To the long defective of ASON constraint shortest path query time; Provide the shortest path of the belt restraining condition that a kind of ASON of raising uses to look into the method for searching route of road efficient, made ASON can in the shorter time, return identical result when retraining the shortest path inquiry.
The method for searching route of present embodiment may further comprise the steps:
Step S302: when source node carries out routing inquiry, in the full mesh topology database of this node being preserved according to the protection type of ASON issuing service on every link newly-increased complete match flag of link protection type.
For example, if the protection type of link is consistent with professional protection type, then the complete match flag of link protection type of this link is set to 0; If the protection type of link and professional protection Type-Inconsistencies, but the link protection type of this link is greater than the protection type of business, and then the complete match flag of link protection type of this link is set to 1; If the protection type of link and professional protection Type-Inconsistencies; And the protection type of link is less than the protection type of business; Then the complete match flag of link protection type of this link can not be provided with; Also careless settings, but this value should be in traditional CSPF and can this link be changed to disabled value.Be set to 0 through the complete match flag of link protection type; The link protection type is set to 1 greater than the complete match flag of link protection type of the protection type of business; When carrying out the complete matched and searched of link protection type; Whether be 0 can determine whether fully mate, be very easy to and search if only needing according to the complete match flag of link protection type of this route, improved search efficiency.
Need to prove; Also can the complete match flag of link protection type be set to other value; At this moment, when judging whether to mate fully, only need know the number of the link of coupling fully; Judge that whether the complete match flag sum of link protection type of route equals the product of the value of link number and setting, can determine whether to mate fully.
Step S304: with the root node of source node as shortest path tree.
When initial, source node is the root node of shortest path tree.At this moment; Each comparing unit all is 0 (wherein; Comparing unit is used to obtain the next node that links to each other with this node and metric (degree) value of this node, and for example source node is to total metric value in next-hop node path, or the weighted value of source node and next-hop node etc.; In the present embodiment, can be summation of the link protection type matching sign among the step S302 etc.).
Because initial, so this moment, next-hop node still was this node.
Step S306:, use dijkstra's algorithm to obtain next-hop node according to the complete match flag of link protection type.
In the present embodiment, if in the link of this node and the next-hop node that links to each other, it is 0 link that the complete match flag of link protection type is arranged, and then chooses that node that links to each other with this node in this link.
Need to prove; When the utilization dijkstra's algorithm obtains next-hop node; Traditional comparative approach is that the priority orders according to the comparison strategy of setting compares successively, is higher than link cost priority like link protection type priority level, then earlier carries out Route Selection according to the link protection type; If it is a plurality of that the route of selecting has, in the route of selecting, select again according to link cost.And in the present embodiment; It then is practical application scene according to each comparing unit; Not strict comparing when each comparing unit compares, but when certain comparing unit arrives to a certain degree, reduce priority-level and carry out ensuing comparison according to traditional priority level.(as, with the link protection type relatively be example, when the link protection type summation of two paths all more than or equal to 1; As be all 2 o'clock, think that this two paths is identical, this moment, the weight to this two paths compared; The selection cost is less, i.e. that less paths of weighted value.)
Step S308: repeating step S306, acquisition arrives the shortest path tree of destination node.
Pass through present embodiment; Realizing that having broken through traditional CSPF on the details is pressing the comparative approach of fixed priority order to each constraints (comparing unit); But compare according to the practical application scene adjustment priority of constraints; Improve the method that traditional C PF module realizes the link protection type matching, improved the routing inquiry efficient that ASON carries out the belt restraining condition.
With reference to Fig. 4, show according to the route sketch map in a kind of method for searching route of the embodiment of the invention three.Among Fig. 4, the protection type link that representative of black fine rule and routing inquiry request are mated fully, the representative of heavy black line section can compatible routing inquiry request be protected type link, the digitized representation link weight on the line segment.
The method for searching route of present embodiment may further comprise the steps:
Step S402:ASON issues the route requests of query node 1 to the belt restraining condition of node 4 to CSPF, and this constraints is: the backward compatible coupling in link protection type strict earlier coupling back.
Step S404:CSPF according to the link protection type whether with constraints in the link protection type mate fully, link is stamped the link mark, whether this link of mark is to mate fully.
In the present embodiment, the link of setting node 1-2 is labeled as 1, and the link of node 1-3 is labeled as 0, and the link of node 2-3 is labeled as 1, and the link of node 2-4 is labeled as 0, and the link of node 3-4 is labeled as 0.Wherein, 0 expression is coupling fully, and 1 expression is not exclusively mated and the link protection type is higher than the link protection type in the constraints.
Step S406: the link protection type matching mark of all links of node 1 on node 4 routes is added up.
In the present embodiment, node 1 has four available routes to node 4, is respectively: node 1-2-4, node 1-3-4, node 1-2-3-4, node 1-3-2-4.Wherein, The adding up and be 1 of the link protection type matching mark of node 1-2-4; The adding up and be 0 of the link protection type matching mark of node 1-3-4; The adding up and be 2 of the link protection type matching mark of node 1-2-3-4, the adding up and be 1 of the link protection type matching mark of node 1-3-2-4.
Step S408: relatively the link protection type matching of route add up with, confirm optimum route results.
In the present embodiment, the adding up and be 0 of the link protection type mark of route 1-3-4, expression link protection type is mated fully.Suppose that link protection type matching priority is higher than other routing strategy priority, confirm that then route 1-3-4 is optimum route results.
Pass through present embodiment; The link protection type identification of coupling is 0 to the CSPF module through being provided with fully; Through judging adding up and be 0 whether of link protection type mark, can judge whether there is the shortest path that satisfies constraints fast, thereby improved ASON significantly look into road efficient.
With reference to Fig. 5, show according to the route sketch map in a kind of method for searching route of the embodiment of the invention four.Among Fig. 5, the protection type link that representative of black fine rule and routing inquiry request are mated fully, the representative of heavy black line section can compatible routing inquiry request be protected type link, the digitized representation link weight on the line segment.
The method for searching route of present embodiment may further comprise the steps:
Step S502:ASON issues the route requests of query node 1 to the belt restraining condition of node 4 to CSPF, and this constraints is: the backward compatible coupling in link protection type strict earlier coupling back.
Step S504:CSPF according to the link protection type whether with constraints in the link protection type mate fully, link is stamped the link mark, whether this link of mark is to mate fully.
In the present embodiment, the link of setting node 1-2 is labeled as 1, and the link of node 1-3 is labeled as 0, and the link of node 2-3 is labeled as 1, and the link of node 2-4 is labeled as 0, and the link of node 3-4 is labeled as 1.Wherein, 0 expression is coupling fully, and 1 expression is not exclusively mated and the link protection type is higher than the link protection type in the constraints.
Step S506: the link protection type matching mark of all links of node 1 on node 4 routes is added up.
In the present embodiment, node 1 has four available routes to node 4, is respectively: node 1-2-4, node 1-3-4, node 1-2-3-4, node 1-3-2-4.Wherein, The adding up and be 1 of the link protection type matching mark of node 1-2-4; The adding up and be 1 of the link protection type matching mark of node 1-3-4; The adding up and be 3 of the link protection type matching mark of node 1-2-3-4, the adding up and be 1 of the link protection type matching mark of node 1-3-2-4.
Step S508: relatively the link protection type matching of route add up with, confirm optimum route results.
In the present embodiment, all there is not the link protection type to mate fully in four routes, at this moment; Then reduce link protection type matching priority; Promptly no longer carry out the comparison (just thinking that the link protection type matching had just compare at 0 o'clock in adding up) of link protection type matching, but continue to select route, to compare the link cost of each route according to the routing rules of setting; Promptly the minimum route of inquiry link cost is an example from a plurality of routes; Then continue the relatively weight summation of four routes, according to comparative result, it is optimum route results that CSPF returns 1-2-3-4.
In this case, constraints requires if comprise the link that surpasses 1 backward compatible coupling of link protection type in the mulitpath, and when not considering other constraintss, mulitpath is regarded as identical.At this moment, can from mulitpath, finally select qualified path according to other constraintss again.Retrain the interface that provides to the outside or coupling fully with present CSPF for the link protection type matching; Or backward compatible coupling; If the routing inquiry that ASON issues requires the strict earlier coupling of link protection type matching constraint,, must inquire about to CSPF and just can return route for twice and compare if not then during backward compatible coupling; The ASON of present embodiment only need once promptly can protect the backward compatible route in the strict earlier back of type matching by return link to the CSPF inquiry; And need not adjust back inquiry, and reduced inquiry times, improved search efficiency.
Certainly, when in all routes, all not having route that the link protection type matees fully, those skilled in the art also can set other comparison condition, and to select suitable route, the present invention does not limit this.
With reference to Fig. 6, show structured flowchart according to a kind of routing inquiring device of the embodiment of the invention five, comprising:
Module 602 is set; Being used in the backward compatible coupling in earlier strict coupling back with service attribute is that constraints is when carrying out routing inquiry; The link that matees fully for the service attribute that exists in the multilink to be checked and the service attribute in the constraints is provided with the first link mark, for the incomplete link of coupling is provided with the second link mark; Enquiry module 604 is used for confirming to satisfy according to the first link mark and the second link mark route of constraints.
Preferably, service attribute is the link protection type; Module 602 is set the second link mark is set for the link that not exclusively coupling and link protection type are higher than the link protection type in the constraints.
Preferably, enquiry module 604 comprises: judge module 6042, be used for judging all available routes, and whether exist all link marks to be the route of the first link mark; Executive Module 6044 is used for if the judged result of judge module 6042 is for being that then definite this route is to satisfy the route of constraints; If the judged result of judge module 6042 is then confirmed a route according to preset rule, for satisfying the route of constraints for not from all available routes.
Preferably, above-mentioned preset rule is the minimum rule of link cost.
Preferably, enquiry module 604 also comprises: select module, be used for if the route of confirming that satisfies constraints comprises a plurality ofly, then from a plurality of routes, select one according to the rule of setting.Preferably, the rule of this setting is the Route Selection priority rule, and the Route Selection priority rule is used for carrying out Route Selection according to the different priorities of a plurality of routing strategies.
Preferably, the first link mark is set to 0, the second link mark and is set to 1; Judge module 6042 is used for judging all available routes, and whether having link mark sum is zero route; Executive Module 6044 is used for if the judged result of judge module 6042 is for being that then definite this route is to satisfy the route of constraints; If the judged result of judge module 6044 is then confirmed a route according to preset rule, for satisfying the route of constraints for not from all available routes.
Need to prove that a plurality of embodiment of the present invention all are example with ASON, but method for searching route of the present invention and device are not only applicable to the ASON network, are applicable to the network that other uses routing inquiry yet.In addition; Constraints among a plurality of embodiment of the present invention is example with the backward compatible coupling in strict earlier coupling back of link protection type all; But be not limited thereto; All require all applicable method and apparatus of the present invention of the strict earlier coupling backward compatible matching constraints in back, and the present invention does not limit this.And a plurality of embodiment of the present invention use dijkstra's algorithm to search shortest path, but are not limited thereto, and those skilled in the art can also select other suitable shortest path searching algorithm according to actual needs, and the present invention does not limit this yet.
It is long to the present invention is directed in the prior art belt restraining routing inquiry time, and inquiry times is many, and the defective that search efficiency is low provides a kind of routing inquiry scheme of belt restraining condition.This scheme is when inquiring about route; The service attribute of all links of the route that requirement is returned preferably with constraints in service attribute mate fully; If there is not such path, the service attribute of some link also can not exclusively mate with the service attribute of constraints on the path.According to the mode of traditional this constraints of realization, then in routing inquiry, need adjust back twice during about the earlier strict coupling back backward compatible matching constraint of service attribute and just can inquire the path that meets the demands.And, can realize that one query just can return the path of satisfying constraints through technical scheme of the present invention, and make route query times reduce, improved significantly and looked into road efficient.
Obviously, it is apparent to those skilled in the art that above-mentioned each module of the present invention or each step can realize with the general calculation device; They can concentrate on the single calculation element; Perhaps be distributed on the network that a plurality of calculation element forms, alternatively, they can be realized with the executable program code of calculation element; Thereby; Can they be stored in the storage device and carry out, and in some cases, can carry out step shown or that describe with the order that is different from here by calculation element; Perhaps they are made into each integrated circuit modules respectively, perhaps a plurality of modules in them or step are made into the single integrated circuit module and realize.Like this, the present invention is not restricted to any specific hardware and software combination.
The above is merely the preferred embodiments of the present invention, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (12)
1. a method for searching route is characterized in that, comprising:
In the backward compatible coupling in earlier strict coupling back with service attribute is that constraints is when carrying out routing inquiry; The link that matees fully for the service attribute that exists in the multilink to be checked and the service attribute in the said constraints is provided with the first link mark, for the incomplete link of coupling is provided with the second link mark;
Confirm to satisfy the route of said constraints according to the said first link mark and the second link mark.
2. method according to claim 1 is characterized in that, said service attribute is the link protection type; The step that said link for incomplete coupling is provided with the second link mark comprises:
The link that is higher than the link protection type in the said constraints for not exclusively coupling and link protection type is provided with the second link mark.
3. method according to claim 1 is characterized in that, the step of confirming to satisfy the route of said constraints according to the said first link mark and the second link mark comprises:
Judge in all available routes whether exist all link marks to be the route of the said first link mark;
If confirm that then this route is to satisfy the route of said constraints; If not, then from said all available routes, confirm a route, for satisfying the route of said constraints according to preset rule.
4. method according to claim 3 is characterized in that, said preset rule is the minimum rule of link cost.
5. method according to claim 1 and 2 is characterized in that, and is a plurality of if said definite route that satisfies constraints comprises, then from said a plurality of routes, selects one according to the rule of setting.
6. method according to claim 5 is characterized in that, the rule of said setting is the Route Selection priority rule, and said Route Selection priority rule is used for carrying out Route Selection according to the different priorities of a plurality of routing strategies.
7. method according to claim 2 is characterized in that, the said first link mark is set to 0, and the said second link mark is set to 1.
8. method according to claim 7 is characterized in that, the step of confirming to satisfy the route of said constraints according to the said first link mark and the second link mark comprises:
Judge in all available routes whether having link mark sum is zero route;
If confirm that then this route is to satisfy the route of said constraints; If not, then from said all available routes, confirm a route, for satisfying the route of said constraints according to preset rule.
9. a routing inquiring device is characterized in that, comprising:
Module is set; Being used in the backward compatible coupling in earlier strict coupling back with service attribute is that constraints is when carrying out routing inquiry; The link that matees fully for the service attribute that exists in the multilink to be checked and the service attribute in the said constraints is provided with the first link mark, for the incomplete link of coupling is provided with the second link mark;
Enquiry module is used for confirming to satisfy according to the said first link mark and the second link mark route of said constraints.
10. device according to claim 9 is characterized in that, said service attribute is the link protection type;
The said module that is provided with is provided with the second link mark for the link that not exclusively coupling and link protection type are higher than the link protection type in the said constraints.
11., it is characterized in that said enquiry module comprises according to claim 9 or 10 described devices:
Whether judge module is used for judging all available routes, exist all link marks to be the route of the said first link mark;
Executive Module is used for if the judged result of said judge module is for being that then definite this route is to satisfy the route of said constraints; If the judged result of said judge module is then confirmed a route according to preset rule, for satisfying the route of said constraints for not from said all available routes.
12. device according to claim 11 is characterized in that, the said first link mark is set to 0, and the said second link mark is set to 1;
Said judge module is used for judging all available routes, and whether having link mark sum is zero route;
Said Executive Module is used for if the judged result of said judge module is for being that then definite this route is to satisfy the route of said constraints; If the judged result of said judge module is then confirmed a route according to preset rule, for satisfying the route of said constraints for not from said all available routes.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010572377.6A CN102487355B (en) | 2010-12-03 | 2010-12-03 | Method for searching route and device |
| PCT/CN2011/079642 WO2012071924A1 (en) | 2010-12-03 | 2011-09-14 | Method and device for routing query |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010572377.6A CN102487355B (en) | 2010-12-03 | 2010-12-03 | Method for searching route and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102487355A true CN102487355A (en) | 2012-06-06 |
| CN102487355B CN102487355B (en) | 2015-08-12 |
Family
ID=46152811
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010572377.6A Active CN102487355B (en) | 2010-12-03 | 2010-12-03 | Method for searching route and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102487355B (en) |
| WO (1) | WO2012071924A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111147377A (en) * | 2019-12-05 | 2020-05-12 | 连连银通电子支付有限公司 | Method, device, equipment and medium for determining service channel |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060050883A1 (en) * | 2004-09-09 | 2006-03-09 | Texas Instruments Incorporated | System and method for bit stream compatible local link encryption |
| CN101330448A (en) * | 2007-06-21 | 2008-12-24 | 华为技术有限公司 | Method and apparatus for announcing link state information and determining multicast forwarding path |
| US20090016244A1 (en) * | 2002-09-20 | 2009-01-15 | Vishal Sharma | System and method for network layer protocol routing in a peer model integrated optical network |
| CN101753597A (en) * | 2008-12-09 | 2010-06-23 | 华为技术有限公司 | Keeping alive method between peer node and client under peer node-client architecture |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100440864C (en) * | 2005-07-22 | 2008-12-03 | 中兴通讯股份有限公司 | Method for obtaining intelligent light network restraining route |
| CN101616085A (en) * | 2009-06-25 | 2009-12-30 | 中兴通讯股份有限公司 | A kind of constraint route generating method and device |
-
2010
- 2010-12-03 CN CN201010572377.6A patent/CN102487355B/en active Active
-
2011
- 2011-09-14 WO PCT/CN2011/079642 patent/WO2012071924A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090016244A1 (en) * | 2002-09-20 | 2009-01-15 | Vishal Sharma | System and method for network layer protocol routing in a peer model integrated optical network |
| US20060050883A1 (en) * | 2004-09-09 | 2006-03-09 | Texas Instruments Incorporated | System and method for bit stream compatible local link encryption |
| CN101330448A (en) * | 2007-06-21 | 2008-12-24 | 华为技术有限公司 | Method and apparatus for announcing link state information and determining multicast forwarding path |
| CN101753597A (en) * | 2008-12-09 | 2010-06-23 | 华为技术有限公司 | Keeping alive method between peer node and client under peer node-client architecture |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111147377A (en) * | 2019-12-05 | 2020-05-12 | 连连银通电子支付有限公司 | Method, device, equipment and medium for determining service channel |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2012071924A1 (en) | 2012-06-07 |
| CN102487355B (en) | 2015-08-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102972009B (en) | The System and method for Path selection is selected for implementing federated service device | |
| CN101965715B (en) | Tie-Breaking in Shortest Path Determination | |
| CN103379032A (en) | Acquisition method and device for cross-domain end-to-end route and secondary route computation element | |
| US20020191545A1 (en) | Methods and apparatus for selecting multiple paths taking into account shared risk | |
| WO2016161808A1 (en) | Method and node for dynamic reconnection of trains | |
| CN100440864C (en) | Method for obtaining intelligent light network restraining route | |
| CN102804712A (en) | Method and apparatus for selecting between multiple equal cost paths | |
| CN100574269C (en) | Be used for coming the heavy method of matched chain right of way in view of optimized traffic assignments | |
| CN102098740A (en) | Link aggregation routing method and device | |
| KR20150030644A (en) | Tie-breaking in shortest path determination | |
| US20200302275A1 (en) | Neural network apparatus | |
| CN103929327A (en) | Hybrid networking service back calculation method for webmaster | |
| EP2448191B1 (en) | Method and apparatus for generating constraint route | |
| CN110779524A (en) | Path planning method, device, equipment and storage medium | |
| US8472347B2 (en) | System and method for providing network resiliency | |
| US7986643B2 (en) | Determining and distributing routing paths for nodes in a network | |
| CN103532861A (en) | Intra-domain dynamic multipath generating method based on generating tree | |
| US7948917B2 (en) | Routing internet communications using network coordinates | |
| CN101909004A (en) | Multi-domain optical network routing method based on edge ROADM (Reconfigurable Optical Add-Drop Multiplexer) ring structure | |
| CN102487355A (en) | Route inquiring method and device | |
| CN106209671A (en) | A kind of method and device determining that routing overhead is shared | |
| CN101459586B (en) | Network address dispensing method and routing method for long link shape ZigBee network | |
| CN101360347A (en) | Route selection method for wavelength routing optical network | |
| CN103999435B (en) | For the apparatus and method of efficient network address translation and ALG process | |
| CN113568863A (en) | Data transmission method, routing node, many-core system and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200714 Address after: 215500 No.13, Caotang Road, Changshu, Suzhou, Jiangsu Province Patentee after: Changshu intellectual property operation center Co.,Ltd. Address before: 510000 unit 2414-2416, building, No. five, No. 371, Tianhe District, Guangdong, China Patentee before: GUANGDONG GAOHANG INTELLECTUAL PROPERTY OPERATION Co.,Ltd. Effective date of registration: 20200714 Address after: 510000 unit 2414-2416, building, No. five, No. 371, Tianhe District, Guangdong, China Patentee after: GUANGDONG GAOHANG INTELLECTUAL PROPERTY OPERATION Co.,Ltd. Address before: 518057 Nanshan District science and technology, Guangdong Province, South Road, No. 55, No. Patentee before: ZTE Corp. |
|
| TR01 | Transfer of patent right | ||
| CP02 | Change in the address of a patent holder |
Address after: 215500 5th floor, building 4, 68 Lianfeng Road, Changfu street, Changshu City, Suzhou City, Jiangsu Province Patentee after: Changshu intellectual property operation center Co.,Ltd. Address before: No.13 caodang Road, Changshu City, Suzhou City, Jiangsu Province Patentee before: Changshu intellectual property operation center Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |