CN101193058B - Method for local re-optimization of loose nodes - Google Patents
Method for local re-optimization of loose nodes Download PDFInfo
- Publication number
- CN101193058B CN101193058B CN2006101569941A CN200610156994A CN101193058B CN 101193058 B CN101193058 B CN 101193058B CN 2006101569941 A CN2006101569941 A CN 2006101569941A CN 200610156994 A CN200610156994 A CN 200610156994A CN 101193058 B CN101193058 B CN 101193058B
- Authority
- CN
- China
- Prior art keywords
- optimization
- path
- local
- message
- tunnel
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention discloses a loose node local re-optimization method, which comprises the following steps: extending new objects, which means the flag value of RRO (route record object) extends the attributes flags TLV (type length value) flag attributes of the LSP (label switching path) attributes and LSP required attributes; in the process of channel establishing, the local re-optimization abilityis negotiated and processed; after the channel established and the more optimized path appears, the loose nodes launch singling processing to establish a more optimized path; when the more optimized path is established, processing to delete the old less optimized path is launched. The invention reduces the scope of re-optimization to the loose section, which makes response to the appearance of the more optimized path timelier. What's more, the shortcoming of head node re-optimization that the influence range of signaling is too long is overcome. At the same time, the re-optimization ability is distributed to the loose nodes, thus reducing the burden of the head node.
Description
Technical field
The present invention relates to traffic engineering re-optimization technology, in particular, be a kind of be used for being implemented in MPLS (Multiprotocol Label Switch, multiprotocol label switching) or GMPLS (
Generalized Multiprotocol Label Switching, general multiple protocols label exchange) and in the network, TE LSP (traffic engineering label switched path) carries out the method for local re-optimization at loose nodes.
Background technology
In the network of MPLS or GMPLS, provide a kind of re-optimization function.When TE LSP find to exist more optimize the path after, the forwarding that remains on original route is not affected under the situation, customer flow can be switched on the newly-established TE LSP that more optimizes.The basic thought of this function is after wishing that finding more to optimize the path exists, can utilize and more optimize the path, simultaneously to existing flow effect minimum.Method for dismounting was set up a new TE LSP after more common method was to use and sets up earlier, and after new TE LSP success, the tunnel head node switches to customer flow on the newly-established TE LSP, deletes sub-optimal path simultaneously, has finished the re-optimization of TE LSP.
If this tunnel is cross-domain, may not know that other region memory more optimizing the path, at such a case, has proposed the re-optimization of loose nodes.The method (draft-ietf-ccamp-loose-path-reopt-02) of loose nodes re-optimization has been proposed at IETF at present, this method is after loose nodes is found more to optimize the path, by the head node of message informing to the tunnel, delet method was set up new tunnel after the head node in tunnel adopted and sets up earlier.Successfully set up when more optimizing the tunnel, customer flow switches to newly to be set up on the tunnel, deletes sub-optimal path simultaneously.
For such method, if loose nodes is far apart from head node, that is to say a lot of intermediate nodes, the re-optimization signaling can be long, also need to recomputate once the burden of the signaling that on whole network, increases at middle loose nodes even without more optimizing the path; And because need loose nodes to send message to head node, notification message may be lost (can adopt reliable news, must be all reliable on entire path, cost is very big reliably).
Summary of the invention
Based on above-mentioned problem, the object of the present invention is to provide a kind of processing method that adopts local re-optimization of loose nodes, the scope of re-optimization is narrowed down between ravel area, accelerate the optimization time, alleviate network burden.
The present invention is a kind of method of local re-optimization of loose nodes, and this method comprises the steps:
Step 1: the flag attribute of attribute flags type lengths values Attributes Flags TLV of expanding flag (mark) mark value, extension tag switching path attribute LSP_ATTRIBUTES and the label switched path demand properties LSP_REQUIRED_ATTRIBUTES object of new object: RRO (route record object);
Step 2: in the tunnel establishment procedure for the processing of carrying the local re-optimization capability negotiation;
Step 3: after the tunnel was set up, after occurring more optimizing the path, loose nodes initiated to set up the signaling process of more optimizing the tunnel;
Step 4: after more optimizing path foundation, initiate the processing in the old suboptimum tunnel of deletion.
Further, in the step 1: the new flag attribute of expansion make to support the local re-optimization node can be in protocol message alternately to the support situation of local re-optimization; Difference re-optimization message and non-re-optimization message.
Further, in the step 2: the tunnel head node is to carry downstream node by PATH message for the information of local re-optimization support, support the node of local re-optimization to preserve support local re-optimization tunnel information, simultaneously this locality support situation is fed back to the head node in tunnel.
Further, in the step 3: after having occurred more optimizing the path in the loose nodes interval, loose nodes judges that more optimizing the path exists, and initiates more to optimize the signaling message in path.This signaling message is done differentiation by carrying local re-optimization flag and old tunnel, and the destination node feedback RESV message of signaling message is given loose nodes, finishes signaling procedure.
Further, in the step 4: after more optimizing the path and successfully setting up, loose nodes sends the old tunnel of PATH TEAR message deletion.Carry the re-optimization mark in this deletion message, distinguish with non-re-optimization message.
Further, in the re-optimization process, transmit path mistake or reservation error message, need carry the re-optimization mark, for the error message that carries the re-optimization mark, the loose nodes of re-optimization receives error message, initiates an associative operation at the re-optimization tunnel.
Compared with prior art, the present invention narrows down to the scope of re-optimization between ravel area, can do timely response after the path occurs more optimizing, and has overcome the long shortcoming of signaling coverage in the method for head node re-optimization.Ability with re-optimization is distributed on the loose nodes simultaneously, has alleviated the burden of head node.
Description of drawings
Fig. 1 is that the present invention supports local re-optimization and the schematic diagram of the expansion done;
Fig. 2 is the capability negotiation step schematic diagram in the process of setting up of local re-optimization of loose nodes of the present invention;
Fig. 3 after the more optimization path of local re-optimization of loose nodes of the present invention occurs, sets up the signaling procedure step schematic diagram of more optimizing the path;
Fig. 4 after the more optimization path of local re-optimization of loose nodes of the present invention is successfully set up, removes old sub-optimal path process steps schematic diagram;
Fig. 5 be local re-optimization of loose nodes of the present invention more optimize the schematic diagram that the Actual path that data pass through set up is optimized in the path;
Embodiment
Below in conjunction with accompanying drawing local re-optimization of loose nodes processing method of the present invention is described.
In the accompanying drawing, term is described as follows:
CSPF: based on the algorithm of constraint SPF calculating path
LSR: LSR
RESV: the RESV of RSVP
PATH: request message is set up in the path of RSVP
PSB:PATH message status piece is preserved the PATH message content
RSB:RESV message status piece is preserved the RESV message content
IGP: Routing Protocol in the territory
Attributes Flags TLV: attribute flags type lengths values
LSP_REQUIRED_ATTRIBUTES: the necessary attributes object of label switched path, the attribute that requires node to support.
LSP_ATTRIBUTES: whether label switched path attribute, node can be selected to support
ERO: explicit route object, record instructs the node address information of setting up the path
RRO: path record object, the node address of the actual process in path that record is set up
HOP: next jumps object, recording messages outgoing interface address information
1. the expansion for supporting that local re-optimization is done.
1.1 expansion Attributes Flags TLV
Shown in Figure 1, Type is 1 expression Attributes Flags TLV.
Length is 8 at present, represents that this sub-TLV only carries a no symbol int at present.
Value expansion local re-optimization demand Local Reoptimization Desire0x1.
This mark is represented the situation of node support local re-optimization, if do not support, can ignore this mark; Can in the RRO object of reserving (RESV) message, express support for situation if support.This mark only works to loose nodes.
This mark should appear in path (PATH) message in tunnel, and other message this mark should not occur.
Expansion Local reoptimization in use 0x2 (local re-optimization uses)
Carry the message of these marks, represent that this message is the message that sends for local re-optimization, supports the node of local re-optimization function should be able to correctly handle these message.This mark can appear in 7 kinds of message of RFC2205 (RSVP) regulation.
Go up explanation according to RFC4420 (based on the attribute coding of the RSVP of traffic engineering), this sub-TLV can appear in the LSP_ATTRIBUTES object, also can occur in the LSP_REQUIRED_ATTRIBUTES object,, different application scenarioss be arranged for these two objects.
The local re-optimization demand appears in the LSP_REQUIRED_ATTRIBUTES object, because should if therefore node can not be discerned this object or not support this sub-TLV, then refuse this message to liking the object that must support; If do not support the local re-optimization attribute, then can ignore this attribute flags.This application scenarios is that the user can be by the situation of configuration instruction support in the tunnel of local re-optimization as the pressure support.
The local re-optimization demand appears in the LSP_ATTRIBUTES object because should to as if can select the object supported, therefore do not support this object or this attribute flags, can ignore this attribute flags.This application scenarios be local re-optimization as in the tunnel that can select to support, the situation that the user can support by configuration instruction.
1.2 the flag of expansion RRO object
RRO IPv4/IPv6 subobject (IP address subobject) Flags
New expanding value is Local reoptimization in use 0x40
The local re-optimization function has been supported in this IP address of content representation of new expansion, and after finding that more optimizing the path exists, this node can initiated re-optimization in this locality, no longer the request of re-optimization is sent to the head node in tunnel.
2. local re-optimization capability negotiation process
2.1 head node behavior
Shown in Figure 2, the negotiations process of local re-optimization ability has been described in the tunnel establishment procedure.
Tunnel head node LSR1 sets up tunnel T1 to LSR5, by node LSR2, and LSR3, LSR4 arrives destination node LSR5.Wherein LSR2 and LSR4 are loose nodes.LSR1 disposes by the user, represents that this tunnel needs local re-optimization, is provided with the mark that the local re-optimization demand is set in the PATH message.In present technique realized, task supported that the local re-optimization ability is a selectable content, so this mark is carried among the Attributes FlagsTLV of LSP_ATTRIBUTES object.But do not limit use in this object, if having in the PATH message, this mark occurs at LSP_REQUIRED_ATTRIBUTES, suggestion is identification correctly, supports this attribute.
2.2 set up the PATH message processing procedure:
Intermediate node LSR2, LSR3, after LSR4 and tail node LSR5 receive and set up the PATH request message, because the local local re-optimization of loose nodes function of supporting, therefore writing down PATH message needs local re-optimization, other object in the normal process PATH message after successfully handling, sends PATH message downstream.
2.3RESV Message Processing:
Receive the RESV message of tail node LSR5 transmission when intermediate node after,, then in RESV message, represent this node support local re-optimization in the RRO object, this information is passed to the head node LSR1 in tunnel because support the local re-optimization function.IPV4 by having expanded the RRO object and the flag mark in IPV6 address and the node address represent that this address supported the local re-optimization function.The RRO object illustrates in front for the expansion of this attribute.
3. the processing behind the path is more optimized in appearance between ravel area
Shown in Figure 3, the re-optimization signaling procedure is described.When a new node LSR6 directly appears in LSR2 and LSR4, this is illustrated in and has occurred the path of more optimizing between ravel area, expresses possibility to have occurred one and more optimize the path.These information can be carried to all nodes in this traffic engineering territory by the IGP agreement.
After LSR2 receives the information of IGP transmission, because LSR2 is a loose nodes, and support local re-optimization, therefore call CSPF and calculate the path that arrives a destination node, because next destination node can be the another one loose nodes in this tunnel, also may be the destination address in tunnel, be the LSR4 node in the T1 tunnel.After CSPF calculated successfully, loose nodes LSR2 compared current path and the new calculating path of using, and sees whether new route is now more optimized.
LSR2 discovery new route is more optimized, data by the local re-optimization tenability of consulting previously in the RRO object, judge whether crossover node supports the local re-optimization function in new and old two paths,, then do not initiate the local re-optimization signaling if crossover node is not supported this function.Support the local re-optimization function if can guarantee the node between ravel area, loose nodes LSR2 initiates signaling message, finishes the signaling procedure of more optimizing the path.If the loose nodes of tunnel process is not supported local loose nodes re-optimization function, then the method for head node re-optimization is adopted in suggestion, and loose nodes just sends a notification message and tells this method of head node to realize.
3.1 local re-optimization signaling-PATH Message Processing
Loose nodes LSR2 sends new PATH message, object below this message has always been changed: ERO, the HOP object has increased object LSP_REQUIRED_ATTRIBUTES simultaneously newly, if comprised this object in the PATH message originally, then can not increase this object.Carry Attributes Flags TLV in LSP_REQUIRED_ATTRIBUTES, description messages is a re-optimization message among this TLV, and it is 0x02 that mark value is set.Expansion for this sub-TLV illustrates in front.
Wherein deposited in the ERO object to send and arrived strict path between the next loose nodes LSR4, among simultaneously that purpose loose nodes among the old ERO is the later newly-established ERO of ERO object tools from re-optimization loose nodes LSR2.Carry address among the ERO this moment: LSR2, LSR6, LSR4, LSR5
After intermediate node LSR6 receives this PATH, judge the local corresponding PSB that whether has,, then create PSB, and to preserve oneself be the re-optimization message, send PATH message to downstream node according to ERO if there is not PSB according to PATH message; If there is PSB in this locality, explanation is a re-optimization message in the message because newly receive, and then preserves the new ERO that produces of re-optimization, and the ERO processing according to re-optimization PATH message sends PATH message to next jumping, and is different if next is jumped, and then preserves re-optimization HOP object.For same tunnel, may there be two PSB.
After this re-optimization PATH message arrives a nearest loose nodes, this loose nodes LSR4 finds that this PATH message is re-optimization PATH message, and to have compared the ERO that goes out from this node be identical with the ERO that does not have re-optimization PATH, then do not send this PATH message downstream.And send RESV message along new route, the PATH in old path is refreshed normally carry out.
If intermediate node does not support this locality to refresh mark, then the transmit path error message abandons PATH message simultaneously, because carried the LSP_REQUIRED_ATTRIBUTES object in the message.
After initiation local re-optimization node receives path error message message, no longer adopt local re-optimization mode re-optimization, perhaps send a notification message and more optimize the path to the local existence of head node explanation in tunnel; Perhaps just reticent.
3.2 local re-optimization signaling-RESV Message Processing:
Intermediate node when between ravel area receives RESV message, it oneself is the RESV of re-optimization that this RESV message is carried the information explanation, has carried the LSP_REQUIRED_ATTRIBUTES object in this RESV message, carries local attribute flagTLV in the object,, it is 0x02 that mark value is set.In the time of to this RESV Message Processing,, need transmit this RESV message, until the loose head node of re-optimization is initiated in the tunnel according to the path of re-optimization PATH because RSEV message is re-optimization RESV;
The loose nodes LSR2 that initiates re-optimization switches to customer flow on the path of new re-optimization after receiving the RESV message that re-optimization returns, and transmit path deletion (PATHTEAR) message has been carried re-optimization information in the path deletion message then.
When handling re-optimization RESV message, if, abandon RESV message simultaneously because the resource reservation failure sends reservation error message to re-optimization purpose loose nodes.
4. delete old path
Shown in Figure 4, be the process of deletion sub-optimal path.After new path is set up successfully, along old path, loose nodes LSR2 sends the path deletion Message Processing that has local re-optimization information, and this re-optimization message is carried among the LSP_ATTRIBUTES, this object carries attribute flag TLV, and it is 0x02 that value of statistical indicant is set.Intermediate node LSR3 and LSR4 between ravel area receive PATHTEAR message, judge earlier for same tunnel, the local PSB that whether has re-optimization, if exist, then only delete the PSB of non-re-optimization, if having only a PSB, and there is the information of local re-optimization, then be the ERO with the ERO replace old of re-optimization, the HOP object substitutes, the outgoing interface change.If have only a PSB, and do not have corresponding local re-optimization ERO, do not have re-optimization information in other words, then will normally delete PSB.
In the time of deletion RSB, because path deletion message has been carried the local re-optimization attribute, therefore also need to judge, if, then delete the RSB of non-re-optimization, if having only a RSB for two RSB of the local existence in same tunnel, if there is the information of local re-optimization, then be the ERO with the ERO replace old of re-optimization, the HOP object substitutes, the outgoing interface change.If have only a PSB, and do not have corresponding local re-optimization ERO, do not have re-optimization information in other words, then will normally delete this RSB.
For the path deletion message that does not have the re-optimization sign normally, just just can initiate to delete deletion message simultaneously in the re-optimization tunnel at the loose nodes of local re-optimization message; For if not loose nodes, but the local node that re-optimization RSB is arranged also can send the path of two paths deletion message to correspondence, the deletion corresponding tunnel.The path deletion message that send this moment is not carried the re-optimization mark.
Shown in Figure 4, the Actual path that the tunnel passes through, the Actual path that the flow of transmitting along this tunnel passes through have been described after the re-optimization.
5. head node and loose nodes are in the interior situation of same flow region
Can a traffic engineering scope between the ravel area of mentioning here, that is to say that two loose nodes all are ABR (Area Border Router, Area Border Router) or ASBR (Automatic System Border Router, Autonomous System Boundary Router, AS Boundary Router), also the head node in possibility loose nodes and tunnel exists in the zone.
For head node and loose nodes interior situation in same flow region, after occurring more optimizing the path, head node calculates more optimizes the path to loose nodes, and loose nodes calculates more optimizes the path to next loose nodes, and re-optimization adopts the calculating segmentation of local re-optimization to carry out.Certainly because head node can perception more be optimized the path existence, also can adopt and set up back deletion mode earlier.But can increase the signaling burden of back, tunnel node like this.
6. just carry and handle at the local re-optimization error message:
Handle for the path error message that re-optimization information is arranged: after the loose nodes of initiation re-optimization is received path error message, because in path error message, also carried the re-optimization attribute-bit, then clearly know the re-optimization failure, send re-optimization path deletion message to downstream node, the node in re-optimization tunnel has been set up in deletion.
For reservation error message, because also carry the re-optimization attribute in the message, so after the destination node of re-optimization receives this message, should the transmit path error message give the loose nodes of re-optimization, carry re-optimization information in the path error message.The content of mistake does not have new increase.
Claims (6)
1. the method for a local re-optimization of loose nodes is characterized in that, this method comprises the steps:
Step 1: expand new object: the flag attribute of the attribute flags type lengths values AttributesFlags TLV of flag mark value, extension tag switching path attribute LSP_ATTRIBUTES and the label switched path demand properties LSP_REQUIRED_ATTRIBUTES object of path record object RRO;
Step 2: in the tunnel establishment procedure for the processing of carrying the local re-optimization capability negotiation;
Step 3: after the tunnel was set up, after occurring more optimizing the path, loose nodes initiated to set up the signaling process of more optimizing the tunnel;
Step 4: after more optimizing path foundation, initiate the processing in the old suboptimum tunnel of deletion.
2. the method for local re-optimization of loose nodes as claimed in claim 1 is characterized in that in the step 1: the new flag attribute of expansion make support the local re-optimization node can be in protocol message alternately to the support situation of local re-optimization; Difference re-optimization message and non-re-optimization message.
3. the method for local re-optimization of loose nodes as claimed in claim 1, it is characterized in that in the step 2: the tunnel head node is carried into downstream node for the information of local re-optimization support by PATH message, support the node of local re-optimization to preserve support local re-optimization tunnel information, simultaneously this locality support situation is fed back to the head node in tunnel.
4. the method for local re-optimization of loose nodes as claimed in claim 1, it is characterized in that in the step 3: after having occurred more optimizing the path in the loose nodes interval, loose nodes judges that more optimizing the path exists, initiate more to optimize the signaling message in path, this signaling message is done differentiation by carrying local re-optimization flag and old tunnel, the destination node feedback RESV message of signaling message is given loose nodes, finishes signaling procedure.
5. the method for local re-optimization of loose nodes as claimed in claim 1, it is characterized in that in the step 4: after more optimizing the path and successfully setting up, the old tunnel of loose nodes transmit path deletion message deletion carries the re-optimization mark in this deletion message, distinguishes with non-re-optimization message.
6. the method for local re-optimization of loose nodes as claimed in claim 1, it is characterized in that in the re-optimization process, transmit path error message or reservation error message, need carry the re-optimization mark, for the error message that carries the re-optimization mark, the loose nodes of re-optimization receives error message, initiates an associative operation at the re-optimization tunnel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101569941A CN101193058B (en) | 2006-11-21 | 2006-11-21 | Method for local re-optimization of loose nodes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101569941A CN101193058B (en) | 2006-11-21 | 2006-11-21 | Method for local re-optimization of loose nodes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101193058A CN101193058A (en) | 2008-06-04 |
| CN101193058B true CN101193058B (en) | 2010-07-07 |
Family
ID=39487819
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006101569941A Expired - Fee Related CN101193058B (en) | 2006-11-21 | 2006-11-21 | Method for local re-optimization of loose nodes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101193058B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102710505B (en) * | 2012-05-16 | 2015-03-25 | 中兴通讯股份有限公司 | Method and system for deploying tunnel services |
| CN103249066B (en) * | 2013-04-18 | 2015-09-02 | 上海桑锐电子科技有限公司 | A kind of radio network path changing method |
| CN105591862A (en) * | 2014-10-20 | 2016-05-18 | 中兴通讯股份有限公司 | Tunnel path computation re-optimization method and device |
| CN108881340A (en) * | 2017-05-11 | 2018-11-23 | 中兴通讯股份有限公司 | A kind of method and device that time delay is collected |
Citations (2)
| 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 |
| WO2005119949A1 (en) * | 2004-05-19 | 2005-12-15 | Cisco Technology, Inc. | Reoptimization triggering by path computation elements |
-
2006
- 2006-11-21 CN CN2006101569941A patent/CN101193058B/en not_active Expired - Fee Related
Patent Citations (2)
| 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 |
| WO2005119949A1 (en) * | 2004-05-19 | 2005-12-15 | Cisco Technology, Inc. | Reoptimization triggering by path computation elements |
Non-Patent Citations (1)
| Title |
|---|
| draft-itef-ccamp-loose-path-report-02.2006,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101193058A (en) | 2008-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101685855B1 (en) | System, method and apparatus for signaling and responding to ero expansion failure in inter domain te lsp | |
| US11528220B2 (en) | Method and device for creating bi-directional segment routing tunnel and storage medium | |
| US7978596B2 (en) | Connection-oriented network node | |
| US7684420B2 (en) | Method for implementing cross-domain constraint routing | |
| EP3554021B1 (en) | Flow label negotiation method, related device, and system | |
| US7133358B2 (en) | Failure control unit | |
| US9571381B2 (en) | System and method for inter-domain RSVP-TE LSP load balancing | |
| US7580359B2 (en) | Method and system for maximizing network capacity utilization in multiprotocol label switched networks by moving label switched paths | |
| EP3754913A1 (en) | Signaling ip path tunnels for traffic engineering | |
| US20140348028A1 (en) | Method for creating ring network label switched path, related device, and communications system | |
| CN101640637B (en) | Resource reservation protocol tunnel management method based on flow rate engineering and system thereof | |
| US20080075008A1 (en) | Transmission apparatus and path establishing method | |
| CN104243311A (en) | Message processing method and router thereof | |
| US8824451B2 (en) | Method and system for establishing an associated bidirectional label-switched path | |
| EP2025109B1 (en) | Traffic-triggered setup of label switched paths | |
| US7826394B2 (en) | Method, system and device for implementing traffic engineering | |
| JP2011519214A (en) | System and method for multi-topology support | |
| EP1786158B1 (en) | Methods and systems for informing and negotiating the monitor ability of the label switching capability | |
| CN101193058B (en) | Method for local re-optimization of loose nodes | |
| KR100617291B1 (en) | Multiple Protocol Label Switching apparatus and method for forwarding a hybrid data of IP/Label-Switching | |
| WO2009076815A1 (en) | Router and method of processing path message | |
| CN101150491B (en) | An optimization method for multicast tree in multi-protocol label switching network | |
| KR100369936B1 (en) | An Efficient Restoration Mechanism Using Bandwidth Sharing Method In MPLS | |
| CN102201970A (en) | Method and system for performing routing optimization on associated bidirectional label switched path (LSP) | |
| CN100391154C (en) | Selecting method of path in resource supervisor |
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 |
Granted publication date: 20100707 Termination date: 20151121 |
|
| EXPY | Termination of patent right or utility model |