CN101984597A - Computing method and system for multi-domain two-way label switched path - Google Patents

Computing method and system for multi-domain two-way label switched path Download PDF

Info

Publication number
CN101984597A
CN101984597A CN2010105314030A CN201010531403A CN101984597A CN 101984597 A CN101984597 A CN 101984597A CN 2010105314030 A CN2010105314030 A CN 2010105314030A CN 201010531403 A CN201010531403 A CN 201010531403A CN 101984597 A CN101984597 A CN 101984597A
Authority
CN
China
Prior art keywords
territory
pce
domain
vspt
link
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
Application number
CN2010105314030A
Other languages
Chinese (zh)
Other versions
CN101984597B (en
Inventor
卢刚
汪学蓉
王大江
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN201010531403.0A priority Critical patent/CN101984597B/en
Publication of CN101984597A publication Critical patent/CN101984597A/en
Priority to PCT/CN2011/073651 priority patent/WO2012058911A1/en
Application granted granted Critical
Publication of CN101984597B publication Critical patent/CN101984597B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • 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/48—Routing tree calculation
    • 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

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 computing method for a multi-domain two-way label switched path, which comprises the following steps: after a PCE of a domain in which a destination node is positioned receives a PCReq message, the PCE computes VSPT according to an intra-domain two-way LSP computed by the PCE and a one-way inter-domain link path, and sends the VSPT to a PCE of an upstream domain; and the PCE of the upstream domain computes new VSPT according to an intra-domain two-way LSP computed by the PCE, a one-way inter-domain link path and the VSPT, and sends the new VSPT to a PCE of an upstream domain until a PCE of a domain in which a source node is positioned sends the final VSPT to the source node. The invention also provides a computing system for the multi-domain two-way label switched path. The technical scheme of the invention realizes computation of an end-to-end multi-domain two-way LSP by BRPC.

Description

A kind of computational methods of multiple domain bidirectional label exchange path and system
Technical field
The present invention relates to general multiple protocols label exchange (GMPLS, GeneralizedMultiprotocol Label Switching) agreement of the communications field, relate in particular to a kind of computational methods and system of multiple domain bidirectional label exchange path.
Background technology
In the multi-layer multi-domain network that uses the GMPLS agreement, multiple node with different exchange capacities and speed can be divided into not same area or different layers according to the actual requirements, these territories can be router domain, optical transfer network (OTN, Optical Transport Network) territory or Packet Transport Network (PTN, Packet TransportNetwork) territory etc.In the multiple-domain network that adopts autonomous system (AS, Autonomous System) to divide, can adopt backward recursive path computing (BRPC, Backward RecuisivePCE-Based Computation) to carry out the multiple domain path computing based on PCE.
In the RFC5441 agreement BRPC is described, this computational process depends on the communication between the co-operating path-calculating element (PCE, Path Computation Element).Path computing client (PCC, Path Computation Client) the PCE path computation request (PCReq in its territory, PathComputation Request) message, this message is transmitted between the PCE in each territory, arrive the PCE that is responsible for calculating label switched path (LSP, Label Switch Path) territory, destination node place up to message; PCE in the purpose territory creates a virtual shortest path tree (VSPT who is made up of the potential path that arrives destination node, Virtual Shortest Path Tree), and at path computing response (PCRep, PathComputation Response) in the message this VSPT is passed to previous PCE, each PCE increases VSPT successively then, and it is passed to passback, the PCE up to territory, source node place, this PCE uses VSPT to select a path end to end, and the path is sent to PCC.
Wherein, BRPC has following agreement:
1, one group of territory (i) go into boundary node, note do BN-en (k, i), wherein (k is that k of territory i goes into boundary node i) to BN-en;
2, one group of territory (i) go out boundary node, note do BN-ex (k, i), wherein (k is that k of territory i goes out boundary node i) to BN-ex;
3, Fig. 1 is the VSPT schematic diagram in the BRPC computational process in the prior art, and as shown in Figure 1, the multiple spot that is returned to PCE (i-1) by PCE (i) is made VSPT (i) to the tree note of (MP2P, MultiPoint To Point) a bit.
In the prior art, the process of utilizing BRPC to calculate the multiple domain path is specially:
Step 1, source node PCC sends to the PCE in this territory with PCReq message in AS (1) territory, and PCReq message will be transmitted according to the order in the territory in the territory sequence of the appointment PCE along a plurality of territories then, up to the PCE that arrives territory, destination node place, i.e. PCE (n).
Step 2, PCE (n) uses suitable path computation algorithm (as CSPF) to calculate VSPT (n), and the VSPT (n) that calculates is returned to PCE (n-1); Wherein, VSPT (n) by row from the territory each of (n) go into boundary node BN-en (j n) form to the shortest constrained path between the destination node.
Step 3 as shown in Figure 1, equals n-1 for i and equals 2 to i, and PCE (i) calculates VSPT (i), and (j, form by the shortest constrained path i) and between the destination node by each BN-en for this VSPT (i).PCE (i) utilizes self traffic engineering storehouse (TED, Traffic Engineering Database) and VSPT (i+1) to calculate, and also needs the multiple domain link with territory AS (i), joins among the territory AS (i+1) and calculates together.
Step 4: the PCE (1) in last territory, PCC place calculates the shortest end-to-end constrained path from PCC to the destination node, and utilizes PCRep message to return to PCC in corresponding path, i.e. source node.
Said process is the general process of calculating in the multiple domain path of BRPC algorithm, and this algorithm provides a kind of method of calculating unidirectional LSP under the multiple domain scene by many PCE cooperations that solves.But, when using the BRPC algorithm to carry out the calculating of multiple domain bidirectional LSP, if the Inter-AS link of link field AS (i) is also joined calculating together among the territory AS (i+1), PCE also needs to know the attribute information of the two-way link of multiple domain link, how to obtain these attribute informations about PCE, do not provide relevant implementation among the RFC5441.Fig. 2 is the schematic diagram that the information of multiple domain link in the prior art is obtained, as shown in Figure 2, though RFC5316 and RFC5392 are respectively based on the routing protocol (ISIS of Intermediate System-to-Intermediate System, IntermediateSystem to Intermediate System Routing Protocol) and ospf (OSPF, Open Shortest Path First) protocol definition the expansion type-length-value (TLV, Type LengthValue), comprise local ip address, the local port sign, far-end IP address, the remote port sign, far-end AS ID, link bandwidth, weight, shared risk link group (SRLG, Shared Risk Link Groups) etc., but after these information spread in entire domain AS (i), PCE (i) also can only know all links and the A1 → B1 in the AS of territory, the unidirectional domain-to-domain link of A2 → B2.For two-way end-to-end LSP, oppositely (PCE (i) is given in the announcement of still having no idea of the attribute information of A1 ← B1 and A2 ← B2) to domain-to-domain link, thereby causes calculating the multiple domain bidirectional LSP.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of computational methods and system of multiple domain bidirectional label exchange path, realizes utilizing BRPC to calculate multiple domain bidirectional LSP end to end.
For achieving the above object, technical scheme of the present invention is achieved in that
The invention provides a kind of computational methods of multiple domain bidirectional label exchange path, comprising:
After the path-calculating element (PCE) in territory, destination node place is received path computing request (PCReq) message, link paths calculates virtual shortest path tree (VSPT) between bidirectional label exchange path in the territory that calculates according to self (LSP) and unidirectional domain, and described VSPT is sent to the PCE in territory, upstream;
Link paths and described VSPT between bidirectional LSP, unidirectional domain in the territory that the PCE in territory, upstream calculates according to self calculate new VSPT and send to the PCE in self territory, upstream, and the PCE up to territory, source node place sends to source node with final VSPT.
In the said method, in the described territory that calculates according to self between bidirectional LSP and unidirectional domain link paths calculate VSPT and be:
PCE calculate this territory all go into boundary node bidirectional LSP in the territory of destination node, PCE calculates the territory, upstream and arrives link paths between the unidirectional domain in this territory, and link paths between bidirectional LSP in the territory and unidirectional domain is spliced, and obtains VSPT.
In the said method, link paths and described VSPT between bidirectional LSP, unidirectional domain in the territory that the PCE in territory, described upstream calculates according to self, calculate new VSPT and be:
PCE calculate this territory all go into bidirectional LSP in boundary node goes out boundary node to all of this territory the territory, PCE calculates the territory, upstream to link paths between the unidirectional domain in this territory; Link paths between bidirectional LSP in the territory and unidirectional domain is spliced, and then the VSPT of the PCE transmission of splicing downstream domain, new VSPT obtained.
In the said method, this method further comprises:
The PCE in intermediate field or first territory carries out authenticate reverse to this territory to link paths between the unidirectional domain of downstream domain autonomous system (AS), if be proved to be successful, then not execution route deletion, if authentication failed, then link paths between this unidirectional domain among the described VSPT is deleted, the VSPT after checking is finished sends to the PCE in territory, upstream.
The computational methods of also a kind of multiple domain bidirectional label exchange path of the present invention comprise:
After the PCE in territory, destination node place receives PCReq message, calculate the multiple domain bidirectional LSP of self, obtain VSPT, described VSPT is sent to the PCE in territory, upstream;
The PCE in territory, upstream calculates new VSPT according to VSPT that receives and the multiple domain bidirectional LSP that self calculates, and sends to the PCE in self territory, upstream, and the PCE up to territory, source node place sends to source node with final VSPT.
In the said method, the multiple domain bidirectional LSP of described calculating self is:
PCE calculates in the territory, upstream all and goes out boundary node all in this territory and go out the multiple domain bidirectional LSP of boundary node.
In the said method, this method also comprises:
PCE carries out examination to the multiple domain bidirectional LSP that calculates to be handled.
In the said method, described PCE carries out examination to the multiple domain bidirectional LSP that calculates and is treated to:
Whether link circuit resource, the territory, upstream of checking the two-way link in the territory meet the demands to the link circuit resource of the unidirectional domain-to-domain link in this territory, and the link that does not meet the demands is deleted from the multiple domain bidirectional LSP that calculates;
Or, whether link circuit resource, the territory, upstream of checking the two-way link in the territory meet the demands to the link circuit resource of the unidirectional domain-to-domain link in this territory to link circuit resource, the downstream domain of the unidirectional domain-to-domain link in this territory, and the link that does not meet the demands is deleted from the multiple domain bidirectional LSP that calculates;
Or, check that whether the two-way resource of two-way link in this territory, inspection downstream domain meet the demands to the link circuit resource of the unidirectional domain-to-domain link in this territory, delete the link that does not meet the demands from the multiple domain bidirectional LSP that calculates.
In the said method, the PCE in territory, described upstream according to the new VSPT of multiple domain bidirectional LSP calculating of VSPT that receives and self calculating is:
Multiple domain bidirectional LSP and the PCE of the downstream domain VSPT that send of PCE after with examination splices, and generates new VSPT.
The invention provides a kind of computing system of multiple domain bidirectional label exchange path, comprising: the PCE in the PCE in territory, destination node place, the PCE in territory, upstream, territory, source node place; Wherein,
The PCE in territory, destination node place, be used to receive PCReq message after, in the territory that calculates according to self between bidirectional LSP and unidirectional domain link paths calculate VSPT, and described VSPT is sent to the PCE in territory, upstream;
The PCE in territory, upstream, link paths and described VSPT between bidirectional LSP, unidirectional domain in the territory that is used for calculating according to self calculate new VSPT and send to the PCE in self territory, upstream;
The PCE in territory, source node place is used for final VSPT is sent to source node.
The invention provides a kind of computing system of multiple domain bidirectional label exchange path, comprising: the PCE in the PCE in territory, destination node place, the PCE in territory, upstream, territory, source node place; Wherein,
The PCE in territory, destination node place, be used to receive PCReq message after, calculate the multiple domain bidirectional LSP of self, obtain VSPT, described VSPT is sent to the PCE in territory, upstream;
The PCE in territory, upstream is used for calculating new VSPT according to the VSPT that receives and the multiple domain bidirectional LSP that self calculates, and sends to the PCE in self territory, upstream;
The PCE in territory, source node place is used for final VSPT is sent to source node.
The computational methods of multiple domain bidirectional label exchange path provided by the invention and system, after the PCE in territory, destination node place receives PCReq message, in the territory that calculates according to self between bidirectional LSP and unidirectional domain link paths calculate VSPT, and described VSPT is sent to the PCE in territory, upstream; Link paths and described VSPT between bidirectional LSP, unidirectional domain in the territory that the PCE in territory, upstream calculates according to self calculate new VSPT and send to the PCE in self territory, upstream, and the PCE up to territory, source node place sends to source node with final VSPT; Or, after the PCE in territory, destination node place receives PCReq message, calculate the multiple domain bidirectional LSP of self, obtain VSPT, described VSPT is sent to the PCE in territory, upstream; The PCE in territory, upstream calculates new VSPT according to the multiple domain bidirectional LSP of VSPT that receives and self calculating, and send to the PCE in self territory, upstream, PCE up to territory, source node place sends to source node with final VSPT, BRPC of the prior art being calculated the method for unidirectional multiple domain LSP expands, on the basis that does not utilize the attribute information of link between bi-directional domain, simply realized the calculating of multiple domain bidirectional LSP end to end.
Description of drawings
Fig. 1 is the VSPT schematic diagram in the BRPC computational process in the prior art;
Fig. 2 is the schematic diagram that the information of multiple domain link in the prior art is obtained;
Fig. 3 is the principle signal picture group of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path;
Fig. 4 is the schematic flow sheet that the present invention realizes the computational methods of multiple domain bidirectional label exchange path;
Fig. 5 is that step 402 and 403 utilizes connecting method to calculate the schematic flow sheet of the method for VSPT among Fig. 4;
Fig. 6 is the schematic flow sheet that step 402 and 403 is utilized the method for an account form calculating VSPT among Fig. 4;
Fig. 7 is the principle schematic of the embodiment one of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path;
Fig. 8 is the schematic flow sheet of the embodiment one of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path;
Fig. 9 is the principle schematic of the embodiment two of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path;
Figure 10 is the schematic flow sheet of the embodiment two of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path;
Figure 11 is the structural representation that the present invention realizes the computing system of multiple domain bidirectional label exchange path.
Embodiment
Basic thought of the present invention is: after the PCE in territory, destination node place receives PCReq message, in the territory that calculates according to self between bidirectional LSP and unidirectional domain link paths calculate VSPT, and described VSPT is sent to the PCE in territory, upstream; Link paths and described VSPT between bidirectional LSP, unidirectional domain in the territory that the PCE in territory, upstream calculates according to self calculate new VSPT and send to the PCE in self territory, upstream, and the PCE up to territory, source node place sends to source node with final VSPT; Or, after the PCE in territory, destination node place receives PCReq message, calculate the multiple domain bidirectional LSP of self, obtain VSPT, described VSPT is sent to the PCE in territory, upstream; The PCE in territory, upstream calculates new VSPT according to VSPT that receives and the multiple domain bidirectional LSP that self calculates, and sends to the PCE in self territory, upstream, and the PCE up to territory, source node place sends to source node with final VSPT.
Below by drawings and the specific embodiments the present invention is described in further detail again.
Among the present invention, the territory of going to the source node direction in the computational process of agreement BRPC algorithm is the territory, upstream, and the territory of going to the destination node direction is a downstream domain.Fig. 3 is the principle signal picture group of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path, with Fig. 3 is example, shown in Fig. 3 (a), five territories are arranged in the computational process of BRPC algorithm, be respectively AS (1), AS (i-1), AS (i), AS (i+1), AS (n); Wherein, territory headed by the AS (i), AS (i-1), AS (i), AS (i+1) are intermediate field, and AS (n) is the tail territory; In the intermediate field, AS (i-1) is the territory, upstream, and AS (i) is this territory, and AS (i+1) is a downstream domain, and its PCE is respectively PCE (1), PCE (i-1), PCE (i), PCE (i+1), PCE (n).The multiple domain bidirectional LSP of the destination node of the source node of BRPC algorithm computation from AS (1) in the AS (n).
The present invention is following agreement: BN-ex, and (k i) goes out boundary node for the k in AS (i) territory is individual; (k i) goes into boundary node for the k in AS (i) territory is individual to BN-en; BN-ex (k, i-1) → BN-en (k, i) for going out boundary node to the individual boundary node BN-en (k of going into of the k in AS (i) territory from the k in AS (i-1) territory, i) unidirectional domain-to-domain link, the information of this unidirectional domain-to-domain link in AS (i) territory BN-en (k, i) on the node configuration and in AS (i), carry out inundation, the reverse link of this unidirectional domain-to-domain link is expressed as BN-ex (k, i-1) ← and BN-en (k, i).BN-ex (k, i) ← BN-en (k, i+1) for going into boundary node to the individual boundary node BN-ex (k of going out of the k in AS (i) territory from the k in AS (i+1) territory, i) unidirectional domain-to-domain link, the information of this unidirectional domain-to-domain link in AS (i) territory BN-ex (k, i) on the node configuration and in AS (i), carry out inundation, the reverse link of this unidirectional domain-to-domain link is expressed as BN-ex (k, i) → and BN-en (k, i+1).Wherein, at different territories, the k value can be different.
The invention provides a kind of computational methods of multiple domain bidirectional label exchange path, Fig. 4 is the schematic flow sheet that the present invention realizes the computational methods of multiple domain bidirectional label exchange path, and as shown in Figure 4, this method may further comprise the steps:
Step 401, PCC sends to the PCE in this territory with PCReq message, and the PCE in this territory gives the PCE of downstream domain with this PCReq forwards, arrives the PCE in territory, destination node place up to this PCReq message;
Concrete, source node PCC is according to this locality configuration or this territory PCE, and PCE in this territory of its PCReq of acquisition service sends to this PCE with PCReq message, for example the PCE among Fig. 3 (1); This PCE determines that this territory is not territory, destination node place, then according to the automatic discovery information of PCE between configuration or territory, selects the PCE of downstream domain, and with the PCE of PCReq forwards to downstream domain; The PCE of downstream domain determines that this territory is not territory, destination node place, then continues to select the PCE of downstream domain and transmits the PCE that PCReq message is given this downstream domain, the PCE up to PCReq message arrival territory, destination node place, for example PCE among Fig. 3 (n).
Step 402, after the PCE in territory, destination node place receives PCReq message, link paths calculating VSPT between bidirectional LSP and unidirectional domain in the territory that calculates according to self, or calculate the multiple domain bidirectional LSP of self, obtain VSPT; The PCE in territory, destination node place sends to the VSPT that calculates the PCE in territory, upstream; Wherein, self the multiple domain bidirectional LSP that calculates of the PCE of territory, destination node place (being the tail territory) is VSPT;
Step 403, link paths and the VSPT that receives between bidirectional LSP, unidirectional domain in the territory that the PCE in territory, upstream calculates according to self calculate new VSPT, or calculate new VSPT according to VSPT that receives and the multiple domain bidirectional LSP that self calculates; The new VSPT that the PCE in territory, upstream will calculate sends to the PCE in self territory, upstream, and the PCE up to territory, PCC place sends to source node with final VSPT, and this VSPT is the multiple domain bidirectional LSP of source node to destination node.
Among the present invention, the specific implementation of calculating the method for VSPT in the step 402 and 403 comprises two kinds: connecting method and an account form.
Fig. 5 is that step 402 and 403 utilizes connecting method to calculate the schematic flow sheet of the method for VSPT among Fig. 4, and as shown in Figure 5, this method comprises:
Bidirectional LSP in the step 501, PCE (i) computational fields;
Concrete, if i=n, promptly this territory AS (i) be the tail territory, then PCE (i) calculate this territory AS (i) all go into boundary node and arrive bidirectional LSP in the territory of destination node, wherein, this territory AS (i) go into boundary node can with reference to the BN-en among the figure 3 (b) (k, i);
If 1＜i＜n, promptly this territory AS (i) is an intermediate field, then PCE (i) calculate this territory AS (i) all go into bidirectional LSP in boundary node goes out boundary node to all of this territory AS (i) the territory; Wherein, all of this territory AS (i) go into boundary node can with reference to the BN-en among the figure 3 (b) (k, i), this territory AS (i) go out boundary node can with reference to the BN-ex among the figure 3 (b) (k, i);
If i=1, i.e. territory headed by this territory AS (i), then PCE (i) source node that calculates this territory AS (i) goes out bidirectional LSP in the territory of boundary node to all, wherein, go out boundary node can with reference to the BN-ex among the figure 3 (b) (k, i);
After aforementioned calculation was finished, PCE (i) was kept at local internal system with bidirectional LSP in the territory that calculates; The bidirectional LSP computational methods belong to prior art in the PCE computational fields, repeat no more herein.
Step 502, PCE (i) calculates link paths between unidirectional domain;
Concrete, if 1＜i≤n, promptly this territory AS (i) is tail territory or intermediate field, then PCE (i) calculate self territory, upstream AS (i-1) to link paths between the unidirectional domain of this territory AS (i), unidirectional domain-to-domain link can with reference to the BN-ex among the figure 3 (b) (k, i-1) → BN-en (k, i); Wherein, computational methods belong to prior art with general path computing, repeat no more herein;
If i=1, promptly territory headed by this territory AS (i) does not deal with herein.
Step 503, PCE (i) calculates VSPT (i) according to link paths between bidirectional LSP in the territory and unidirectional domain;
Concrete, if i=n, promptly this territory AS (i) is the tail territory, directly link paths between bidirectional LSP in the territory and unidirectional domain is spliced, and obtains VSPT (i); For example, path 1 → 2 and path 2 → 3 are spliced, obtain path 1 → 2 → 3 after the splicing;
If 1≤i＜n, be that this territory AS (i) is intermediate field or first territory, then directly link paths between bidirectional LSP in the territory and unidirectional domain is spliced earlier, and then the PCE (i+1) of splicing downstream domain AS (i+1) sends to the VSPT (i+1) of PCE (i) by PCRep message, obtain VSPT (i).
Step 504, PCE (i) carries out the checking in reverse domain-to-domain link path to be handled;
Concrete, if i=n, promptly this territory AS (i) is the tail territory, does not do checking herein and handles;
If 1≤i＜n, be that this territory AS (i) is intermediate field or first territory, then PCE (i) carries out authenticate reverse to this territory AS (i) to link paths between the unidirectional domain of downstream domain AS (i+1), and unidirectional domain-to-domain link can be with reference to (the k of the BN-ex among the figure 3 (c), i) ← and BN-en (k, i+1); If the bandwidth of link paths satisfies the bandwidth constraint condition between unidirectional domain, promptly the available bandwidth of link paths then is proved to be successful greater than the required bandwidth of multiple domain bidirectional LSP between this unidirectional domain, on the contrary authentication failed then; If be proved to be successful, then not execution route deletion, if authentication failed, then link paths deletion between this unidirectional domain among the VSPT that will in step 503, obtain (i); At last, the VSPT (i) after checking is finished sends to PCE (i-1) by PCRep message.
Fig. 6 is the schematic flow sheet that step 402 and 403 is utilized the method for an account form calculating VSPT among Fig. 4, and as shown in Figure 6, this method comprises:
Step 601, PCE (i) calculates the multiple domain bidirectional LSP;
Concrete, if 1＜i≤n, be that this territory AS (i) is tail territory or intermediate field, then all in PCE (i) calculating territory, the upstream AS (i-1) go out boundary node and go out the multiple domain bidirectional LSP of boundary node to interior all of this territory AS (i), wherein, in territory, the upstream AS (i-1) go out boundary node can with reference to the BN-ex among the figure 3 (b) (k, i-1), in this territory AS (i) go out boundary node can with reference to the BN-ex among the figure 3 (b) (k, i);
If i=1, i.e. territory headed by this territory AS (i), then PCE (i) source node (being PCC) that calculates this territory AS (i) goes out the multiple domain bidirectional LSP of boundary node to this territory AS (i), wherein go out boundary node can with reference to the BN-ex among the figure 3 (b) (k, i);
The computational methods that PCE calculates the multiple domain bidirectional LSP belong to prior art, repeat no more herein.
Step 602, PCE (i) carries out examination to the multiple domain bidirectional LSP that calculates to be handled;
Concrete, if i=n, promptly this territory AS (i) is the tail territory, at first, for the link in this territory AS (i), checks whether the link circuit resource of the two-way link in this territory meets the demands; If the available link resource of the two-way link in the territory then meets the demands, otherwise does not meet the demands greater than the required link circuit resource of this multiple domain bidirectional LSP; Then, for the domain-to-domain link part of this territory, check whether territory, upstream AS (i-1) meets the demands to the link circuit resource of the unidirectional domain-to-domain link of this territory AS (i), and this unidirectional domain-to-domain link can be with reference to the BN-ex (k among the figure 3 (b) to the territory, upstream, i-1) → and BN-en (k, i); If the available link resource of this unidirectional domain-to-domain link then meets the demands, otherwise does not meet the demands greater than the required link circuit resource of multiple domain bidirectional LSP; If above-mentioned requirements all satisfies, then not execution route deletion if exist at least one not meet the demands, is deleted in the multiple domain bidirectional LSP that this link that does not meet the demands is calculated from step 601;
If 1＜i＜n, promptly this territory AS (i) is an intermediate field, at first, for the link in this territory AS (i), checks whether the link circuit resource of the two-way link in this territory meets the demands; Secondly, for the domain-to-domain link part of this territory, check whether territory, upstream AS (i-1) meets the demands to the link circuit resource of the unidirectional domain-to-domain link of this territory AS (i), and this unidirectional domain-to-domain link can be with reference to the BN-ex (k among the figure 3 (b) to the territory, upstream, i-1) → and BN-en (k, i); Then, to the domain-to-domain link part of this territory, check whether downstream domain AS (i+1) meets the demands to the link circuit resource of the unidirectional domain-to-domain link of this territory AS (i), and wherein this unidirectional domain-to-domain link can be with reference to the BN-ex (k among the figure 3 (c) to downstream domain, i) ← and BN-en (k, i+1); If above-mentioned requirements all satisfies, then not execution route deletion if exist at least one not meet the demands, is deleted in the multiple domain bidirectional LSP that this link that does not meet the demands is calculated from step 601;
If i=1, promptly territory headed by this territory AS (i) at first, for the link in this territory AS (i), checks whether the two-way resource of two-way link meets the demands in this territory; Then, for the domain-to-domain link part of this territory, check whether downstream domain AS (i+1) meets the demands to the link circuit resource of the unidirectional domain-to-domain link of this territory AS (i) to downstream domain, wherein, this unidirectional domain-to-domain link can with reference to the BN-ex among the figure 3 (c) (k, i) ← BN-en (k, i+1); If above-mentioned requirements all satisfies, then not execution route deletion if exist at least one not meet the demands, is deleted in the multiple domain bidirectional LSP that this link that does not meet the demands is calculated from step 601.
Step 603, PCE (i) calculates VSPT (i) according to the multiple domain bidirectional LSP;
Concrete, if i=n, promptly territory AS (i) is the tail territory, then the path after the examination promptly is new VSPT (i) in the step 602, and this VSPT (i) is sent to PCE (i-1) by PCRep message;
If 1≤i＜n, be that this territory AS (i) is intermediate field or first territory, then need the VSPT (i+1) that the PCE (i+1) of multiple domain bidirectional LSP after the examination in the step 602 and downstream domain AS (i+1) sends is spliced, generate new VSPT (i), send to PCE (i-1) with the new VSPT (i) that obtains and by PCRep message.
Embodiment one
Fig. 7 is the principle schematic of the embodiment one of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path, and this embodiment is at utilizing connecting method to calculate the method for VSPT, as shown in Figure 7, there are three AS, be AS1, AS2, AS3, have three PCE, i.e. PCE1, PCE2, PCE3; R2 and R3 are the AS border router (ASBR, AS Border Router) of AS1, and R4, R5, R6 and R7 are the ASBR of AS2, and R8 and R9 are the ASBR of AS3; The multiple domain bidirectional LSP of foundation from R1 to R10, wherein, the territory sequence is AS1 → AS2 → AS3, the PCE sequence is PCE1 → PCE2 → PCE3.
Fig. 8 is the schematic flow sheet of the embodiment one of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path, and as shown in Figure 8, this method comprises:
Step 801, the PCC of R1 sends PCReq message to PCE1;
Concrete, the PCC of R1 sends PCReq message to PCE1, comprises required parameter (RP, Request Parameters) object, END-POINTS object, territory sequence in this PCReq message all the time; In the present embodiment, the B value in the RP object is 1, represents that promptly domain-to-domain link is a two-way link, the END-POINTS object is that { R1, R10} promptly represent the source node and the destination node of this two-way link, the territory sequence is that { AS1-AS2-AS3} need in the two-way link promptly to represent the territory of process.
Step 802, PCE1 sends to PCE3 with PCReq message by PCE2;
Concrete, PCE1 determines that according to the territory sequence downstream domain in self territory, place is AS2, and then with the PCE2 of PCReq forwards to this downstream domain AS2, PCE2 gives PCE3 with this PCReq forwards.
Step 803, PCE3 calculates VSPT3, and the VSPT3 that calculates is sent to PCE2;
Concrete, after PCE3 receives the PCReq request, according to its territory sequence of carrying, determine that this territory is the tail territory, that then calculates this territory AS3 goes into boundary node (being R8 and R9) to bidirectional LSP between the territory of R10, then between the territory that this is calculated between the unidirectional domain of bidirectional LSP and the R6 → R8 that precomputes and R7 → R9 link paths splice, obtain VSPT3; PCE3 sends to PCE2 with the VSPT3 that calculates by PCRep message, and wherein, this VSPT3 is a path sequence, and promptly (ERO1:R6-R8-R10, ER02:R7-R8-R10).
Step 804, PCE2 calculates VSPT2 according to VSPT3, and the VSPT2 that calculates is sent to PCE1;
Concrete, the territory sequence of carrying in the PCReq message of PCE2 according to previous PCE1 transmission, determine that this territory is an intermediate field, that then calculates this territory AS2 goes into boundary node (being R4 and R5) to bidirectional LSP between the territory that goes out boundary node (being R6 and R7), then between the territory that this is calculated between the unidirectional domain of bidirectional LSP and the R2 → R4 that precomputes and R3 → R5 link paths splice, PCE2 makes up the VSPT3 of spliced path and PCE3 transmission, obtains VSPT2; PCE2 sends to PCE1 with the VSPT2 that calculates by PCRep message, and wherein, this VSPT2 is a path sequence, i.e. (ERO:R2-R4-R6-R8-R10).
Step 805, PCE1 calculates VSPT1 according to VSPT2, and the VSPT1 that calculates is sent to R1;
Concrete, PCE1 calculates the unidirectional LSP of R1 to the boundary node (being R2 and R3) of territory AS1, and the VSPT2 of unidirectional LSP that will calculate and PCE2 transmission splices, and finally obtains VSPT1, this VSPT1 is a path sequence, i.e. (ERO:R1-R2-R4-R6-R8-R10); PCE1 sends to R1 with the VSPT1 that calculates by PCRep message, and so far R1 finishes to the calculating of the multiple domain bidirectional LSP of R10.
Embodiment two
Fig. 9 is the principle schematic of the embodiment two of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path, this embodiment is at the method for utilizing an account form calculating VSPT, as shown in Figure 9, there are three AS, be AS1, AS2, AS3, there are three PCE, i.e. PCE1, PCE2, PCE3; R2 and R3 are the ASBR of AS1, and R4, R5, R6 and R7 are the ASBR of AS2, and R8 and R9 are the ASBR of AS3; The multiple domain bidirectional LSP of foundation from R1 to R10, the territory sequence is AS 1 → AS2 → AS3, the PCE sequence is PCE1 → PCE2 → PCE3.
Figure 10 is the schematic flow sheet of the embodiment two of the present invention's computational methods of realizing the multiple domain bidirectional label exchange path, and as shown in figure 10, this method comprises:
Step 1001, the PCC of R1 sends PCReq message to PCE1;
Concrete, the PCC of R1 sends PCReq message to PCE1, comprises RP object, END-POINTS object, territory sequence in this PCReq message all the time; In the present embodiment, the B value is 1 in the RP object, represents that promptly domain-to-domain link is a two-way link, the END-POINTS object is that { R1, R10} promptly represent the source node and the destination node of this two-way link, the territory sequence is that { AS1-AS2-AS3} need in the two-way link promptly to represent the territory of process.
Step 1002, PCE1 sends to PCE3 with PCReq message by PCE2;
Concrete, PCE1 determines that according to the territory sequence downstream domain in self territory, place is AS2, with the PCE2 of PCReq forwards to downstream domain AS2, PCE2 with this PCReq forwards to PCE3.
Step 1003, PCE3 calculates VSPT3, and the VSPT3 that calculates is sent to PCE2;
Concrete, after PCE3 receives the PCReq request, according to its territory sequence of carrying, determine that this territory is the tail territory, then computational fields AS2's goes out boundary node (being R6 and R7) to the multiple domain bidirectional LSP of destination node R10, obtain VSPT3, PCE3 sends to PCE2 with the VSPT3 that calculates by PCRep message, and wherein, this VSPT3 is a path sequence, promptly (ERO1:R6-R8-R10, ERO2:R7-R8-R10).
Step 1004, PCE2 carries out examination to two-way domain-to-domain link to be handled;
Concrete, after PCE2 receives the PCRep message that PCE3 sends, the two-way domain-to-domain link of R6 ← R8 and R7 ← R9 to be carried out examination handle, concrete examination processing method can refer step 602.
Step 1005, PCE2 calculates VSPT2 according to VSPT3, and the VSPT2 that calculates is sent to PCE1;
Concrete, as to carry in the PCReq message that PCE2 sends according to previous PCE1 territory sequence determines that this territory is an intermediate field, and then computational fields AS1's goes out the multiple domain bidirectional LSP that go out boundary node (be R6 and R7) of boundary node (being R2 and R3) to this territory AS2; PCE2 makes up the VSPT3 that the multiple domain bidirectional LSP that calculates and PCE3 send, and obtains VSPT2, and PCE2 sends to PCE1 with the VSPT2 that calculates by PCRep message, and wherein, this VSPT2 is a path sequence, i.e. (ERO:R2-R4-R6-R8-R10).
Step 1006, PCE1 carries out examination to two-way domain-to-domain link to be handled;
Concrete, after PCE1 receives the PCRep request, the two-way domain-to-domain link of R2 ← R4 and R3 ← R5 to be carried out examination handle, concrete examination processing method can refer step 602.
Step 1007, PCE1 calculates VSPT1 according to VSPT2, and the VSPT1 that calculates is sent to R1;
Concrete, PCE1 calculates R1 and goes out the multiple domain bidirectional LSP of boundary node (being R2 and R3) to territory AS1, and the VSPT2 of two-way LPS of the multiple domain that calculates and PCE2 transmission is spliced, and finally obtains VSPT1, this VSPT1 is a path sequence, i.e. (ERO:R1-R2-R4-R6-R8-R10); PCE1 sends to R1 with the VSPT1 that calculates by PCRep message, and so far R1 finishes to the calculating of the multiple domain bidirectional LSP of R10.
For realizing said method, the present invention also provides a kind of computing system of multiple domain bidirectional label exchange path, Figure 11 is the structural representation that the present invention realizes the computing system of multiple domain bidirectional label exchange path, as shown in figure 11, this system comprises: the PCE113 in the PCE111 in territory, destination node place, the PCE112 in territory, upstream, territory, source node place; Wherein,
The PCE111 in territory, destination node place, be used to receive PCReq message after, in the territory that calculates according to self between bidirectional LSP and unidirectional domain link paths calculate VSPT, and described VSPT is sent to the PCE112 in territory, upstream;
The PCE112 in territory, upstream, link paths and described VSPT between bidirectional LSP, unidirectional domain in the territory that is used for calculating according to self calculate new VSPT and send to the PCE in self territory, upstream;
The PCE113 in territory, source node place is used for final VSPT is sent to source node.
The present invention also provides a kind of computing system of multiple domain bidirectional label exchange path, and as shown in figure 11, this system comprises: the PCE113 in the PCE111 in territory, destination node place, the PCE112 in territory, upstream, territory, source node place; Wherein,
The PCE111 in territory, destination node place, be used to receive PCReq message after, calculate the multiple domain bidirectional LSP of self, obtain VSPT, described VSPT is sent to the PCE112 in territory, upstream;
The PCE112 in territory, upstream is used for calculating new VSPT according to the VSPT that receives and the multiple domain bidirectional LSP that self calculates, and sends to the PCE in self territory, upstream;
The PCE113 in territory, source node place is used for final VSPT is sent to source node.
In above-mentioned two systems, the PCE in the PCE in destination node, territory, destination node place, source node and territory, source node place is one, and the PCE in territory, upstream and territory, upstream is one or more.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.

Claims (11)

1. the computational methods of a multiple domain bidirectional label exchange path is characterized in that, this method comprises:
After the path-calculating element (PCE) in territory, destination node place is received path computing request (PCReq) message, link paths calculates virtual shortest path tree (VSPT) between bidirectional label exchange path in the territory that calculates according to self (LSP) and unidirectional domain, and described VSPT is sent to the PCE in territory, upstream;
Link paths and described VSPT between bidirectional LSP, unidirectional domain in the territory that the PCE in territory, upstream calculates according to self calculate new VSPT and send to the PCE in self territory, upstream, and the PCE up to territory, source node place sends to source node with final VSPT.
2. method according to claim 1 is characterized in that, in the described territory that calculates according to self between bidirectional LSP and unidirectional domain link paths calculate VSPT and be:
PCE calculate this territory all go into boundary node bidirectional LSP in the territory of destination node, PCE calculates the territory, upstream and arrives link paths between the unidirectional domain in this territory, and link paths between bidirectional LSP in the territory and unidirectional domain is spliced, and obtains VSPT.
3. method according to claim 1 is characterized in that, link paths and described VSPT between bidirectional LSP, unidirectional domain in the territory that the PCE in territory, described upstream calculates according to self calculate new VSPT and be:
PCE calculate this territory all go into bidirectional LSP in boundary node goes out boundary node to all of this territory the territory, PCE calculates the territory, upstream to link paths between the unidirectional domain in this territory; Link paths between bidirectional LSP in the territory and unidirectional domain is spliced, and then the VSPT of the PCE transmission of splicing downstream domain, new VSPT obtained.
4. method according to claim 1 is characterized in that, this method further comprises:
The PCE in intermediate field or first territory carries out authenticate reverse to this territory to link paths between the unidirectional domain of downstream domain autonomous system (AS), if be proved to be successful, then not execution route deletion, if authentication failed, then link paths between this unidirectional domain among the described VSPT is deleted, the VSPT after checking is finished sends to the PCE in territory, upstream.
5. the computational methods of a multiple domain bidirectional label exchange path is characterized in that, this method comprises:
After the PCE in territory, destination node place receives PCReq message, calculate the multiple domain bidirectional LSP of self, obtain VSPT, described VSPT is sent to the PCE in territory, upstream;
The PCE in territory, upstream calculates new VSPT according to VSPT that receives and the multiple domain bidirectional LSP that self calculates, and sends to the PCE in self territory, upstream, and the PCE up to territory, source node place sends to source node with final VSPT.
6. method according to claim 5 is characterized in that, the multiple domain bidirectional LSP of described calculating self is:
PCE calculates in the territory, upstream all and goes out boundary node all in this territory and go out the multiple domain bidirectional LSP of boundary node.
7. method according to claim 5 is characterized in that, this method also comprises:
PCE carries out examination to the multiple domain bidirectional LSP that calculates to be handled.
8. method according to claim 7 is characterized in that, described PCE carries out examination to the multiple domain bidirectional LSP that calculates and is treated to:
Whether link circuit resource, the territory, upstream of checking the two-way link in the territory meet the demands to the link circuit resource of the unidirectional domain-to-domain link in this territory, and the link that does not meet the demands is deleted from the multiple domain bidirectional LSP that calculates;
Or, whether link circuit resource, the territory, upstream of checking the two-way link in the territory meet the demands to the link circuit resource of the unidirectional domain-to-domain link in this territory to link circuit resource, the downstream domain of the unidirectional domain-to-domain link in this territory, and the link that does not meet the demands is deleted from the multiple domain bidirectional LSP that calculates;
Or, check that whether the two-way resource of two-way link in this territory, inspection downstream domain meet the demands to the link circuit resource of the unidirectional domain-to-domain link in this territory, delete the link that does not meet the demands from the multiple domain bidirectional LSP that calculates.
9. method according to claim 5 is characterized in that, the PCE in territory, described upstream according to the new VSPT of multiple domain bidirectional LSP calculating of VSPT that receives and self calculating is:
Multiple domain bidirectional LSP and the PCE of the downstream domain VSPT that send of PCE after with examination splices, and generates new VSPT.
10. the computing system of a multiple domain bidirectional label exchange path is characterized in that, this system comprises: the PCE in the PCE in territory, destination node place, the PCE in territory, upstream, territory, source node place; Wherein,
The PCE in territory, destination node place, be used to receive PCReq message after, in the territory that calculates according to self between bidirectional LSP and unidirectional domain link paths calculate VSPT, and described VSPT is sent to the PCE in territory, upstream;
The PCE in territory, upstream, link paths and described VSPT between bidirectional LSP, unidirectional domain in the territory that is used for calculating according to self calculate new VSPT and send to the PCE in self territory, upstream;
The PCE in territory, source node place is used for final VSPT is sent to source node.
11. the computing system of a multiple domain bidirectional label exchange path is characterized in that, this system comprises: the PCE in the PCE in territory, destination node place, the PCE in territory, upstream, territory, source node place; Wherein,
The PCE in territory, destination node place, be used to receive PCReq message after, calculate the multiple domain bidirectional LSP of self, obtain VSPT, described VSPT is sent to the PCE in territory, upstream;
The PCE in territory, upstream is used for calculating new VSPT according to the VSPT that receives and the multiple domain bidirectional LSP that self calculates, and sends to the PCE in self territory, upstream;
The PCE in territory, source node place is used for final VSPT is sent to source node.
CN201010531403.0A 2010-11-04 2010-11-04 Computing method and system for multi-domain two-way label switched path Expired - Fee Related CN101984597B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201010531403.0A CN101984597B (en) 2010-11-04 2010-11-04 Computing method and system for multi-domain two-way label switched path
PCT/CN2011/073651 WO2012058911A1 (en) 2010-11-04 2011-05-04 Method and system for computing multi-domain bidirectional label switch path

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010531403.0A CN101984597B (en) 2010-11-04 2010-11-04 Computing method and system for multi-domain two-way label switched path

Publications (2)

Publication Number Publication Date
CN101984597A true CN101984597A (en) 2011-03-09
CN101984597B CN101984597B (en) 2015-01-28

Family

ID=43641768

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010531403.0A Expired - Fee Related CN101984597B (en) 2010-11-04 2010-11-04 Computing method and system for multi-domain two-way label switched path

Country Status (2)

Country Link
CN (1) CN101984597B (en)
WO (1) WO2012058911A1 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012058911A1 (en) * 2010-11-04 2012-05-10 中兴通讯股份有限公司 Method and system for computing multi-domain bidirectional label switch path
CN102624616A (en) * 2012-03-02 2012-08-01 中兴通讯股份有限公司 Method and system for realizing splicing between label switched paths
WO2013041028A1 (en) * 2011-09-20 2013-03-28 Huawei Technologies Co., Ltd. System and Method for Computing Inter-Domain Shortest Constrained Path in a Computer Network
CN103067271A (en) * 2011-10-19 2013-04-24 中兴通讯股份有限公司 Implement method of bidirectional path and device of bidirectional path
CN103095576A (en) * 2013-01-07 2013-05-08 中兴通讯股份有限公司 Method and field for avoiding diversification path calculation deadlock

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106302153B (en) 2015-05-11 2020-02-07 中兴通讯股份有限公司 Multi-domain controller, single-domain controller, software defined optical network system and method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101483539A (en) * 2008-01-07 2009-07-15 华为技术有限公司 Method, path computing unit and system for obtaining path
WO2009115726A1 (en) * 2008-03-04 2009-09-24 France Telecom Technique for determining a point-to-multipoint tree linking a root node to a plurality of leaf nodes
CN101552716A (en) * 2008-04-03 2009-10-07 华为技术有限公司 Method, device and system for calculating service path
CN101552717A (en) * 2008-04-03 2009-10-07 华为技术有限公司 Method and device for requesting computing path in multiple-domain networks

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7801048B1 (en) * 2004-06-23 2010-09-21 Cisco Technology, Inc. Concurrent path computation using virtual shortest path tree
CN101984597B (en) * 2010-11-04 2015-01-28 中兴通讯股份有限公司 Computing method and system for multi-domain two-way label switched path

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101483539A (en) * 2008-01-07 2009-07-15 华为技术有限公司 Method, path computing unit and system for obtaining path
WO2009115726A1 (en) * 2008-03-04 2009-09-24 France Telecom Technique for determining a point-to-multipoint tree linking a root node to a plurality of leaf nodes
CN101552716A (en) * 2008-04-03 2009-10-07 华为技术有限公司 Method, device and system for calculating service path
CN101552717A (en) * 2008-04-03 2009-10-07 华为技术有限公司 Method and device for requesting computing path in multiple-domain networks

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012058911A1 (en) * 2010-11-04 2012-05-10 中兴通讯股份有限公司 Method and system for computing multi-domain bidirectional label switch path
WO2013041028A1 (en) * 2011-09-20 2013-03-28 Huawei Technologies Co., Ltd. System and Method for Computing Inter-Domain Shortest Constrained Path in a Computer Network
CN103067271A (en) * 2011-10-19 2013-04-24 中兴通讯股份有限公司 Implement method of bidirectional path and device of bidirectional path
CN102624616A (en) * 2012-03-02 2012-08-01 中兴通讯股份有限公司 Method and system for realizing splicing between label switched paths
CN102624616B (en) * 2012-03-02 2018-03-02 中兴通讯股份有限公司 It is a kind of to realize the method and system spliced between label switched path
CN103095576A (en) * 2013-01-07 2013-05-08 中兴通讯股份有限公司 Method and field for avoiding diversification path calculation deadlock
CN103095576B (en) * 2013-01-07 2018-02-16 中兴通讯股份有限公司 A kind of method and apparatus for avoiding diverse paths from calculating deadlock

Also Published As

Publication number Publication date
WO2012058911A1 (en) 2012-05-10
CN101984597B (en) 2015-01-28

Similar Documents

Publication Publication Date Title
CN105594167B (en) Method, controller, forwarding device and the network system to E-Packet
CN101371150B (en) Dynamic protection against failure of a head-end node of one or more TE-LSPs
CN101606341B (en) Technique for efficiently routing ip traffic on CE-CE paths across a provider network
RU2541940C2 (en) Method of applying service instance to mpls network (versions) and mpls network
CN101536375B (en) Inter-domain path computation technique
CN101483539B (en) Method, path computing unit and system for obtaining path
CN103209088B (en) Ring network label switch path creation method and associated devices and communication system
CN101984597B (en) Computing method and system for multi-domain two-way label switched path
US9712426B2 (en) Multi-domain routing computation method and device, path computation element and routing network
CN105871722A (en) Tag structure and tag message forwarding method and device
CN102611607A (en) Processing method and path computation element of inter-domain link information
CN101729385B (en) Path calculation and establishing method, device and system
CN101960801A (en) Technique for determining a point-to-multipoint tree linking a root node to a plurality of leaf nodes
CN101471868A (en) Route selection method and network system, route calculation module
CN105634941A (en) Cross-domain path calculation method and device
CN102195869A (en) Dual-end recursive path computation element (PCE)-based computation method and device
CN102065006B (en) Method for recovering inter-domain failure of cross-domain label switched path
CN103188147A (en) Path establishment method and system
CN101247322A (en) Method and network appliance for route computation between autonomy systems
CN101588288A (en) Configuration method, communication equipment and communication system of link attribute information
CN104092611A (en) Method and device for determining label switching route with restrained cross region
CN102480406B (en) Method and system for building cross-domain end-to-end two-way label switching path
JP4589978B2 (en) Route setting method and route setting device
CN104135423B (en) A kind of bidirectional tunnel method for building up and device
CN102571530A (en) Inter-domain link status information processing method and PCE

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
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20150128

Termination date: 20201104