CN1520102A - Method of switching routes by setting up and deleting fork marker - Google Patents
Method of switching routes by setting up and deleting fork marker Download PDFInfo
- Publication number
- CN1520102A CN1520102A CNA031008127A CN03100812A CN1520102A CN 1520102 A CN1520102 A CN 1520102A CN A031008127 A CNA031008127 A CN A031008127A CN 03100812 A CN03100812 A CN 03100812A CN 1520102 A CN1520102 A CN 1520102A
- Authority
- CN
- China
- Prior art keywords
- lsp
- node
- bifurcated
- hop
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The method sets up source node and target node the forked label switch path (LSP) passes through. Fork LSP is forked to working LSP sect and protecting LSP sect at first node of fork LSP, and working LSP sect and protecting LSP sect are gathered at last node. Working LSP sect is built first, and then protecting LSP sect is built. Fork LSP may have a ring network or multiple ring networks. The deleting method sends deleting message along working LSP and protecting LSP in order to delete fork LSP. Deleted fork LSP may have a ring network or multiple ring networks. The invention provides LSP service protection from end to end for intelligent light network as well as provides sub network protection pointed to case of complex multiple sub networks. The method also provides method for deleting fork LSP already built.
Description
Technical field
The present invention relates to the ASON field, the method that relates to a kind of foundation in the ASON or rather and delete bifurcated label switched path (LSP, Label Switching Path).
Background technology
(Generalized Multi-Protocol LabelSwitching, GMPLS) technology can be set up wall scroll LSP in ASON, and can the LSP that set up be deleted and safeguard to adopt existing GMPLS.If the wall scroll LSP that is set up has break down somewhere, then therefore whole piece LSP can can't work.
At this situation; ASON has proposed a kind of LSP to be carried out 1+1 protected thought end to end; between the entrance network element of ASON and outlet network element, set up a working LSP and a protection LSP, so that business datum can switch on the protection LSP apace when the working LSP cisco unity malfunction.Referring to Fig. 1; if need to set up other business of end-to-end protection level between customer end A and the customer end B; then between Web portal network element A and outlet network element B, set up a working LSP and protection LSP on the other side, when the working LSP cisco unity malfunction, the loaded service data are switched on the protection LSP.
This protection thought does not have feasible implementation at present, and this thought only considered end to end protection, and does not consider in the protection that has under the situation of a plurality of subnets each subnet.
Summary of the invention
In view of this; main purpose of the present invention just provides that a kind of in the ASON sets up and the method for deletion bifurcated label switched path, ASON is protected end to end and the business through each subnet is protected existing under the situation of a plurality of subnets realizing.For realizing above purpose; method for building up of the present invention specifically is achieved in that a kind of method of setting up bifurcated label switched path (LSP); be applicable to ASON; bifurcated LSP originates in source node; end at destination node; and become working LSP section and protection LSP section at first node upper bifurcation, and this working LSP section and protection LSP section converge in end-node, and the method for building up of this bifurcated LSP may further comprise the steps at least:
A1. the path of source node calculating bifurcated LSP obtains operating path and protection path, generate the LSP request message, and send downstream along the operating path hop-by-hop, each downstream node is received the LSP request message of LSP request message after-cost node, up to the first node of bifurcated LSP;
B1. the first node of bifurcated LSP generates the working LSP request message of this node according to the LSP request message of receiving, and send downstream along the operating path hop-by-hop, each downstream node is received the working LSP request message of working LSP request message after-cost node, up to destination node;
C1. destination node is received the LSP response message of working LSP request message after-cost node, and upstream sends along the operating path hop-by-hop, and each upstream node is received the LSP response message of LSP response message after-cost node, up to the first node of bifurcated LSP;
D1. the first node of bifurcated LSP is received the protection LSP request message of LSP response message after-cost node, and along protecting the path hop-by-hop to send downstream, each downstream node is received the protection LSP request message of protection LSP request message after-cost node, up to the end-node of bifurcated LSP;
E1. the end-node of bifurcated LSP disposes two the sending out and the choosing receipts of hardware of this node, and upstream sends along protection path hop-by-hop, and each upstream node is received the LSP response message of LSP response message after-cost node, up to the first node of bifurcated LSP;
F1. the first node of bifurcated LSP is received two the sending out and the choosing receipts of hardware of disposing this node behind the LSP response message, and the LSP response message hop-by-hop that generates this node upstream sends, each upstream node is received the LSP response message of LSP response message after-cost node, source node up to bifurcated LSP, source node receive behind the LSP response message hop-by-hop to downstream node hop-by-hop send acknowledge message, up to destination node.
This method may further include when bifurcated LSP through more than one during different looped network; repeated execution of steps b1 to f1 once more than; set up the working LSP section in each looped network successively and protect the LSP section to the order of source node according to destination node, generate bifurcated LSP through an above looped network.
Among the described step a1, the path of bifurcated LSP is calculated by the routing module of source node, the work route display object (ERO) of corresponding operating path and the protection ERO in corresponding protection path are carried in this path, its first entrained ERO is work ERO, source node generates the routing information that comprises work ERO and protection ERO, the LSP request message of the LSP ID of bifurcated LSP, after each node obtains this LSP request message, routing information to work ERO and protection ERO compares, judge whether oneself is the first node of bifurcated LSP, if, then write down this information in this node, node learns by searching this recorded information whether this node is the first node of bifurcated LSP;
After first node is received the LSP request message among the described step b1, generate working LSP ID and the protection LSP ID of bifurcated LSP according to the LSP ID of the bifurcated LSP in the LSP request message, generation comprises the working LSP request message of work ERO and the working LSP ID of the routing information of protecting ERO and bifurcated LSP, and hop-by-hop sends to downstream node, each downstream node compares with the routing information of protection ERO work ERO after receiving the working LSP request message, judge whether oneself is the end-node of bifurcated LSP, if, then write down this information in this node, node learns by searching this recorded information whether this node is the end-node of bifurcated LSP;
First node generates the protection LSP request message that comprises work ERO and the protection LSP ID of the routing information of protecting ERO and bifurcated LSP in the described steps d 1, and hop-by-hop sends to downstream node.
Described step a1 and b1 may further include, judged whether that node refusal sets up bifurcated LSP, if have, then this node generates the refuse information that refusal is set up this bifurcated LSP, and along operating path hop-by-hop upstream nodes transmission refuse information, up to source node, each node is received the bifurcated LSP information of deleting this node after the refuse information; Otherwise continue to set up process.
Described step c1 may further include, judged whether that node refusal sets up bifurcated LSP, if have, then this node generates the refuse information that refusal is set up this bifurcated LSP, and along operating path respectively hop-by-hop upstream send refuse information with downstream node, up to source node and destination node, each node is received the bifurcated LSP information of deleting this node after the refuse information; Otherwise continue to set up process.
Described steps d 1 may further include, judged whether that node refusal sets up bifurcated LSP, if have, then this node generates the refuse information that refusal is set up this bifurcated LSP, and along protection path hop-by-hop upstream nodes transmission refuse information, first node up to bifurcated LSP, this refusal is set up the bifurcated LSP information that each node between the first node of the node of bifurcated LSP and bifurcated LSP is received this node of deletion after the refuse information, and the first node of bifurcated LSP adopts GMPLS technology deletion bifurcated LSP; Otherwise continue to set up process.
Described step e1 may further include, judged whether that node refusal sets up bifurcated LSP, if have, then this node generates the refuse information that refusal is set up this bifurcated LSP, and along protecting path difference hop-by-hop upstream to send refuse information with downstream node, up to first node and the end-node of bifurcated LSP, the first node of bifurcated LSP and each node between the end-node receive the bifurcated LSP information of deleting this node after the refuse information; The first node of bifurcated LSP adopts GMPLS technology deletion bifurcated LSP; Otherwise continue to set up process.
Each node is opened the light alarm monitoring after receiving acknowledge message among the described step f1.
Described step f1 may further include; the first node of bifurcated LSP receives after the acknowledge message and sends acknowledge message along operating path and the downward hop-by-hop of protection path hop-by-hop simultaneously, and the end-node of bifurcated LSP is that hop-by-hop sends acknowledge message downwards after receiving the affirmation message that any paths sends.
Described source node and first node are same node, and described step a1 comprises that the path of source node calculating bifurcated LSP obtains operating path and protection path, enters step b1 afterwards.
Described destination node and end-node are same node.
A kind of method of deleting bifurcated LSP, this delet method may further comprise the steps at least:
A2. after the node on the bifurcated LSP is received bifurcated LSP delete command, judge whether this node is source node, if not, then generate notification message, and upstream nodes sends a notification message, up to source node, and enter next step, otherwise, next step directly entered;
B2. source node is closed the light alarm monitoring of this node, generate the alarm information of closing of this node, and send downstream along operating path and protection path hop-by-hop respectively, after each downstream node is received and is closed alarm information, close the light alarm monitoring of this node, and generate the alarm information of closing of this node, up to destination node;
C2. destination node generates deletion message after receiving and closing alarm information; and will delete the message hop-by-hop and upstream send; up to end-node; end-node receives that deletion will delete message after the message along operating path with protect the path hop-by-hop upstream to send; each node is received the bifurcated LSP information of deleting this node after the deletion message; and generate the deletion message of this node, up to source node.
Described step b2 may further include, judged whether that the working LSP section breaks down, if have, only send deletion message among the then described step b2 along protection path hop-by-hop upstream nodes hop-by-hop, each node is received the bifurcated LSP information of deleting this node after the deletion message, working LSP before the working LSP segment fault point is deleted by timeout mechanism, and working LSP afterwards is by the synchronizing process deletion after recovering; Otherwise proceed deletion.
Described step b2 can further include, judged whether that protection LSP section breaks down, if have, only send deletion message among the then described step b2 along operating path hop-by-hop upstream nodes hop-by-hop, each node is received the bifurcated LSP information of deleting this node after the deletion message, protection LSP before the protection LSP segment fault point deletes by timeout mechanism, and protection LSP afterwards is by the synchronizing process deletion after recovering; Otherwise proceed deletion.
This method may further include; judge whether that the bifurcated LSP outside working LSP section and the protection LSP section breaks down; if have; then, recover the back by the bifurcated LSP after the automatic detecting machine system deletion fault point after recovering in the fault point by the bifurcated LSP before the timeout mechanism deletion fault point.
This method can further include, and deletion is during through the bifurcated LSP of different looped networks more than, repeated execution of steps b2 to c2 once more than, delete the working LSP section in each subring net successively and protect the LSP section to the order of source node according to destination node.
Described source node and first node are same node.
Described destination node and end-node are same node, and destination node is received to close and generated deletion message behind the alarm information among the described step c2, and will deletes message along operating path with protect the path hop-by-hop upstream to send.
The method that the present invention sets up bifurcated LSP has realized the protection of end-to-end LSP business, can also realize existing simultaneously the subnet protection under a plurality of subnet situations.
Description of drawings
Fig. 1 is the schematic diagram of end-to-end 1+1 protection thought in the ASON;
Fig. 2 is the model of bifurcated LSP of the present invention;
Fig. 3 is the schematic diagram of bifurcated LSP yet to be built in the embodiment of the invention;
Fig. 4 is the schematic diagram of A node calculating path in the embodiment of the invention;
Fig. 5 is the schematic diagram that each node sends the LSP request message in the embodiment of the invention along working LSP;
Fig. 6 is a unaccepted schematic diagram when setting up working LSP in the embodiment of the invention;
Fig. 7 is the schematic diagram that the first node stop of bifurcated LSP in the embodiment of the invention sends the LSP response message;
Fig. 8 is the first node of bifurcated LSP in the embodiment of the invention sends the LSP request message along protection LSP a schematic diagram;
Fig. 9 is a unaccepted schematic diagram when setting up protection LSP in the embodiment of the invention;
Figure 10 sets up the design sketch of LSP for receiving refusal behind the LSP response message in the embodiment of the invention;
Figure 11 is the schematic diagram that bifurcated LSP end-node sends the LSP response message in the embodiment of the invention along protection LSP;
Figure 12 is the schematic diagram that sends Confirm message in the embodiment of the invention;
Figure 13 is the schematic diagram of initiating deletion bifurcated LSP in the embodiment of the invention from the A node;
The schematic diagram of deletion bifurcated LSP when Figure 14 did not all lose efficacy with protection LSP section signalling path for working LSP section in the embodiment of the invention;
The schematic diagram of deletion bifurcated LSP when Figure 15 lost efficacy for having only working LSP section signalling path in the embodiment of the invention;
The schematic diagram of deletion bifurcated LSP when Figure 16 all lost efficacy with protection LSP section signalling path for working LSP section in the embodiment of the invention;
Figure 17 is the schematic diagram of initiating deletion bifurcated LSP in the embodiment of the invention from the C node;
Figure 18 is the schematic diagram of the bifurcated LSP of leap plurality of subnets yet to be built in the embodiment of the invention;
Figure 19 is the first node of the bifurcated LSP of subnet 2 in the embodiment of the invention sends the LSP request message along protection LSP path a schematic diagram;
Figure 20 is the first node of the bifurcated LSP of subnet 1 in the embodiment of the invention sends the LSP request message along protection LSP path a schematic diagram;
Figure 21 receives the schematic diagram of LSP response for source node in the embodiment of the invention.
Embodiment
Below in conjunction with drawings and the specific embodiments the inventive method is described in further detail.
The bifurcated LSP that the present invention set up is that a LSP becomes two LSP at some node upper bifurcations, these two LSP the node number of process can be identical, also can be different, these two LSP converge at other certain node again then, bifurcated and aggregation node occur in pairs, such bifurcated can have only one in a bifurcated LSP, also several can be arranged.Its model is referring to Fig. 2, and the LSP from A to the H node is branched into two LSP at the B node, converges at the G node again then, forms a subnet.This LSP from A to the H node is bifurcated LSP, and B node wherein is called the first node of bifurcated LSP, and the G node is called the end-node of bifurcated LSP, and the A node is a source node, and the H node is a destination node.Source node can be same node with first node, and destination node can be same node with end-node also.Have only a pair of bifurcated and aggregation node in the model shown in Figure 2, in fact can also after the G node, form the similar subnet of subnet in several and the model as required again, to be implemented under the plurality of subnets situation protection each subnet.
The present invention is based on the GMPLS technology, the message that each node generated and sent of bifurcated LSP defines by the GMPLS technology.
Illustrate the process of setting up of bifurcated LSP below.
If the user need set up a bifurcated LSP, then the user needs source node and the destination node of this bifurcated LSP are notified to source node, after obtaining this information, source node can obtain the information of other nodes of this bifurcated LSP by the topology information that is obtained by standard routing protocol, the Routing Protocol that source node adopted can be exploitation formula SPF traffic engineering expansion (OSPF-PE, OPEN SHORTESTPATH FIRST-TRAFFIC ENGINEERING) agreement, also can be other Routing Protocols such as Intermediate System-to-Intermediate System (IS-IS, Intermediate System-Intermediate System) agreement.Set up bifurcated LSP as shown in Figure 3 if desired, this bifurcated LSP converges at the F node at B node bifurcated, and wherein BCDEF is the working LSP section, and BHIJF is protection LSP section, and then the process of Jian Liing is as follows:
The LSP that the a1.A node initiates to connect asks.
The source node of the bifurcated LSP that user notification A node will be set up and destination node are respectively A node and G node, the A node obtains obtaining by Routing Protocol after this message the information of other nodes of this bifurcated LSP, afterwards, the routing module of A node calculates the path of A to G node by present existing hop generating algorithm according to the information that is obtained, generation LSP asks (LSP Req) message and sends to downstream node along the operating path hop-by-hop, each downstream node is received the LSP Req message of LSP Req message after-cost node, and send downstream along the operating path hop-by-hop, up to the first node of bifurcated LSP.
The A node calculates the path of A to G node referring to Fig. 4, two route display object (ERO are carried in this path, Explicit Route Object), wherein the path of ERO1 is ABCDEFG, the node that is to say its process is respectively A, B, C, D, E, F and G node, the path of ERO2 is BHIJF, that is to say that the node of its process is respectively B, H, I, J and F node.First entrained ERO of path that regulation calculates is work ERO, and other ERO is protection ERO, and therefore the ERO1 here is work ERO, and ERO2 is protection ERO.The information that comprises work ERO and all protection ERO in the LSP Req message of being initiated also is included in when setting up bifurcated LSP the ID by the bifurcated LSP of ASON unified distribution.The information of work ERO and protection ERO is the routing information of work ERO and protection ERO, and in the present embodiment, this LSP Req message comprises the routing information of ERO1 and ERO2.
Because LSP Req message comprises the routing information of work ERO and protection ERO; therefore; each node is after receiving LSP Req message; by these routing informations being compared the first node that obtains bifurcated LSP; thereby learn whether oneself is the first node of bifurcated LSP; if then the minute book node is first node in this node.If this source node is the first node of bifurcated LSP, does not then need to send to downstream node LSP Req message, and directly enter step a2.
Have only a work ERO and a protection ERO in the present embodiment, in fact the work ERO of bifurcated LSP can only have one, and protection ERO can have many, and such as a bifurcated LSP through N different looped networks, its protection ERO just has the N bar accordingly.
A2. the first node of bifurcated LSP generates the working LSP Req message of this node, and sends downstream along the operating path hop-by-hop, and each downstream node is received the working LSP Req message of working LSP Req message after-cost node, up to arriving destination node G.
The process that sends working LSP Req message is referring to Fig. 5.LSP ID in the LSP Req message that first node is received is set to working LSP ID and protection LSP ID; this working LSP ID is arranged in the LSP Req message working LSP Req message as first node with the routing information of work ERO and protection ERO, and this working LSP Req message is sent downwards along the operating path hop-by-hop.Being provided with of this working LSP ID and protection LSP ID can be adopted the information that increases differentiation working LSP and protection LSP in the protection attribute field of LSP ID; can can be on the basis of LSP ID, to increase an identification field that is used to distinguish working LSP and protection LSP again with the LSPID expansion also by LSP ID expansion is obtained.Receive the working LSP Req message of the working LSP Req message after-cost node of a node transmission at each node.Because working LSP Req message comprises the routing information of work ERO and protection ERO; therefore; each node is after receiving working LSP Req message; by these routing informations being compared the end-node that obtains bifurcated LSP; thereby learn whether oneself is the end-node of bifurcated LSP; if then the minute book node is an end-node in this node.
In step a1 and a2, if any one node refusal is set up this working LSP, should think then and this time set up failure that should not continue to set up, all nodes discharge corresponding resource to delete this working LSP again.
Setting up this working LSP with F node refusal is example, and the process of its deletion LSP is referring to Fig. 6.Arrive the refusal that the F node has suffered the F node afterwards for a certain reason if set up the working LSP Req message of working LSP, then the F node sends the refuse information notice upstream node that refusal LSP sets up, each upstream node is received the LSP information of all deleting this node after the refuse information, and continue hop-by-hop and upwards send refuse information, up to the A node.After the LSP information of intact this node of A knot removal, this LSP is just fully deleted.
A3. destination node G LSP response (LSP Rsp) message of sending this node give its upstream node G node upstream node successively hop-by-hop send LSP Rsp message, up to the first node of bifurcated LSP.
Its hop-by-hop upwards sends the detailed process of LSP Rsp message referring to Fig. 7.Each node checks according to the recorded information of this node whether this node is the first node of bifurcated LSP after receiving LSP Rsp message; if this node is not the first node of bifurcated LSP; then continue hop-by-hop and upwards send LSP Rsp message; otherwise this node no longer upstream nodes sends LSP Rsp message, but sets up corresponding protection LSP according to protection ERO.
Similarly, if being arranged, certain node refusal sets up this working LSP in this process, then should think and this time set up failure, should not continue again to set up, all nodes discharge corresponding resource to delete this working LSP, delete procedure among its delete procedure and the step a2 is similar, and the node of this refusal sets up working LSP that different is need be distinguished hop-by-hop and upstream send refuse information with downstream node.
The a4.B node learns that according to the information that this node write down this node is the first node of bifurcated LSP after receiving the LSP Rsp message of C node; just protect the first node of ERO; therefore the B node sends protection LSP Req message foundation protection LSP according to the path BHIJF hop-by-hop of protection ERO to the H node; the information that comprises work ERO and protection ERO in this protection LSP Req message; the protection LSP ID that also comprises the bifurcated LSP of previous setting; the H node judges that according to the information that this node write down this node is not last node of protection LSP after receiving protection LSP Req message; therefore send protection LSP Req message to its downstream node; downstream node continues to judge and sends protection LSP Req message, up to the end-node F of protection LSP.This process that sends protection LSP Req message is referring to Fig. 8.
Identical with the process of setting up working LSP; if being arranged, any one node refusal sets up this protection LSP in the process of setting up protection LSP; then should not set up this protection LSP again, and should think and this time set up failure that all nodes should discharge corresponding resource to delete this protection LSP.And trigger the operation of deletion working LSP by the first Node B node of bifurcated LSP, thereby delete whole piece LSP.
Setting up this protection LSP with I node refusal is example, and the process of its deletion LSP is referring to Fig. 9.Refused by the I node for a certain reason after the protection LSP Req message of protection LSP arrives the I node if be used to set up, then the I node should send refuse information that refusal LSP sets up to the H node, and this message and hop-by-hop upwards send, up to the B node.Just with the LSP information deletion of this node, protection LSP has not just existed yet after receiving refuse information for I and H node.After the B node receives this refuse information; because protection LSP has not existed; so the B node receives the situation that refusal after the LSP Rsp message is set up LSP when at this moment just being equivalent to set up non-bifurcation LSP, therefore can adopt the GMPLS technology to carry out the deletion of LSP, its design sketch is referring to Figure 10.
The a5.F node learns that according to the information that this node write down this node is last node of protection LSP; it is the end-node of bifurcated LSP; therefore the F node is learnt the relevant information of hardware according to working LSP ID and protection LSP ID; dispose two the sending out of hardware of this node with this; choosing is received and is switched with the protection that is used for bifurcated LSP; and send LSP Rsp message to the J node; this message also sends along protection LSP hop-by-hop upstream nodes hop-by-hop; it is not the first node of protection LSP that each upstream node receives the INFORMATION DISCOVERY oneself that writes down according to this node after the LSP Rsp message; then upstream nodes continues to send the LSPRsp message of this node; find that up to the B node this node is the first node of protection LSP; the two of this node of B node configuration hardware send out afterwards; choosing is received; switch with the protection that is used for bifurcated LSP; the LSP response message that will send this node then is to upstream node A, and the process of transmitting this LSP Rsp message is referring to Figure 11.
Similarly, if in the process of setting up protection LSP, there is any one node refusal to set up this protection LSP, then should do not set up this protection LSP again, and should think and this time set up failure that all nodes should discharge corresponding resource to delete this protection LSP.Its process and delete procedure described in the step a4 of deleting this protection LSP is similar, and when different was this protection of deletion LSP, this refusal foundation was protected the node of LSP need distinguish upstream and sent refuse information with downstream node.
The a6.A node sends affirmation (Confirm) message of having received this LSP Rsp message and gives downstream node B after receiving LSP Rsp message, and the B node sends Confirm message along working LSP and protection LSP simultaneously, and this message hop-by-hop issues, up to the F node.The F node only needs that receive earlier in two Confirm message being received sent to downstream node G.Its detailed process of transmitting Confirm message is referring to Figure 12, and in this process, each node all will be opened the light alarm and lose etc. to detect light after receiving Confirm message.
If the destination node of bifurcated LSP and end-node are same nodes, promptly the F node is a destination node, and then the F node does not need to send downstream Confirm message again.
So far, the foundation of a bifurcated LSP is finished.
The delete procedure corresponding with bifurcated LSP needs each node at the message initiated timer of receiving of setting according to the GMPLS technology, if timer expiry and do not receive response message, the delete procedure that this bifurcated LSP then is described breaks down, and therefore the timeout mechanism that provides by the GMPLS technology carries out follow-up deletion work.Delete the bifurcated LSP that has set up if desired, then the user issues the delete command of bifurcated LSP to certain node, this node judges whether this node is source node, if not, then this node upwards sends notice (Notify) message, up to source node, source node receives the light alarm monitoring of closing this node after this Notify message, and hop-by-hop sends to destination node, each node is received and is closed the light alarm monitoring of closing this node behind the alarm information, the hop-by-hop upstream nodes sent deletion message after destination node received and closes alarm information, to initiate real deletion, upstream node is deleted the LSP information that this node is preserved after receiving deletion message, and continues hop-by-hop to its upstream node transmission deletion message, up to source node.If the signalling path of the bifurcated LSP that deletes breaks down, then destination node can't receive and close alarm information, its upstream node also just can't receive the deletion message that destination node is initiated, this moment, the node before the malfunctioning node can be deleted the LSP that this node is preserved by the timeout mechanism that is provided by the GMPLS technology, and the synchronizing process after the recoveries such as synchronization mechanism after the fault recovery that the node after the malfunctioning node provides by the GMPLS technology is deleted the LSP information that this node is preserved.
Issue delete command to the A node with the user below, initiate deletion from the A node and be example, the process of deleting the bifurcated LSP that has set up is elaborated.
Its delete procedure is referring to Figure 13; the A node is after receiving delete command; owing to itself be the source node of LSP; therefore this node directly sends and closes alarm information to the B node; to close the light alarm of B node; the B node sends along working LSP and protection LSP simultaneously and closes alarm information, according to the F node receive LSP on one side whether close the timer that is started behind the alarm information overtime, following two kinds of dispositions are arranged:
If the F node is received the alarm information of closing of another side LSP in the time that timer sets; the signaling communication that both sides LSP is described does not all have to lose efficacy; then its delete procedure is referring to Figure 14; the F node is closed alarm information receiving that closing of both sides continues behind the alarm information to send to downstream node; closing the alarm information hop-by-hop afterwards sends downwards; up to arriving destination node G; the G node receive close alarm information after; hop-by-hop sends deletion message to its upstream node F; after the F node is received deletion message; send deletion message along work and protection ERO respectively; each node is received the LSP information of deleting this node after the deletion message, and continues to close alarm information to its upstream node transmission, up to the A node; behind the LSP of this node of A knot removal, the bifurcated LSP that is set up is deleted fully.
If the F node is not received the alarm information of closing of another side LSP yet behind timer expiry, the signalling path that another side LSP is described lost efficacy, if the signalling path of working LSP lost efficacy, suppose that the D node on it breaks down, then its delete procedure is referring to Figure 15, the F node then continues hop-by-hop and transmits this to downstream node and close alarm information behind timer expiry, the G node sends deletion message by normal delete procedure hop-by-hop upstream nodes after closing alarm information receiving, protection LSP section can normally be deleted like this, and the LSP between the B-C node of working LSP section deletes by the timeout mechanism of GMPLS technology, and the LSP between the D-E-F node then deletes by the synchronizing process after the recoveries such as synchronization mechanism after the fault recovery of GMPLS technology; If the signalling path of protection LSP section lost efficacy; delete procedure when then its delete procedure lost efficacy with the signalling path that has only the working LSP section is identical; different is that working LSP is normally deleted; and protection LSP goes up the timeout mechanism deletion of LSP by the GMPLS technology before the malfunctioning node, and the synchronizing process after the recoveries such as synchronization mechanism of the LSP after the malfunctioning node after by the fault recovery of GMPLS technology is deleted.
And if F node or other nodes are not received any message yet behind the timer expiry of this node; then explanation may be the working LSP section and protect the signalling path of LSP section all to lose efficacy; the public part that also might be bifurcated LSP breaks down; then the LSP before the fault point is deleted by timeout mechanism, and the LSP after the fault point is waiting other conditions to delete by the automatic monitoring after the recovery of GMPLS technology after the fault recovery.Illustrate at first kind of situation below, suppose that D node and I node break down, then the process of its deletion LSP is referring to Figure 16, LSP before C node and the H node can delete by the timeout mechanism of node, and D node and I node and subsequent LSP will wait other conditions to delete by the automatic detection after the recovery of GMPLS technology after D node and the recovery of I node.
The foregoing description is to initiate to connect deletion from the A node, if from other nodes, be assumed to the C node and initiate to connect deletion, then referring to Figure 17, after the C node receives delete command, at first send Notify message to its upstream node, up to the A node, it is identical with said process that the A node receives the process of initiating to connect deletion after this message.
Above-described foundation and the deletion that is at the bifurcated LSP of list net, if bifurcated LSP need cross over a plurality of subnets, the basic scheme of then setting up this bifurcated LSP is the bifurcated LSP that sets up earlier from source node subnet farthest, set up the bifurcated LSP of nearer subnet more successively, the foundation of each subnet bifurcated LSP all is the equal of the bifurcated LSP that sets up single subnet.With its accordingly, the bifurcated LSP that a plurality of subnets are crossed in deletion can be regarded as the bifurcated LSP that repeatedly deletes single subnet, the basic scheme of its deletion be deletion earlier from the bifurcated LSP of source node subnet farthest, delete the bifurcated LSP of nearer subnet more successively.
At first the process to the bifurcated LSP that sets up plurality of subnets elaborates for example.
Set up the bifurcated LSP of two subnets of leap as shown in figure 18 if desired, then at first need the routing module of A node to calculate the path of A to H, comprise three ERO, the path of ERO1 is ABCDEFGH, the path of ERO2 is BIJE, and the path of ERO3 is EKLH, and ERO1 is work ERO.LSP Req message is sent downwards from the path hop-by-hop of A node according to work ERO, node H to the last, each node judges all after receiving LSP Req message whether oneself is first node or the end-node of bifurcated LSP, if then write down this information in this node.Last node H sends LSP Rsp message to upstream node after receiving LSP Req message; whether each node is the first node of bifurcated LSP according to the information check oneself that this node write down after receiving LSP Rsp message; if not; then continue to send LSP Rsp message to upstream node; if then need to send LSP Req message to downstream node according to the path of the protection ERO of correspondence.First node in the present embodiment is set up the process of protection LSP referring to Figure 19; the E node is the first node of the bifurcated LSP of subnet 2; after it receives the LSP Rsp message of F node transmission; path EKLH according to the protection ERO of correspondence sends LSP Req message to downstream node K; to set up the protection LSP of subnet 2; this message and hop-by-hop send downwards, up to the end-node H of the bifurcated LSP of subnet 2.The H node is after receiving LSP Req message; send LSP Rsp message to corresponding upstream node L node; referring to Figure 20; this message and hop-by-hop upwards send; find that up to the E node it is the first node of the bifurcated LSP of subnet 2; the E node sends LSP Rsp message along the path hop-by-hop upstream nodes of the work ERO of subnet 1 again, finds it oneself is the first node of subnet 1 bifurcated LSP up to the B node, and then the B node sends LSP Req message along the path BIJE of the protection ERO of subnet 1.Equally, it oneself is the end-node of subnet 1 bifurcated LSP that the E node is found after receiving this message, so again along the path BIJE transmission LSP Rsp message of protection ERO, up to the B node, the B node is given the A node with this forwards again.The A node receives that the schematic diagram of LSP response message is referring to Figure 21.So far, the bifurcated LSP of subnet 1 also sets up and finishes.
Equally, in setting up the process of subnet, if there is certain node refusal to set up this bifurcated LSP, if then this refusal node of setting up bifurcated LSP is a node on the subnet 2, then to refuse to set up the delete procedure that bifurcated LSP taked identical for Ci Shi delete procedure certain node when setting up the list net; If it is node on the subnet 1 that this refusal is set up the node of bifurcated LSP, then to set up the delete procedure that bifurcated LSP taked identical for the delete procedure of subnet 1 and bifurcated LSP before thereof certain node refusal when setting up the list net, and the processing procedure of the bifurcated LSP that the delete procedure of subnet 2 and bifurcated LSP afterwards thereof and deletion foundation are successful is identical.
The embodiment that more than sets up the bifurcated LSP of plurality of subnets sets up the bifurcated LSP that crosses over two subnets, can set up the bifurcated LSP that crosses over numerous subnet according to setting up principle.
For deleting the plurality of subnets bifurcated LSP that has set up, delete the bifurcated LSP of two subnets of the leap of having set up as shown in figure 17 if desired, then at first delete the bifurcated LSP of subnet 2, and then the bifurcated LSP of deletion subnet 1, promptly a plurality of subnets are deleted respectively with drawing near, the process of each the deletion subnet all process with the bifurcated LSP that deletes single subnet is identical.
When using bifurcated LSP transmission user professional; if working LSP is no problem; then customer service is directly walked working LSP; if working LSP breaks down; then bifurcated LSP protects and switches; owing to disposed two on hardware and choosing receipts at first node and end-node; therefore first node or the end-node by bifurcated LSP is switched to customer service on the protection LSP corresponding with the working LSP section that breaks down; if and have only the LSP of a direction to lose efficacy in the two-way services of working LSP; such as being that downstream direction breaks down; then the first node by bifurcated LSP carries out switching of customer service; only the customer service of this direction is switched on the protection LSP, i.e. working LSP and protection LSP transmission user business all.Therefore after protection is switched; the path that customer service is walked has just become; protect the node of switching to know the actual path of walking of customer service; but the first node of first of bifurcated LSP may not known; for convenient from the actual path of walking of this first first querying node customer service; protecting the node switched to need the information in this path is notified to first first node of LSP, its Notification Method is to protect the node switched that the actual routing information of walking of customer service is placed on first the first node that sends to LSP in the Notify message.
The inventive method provides foundation, deletion and the maintenance mechanism of a cover 1+1 teleservice, thereby ASON LSP service protection end to end is provided, and the subnet protection can be provided at the plurality of subnets situation of complexity.
Claims (18)
1, a kind of method of setting up bifurcated label switched path (LSP); be applicable to ASON; it is characterized in that; bifurcated LSP originates in source node; end at destination node; and become working LSP section and protection LSP section at first node upper bifurcation, and this working LSP section and protection LSP section converge in end-node, and the method for building up of this bifurcated LSP may further comprise the steps at least:
A1. the path of source node calculating bifurcated LSP obtains operating path and protection path, generate the LSP request message, and send downstream along the operating path hop-by-hop, each downstream node is received the LSP request message of LSP request message after-cost node, up to the first node of bifurcated LSP;
B1. the first node of bifurcated LSP generates the working LSP request message of this node according to the LSP request message of receiving, and send downstream along the operating path hop-by-hop, each downstream node is received the working LSP request message of working LSP request message after-cost node, up to destination node;
C1. destination node is received the LSP response message of working LSP request message after-cost node, and upstream sends along the operating path hop-by-hop, and each upstream node is received the LSP response message of LSP response message after-cost node, up to the first node of bifurcated LSP;
D1. the first node of bifurcated LSP is received the protection LSP request message of LSP response message after-cost node, and along protecting the path hop-by-hop to send downstream, each downstream node is received the protection LSP request message of protection LSP request message after-cost node, up to the end-node of bifurcated LSP;
E1. the end-node of bifurcated LSP disposes two the sending out and the choosing receipts of hardware of this node, and upstream sends along protection path hop-by-hop, and each upstream node is received the LSP response message of LSP response message after-cost node, up to the first node of bifurcated LSP;
F1. the first node of bifurcated LSP is received two the sending out and the choosing receipts of hardware of disposing this node behind the LSP response message, and the LSP response message hop-by-hop that generates this node upstream sends, each upstream node is received the LSP response message of LSP response message after-cost node, source node up to bifurcated LSP, source node receive behind the LSP response message hop-by-hop to downstream node hop-by-hop send acknowledge message, up to destination node.
2, method according to claim 1; it is characterized in that; this method further comprise when bifurcated LSP through more than one during different looped network; repeated execution of steps b1 to f1 once more than; set up working LSP section and protection LSP section among the bifurcated LSP of each subring net correspondence according to destination node to the order of source node successively, generate bifurcated LSP through an above looped network.
3, method according to claim 1, it is characterized in that, among the described step a1, the path of bifurcated LSP is calculated by the routing module of source node, the work route display object (ERO) of corresponding operating path and the protection ERO in corresponding protection path are carried in this path, its first entrained ERO is work ERO, source node generates the routing information that comprises work ERO and protection ERO, the LSP request message of the LSP ID of bifurcated LSP, after each node obtains this LSP request message, routing information to work ERO and protection ERO compares, judge whether oneself is the first node of bifurcated LSP, if, then write down this information in this node, node learns by searching this recorded information whether this node is the first node of bifurcated LSP;
After first node is received the LSP request message among the described step b1, generate working LSP ID and the protection LSP ID of bifurcated LSP according to the LSP ID of the bifurcated LSP in the LSP request message, generation comprises the working LSP request message of work ERO and the working LSP ID of the routing information of protecting ERO and bifurcated LSP, and hop-by-hop sends to downstream node, each downstream node compares with the routing information of protection ERO work ERO after receiving the working LSP request message, judge whether oneself is the end-node of bifurcated LSP, if, then write down this information in this node, node learns by searching this recorded information whether this node is the end-node of bifurcated LSP;
First node generates the protection LSP request message that comprises work ERO and the protection LSP ID of the routing information of protecting ERO and bifurcated LSP in the described steps d 1, and hop-by-hop sends to downstream node.
4, method according to claim 1, it is characterized in that described step a1 and b1 further comprise, judged whether that node refusal sets up bifurcated LSP, if have, then this node generates the refuse information that refusal is set up this bifurcated LSP, and along operating path hop-by-hop upstream nodes transmission refuse information, up to source node, each node is received the bifurcated LSP information of deleting this node after the refuse information; Otherwise continue to set up process.
5, method according to claim 1, it is characterized in that described step c1 further comprises, judged whether that node refusal sets up bifurcated LSP, if have, then this node generates the refuse information that refusal is set up this bifurcated LSP, and along operating path respectively hop-by-hop upstream send refuse information with downstream node, up to source node and destination node, each node is received the bifurcated LSP information of this node of deletion after the refuse information; Otherwise continue to set up process.
6, method according to claim 1, it is characterized in that, described steps d 1 further comprises, judged whether that node refusal sets up bifurcated LSP, if have, then this node generates the refuse information that refusal is set up this bifurcated LSP, and along protection path hop-by-hop upstream nodes transmission refuse information, first node up to bifurcated LSP, this refusal is set up the bifurcated LSP information that each node between the first node of the node of bifurcated LSP and bifurcated LSP is received this node of deletion after the refuse information, and the first node of bifurcated LSP adopts GMPLS technology deletion bifurcated LSP; Otherwise continue to set up process.
7, method according to claim 1, it is characterized in that, described step e1 further comprises, judged whether that node refusal sets up bifurcated LSP, if have, then this node generates the refuse information that refusal is set up this bifurcated LSP, and upstream sends refuse information with downstream node along protection path difference hop-by-hop, up to first node and the end-node of bifurcated LSP, the first node of bifurcated LSP and each node between the end-node receive the bifurcated LSP information of deleting this node after the refuse information; The first node of bifurcated LSP adopts GMPLS technology deletion bifurcated LSP; Otherwise continue to set up process.
8, method according to claim 1 is characterized in that, each node is opened the light alarm monitoring after receiving acknowledge message among the described step f1.
9, method according to claim 1; it is characterized in that; described step f1 further comprises; the first node of bifurcated LSP receives after the acknowledge message and sends acknowledge message along operating path and the downward hop-by-hop of protection path hop-by-hop simultaneously, and the end-node of bifurcated LSP is that hop-by-hop sends acknowledge message downwards after receiving the affirmation message that any paths sends.
10, method according to claim 1 is characterized in that, described source node and first node are same node, and described step a1 comprises that the path of source node calculating bifurcated LSP obtains operating path and protection path, enters step b1 afterwards.
11, method according to claim 1 is characterized in that, described destination node and end-node are same node.
12, a kind of method of deleting bifurcated LSP is characterized in that, this delet method may further comprise the steps at least:
A2. after the node on the bifurcated LSP is received bifurcated LSP delete command, judge whether this node is source node, if not, then generate notification message, and upstream nodes sends a notification message, up to source node, and enter next step, otherwise, next step directly entered;
B2. source node is closed the light alarm monitoring of this node, generate the alarm information of closing of this node, and send downstream along operating path and protection path hop-by-hop respectively, after each downstream node is received and is closed alarm information, close the light alarm monitoring of this node, and generate the alarm information of closing of this node, up to destination node;
C2. destination node generates deletion message after receiving and closing alarm information; and will delete the message hop-by-hop and upstream send; up to end-node; end-node receives that deletion will delete message after the message along operating path with protect the path hop-by-hop upstream to send; each node is received the bifurcated LSP information of deleting this node after the deletion message; and generate the deletion message of this node, up to source node.
13, method according to claim 12, it is characterized in that, described step b2 further comprises, judged whether that the working LSP section breaks down, if have, only send deletion message among the then described step b2 along protection path hop-by-hop upstream nodes hop-by-hop, each node is received the bifurcated LSP information of this node of deletion after the deletion message, working LSP before the working LSP segment fault point is deleted by timeout mechanism, and working LSP afterwards is by the synchronizing process deletion after recovering; Otherwise proceed deletion.
14, method according to claim 12, it is characterized in that, described step b2 further comprises, judged whether that protection LSP section breaks down, if have, only send deletion message among the then described step b2 along operating path hop-by-hop upstream nodes hop-by-hop, each node is received the bifurcated LSP information of deleting this node after the deletion message, protection LSP before the protection LSP segment fault point deletes by timeout mechanism, and protection LSP afterwards is by the synchronizing process deletion after recovering; Otherwise proceed deletion.
15, method according to claim 12; it is characterized in that this method further comprises; judge whether that the bifurcated LSP outside working LSP section and the protection LSP section breaks down; if have; then, recover the back by the bifurcated LSP after the automatic detecting machine system deletion fault point after recovering in the fault point by the bifurcated LSP before the timeout mechanism deletion fault point.
16, method according to claim 12; it is characterized in that this method further comprises; deletion is during through the bifurcated LSP of different looped networks more than; repeated execution of steps b2 to c2 once more than, delete working LSP section and protection LSP section in each subring net according to destination node successively to the order of source node.
17, method according to claim 12 is characterized in that, described source node and first node are same node.
18, method according to claim 12; it is characterized in that; described destination node and end-node are same node, and destination node is received to close and generated deletion message behind the alarm information among the described step c2, and will deletes message along operating path with protect the path hop-by-hop upstream to send.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031008127A CN100353716C (en) | 2003-01-22 | 2003-01-22 | Method of switching routes by setting up and deleting fork marker |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031008127A CN100353716C (en) | 2003-01-22 | 2003-01-22 | Method of switching routes by setting up and deleting fork marker |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1520102A true CN1520102A (en) | 2004-08-11 |
| CN100353716C CN100353716C (en) | 2007-12-05 |
Family
ID=34281318
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031008127A Expired - Fee Related CN100353716C (en) | 2003-01-22 | 2003-01-22 | Method of switching routes by setting up and deleting fork marker |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100353716C (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006079292A1 (en) * | 2005-01-27 | 2006-08-03 | Huawei Technologies Co., Ltd. | A method for creating the path for the return label in the multi-protocol label switching system |
| CN1309216C (en) * | 2004-10-08 | 2007-04-04 | 烽火通信科技股份有限公司 | Method for controlling plane participation protective rotation in ASON network |
| WO2007093099A1 (en) * | 2006-02-18 | 2007-08-23 | Huawei Technologies Co., Ltd | Method and system for associating and distinguishing the account bill in the fork scene |
| WO2008031352A1 (en) * | 2006-09-08 | 2008-03-20 | Huawei Technologies Co., Ltd. | Recovery method and apparatus for optical network lsp occuring abnormal delete |
| CN100459553C (en) * | 2005-07-06 | 2009-02-04 | 华为技术有限公司 | Method for protecting transannular business of optical transmission network |
| WO2009065279A1 (en) * | 2007-11-21 | 2009-05-28 | Zte Corporation | A method for soft re-routing in ason |
| CN1816217B (en) * | 2005-02-06 | 2010-06-02 | 华为技术有限公司 | Route setting method based on node address changing |
| CN101146035B (en) * | 2007-06-13 | 2010-12-29 | 中兴通讯股份有限公司 | Label switching path routing search method and system |
| CN102136865A (en) * | 2010-08-09 | 2011-07-27 | 华为技术有限公司 | Service recovering method, system and node device |
| CN103250377A (en) * | 2010-12-15 | 2013-08-14 | 瑞典爱立信有限公司 | Message passing to assure deletion of label switched path |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE19646016C2 (en) * | 1996-11-07 | 1999-10-14 | Siemens Ag | Method for the equivalent switching of transmission devices for the bidirectional transmission of ATM cells |
| GB2337904B (en) * | 1998-05-29 | 2003-03-12 | Nec Technologies | Frame erasure for digital data transmision systems |
| EP1126741A1 (en) * | 2000-02-15 | 2001-08-22 | Siemens Aktiengesellschaft | Method for protection switching of transmission equipment in MPLS networks |
| EP1130853A1 (en) * | 2000-02-29 | 2001-09-05 | Siemens Aktiengesellschaft | Circuit arrangement for changeover to standby of transmission installations in ring architectures with MPLS-packets |
| KR100349655B1 (en) * | 2000-10-28 | 2002-08-24 | 주식회사 케이티 | Path setup method for path protection/recovery in MPLS networks and path recovery method using the same |
| KR100725005B1 (en) * | 2000-11-22 | 2007-06-04 | 주식회사 케이티 | Fast rerouting method in mpls network |
| KR100361663B1 (en) * | 2001-01-19 | 2002-11-22 | 삼성전자 주식회사 | System for MPLS Label Switch Path protection |
-
2003
- 2003-01-22 CN CNB031008127A patent/CN100353716C/en not_active Expired - Fee Related
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1309216C (en) * | 2004-10-08 | 2007-04-04 | 烽火通信科技股份有限公司 | Method for controlling plane participation protective rotation in ASON network |
| WO2006079292A1 (en) * | 2005-01-27 | 2006-08-03 | Huawei Technologies Co., Ltd. | A method for creating the path for the return label in the multi-protocol label switching system |
| CN1816217B (en) * | 2005-02-06 | 2010-06-02 | 华为技术有限公司 | Route setting method based on node address changing |
| CN100459553C (en) * | 2005-07-06 | 2009-02-04 | 华为技术有限公司 | Method for protecting transannular business of optical transmission network |
| WO2007093099A1 (en) * | 2006-02-18 | 2007-08-23 | Huawei Technologies Co., Ltd | Method and system for associating and distinguishing the account bill in the fork scene |
| CN100454814C (en) * | 2006-02-18 | 2009-01-21 | 华为技术有限公司 | Fork situation call charge correlating and differentiating method |
| WO2008031352A1 (en) * | 2006-09-08 | 2008-03-20 | Huawei Technologies Co., Ltd. | Recovery method and apparatus for optical network lsp occuring abnormal delete |
| CN101146035B (en) * | 2007-06-13 | 2010-12-29 | 中兴通讯股份有限公司 | Label switching path routing search method and system |
| WO2009065279A1 (en) * | 2007-11-21 | 2009-05-28 | Zte Corporation | A method for soft re-routing in ason |
| CN102136865A (en) * | 2010-08-09 | 2011-07-27 | 华为技术有限公司 | Service recovering method, system and node device |
| CN102136865B (en) * | 2010-08-09 | 2014-04-16 | 华为技术有限公司 | Service recovering method, system and node device |
| CN103250377A (en) * | 2010-12-15 | 2013-08-14 | 瑞典爱立信有限公司 | Message passing to assure deletion of label switched path |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100353716C (en) | 2007-12-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101164260B (en) | Method of processing channel fault in automatic exchange optical network | |
| CN1866806A (en) | Method for realizing shared grid network recovery | |
| WO2006025296A1 (en) | Failure recovery method, network device, and program | |
| WO2002071690A2 (en) | Automatic control plane recovery for agile optical networks | |
| CN1870549A (en) | Communication network connection failure protection methods and systems | |
| CN102474446A (en) | Recovery mechanism for point-to-multipoint traffic | |
| CN1859260A (en) | Resource distributing method while traditional optical transfer net and intelligent optical network grouping | |
| CN101176303A (en) | Service rearranging method and network node | |
| CN101075970A (en) | Method and apparatus for selecting router | |
| CN101035019A (en) | Fast convergence method and device of the end-to-end service | |
| CN104170328A (en) | Protection in ring network of label switching routers | |
| CN1520102A (en) | Method of switching routes by setting up and deleting fork marker | |
| JP4297636B2 (en) | Transmission system | |
| JP2005252368A (en) | Path calculation system and method, and communication node | |
| JP4146080B2 (en) | Communication network | |
| US20150186202A1 (en) | Method and Device for Sending Inter-Domain Fault Information | |
| CN102123088A (en) | TE (Traffic Engineering) tunnel establishing method and equipment | |
| EP2658177B1 (en) | Method for detecting tunnel faults and traffic engineering node | |
| CN101192959B (en) | A recovery method for multicast service connection in automatic switching optical network | |
| CN1499747A (en) | Method for implementing protection and restoration for intelligent optical network | |
| CN106464447A (en) | Error code information transfer method, network device and communication system | |
| CN103973561A (en) | Network maintenance method for space-sky information network | |
| CN1859157A (en) | Service protective method | |
| CN1558621A (en) | Method for recovering route in all-purpose multiple protocol label switched network | |
| CN101515827B (en) | Method for business wrong link resistance wrong in an automatic switched optical network and system thereof |
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: 20071205 Termination date: 20160122 |
|
| EXPY | Termination of patent right or utility model |