CN102647340A - Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node - Google Patents
Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node Download PDFInfo
- Publication number
- CN102647340A CN102647340A CN2012100776827A CN201210077682A CN102647340A CN 102647340 A CN102647340 A CN 102647340A CN 2012100776827 A CN2012100776827 A CN 2012100776827A CN 201210077682 A CN201210077682 A CN 201210077682A CN 102647340 A CN102647340 A CN 102647340A
- Authority
- CN
- China
- Prior art keywords
- node
- path
- router
- message
- xro
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The invention discloses a path calculation method of a loose node in an RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel, the loose node, a non-loose node and the RSVP-TE network. The method comprises the following steps that: each node in the RSVP-TE network sends a PATH message carrying the router ID (Identifier) of the node to a downstream node; when the path of the loose node is calculated, the router ID is used as a constraint condition of path exclude to submit to CSPF (Constrained Shortest Path First) to calculate the path. The loose node comprises a receiving module, a path calculation module and a message generating module; the non-loose node comprises a message generating module and a sending module; and the RSVP-TE network comprises the loose node and the non-loose node. The local router ID of an upstream node is used as a constraint condition of the path exclude, so that the possibility of a loop generated when the path of the loose node is calculated is greatly reduced.
Description
Technical field
The present invention relates to data network communication field; Be specifically related to method, loose nodes and non-loose nodes and the RSVP-TE network of the loose nodes path computing in a kind of RSVP (Resource Reservation Protocol-Traffic Engineer is called for short RSVP-TE) tunnel based on traffic engineering.
Background technology
RSVP-TE is a kind of traffic engineering technology based on MPLS (Multi-Protocol Label Switching, multiprotocol label switching).RSVP can support the distribution of MPLS label after expansion; And when transmitting label binding message, carry resource obligate information; RSVP after this expansion is called RSVP-TE; Be used for setting up lsp tunnel as a kind of signaling protocol, be used through information issue, path computing, Signalling exchange (RSVP-TE), these four functions of data forwarding and can realize the forwarding of service traffics in traffic engineering tunnel (TE Tunnels) at MPLS TE.
The RSVP-TE tunnel roughly is divided into two types in the process of path computing: one type is dynamically to calculate the road; One type is to calculate the road through the explicit path of configuration.Dynamically calculating the road is a kind of a kind of calculation road mechanism that does not have other constraints, as long as a paths can satisfy the tunnel and set up resource needed.If dynamically calculate the road, only can submit to a CSPF (Constrained Shorest Path Tree, Constraint Shortest Path First algorithm) to calculate the fullpath of calculating head node tail node at head node to the tunnel from the tunnel; It is a kind of a kind of calculation road mechanism with configuration constraint that explicit path is calculated the road, can must get rid of certain interface or node in the configured tunneling technique path, can necessary strict or loose certain interface of process or the node of configured tunneling technique.If explicit path is calculated the road; When the tunnel head node submits to CSPF to calculate; What calculate is the path (if all be strict configuration in showing paths, what calculate so also is the fullpath of head node tail node to the tunnel from the tunnel) from first loose nodes of tunnel head node to show paths, after PATH message arrives first loose nodes; Can carry out CSPF once more and calculate, calculate next loose point.The final like this tunnel tail node that calculates.
In RFC4874, proposed a kind of XRO object and be used for some link of the explicit eliminating of path computing or node, and be carried into the downstream tail node always through PATH message.Use among the RSVP-TE that existing object XRO (Exlucde Route Object gets rid of routing object) retrains path computing in the PATH message.
Because after setting up the PATH message arrival loose nodes in path; Carry out CSPF and calculate interface or the node eliminating that the middle configuration that just will show paths needs explicit exclusion; Not will before the path of process do not get rid of, the path of therefore calculating once more is very possible to be overlapped with the node of process before, this can pass through RRO (the Record Route Object in the PATH message certainly; The record routing object) carry out loop detection, discovery loop and announcement are carried out the dismounting in tunnel to head node.As shown in Figure 1, the tunnel is established to R5 by R1, sets up through explicit path.Showing paths of configuration is eliminating R4 node, and loose to R3, so the tunnel only can calculate one by the path of R1 to R3 at head node; According to the possible path of existing topology is R1-＞R2-＞R3, when the PATH message of setting up the path reaches R3 (loose nodes), can carry out CSPF once more and calculate; Current calculating can be got rid of the R4 node equally; The path of calculating possibly be that R3-＞R2-＞R5 (supposes that this paths is superior to R3-＞R5), when the RRO loop detection, can find at the R2 node loop is arranged; The PATH-ERR message announcement is removed the tunnel to head node.At this moment, such problem can occur: when waiting the tunnel to rebuild, repeat above-mentioned step again, the tunnel can not set up all the time.
Can know by above-mentioned analysis; Do not have a kind of mechanism to make in the back in the tunnel process of reconstruction to calculate to pass by to go to avoid producing this loop result calculated in the journey automatically at loose nodes; Make the tunnel calculate in the process of road, loop detection, dismounting always and circulate, and can't set up success.
Summary of the invention
The technical issues that need to address of the present invention provide method, loose nodes, non-loose nodes and the RSVP-TE network of loose nodes path computing in a kind of RSVP-TE tunnel, avoid producing loop when being implemented in the loose nodes calculating path automatically.
In order to solve the problems of the technologies described above, the invention provides the method for loose nodes path computing in a kind of RSVP-TE tunnel, comprising:
Carry the PATH message of the router id of this node based on each node downstream node transmission in the RSVP RSVP-TE tunnel of traffic engineering;
Loose nodes is submitted the constraints that said router id is got rid of as the path to Constraint Shortest Path First algorithm CSPF calculating path when calculating path.
Further, when each node downstream node sends the PATH message of the router id that carries this node in the said RSVP-TE tunnel, the router id of this node is added among the eliminating routing object XRO of said PATH message;
Said loose nodes obtains the constraints that said router id is got rid of as the path among the XRO from the said PATH message of receiving when calculating path, submit the CSPF calculating path to.
Further, said method also comprises:
Flag field in the SESSION ATTRIBUTE object of expansion PATH message, flag bit of redetermination indicate need be automatically adds the router id of this node among the XRO to.
Further, when each node downstream node sends the PATH message of the router id that carries this node in the said RSVP-TE tunnel, the router id of this node is added among the eliminating routing object XRO of said PATH message, comprising:
When the head node downstream node in the said RSVP-TE tunnel sends PATH message; The router id of this node is added among the said XRO; And expand the flag field in the SESSION ATTRIBUTE object of said PATH message, flag bit of redetermination indicates and need be automatically the router id of this node be added among the XRO;
Said downstream node is when receiving said PATH message; If find the flag field in the said SESSION ATTRIBUTE object said flag bit is arranged; Then said downstream node adds the router id of this node among the XRO of said PATH message to when sending PATH message toward its downstream node.
In order to solve the problems of the technologies described above, the present invention also provides the loose nodes in a kind of RSVP-TE tunnel, comprising:
Receiver module is used to receive the PATH message that upstream node is sent, and therefrom obtains router id;
Path calculation module is used for submitting the constraints that said router id is got rid of as the path to Constraint Shortest Path First algorithm CSPF calculating path;
Message generating module, the PATH message that is used for sending at said loose nodes downstream node is added the router id of this node.
Further, said receiver module is used for obtaining said router id from the eliminating routing object XRO of said PATH message;
Said message generating module, the XRO of the PATH message that is used for sending at said loose nodes downstream node adds the router id of this node.
Further, said message generating module also is used for expanding the flag field of the SESSION ATTRIBUTE object of PATH message, and flag bit of redetermination indicates and need be automatically the router id of this node be added among the said XRO.
In order to solve the problems of the technologies described above, the present invention also provides the non-loose nodes in a kind of RSVP-TE tunnel, comprising:
Message generating module is used for the router id at this node of PATH message interpolation of said non-loose nodes downstream node transmission;
Sending module is used for the said PATH message that carries this node router id is sent to said downstream node.
Further, said message generating module is used for the router id of this node is added to the eliminating routing object XRO of said PATH message.
Further, said message generating module also is used for expanding the flag field of the SESSION ATTRIBUTE object of PATH message, and flag bit of redetermination indicates and need be automatically the router id of this node be added among the XRO.
Further, said non-loose nodes also comprises:
Receiver module; Be used to receive the PATH message that upstream node is sent; If find the flag field in the SESSION ATTRIBUTE object of said PATH message said flag bit is arranged, then notify said message generating module that the router id of this node is added among the XRO of said PATH message;
Said message generating module is used for after receiving the notice of said receiver module, and the router id of this node is added among the XRO of said PATH message.
In order to solve the problems of the technologies described above, the present invention also provides a kind of RSVP-TE network, comprising: aforesaid loose nodes and aforesaid non-loose nodes.
Compared with prior art; The method of loose nodes path computing, loose nodes, non-loose nodes and RSVP-TE network in the RSVP-TE provided by the invention tunnel; Through the constraints that the local router ID with upstream node gets rid of as the path, significantly reduced the possibility that produces loop when loose nodes is calculated the road.
Description of drawings
Fig. 1 is the networking diagram that traditional tunnel is set up;
Fig. 2 is the method flow diagram of the loose nodes path computing in the RSVP-TE tunnel among the embodiment;
Fig. 3 is the loose nodes structure chart in the RSVP-TE tunnel among the embodiment;
Fig. 4 is the non-loose nodes structure chart in the RSVP-TE tunnel among the embodiment;
Fig. 5 is the networking diagram that the tunnel is set up in the applying examples;
Fig. 6 is the method flow diagram of loose nodes path computing in the RSVP-TE tunnel in the applying examples.
Embodiment
For making the object of the invention, technical scheme and advantage clearer, hereinafter will combine accompanying drawing that embodiments of the invention are elaborated.Need to prove that under the situation of not conflicting, embodiment among the application and the characteristic among the embodiment be combination in any each other.
Embodiment:
As shown in Figure 2, present embodiment provides the method for loose nodes path computing in a kind of RSVP-TE tunnel, comprising:
Each node downstream node sends the PATH message of the router id that carries this node in the S101:RSVP-TE tunnel;
In the present embodiment, as a kind of preferred mode, can the router id of this node be added among the eliminating routing object XRO of said PATH message.
In addition; Flag field in the SESSION ATTRIBUTE object of expansion PATH message; Flag bit of redetermination, 0x20 for example indicates and need be automatically the router id of this node be added among the XRO; When the downstream node is received PATH message, just can discern like this, need be automatically the router id of this node be added among the XRO determining whether the SESSION ATTRIBUTE object of PATH message.
For example; When the head node downstream node in the RSVP-TE tunnel sends PATH message; Automatically the router id with this node adds among the XRO; And the flag field in the SESSION ATTRIBUTE object of expansion PATH message, flag bit of redetermination indicates and need be automatically the router id of this node be added among the XRO;
Said downstream node is when receiving said PATH message; If find the flag field in the said SESSION ATTRIBUTE object said flag bit is arranged; Then said downstream node adds the router id of this node among the XRO to when sending PATH message toward its downstream node.
Like this, in automatic interpolation local router ID to XRO,, significantly reduced loose nodes and calculated the possibility that the road produces loop the constraints that local router ID gets rid of as the path.
S102: loose nodes is submitted the constraints that said router id is got rid of as the path to Constraint Shortest Path First algorithm (CSPF) calculating path when calculating path.
Wherein, said loose nodes obtains the constraints that said router id is got rid of as the path among the XRO from the said PATH message of receiving when calculating path, submit the CSPF calculating path to.The CSPF algorithm is a prior art, repeats no more here.
In addition; After loose nodes calculates the path; When said loose nodes downstream node sent PATH message, the router id with this loose nodes added among the said XRO automatically, also had loose nodes to prevent the back; Guarantee to avoid the loop of loose nodes generation, set up the tunnel smoothly until the tunnel tail node.
As shown in Figure 3, present embodiment provides the loose nodes in a kind of RSVP-TE tunnel, comprising:
Receiver module is used to receive the PATH message that upstream node is sent, and therefrom obtains router id;
Wherein, obtain said router id among the XRO of said receiver module from said PATH message.
Path calculation module is used for submitting the constraints that said router id is got rid of as the path to Constraint Shortest Path First algorithm CSPF calculating path;
Message generating module, the PATH message that is used for sending at said loose nodes downstream node is added the router id of this node.
Wherein, add the router id of this node among the eliminating routing object XRO of said message generating module in the PATH message that said loose nodes downstream node sends.
Said message generating module also is used for expanding the flag field of the SESSION ATTRIBUTE object of PATH message, and flag bit of redetermination indicates and need be automatically the router id of this node be added among the XRO.
As shown in Figure 4, present embodiment provides the non-loose nodes in a kind of RSVP-TE tunnel, comprising:
Message generating module is used for the router id at this node of PATH message interpolation of said non-loose nodes downstream node transmission;
Wherein, said message generating module is added the router id of this node among the eliminating routing object XRO of said PATH message to.
Said message generating module also is used for expanding the flag field of the SESSION ATTRIBUTE object of PATH message, and flag bit of redetermination indicates and need be automatically the router id of this node be added among the XRO.
Sending module is used for the said PATH message that carries this node router id is sent to downstream node.
In addition, as a kind of preferred mode, said non-loose nodes also comprises:
Receiver module; Be used to receive the PATH message that upstream node is sent; If find the flag field in the said SESSION ATTRIBUTE object said flag bit is arranged, then notify said message generating module that the router id of this node is added among the XRO of said PATH message;
Said message generating module is used for after receiving the notice of said receiver module, and the router id of this node is added among the XRO of said PATH message.
In addition, present embodiment also provides a kind of RSVP-TE network, comprising: aforesaid loose nodes and aforesaid non-loose nodes.
In an applying examples, as shown in Figure 5, the tunnel head node is R1, and tail node is R5.What the tunnel used is explicit path, and loose nodes is arranged in the explicit path, and the router id of 5 nodes is respectively Rid1, Rid2, Rid3, Rid4, Rid5.Flag field in the SESSION ATTRIBUTE object of expansion PATH message, flag bit 0x20 of redetermination indicates and need be automatically the router id of this node be added among the XRO.
As shown in Figure 6, the method for RSVP-TE loose nodes path computing may further comprise the steps:
S201: tunnel head node R1 adds Rid1 among the XRO, is that the mark of 0x20 is carried into downstream node R2 through PATH message with SESSION ATTRIBUTE object flag field simultaneously;
S202: when R2 handled the PATH message of receiving, the flag field among the discovery SESSION ATTRIBUTE had the mark of 0x20, then in the PATH message that downstream node R 3 is sent, in XRO, can add the router id Rid2 of this node;
S203: when R3 receives the PATH of upstream node R2 transmission; Subobjects such as Rid1, Rid2 are arranged in the XRO object; Because R3 is a loose nodes, need submit to CSPF to calculate once more, submitting to need be with the subobject among the XRO as the constraints of calculating when calculating;
The path of calculating this time only possibly be R3-＞R5, and the restrained condition of path R3-＞R2-＞R5 forecloses.
S204:R3 also adds the Rid3 of this node among the XRO in the PATH message that R5 sends, and prevents that the back from also having loose nodes, the tail node until the tunnel;
S205:R5 receives after the PATH message, because be the tunnel tail node, can upstream send RESV message, until a node.
Like this, the tunnel has just been set up successfully, has avoided the loop that produces at loose nodes simultaneously.
Can find out from the foregoing description; With respect to prior art; The method and system of the RSVP-TE loose nodes path computing that provides in the foregoing description in automatic interpolation local router ID to XRO, can significantly reduce the possibility that produces loop when loose nodes is calculated the road.
One of ordinary skill in the art will appreciate that all or part of step in the said method can instruct related hardware to accomplish through program, said program can be stored in the computer-readable recording medium, like read-only memory, disk or CD etc.Alternatively, all or part of step of the foregoing description also can use one or more integrated circuits to realize.Correspondingly, each the module/unit in the foregoing description can adopt the form of hardware to realize, also can adopt the form of software function module to realize.The present invention is not restricted to the combination of the hardware and software of any particular form.
The above is merely the preferred embodiments of the present invention, is not to be used to limit protection scope of the present invention.According to summary of the invention of the present invention; Also other various embodiments can be arranged; Under the situation that does not deviate from spirit of the present invention and essence thereof, those of ordinary skill in the art are when making various corresponding changes and distortion according to the present invention, and are all within spirit of the present invention and principle; Any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (12)
1. the method for loose nodes path computing in the RSVP-TE tunnel comprises:
Carry the PATH message of the router id of this node based on each node downstream node transmission in the RSVP RSVP-TE tunnel of traffic engineering;
Loose nodes is submitted the constraints that said router id is got rid of as the path to Constraint Shortest Path First algorithm CSPF calculating path when calculating path.
2. the method for claim 1 is characterized in that:
When each node downstream node sends the PATH message of the router id that carries this node in the said RSVP-TE tunnel, the router id of this node is added among the eliminating routing object XRO of said PATH message;
Said loose nodes obtains the constraints that said router id is got rid of as the path among the XRO from the said PATH message of receiving when calculating path, submit the CSPF calculating path to.
3. according to claim 1 or claim 2 method, it is characterized in that: said method also comprises:
Flag field in the SESSION ATTRIBUTE object of expansion PATH message, flag bit of redetermination indicate need be automatically adds the router id of this node among the XRO to.
4. method as claimed in claim 3 is characterized in that:
When each node downstream node sends the PATH message of the router id that carries this node in the said RSVP-TE tunnel, the router id of this node is added among the eliminating routing object XRO of said PATH message, comprising:
When the head node downstream node in the said RSVP-TE tunnel sends PATH message; The router id of this node is added among the said XRO; And expand the flag field in the SESSION ATTRIBUTE object of said PATH message, flag bit of redetermination indicates and need be automatically the router id of this node be added among the XRO;
Said downstream node is when receiving said PATH message; If find the flag field in the said SESSION ATTRIBUTE object said flag bit is arranged; Then said downstream node adds the router id of this node among the XRO of said PATH message to when sending PATH message toward its downstream node.
5. the loose nodes in the RSVP-TE tunnel comprises:
Receiver module is used to receive the PATH message that upstream node is sent, and therefrom obtains router id;
Path calculation module is used for submitting the constraints that said router id is got rid of as the path to Constraint Shortest Path First algorithm CSPF calculating path;
Message generating module, the PATH message that is used for sending at said loose nodes downstream node is added the router id of this node.
6. loose nodes as claimed in claim 5 is characterized in that:
Said receiver module is used for obtaining said router id from the eliminating routing object XRO of said PATH message;
Said message generating module, the XRO of the PATH message that is used for sending at said loose nodes downstream node adds the router id of this node.
7. like claim 5 or 6 described loose nodes, it is characterized in that:
Said message generating module also is used for expanding the flag field of the SESSION ATTRIBUTE object of PATH message, and flag bit of redetermination indicates and need be automatically the router id of this node be added among the said XRO.
8. the non-loose nodes in the RSVP-TE tunnel comprises:
Message generating module is used for the router id at this node of PATH message interpolation of said non-loose nodes downstream node transmission;
Sending module is used for the said PATH message that carries this node router id is sent to said downstream node.
9. non-loose nodes as claimed in claim 8 is characterized in that:
Said message generating module is used for the router id of this node is added to the eliminating routing object XRO of said PATH message.
10. non-loose nodes as claimed in claim 9 is characterized in that:
Said message generating module also is used for expanding the flag field of the SESSION ATTRIBUTE object of PATH message, and flag bit of redetermination indicates and need be automatically the router id of this node be added among the XRO.
11. non-loose nodes as claimed in claim 10 is characterized in that: said non-loose nodes also comprises:
Receiver module; Be used to receive the PATH message that upstream node is sent; If find the flag field in the SESSION ATTRIBUTE object of said PATH message said flag bit is arranged, then notify said message generating module that the router id of this node is added among the XRO of said PATH message;
Said message generating module is used for after receiving the notice of said receiver module, and the router id of this node is added among the XRO of said PATH message.
12. a RSVP-TE network comprises: like the described loose nodes of claim 5-7 with like the described non-loose nodes of claim 8-11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100776827A CN102647340A (en) | 2012-03-22 | 2012-03-22 | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100776827A CN102647340A (en) | 2012-03-22 | 2012-03-22 | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102647340A true CN102647340A (en) | 2012-08-22 |
Family
ID=46659924
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012100776827A Pending CN102647340A (en) | 2012-03-22 | 2012-03-22 | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102647340A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104702501A (en) * | 2013-12-05 | 2015-06-10 | 中兴通讯股份有限公司 | Method and device for enhancing TE FRR (Traffic Engineering-Fast Re-Route) protection reliability |
| WO2016061932A1 (en) * | 2014-10-20 | 2016-04-28 | 中兴通讯股份有限公司 | Tunnel path computation method and apparatus and device |
| WO2016078363A1 (en) * | 2014-11-21 | 2016-05-26 | 中兴通讯股份有限公司 | Methods and apparatuses for sending and receiving tunnel constraint information |
| WO2016141677A1 (en) * | 2015-03-12 | 2016-09-15 | 中兴通讯股份有限公司 | Path calculation method, system and path calculation node |
| WO2017152595A1 (en) * | 2016-03-11 | 2017-09-14 | 中兴通讯股份有限公司 | Method and device for responding to network topology change |
| WO2018177256A1 (en) * | 2017-03-27 | 2018-10-04 | 中兴通讯股份有限公司 | Method and device for announcing delay information |
| CN113225258A (en) * | 2020-02-06 | 2021-08-06 | 阿里巴巴集团控股有限公司 | Message forwarding method, device, network equipment and system |
| WO2023040503A1 (en) * | 2021-09-16 | 2023-03-23 | 中兴通讯股份有限公司 | Path calculation method and apparatus, network controller and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1592159A (en) * | 2003-08-29 | 2005-03-09 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
| EP1089517B1 (en) * | 1999-10-01 | 2005-12-14 | Nortel Networks Limited | Establishing connections accross a communications network |
| CN101222407A (en) * | 2008-01-23 | 2008-07-16 | 中兴通讯股份有限公司 | Method for evading loose node automatic loop circuit |
| CN101945049A (en) * | 2010-09-20 | 2011-01-12 | 中兴通讯股份有限公司 | Multi-protocol label switching system, node equipment and establishing method of bidirectional tunnel |
-
2012
- 2012-03-22 CN CN2012100776827A patent/CN102647340A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1089517B1 (en) * | 1999-10-01 | 2005-12-14 | Nortel Networks Limited | Establishing connections accross a communications network |
| CN1592159A (en) * | 2003-08-29 | 2005-03-09 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
| CN101222407A (en) * | 2008-01-23 | 2008-07-16 | 中兴通讯股份有限公司 | Method for evading loose node automatic loop circuit |
| CN101945049A (en) * | 2010-09-20 | 2011-01-12 | 中兴通讯股份有限公司 | Multi-protocol label switching system, node equipment and establishing method of bidirectional tunnel |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104702501A (en) * | 2013-12-05 | 2015-06-10 | 中兴通讯股份有限公司 | Method and device for enhancing TE FRR (Traffic Engineering-Fast Re-Route) protection reliability |
| CN104702501B (en) * | 2013-12-05 | 2019-02-15 | 中兴通讯股份有限公司 | A kind of method and device improving TE FRR protection reliability |
| WO2016061932A1 (en) * | 2014-10-20 | 2016-04-28 | 中兴通讯股份有限公司 | Tunnel path computation method and apparatus and device |
| WO2016078363A1 (en) * | 2014-11-21 | 2016-05-26 | 中兴通讯股份有限公司 | Methods and apparatuses for sending and receiving tunnel constraint information |
| CN105681190A (en) * | 2014-11-21 | 2016-06-15 | 中兴通讯股份有限公司 | Tunnel restraint information sending, receiving method and device |
| WO2016141677A1 (en) * | 2015-03-12 | 2016-09-15 | 中兴通讯股份有限公司 | Path calculation method, system and path calculation node |
| CN106034076A (en) * | 2015-03-12 | 2016-10-19 | 中兴通讯股份有限公司 | Method and system for realizing path calculation, and path calculation node |
| WO2017152595A1 (en) * | 2016-03-11 | 2017-09-14 | 中兴通讯股份有限公司 | Method and device for responding to network topology change |
| WO2018177256A1 (en) * | 2017-03-27 | 2018-10-04 | 中兴通讯股份有限公司 | Method and device for announcing delay information |
| CN113225258A (en) * | 2020-02-06 | 2021-08-06 | 阿里巴巴集团控股有限公司 | Message forwarding method, device, network equipment and system |
| WO2023040503A1 (en) * | 2021-09-16 | 2023-03-23 | 中兴通讯股份有限公司 | Path calculation method and apparatus, network controller and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11962496B2 (en) | Method for establishing segment routing for IPv6 tunnel | |
| CN102647340A (en) | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node | |
| JP5759637B2 (en) | Method for creating label switch path of ring network, related device, and communication system | |
| CN110417651B (en) | Tunnel establishment method, device and system | |
| US7489695B1 (en) | Automatic LSP stitching with protocol signaling | |
| US9210075B2 (en) | Method and apparatus for managing end-to-end consistency of bi-directional MPLS-TP tunnels via in-band communication channel (G-ACH) protocol | |
| EP2135393B1 (en) | Ethernet spanning tree provision | |
| CN102119517B (en) | System and method for multi-topology support | |
| WO2011032430A1 (en) | Pseudo wire establishment method and node device | |
| WO2017124709A1 (en) | Method of establishing traffic engineering tunnel and device | |
| CN101640637B (en) | Resource reservation protocol tunnel management method based on flow rate engineering and system thereof | |
| WO2017211164A1 (en) | Method, apparatus, and system for determining inter-as label switched path tunnel | |
| WO2019007316A1 (en) | Method and device for achieving bidirectional segment routing tunnel, storage medium, and apparatus | |
| CN108881017B (en) | Method for changing bandwidth constraint of each hop in multi-path label switching path and router | |
| WO2016078363A1 (en) | Methods and apparatuses for sending and receiving tunnel constraint information | |
| WO2017190675A1 (en) | Link information processing method, apparatus and system | |
| US7768924B2 (en) | Using a link attribute to inform nodes of the availability of traffic management resources | |
| JP2009089394A (en) | Availability notification of traffic management resource | |
| CN102447612B (en) | Bidirectional point is to multipoint label switched path foundation, grafting and pruning method and system | |
| CN112532522B (en) | Service path establishing method and device and electronic equipment | |
| CN103023780A (en) | Method and device for routing computation | |
| CN101222407A (en) | Method for evading loose node automatic loop circuit | |
| CN102957614A (en) | Method and device for realizing dynamic routing | |
| CN102170391A (en) | Associated bidirectional label switched path creation method and system | |
| WO2018205887A1 (en) | Delay collection method and apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20120822 |
|
| RJ01 | Rejection of invention patent application after publication |