CN103095576B - A kind of method and apparatus for avoiding diverse paths from calculating deadlock - Google Patents
A kind of method and apparatus for avoiding diverse paths from calculating deadlock Download PDFInfo
- Publication number
- CN103095576B CN103095576B CN201310004839.8A CN201310004839A CN103095576B CN 103095576 B CN103095576 B CN 103095576B CN 201310004839 A CN201310004839 A CN 201310004839A CN 103095576 B CN103095576 B CN 103095576B
- Authority
- CN
- China
- Prior art keywords
- domain
- path
- diverse paths
- domains
- deadlock
- 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.)
- Active
Links
Abstract
The invention provides a kind of method for avoiding diverse paths from calculating deadlock and domain, wherein, methods described includes：Other domains that deadlock because being calculated using diverse paths simultaneously will be present with this domain are searched in the domain of diverse paths traversal；In diverse paths calculate simultaneously, when this domain reports diverse paths path in the domain in this domain to other domains, the route segment that can be connected in an optional domain in this domain is as temporary path of the diverse paths where this domain in this domain；The temporary path is reported into other domains.The present invention realize diverse paths are calculated simultaneously using BRPC algorithms when, avoid while Deadlock caused by calculating.
Description
Technical field
The present invention relates to diverse paths calculating field, more particularly to a kind of method for avoiding diverse paths from calculating deadlock
And device.
Background technology
In a transport network, the diversity (also referred to as independence) in path refers to the incidence relation of mulitpath.Diversity road
The resource of some specific types is not shared in footpath, such as, node, link, sharing memory.In the case of cross-domain, diversity
The result of calculation of path computing is to require the separation property of domain sequence, also requires the separation property in path in same domain.In RFC standards
(BRPC) being calculated using the backward recursive based on path-calculating element PCE in RFC 5441 and calculating cross-domain path, this is also current
A kind of calculation in the most frequently used cross-domain path in this area.
The calculation that diverse paths are directed in RFC standards RFC 5298 gives order calculating and while calculated
Two ways.Order calculation refers to when calculating end-to-end path, without considering uncalculated diverse paths, only considers
Calculated diverse paths, end-to-end path computation is carried out one by one；Calculation refers to all end-to-end diversity simultaneously
Path is calculated simultaneously in each realm entry, and all diverse paths are finally given by first node.
The possibilities of optimal disjoint paths is found using sequentially calculating this mode and can reduce, or even because above path is counted
The unreasonable of calculation causes to can not find the path calculated rearward.Simultaneously as path is calculated one by one, path computing when
Effect property is also had a greatly reduced quality.From path computing speed, from the point of view of the degree of accuracy and success rate, while calculate and occupied sizable advantage.
But at present in the case of the domain sequence of diverse paths is incomplete same, BRPC algorithms can not be supported to calculate simultaneously well
Mode.
For this problem, RFC standards RFC 5440 and RFC 6007 pass through synchronous container (SVEC) object for expanding
Diverse paths computation requests are carried to realize BRPC algorithms to diverse paths while the support of calculating.When some domain receives
During multiple diverse paths computation requests, the domain can determine whether that diverse paths be present passes through this domain, and this domain need to be carried out to path
Calculate simultaneously.Although this solves BRPC algorithms to diverse paths while the support sex chromosome mosaicism of calculating, can not solve same
When calculate existing for " Deadlock ", as shown in figure 1, the domain sequence in path 1 is：Domain 1- domains 2- domains 3- domains 4；The domain sequence in path 2
It is classified as：Domain 1- domains 3- domains 2- domains 4；When carrying out diverse paths and calculating simultaneously, domain 3 need to receive the transmission of domain 2 to path 2
Result of calculation and the result of calculation to path 1 that sends of domain 4 after could carry out diverse paths calculating, and report meter to domain 2
Calculate result；And domain 2 needs to receive the result of calculation to path 2 for sending the result of calculation in path 1 and domain 4 of the transmission of domain 3
After could carry out diverse paths calculating, and report result of calculation to domain 3.So, domain 3 and domain 2 will be absorbed in it is a kind of each other etc.
The path computation result that other side sends is treated, so that this domain can not continue di-verse paths while " deadlock state " that calculates, in this
The domain 3 (domain 2) of sample state is commonly known as the domain that deadlock because being calculated using diverse paths simultaneously with domain 2 (domain 3) be present.
The content of the invention
In order to solve the above technical problems, the invention provides it is a kind of avoid diverse paths calculate deadlock method and domain,
To solve how when calculating diverse paths simultaneously using BRPC algorithms, to avoid calculating caused Deadlock simultaneously.
In order to solve the above technical problems, the invention provides a kind of method for avoiding diverse paths from calculating deadlock, it is described
Method includes：
Deadlock will be present with this domain because being calculated using diverse paths simultaneously by being searched in the domain of diverse paths traversal
Other domains；
In diverse paths calculate simultaneously, when this domain reports diverse paths on this Yu Yunei road to other described domains
During footpath, the route segment that can be connected in an optional domain in this domain is as the diverse paths where this domain on the interim road in this domain
Footpath；
The temporary path is reported into other described domains.
Further, described searched in the domain of diverse paths traversal will be because being counted simultaneously with this domain using diverse paths
Calculate and other domains of deadlock be present, including：
The domain of all diverse paths traversals is known simultaneously；
The domain traveled through by analyzing every diverse paths determines other domains that deadlock be present with this domain.
Further, domain that is described while knowing all diverse paths traversals, including：
Receive synchronous container (SVEC) object comprising diverse paths computation requests that first domain is sent；
It is corresponding with every diverse paths computation requests from SVEC to obtain one respectively comprising routing object (IRO) field
The domain sequence of bar diverse paths traversal.
Further, it is described that the temporary path is reported into other described domains, including：
The temporary path is placed in disjoint virtual shortest path tree (Disjoint VSPT) report it is described its
His domain, and indicate that the path is temporary path before each temporary path.
In order to solve the above technical problems, present invention also offers a kind of domain for avoiding diverse paths from calculating deadlock, it is described
Domain includes deadlock domain lookup module, diverse paths computing module and path reporting module simultaneously, wherein,
The deadlock domain lookup module, will be because using diversity with this domain for being searched in the domain that diverse paths travel through
Path calculates and other domains of deadlock be present simultaneously, and by diverse paths described in other field notices found while calculates mould
Block and path reporting module；
The diverse paths simultaneously computing module, for diverse paths simultaneously calculate in, when this domain to it is described its
His domain reports diverse paths in the domain in this domain during path, and the route segment that can be connected in an optional domain in this domain is used as this
The temporary path of diverse paths where domain in this domain；The path reporting module is sent to through the temporary path；
The path reporting module, for the temporary path to be reported into other described domains.
Further, the deadlock domain lookup module, in the domain that diverse paths travel through search with this domain by because
Calculated simultaneously using diverse paths and other domains of deadlock be present, including：
The deadlock domain lookup module is more by analyzing every for knowing the domain of all diverse paths traversals simultaneously
The domain of Yang Xing roads traversal determines other domains that deadlock be present with this domain.
Further, the deadlock domain lookup module, for knowing the domain of all diverse paths traversals simultaneously, including：
The deadlock domain lookup module, the synchronous container for including diverse paths computation requests sent for receiving first domain
(SVEC objects)；It is corresponding with every diverse paths computation requests from the SVEC to include routing object (IRO) field point
The domain sequence of paths traversal is not obtained.
Further, the path reporting module, for the temporary path to be reported into other described domains, including：
The path reporting module, for the temporary path to be placed in into disjoint virtual shortest path tree
Other described domains are reported in (Disjoint VSPT), and indicate that the path is temporary path before each temporary path.
Above-mentioned technical proposal, in diverse paths calculate simultaneously, when this domain needs the downstream for calculating path dead as one
Lock domain reports diverse paths in the domain in this domain during path to its upstream deadlock domain, is no longer waiting for the upstream deadlock domain and reports
Domain in path, but the route segment that can be connected in an optional domain in this domain is reported on described as path in interim domain
Swim deadlock domain, avoid prior art it is existing because deadlock domain each other be absorbed in it is a kind of wait other side's transmission each other report path,
So that this domain can not continue di-verse paths while " deadlock state " that calculates.
Brief description of the drawings
Fig. 1 is to calculate the diverse paths schematic diagram for deadlock situation occur simultaneously；
Fig. 2 is the method flow diagram for avoiding diverse paths calculating deadlock of the present embodiment；
Fig. 3 is the diverse paths schematic diagram of this first and second application example；
Fig. 4 is the domain composition figure for avoiding diverse paths calculating deadlock of the present embodiment.
Embodiment
For the object, technical solutions and advantages of the present invention are more clearly understood, below in conjunction with accompanying drawing to the present invention
Embodiment be described in detail.It should be noted that in the case where not conflicting, in the embodiment and embodiment in the application
Feature can mutually be combined.
Fig. 2 is the method flow diagram for avoiding diverse paths calculating deadlock of the present embodiment.
S201 is searched in the domain that diverse paths travel through will be because being existed with this domain using diverse paths while calculating
Other domains of deadlock；
The domain of all diverse paths traversal can be known simultaneously, the domain traveled through by analyzing every diverse paths determine with
Other domains of deadlock be present in this domain；
By extending RFC 5440 and RFC 6007 SVEC objects, the domain of every diverse paths traversal can be respectively placed in
In IRO fields corresponding with a diverse paths computation requests；
Extension to SVEC objects is as follows：
Wherein, Request-ID#1 and Request-ID#2 represents 2 diverse paths computation requests；Each request mark
Afterwards<IRO>For carrying the domain sequence of diverse paths traversal corresponding with the request；
Above-mentioned SVEC objects can be sent by first domain by way of multicast to all<IRO>The domain of record, so, each domain
The domain of all diverse paths traversals can be known, and the time for receiving SVEC objects is shortened by multicast；
The domains of SVEC objects is received except can be from<IRO>Analyze with this domain exist deadlock other are overseas, can also analyze
Which diverse paths passes through this domain, if the diverse paths for having phase relation need while by this domain etc.；
S202 is in diverse paths calculate simultaneously, when this domain reports diverse paths in the domain in this domain to other described domains
During interior path, the route segment that can be connected in an optional domain in this domain the facing in this domain as the diverse paths where this domain
When path；
The temporary path is reported other described domains by S203；
The temporary path can be placed in disjoint virtual shortest path tree (Disjoint VSPT), and is faced each
When path before indicate that the path is temporary path, it is as follows：
o Request ID#1Virtual Routing(Primary)
The route display object 1 of-ERO1 [for VSPT1] // virtual shortest path tree 1
-ERO2[for VSPT2]
-ERO3[for VSPT3]
o Request ID#2Virtual Routing(Secondary)
-ERO4[for VSPT1]
-ERO5[for VSPT2]
-ERO6[for VSPT3]
Above-mentioned Request ID#1Virtual Routing (Primary) and Request-ID#2Virtual Routing
(Secondary) the request knot that the path is diverse paths computation requests Request-ID#1 and Request-ID#2 is represented
Fruit；" Virtual Routing " represent that the path is temporary path.
If the upstream domain in deadlock domain knows that certain diverse paths have temporary path in some domain, same is known again
Formal path of the diverse paths in same domain, then the upstream domain, can be described in when carrying out diverse paths while calculating
Temporary path described in formal path replacement.
Above-described embodiment is further illustrated by using example with 2 below.
Using example one, as shown in figure 3, there is 4 domains：There are multiple nodes in 1~domain of domain 4, each domain, chain between node
Numeral on road represents calculation cost.
2 diverse paths in this application example be present, the head and the tail node of 2 diverse paths is respectively：Path 1,
50 points of domain 1 arrive 150 points of domain 4；Path 2,160 points from 50 points of domain 1 to domain 4.
Step 1, the path-calculating element of domain 1 receive the diverse paths computation requests；
Step 2, for the path-calculating element of domain 1 according to separation property principle computational fields sequence, the domain sequence for obtaining path 1 is domain
1- domains 3- domains 4；The domain sequence in path 2 is domain 1- domains 2- domains 3- domains 4；
Step 3, the path-calculating element of domain 1 issue SVEC objects to domain 1, domain 2, domain 3, domain 4, and the object is various including 2
Property path computing request, wherein, parameter in Request-ID#1<IRO>The domain sequence in domain 1, domain 3 and domain 4 is carried,
Parameter in Request-ID#2<IRO>Carry the domain sequence in domain 1, domain 2, domain 3 and domain 4；
It is more to show that domain 2 is not present by analyzing SVEC objects for step 4, domain 1, domain 2, the path-calculating element in domain 3 and domain 4
Bar diverse paths pass through the domain, therefore the domain does not need path to calculate simultaneously；And domain 1, domain 3, domain 4 need path while counted
Calculate；
Step 5, the path-calculating element in domain 4 (tail domain) carries out path 1 and the BRPC in path 2 is calculated simultaneously, and calculating
As a result (path 1：Domain 4.110- domains 4.150；Path 2：Domain 4.130- domains 4.120- domains 4.160) return to domain 3；
After step 6, the neat path 1 of path-calculating element collection in domain 3 and the RSP message in path 2, while carrying out BRPC
Calculate, and respectively result of calculation (path 1：Domain 3.20- domains 3.30- domains 3.50- domains 4.110- domains 4.150；Path 2：Domain
3.60- domains 4.130- domains 4.120- domains 4.160) upstream the path-calculating element of domain (path 1 is domain 1, and path 2 is domain 2) return
Return；
Step 7, after the path-calculating element in domain 1 receives the message of the return of path 1, find to need the calculating for waiting path 2
As a result, therefore first the BRPC in path 1 is handled and hung up；
Step 8, after the path-calculating element in domain 2 receives the message of the return of path 2, continue the BRPC calculating process in this domain,
After the completion of, by result (path 2：Domain 2.80- domains 2.90- domains 2.A0- domains 2.B0- domains 3.60- domains 4.130- domains 4.120- domains
4.160) path-calculating element in domain 1 is returned to；
After step 9, the neat path 1 of path-calculating element collection in domain 1 and the BRPC RSP in path 2, path 1 and road are carried out
The BRPC in footpath 2 is calculated simultaneously and is obtained final result of calculation (path 1：Domain 1.50- domains 1.10- domains 3.20- domains 3.30- domains
3.50- domains 4.110- domains 4.150；Path 2：Domain 1.50- domains 1.60- domains 1.40- domains 2.80- domains 2.90- domains 2.A0- domains 2.B0-
Domain 3.60- domains 4.130- domains 4.120- domains 4.160), complete whole path calculation process end to end.
Using example two, still as shown in figure 3, in the presence of 2 diverse paths, the head and the tail node difference of 2 diverse paths
It is：Path 1,50 points of arrive domain 4 150 points in domain 1；Path 2,160 points from 50 points of domain 1 to domain 4.
Step 1, the path-calculating element of domain 1 receive the diverse paths computation requests；
Step 2, the domain sequence that the path-calculating element of domain 1 obtains path 1 are domain 1- domains 2- domains 3- domains 4；The domain sequence in path 2
It is classified as domain 1- domains 3- domains 2- domains 4；
Step 3, the path-calculating element of domain 1 issue SVEC objects to domain 1, domain 2, domain 3, domain 4, and the object is various including 2
Property path computing request, wherein, parameter in Request-ID#1<IRO>The domain sequence in domain 1, domain 2, domain 3 and domain 4 is carried,
Parameter in Request-ID#2<IRO>Carry the domain sequence in domain 1, domain 3, domain 2 and domain 4；
Step 4, domain 1, domain 2, the path-calculating element in domain 3 and domain 4 by analyzing SVEC objects, draw domain 1, domain 2,
Domain 3, domain 4 have a plurality of diverse paths to pass through, therefore aforementioned four domain is required to path while calculated；In addition, domain 2 and domain 3
Also analyze this domain and other side domain and deadlock situation be present；
Step 5, the path-calculating element in domain 4 (tail domain) carries out path 1 and the BRPC in path 2 is calculated simultaneously, and calculating
As a result (path 1：Domain 4.110- domains 4.150；Path 2：Domain 4.130- domains 4.120- domains 4.160) returned to domain 3, domain 2；
Step 6, after the path-calculating element in domain 3 receives BRPC RSP message, because analysis outbound path 1, path 2 are in domain
2nd, deadlock occurs for domain 3, and an optional route segment is as temporary path of the path 1 in this domain in this domain in domain 3, by the temporary path
Upstream domain (domain 2) in path 1 is sent where to it；
Step 7, meanwhile, after the path-calculating element in domain 2 receives BRPC RSP message, due to analysis outbound path 1, path 2
Deadlock occurs in domain 2, domain 3, the optional route segment in this domain of domain 2 is interim by this as temporary path of the path 2 in this domain
Path is sent to the upstream domain (domain 3) in path 2 where it；
Step 8, domain 3 receive path 2 after domain 2 is temporarily by route segment, start using in BRPC simultaneously computational fields 3
Path 1 and the route segment of path 2, and result of calculation (path 1：Domain 3.60- domains 4.110- domains 4.150；Path 2：Domain 3.20-
Domain 3.30- domains 3.50- domains 2.70- domains 2 are temporarily by route segment-domain 2.B0- domains 4.130- domains 4.120- domains 4.160) it is sent to
Domain 1；
Step 9, meanwhile, domain 2 receives path 1 after domain 3 is temporarily by route segment, starts using BRPC while calculates
Path 1 and the route segment of path 2 in domain 2, and result of calculation (path 1：Domain 2.80- domains 3.60- domains 3 temporarily by route segment-
Domain 3.60- domains 4.110- domains 4.150；Path 2：Domain 2.70- domains 2.A0- domains 2.B0- domains 4.130- domains 4.120- domains 4.160) hair
Give domain 1；
Step 10, the path-calculating element in domain 1 are collected neat all BRPC RSP, known in the result of calculation reported from domain 3
It is domain 3.60 to know the formal path that path 1 passes through domain 3, knows that path 2 passes through the formal of domain 2 in the result of calculation reported from domain 2
Path is domain 2.70- domains 2.A0- domains 2.B0；Temporary path present in the BRPC RSP that domain 1 reports domain 3 and domain 2 is with each
After formal path replacement, then carry out while path computing, obtain result of calculation (path 1：Domain 1.50- domains 1.60- domains 1.40- domains
2.80- domains 3.60- domains 4.110- domains 4.150；Path 2：Domain 1.50- domains 1.10- domains 3.20- domains 3.30- domains 3.50- domains 2.70-
Domain 2.A0- domains 2.B0- domains 4.130- domains 4.120- domains 4.160), complete whole path calculation process end to end.
Fig. 4 is the domain composition figure for avoiding diverse paths calculating deadlock of the present embodiment.
The domain includes deadlock domain lookup module, diverse paths computing module and path reporting module simultaneously, wherein,
Deadlock domain lookup module, will be because using diverse paths with this domain for being searched in the domain that diverse paths travel through
Simultaneously calculate and other domains of deadlock be present, and by diverse paths described in other field notices found simultaneously computing module with
And path reporting module；
The deadlock domain lookup module, it is various by analyzing every for knowing the domain of all diverse paths traversals simultaneously
Property road traversal domain determine other domains of deadlock be present with this domain；Such as, by receiving that first domain sends comprising based on diverse paths
Calculate the synchronous container (SVEC objects) of request；It is corresponding with every diverse paths computation requests from the SVEC to include route
Object (IRO) field obtains the domain sequence of paths traversal respectively；To realize the function, it is necessary to expand existing SVEC
Open up, the domain sequence of one diverse paths traversal of increase in each IPO fields in existing SVEC；
SVEC objects are as follows after extension：
Wherein, Request-ID#1 and Request-ID#2 represents 2 diverse paths computation requests；Each request mark
Afterwards<IRO>For carrying the domain sequence of diverse paths traversal corresponding with the request；
Diverse paths computing module simultaneously, used in being calculated in diverse paths simultaneously, when this domain is to other described domains
Report diverse paths in the domain in this domain during path, the route segment that can be connected in an optional domain in this domain is as this domain institute
Diverse paths this domain temporary path；The path reporting module is sent to through the temporary path；
Path reporting module, for the temporary path to be reported into other described domains；
The path reporting module, disjoint virtual shortest path tree is placed in available for by the temporary path
Other described domains are reported in (Disjoint VSPT), and indicate that the path is temporary path before each temporary path, it is as follows
It is shown：
o Request ID#1Virtual Routing(Primary)
The route display object 1 of-ERO1 [for VSPT1] // virtual shortest path tree 1
-ERO2[for VSPT2]
-ERO3[for VSPT3]
o Request ID#2Virtual Routing(Secondary)
-ERO4[for VSPT1]
-ERO5[for VSPT2]
-ERO6[for VSPT3]
Above-mentioned Request ID#1Virtual Routing (Primary) and Request-ID#2Virtual Routing
(Secondary) the request knot that the path is diverse paths computation requests Request-ID#1 and Request-ID#2 is represented
Fruit；" Virtual Routing " represent that the path is temporary path.
One of ordinary skill in the art will appreciate that all or part of step in the above method can be instructed by program
Related hardware is completed, and described program can be stored in computer-readable recording medium, such as read-only storage, disk or CD
Deng.Alternatively, all or part of step of above-described embodiment can also be realized using one or more integrated circuits, accordingly
Ground, each module/unit in above-described embodiment can be realized in the form of hardware, can also use the shape of software function module
Formula is realized.The present invention is not restricted to the combination of the hardware and software of any particular form.
It should be noted that the present invention can also have other various embodiments, without departing substantially from of the invention spiritual and its essence
In the case of, those skilled in the art can make various corresponding changes and deformation according to the present invention, but these are corresponding
Change and deform the protection domain that should all belong to appended claims of the invention.
Claims (8)
- A kind of 1. method for avoiding diverse paths from calculating deadlock, it is characterised in that methods described includes：Diverse paths traversal domain in search with this domain by because using diverse paths simultaneously calculate exist deadlock its His domain；In diverse paths calculate simultaneously, when this domain reports diverse paths path in the domain in this domain to other described domains When, the route segment that can be connected in an optional domain in this domain is as the diverse paths where this domain on the interim road in this domain Footpath；The temporary path is reported into other described domains.
- 2. the method as described in claim 1, it is characterised in thatDescribed searched in the domain of diverse paths traversal will have deadlock with this domain because being calculated using diverse paths simultaneously Other domains, including：The domain of all diverse paths traversals is known simultaneously；The domain traveled through by analyzing every diverse paths determines other domains that deadlock be present with this domain.
- 3. method as claimed in claim 2, it is characterised in thatDomain that is described while knowing all diverse paths traversals, including：Receive the synchronous container SVEC objects for including diverse paths computation requests that first domain is sent；From SVEC it is corresponding with every diverse paths computation requests comprising routing object IRO fields obtain respectively one it is various The domain sequence of property traversal path.
- 4. such as method according to any one of claims 1 to 3, it is characterised in thatIt is described that the temporary path is reported into other described domains, including：The temporary path is placed in disjoint virtual shortest path tree Disjoint VSPT and reports other described domains, And indicate that the path is temporary path before each temporary path.
- 5. it is a kind of avoid diverse paths calculate deadlock device, it is characterised in that described device include deadlock domain lookup module, Diverse paths while computing module and path reporting module, wherein,The deadlock domain lookup module, will be because using diverse paths with this domain for being searched in the domain that diverse paths travel through Simultaneously calculate and other domains of deadlock be present, and by diverse paths described in other field notices found simultaneously computing module with And path reporting module；Diverse paths computing module simultaneously, used in being calculated in diverse paths simultaneously, when this domain is to other described domains Report diverse paths in the domain in this domain during path, the route segment that can be connected in an optional domain in this domain is as this domain institute Diverse paths this domain temporary path；The path reporting module is sent to through the temporary path；The path reporting module, for the temporary path to be reported into other described domains.
- 6. device as claimed in claim 5, it is characterised in thatThe deadlock domain lookup module, will be because using diverse paths with this domain for being searched in the domain that diverse paths travel through Calculate simultaneously and other domains of deadlock be present, including：The deadlock domain lookup module, for knowing the domain of all diverse paths traversals simultaneously, by analyzing every diversity The domain of road traversal determines other domains that deadlock be present with this domain.
- 7. device as claimed in claim 6, it is characterised in thatThe deadlock domain lookup module, for knowing the domain of all diverse paths traversals simultaneously, including：The deadlock domain lookup module, the synchronous container SVEC for including diverse paths computation requests sent for receiving first domain Object；It is corresponding with every diverse paths computation requests from the SVEC to obtain one respectively comprising routing object IRO fields The domain sequence of paths traversal.
- 8. the device as any one of claim 5~7, it is characterised in thatThe path reporting module, for the temporary path to be reported into other described domains, including：The path reporting module, for the temporary path to be placed in into disjoint virtual shortest path tree Disjoint Other described domains are reported in VSPT, and indicate that the path is temporary path before each temporary path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310004839.8A CN103095576B (en) | 2013-01-07 | 2013-01-07 | A kind of method and apparatus for avoiding diverse paths from calculating deadlock |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310004839.8A CN103095576B (en) | 2013-01-07 | 2013-01-07 | A kind of method and apparatus for avoiding diverse paths from calculating deadlock |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103095576A CN103095576A (en) | 2013-05-08 |
| CN103095576B true CN103095576B (en) | 2018-02-16 |
Family
ID=48207729
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310004839.8A Active CN103095576B (en) | 2013-01-07 | 2013-01-07 | A kind of method and apparatus for avoiding diverse paths from calculating deadlock |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103095576B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155135A (en) * | 2006-09-28 | 2008-04-02 | 华为技术有限公司 | Method and device for flooding autonomous system border router ability information |
| CN101686197A (en) * | 2008-09-27 | 2010-03-31 | 华为技术有限公司 | Route information obtaining method and system, route calculation device |
| CN101984597A (en) * | 2010-11-04 | 2011-03-09 | 中兴通讯股份有限公司 | Computing method and system for multi-domain two-way label switched path |
| CN102611607A (en) * | 2011-01-21 | 2012-07-25 | 中兴通讯股份有限公司 | Processing method and path computation element of inter-domain link information |
| US8531969B2 (en) * | 2011-01-21 | 2013-09-10 | Ciena Corporation | Path computation systems and methods for heterogeneous multi-domain networks |
-
2013
- 2013-01-07 CN CN201310004839.8A patent/CN103095576B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155135A (en) * | 2006-09-28 | 2008-04-02 | 华为技术有限公司 | Method and device for flooding autonomous system border router ability information |
| CN101686197A (en) * | 2008-09-27 | 2010-03-31 | 华为技术有限公司 | Route information obtaining method and system, route calculation device |
| CN101984597A (en) * | 2010-11-04 | 2011-03-09 | 中兴通讯股份有限公司 | Computing method and system for multi-domain two-way label switched path |
| CN102611607A (en) * | 2011-01-21 | 2012-07-25 | 中兴通讯股份有限公司 | Processing method and path computation element of inter-domain link information |
| US8531969B2 (en) * | 2011-01-21 | 2013-09-10 | Ciena Corporation | Path computation systems and methods for heterogeneous multi-domain networks |
Non-Patent Citations (1)
| Title |
|---|
| "Interdomain path computation for PCE-assisted Traffic Engineering";L.Bisti.et al;《Brodband Communications,Networks,and Systems》;20090916;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103095576A (en) | 2013-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8681635B2 (en) | Computer-implemented systems and methods for planning a route | |
| CN108629974B (en) | Traffic operation index establishing method considering urban road traffic network characteristics | |
| WO2019109645A1 (en) | Road condition forecasting method and apparatus, storage medium and server | |
| WO2016091174A1 (en) | Search method and apparatus for graph data | |
| CN110543728B (en) | Urban traffic network key intersection discovery method | |
| WO2016023437A1 (en) | Method and device for discovering network topology | |
| WO2016008230A1 (en) | Method and device for binding point of interest (poi) to road | |
| CN105677755B (en) | A kind of method and device handling diagram data | |
| CN102880641A (en) | Parametric bus transfer method in consideration of short-distance walking station pair | |
| CN106209840A (en) | A kind of network packet De-weight method and device | |
| Li et al. | Traffic congestion alleviation over dynamic road networks: Continuous optimal route combination for trip query streams | |
| US20230078656A1 (en) | Method and apparatus for determining navigation prompt information, storage medium and electronic device | |
| CN108650110A (en) | A kind of link failure detection method under HPC indirect networks environment | |
| CN105227348A (en) | A kind of Hash storage means based on IP five-tuple | |
| CN103236978A (en) | Determination method and device of topologic top AS (autonomous system) nodes | |
| CN103095576B (en) | A kind of method and apparatus for avoiding diverse paths from calculating deadlock | |
| CN106781472A (en) | A kind of road conditions detection method and device based on public transport car data | |
| CN110855566B (en) | Method and device for dragging upstream flow | |
| WO2013150691A1 (en) | Management server and flow process method | |
| US20160255180A1 (en) | Method and apparatus for operating transmitting and receiving nodes processing packet including field position information | |
| JP5027787B2 (en) | AC traffic calculation device, AC traffic calculation system, AC traffic calculation method and program thereof | |
| CN107404411A (en) | A kind of parallel network topology discovery method | |
| CN105897463A (en) | Multinode power line channel response generation method based on low-voltage topological network | |
| CN105488289B (en) | The method of Dynamic Graph structure matching under distributed environment | |
| CN106649315A (en) | Method and device for processing path navigation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |