WO2017063166A1 - 一种过中断链路建立标签交换路径的方法及装置 - Google Patents

一种过中断链路建立标签交换路径的方法及装置 Download PDF

Info

Publication number
WO2017063166A1
WO2017063166A1 PCT/CN2015/091983 CN2015091983W WO2017063166A1 WO 2017063166 A1 WO2017063166 A1 WO 2017063166A1 CN 2015091983 W CN2015091983 W CN 2015091983W WO 2017063166 A1 WO2017063166 A1 WO 2017063166A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
link
current
interrupted
remote information
Prior art date
Application number
PCT/CN2015/091983
Other languages
English (en)
French (fr)
Inventor
冯皓宇
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to PCT/CN2015/091983 priority Critical patent/WO2017063166A1/zh
Publication of WO2017063166A1 publication Critical patent/WO2017063166A1/zh

Links

Images

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a method and apparatus for establishing a label switching path over an interrupted link.
  • the planning optimization algorithm in the planning optimization tool can quickly calculate the optimal network resources and service routes that meet the business requirements. Using it to complete the network planning and design offline can help network operators to plan the entire network reasonably, and obtain detailed plans for network structure, resource allocation, and service distribution.
  • the planning optimization tool and the Network Management System need to have an interconnected interface, as shown in Figure 1.
  • the interface can be used to export the existing network data in the network management system to the planning optimization tool, and the network planning optimization design result is imported from the planning optimization tool into the network management system.
  • the network planning optimization design result refers to the route that the label switch path (LSP) passes through, and the network management system performs service import or service release, which means establishing a label switching path, that is, establishing on the path node.
  • LSP label switch path
  • the planning optimization tool is usually an independent offline tool
  • the network planning optimization design result is imported into the existing network through the network management system
  • the situation is inconsistent with the network situation when the business is imported. If the planned label switching path is interrupted when it is imported into the live network, the end-to-end service fails to be delivered, or the result of the distribution does not match the planned path. As a result, the label switching path cannot be successfully imported. Affect the maintenance of the entire network.
  • the embodiment of the invention provides a method and a device for establishing a label switching path by using an interrupted link, which is used to solve the problem that the label switching path cannot be successfully imported according to the planned link exchange path when the label switching path is imported into the existing network. .
  • the first node receives an LSP establishment request for the first label switched path LSP
  • the first node determines a link corresponding to a connection between itself and the second node according to local storage, and the chain The historical remote information of the path, and further determining that the historical remote information of the link is consistent with the connection information between the first node and the second node that is carried in the LSP establishment request;
  • the first node completes the input and output port resource reservation according to the LSP establishment request, and establishes its own transport layer physical connection establishment.
  • the first node further determines that the historical remote information of the link is consistent with the connection information between the first node and the second node that is carried in the LSP establishment request, and includes:
  • the remote link ID included in the historical remote information of the link is consistent with the link ID of the second node included in the connection information between the first node and the second node.
  • it also includes:
  • the first node determines a non-disruptive link corresponding to each node connected to itself, and current remote information corresponding to each non-interrupted link, and floods the current remote information of all non-interrupted links obtained To the whole network.
  • the first node determines a non-disruptive link corresponding to each node connected to itself, and current remote information corresponding to each non-interrupted link, and obtains the current far of all non-interrupted links.
  • the information is flooded to the entire network, including:
  • the first node determines a non-disruptive link corresponding to each node connected to itself, and performs, for each non-interrupted link, respectively:
  • the first node uses the remote node ID and the remote link ID as current remote information of the current non-interrupted link;
  • the first node encodes the current remote information of the current non-interrupted link into a routing protocol, and floods the entire network through the routing protocol;
  • the direction of the current non-interrupted link is the first node to the current node, and the direction of the link of the current node is the current node to the first node.
  • it also includes:
  • the first node determines that the link connected to the any node is the target link, and saves the target link before the interruption.
  • the end information is saved as historical remote information of the target link, and the current remote information of the target link is deleted.
  • the first node encodes historical remote information of the target link into a routing protocol, and floods the entire network through the routing protocol.
  • it also includes:
  • the first node determines that the link connected to the any node is a recovery link
  • the first node encodes the latest current remote information of the recovery link into a routing protocol, and floods the entire network through the routing protocol.
  • An apparatus for establishing a label switching path over an interrupted link comprising:
  • a receiving unit configured to receive an LSP establishment request for the first LSP
  • a determining unit configured to determine, according to the LSP establishment request, that the neighboring downstream node in the first LSP is the second node;
  • An analyzing unit configured to determine, according to local storage, a link corresponding to a connection between itself and the second node, and a historical remote end of the link when determining that the connection between itself and the second node is interrupted Information, and further determining that the historical remote information of the link is consistent with the connection information between the first node and the second node that is carried in the LSP establishment request;
  • an establishing unit configured to complete the input and output port resource reservation according to the LSP establishment request, and establish a physical layer connection of the transmission layer itself.
  • the analyzing unit is specifically configured to:
  • the remote node identity information ID which is consistent with the ID of the second node included in the connection information between the first node and the second node;
  • the remote link ID included in the historical remote information of the link is consistent with the link ID of the second node included in the connection information between the first node and the second node.
  • it also includes:
  • a management unit configured to determine a non-disruptive link corresponding to each node connected to itself, and current remote information corresponding to each non-interrupted link, and flood the obtained current remote information of all non-interrupted links To the whole network.
  • the management unit is specifically configured to:
  • the direction of the current non-interrupted link is the device to the current node, and the direction of the link of the current node is the current node to the device.
  • the management unit is further configured to:
  • the link corresponding to the any node is determined as the target link, and the current remote information saved by the target link before the interruption is saved as the target link. Historical remote information and delete current remote information of the target link.
  • the management unit is further configured to:
  • a label switching router the device comprising a transceiver, a processor, and a memory.
  • the transceiver, the processor, and the memory are connected to each other;
  • a transceiver configured to receive an LSP establishment request for the first LSP
  • a processor configured to determine, according to the LSP establishment request, that the adjacent downstream node in the first LSP is the second node; when determining that the connection between the self and the second node is interrupted, determining, according to the local save, the corresponding self and the second node The link between the link and the historical remote information of the link, and further determine that the historical remote information of the link is consistent with the connection information between the first node and the second node carried in the LSP establishment request; Establish a request to complete the input and output port resource reservation, and establish its own transport layer physical connection;
  • a memory for storing program code executed by the processor.
  • the embodiment of the present invention provides a method and an apparatus for establishing a label switching path by using an interrupted link.
  • the first node receives an LSP establishment request for the first LSP, where the first LSP may be an offline planned LSP. Determining, according to the LSP establishment request, that the neighboring downstream node in the first LSP is the second node.
  • the first node determines, according to the local save, a link corresponding to the connection between itself and the second node, and historical remote information of the link, And further determining that the historical remote information of the link is consistent with the connection information between the first node and the second node carried in the LSP establishment request.
  • the historical remote information of the link saved by the first node determines that the link is available, and can continue to use the link to issue services. Finally, the first node completes the input and output port resource reservation according to the LSP establishment request, and establishes its own transport layer physical connection establishment.
  • the solution provided by the embodiment of the present invention can realize the seamless connection between the offline planning and the online operation and maintenance. Even if there is a link interruption, the label switching path can be successfully imported into the existing network, so that the network planning and network operation and maintenance are consistent. . Further, the operation and maintenance personnel can realize the rapid release of services, and the first release of the service is to repair the faulty optical fiber, thereby improving the service opening efficiency.
  • FIG. 1 is a computing path for importing a planning optimization tool through a network management system in the background art of the present invention
  • FIG. 2 is a schematic structural diagram of an MPLS network according to an embodiment of the present invention.
  • FIG. 3 is a schematic diagram of connection between a node A and a node B according to an embodiment of the present invention
  • FIG. 4 is a schematic diagram of a routing protocol carrying a historical remote object according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a connection relationship between a node A, a node B, and a node C according to an embodiment of the present invention
  • FIG. 6 is a schematic diagram of connection relationships of nodes in a label switching network according to an embodiment of the present invention.
  • FIG. 8 is a flowchart showing an overview of establishing a label switching path for an interrupted link according to an embodiment of the present invention
  • FIG. 9 is a flowchart of Embodiment 1 of establishing a label switching path for an interrupted link according to an embodiment of the present invention.
  • Embodiment 10 is a flowchart of Embodiment 2 of establishing a label switching path by using an interrupted connection according to an embodiment of the present invention
  • FIG. 11 is a schematic structural diagram of an apparatus for establishing a label switching path by using an interrupted link according to an embodiment of the present invention.
  • FIG. 12 is a schematic structural diagram of a label switching router according to an embodiment of the present invention.
  • the embodiment of the invention provides a method and a device for establishing a label switching path by using an interrupted link, which is used to solve the problem that the planned label switching path is successfully imported due to the planned label switching path when the label switching path is imported into the existing network. problem.
  • the method and the device are based on the same inventive concept. Since the principles of the method and the device for solving the problem are similar, the implementation of the device and the method can be referred to each other, and the repeated description is not repeated.
  • the main application scenario of the embodiment of the present invention is a Generalized Multiprotocol Label Switching (GMPLS) network and a Multiprotocol Label Switching (MPLS) network.
  • the MPLS network is taken as an example to describe the architecture of the MPLS network.
  • the architecture of the GMPLS network is basically the same as that of the MPLS network.
  • the basic constituent unit of the MPLS network is a label switching router, that is, a node, and each node is composed of two parts, a control plane and a forwarding plane.
  • the control plane is responsible for label allocation, routing, establishment of a label forwarding table, establishment of a label switching path, and teardown.
  • the forwarding plane is responsible for forwarding the received packets according to the label forwarding table.
  • a node controller may be included in the MPLS network for issuing control commands to each node.
  • the forwarding of user data is not involved, so various actions of the nodes mentioned below are performed by the control plane of the node.
  • the node manages the link information corresponding to each link of the node, and specifically includes at least the following three aspects:
  • the node determines the non-interrupted link corresponding to each node connected to itself, and the current remote information corresponding to each non-interrupted link, and floods the obtained current remote information of all non-interrupted links to Whole network.
  • node A is connected to node B, and it is assumed that the connection between node A and node B is normal and is a non-interrupt link.
  • the node A determines that the link ID of the connection is ID_1 according to the link index identifier saved by the node, and the direction is from the node A to the node B.
  • the node B determines the link ID of the connection as ID_2 according to the link index identifier saved by the node, and the direction is from Node B to Node A. Further, the node A determines the current remote information for the link ID_1 by using a Link Management Protocol (LMP).
  • LMP Link Management Protocol
  • the node A determines, by the link management protocol LMP, that the current node connected to itself is the node B, and the link ID of the node B, ID_2.
  • Node A uses the node ID of Node B as the remote node ID and the link ID of Node B as the remote link ID.
  • the current remote information includes at least: a remote node ID and a remote link ID. Therefore, the current remote information of the link ID_1 is: (B, ID_2). Similarly, the Node B determines the current remote information for the link ID_2 through the LMP, and obtains the current remote information of the link ID_2 as: (A, ID_1).
  • the node A After determining the current remote information of the link ID_1, the node A saves the current remote information of the link ID_1 to the local database, and encodes the current remote information of the link ID_1 in the routing protocol open shortest path first (Open Shortest) Path First (OSPF) OSPF/IS-IS object, and the current remote information of link ID_1 is flooded to the entire network through the routing protocol.
  • Open Shortest) Path First (OSPF) OSPF/IS-IS object OSPF/IS-IS object
  • the node determines that the link connected to the node is the target link, and saves the current remote information saved by the target link before the interruption as the target link.
  • Historical remote information deletes the current remote information of the target link, and encodes the historical remote information of the target link into the routing protocol, and floods the entire network through the routing protocol.
  • the node A determines that the connection between the node B and the node B is interrupted by the LMP, that is, when the link ID_1 is interrupted, the node A will link the current remote information of the link ID_1 before the interruption (B, ID_2).
  • the existing remote information of the link ID_1 is deleted, and the current remote information of the link ID_1 is deleted, and the historical remote information of the link ID_1 is flooded to the entire network through a routing protocol.
  • the node determines that the link connected to the node is the recovery link, and re-acquires the current remote information of the restored link through the LMP, and deletes the recovered link. Historical remote information of the link.
  • the node encodes the latest current remote information of the recovery link into the routing protocol, and floods the entire network through the routing protocol.
  • the node A re-checks the LMP to obtain the current remote information (B, ID_2) of the link ID_1, and deletes the historical remote information of the link ID_1, and routes through The protocol floods the latest current remote information of link ID_1 to the entire network.
  • the node recovers the current remote information or historical remote information of each link from the local database, and checks each link.
  • node A recovers the current remote information of each non-interrupted link connected to itself saved before the restart from the local data, and rechecks each non-interrupted link. If it is determined that the interrupt link exists, the current remote information of the interrupt link is saved as the historical remote information of the interrupt link, and the current remote information of the interrupt link is deleted. If it is determined that there is an uninterrupted link in which the current remote information is inconsistent with the current remote information saved before the restart, the current remote information of the uninterrupted link is updated.
  • Node A recovers the historical remote information of each interrupted link that is saved before the restart from the local database, and re-verifies each interrupted link. If it is determined that there is a link that returns to normal, then it is determined. The current remote information corresponding to the normal link is restored, and the historical remote information corresponding to the restored link is deleted.
  • the above recovery and verification process can ensure the accuracy of the link information.
  • the node A After the verification is completed, the node A passes the current remote information corresponding to all the verified non-interrupted links through the routing protocol, and all the verified interrupts. The historical remote information corresponding to the link is flooded to the entire network.
  • the embodiment of the present invention further provides another method for a node to manage link information corresponding to each link of the node:
  • the node saves a pair of current remote information and historical remote information corresponding to each link connected to itself.
  • node A after node A determines the current remote information of link ID_1, node A will simultaneously save the current remote information of link ID_1 as the historical remote information of link ID_1, and this will be Two identical information are saved to the local database, and a pair of current remote information and historical remote information corresponding to the link ID_1 are flooded to the entire network through a routing protocol.
  • the node determines that the current remote information of any link changes, the historical remote information of the link is updated, so that the current remote information and the historical remote information of the link are consistent.
  • the current remote information of the link ID_1 of the node A is (B, ID_2), and after a certain time, the node A and the node B no longer have a connection relationship, and the node A and the node C are established.
  • the connection relationship is determined by the LMP.
  • the node A determines that the current remote information of the link ID_1 is: (C, ID_3).
  • the historical remote information of the link ID_1 is still: (B, ID_2), node A.
  • the node A updates its historical remote information by using the current remote information of the link ID_1 to keep the two consistent, and corresponding to the link ID_1 by the routing protocol.
  • a pair of the latest current remote information and historical remote information are flooded to the entire network.
  • the node determines that the connection with any of the nodes is interrupted, the current remote information of the link corresponding to the link is deleted, and the historical remote information of the corresponding link is retained.
  • the node A determines that the connection between the node B and the node B is interrupted by the LMP, that is, when the link ID_1 is interrupted, the node A will link the current remote information (B, ID_2) of the link ID_1 before the interruption. Delete, retain the historical remote information (B, ID_2) of the link ID_1, and flood the historical remote information of the link ID_1 to the entire network through the routing protocol.
  • the node A re-checks the LMP to obtain the current remote information (B, ID_2) of the link ID_1, and always makes the current remote information and history of the link ID_1 far.
  • the end information is consistent, and then a pair of latest current remote information and historical remote information corresponding to the link ID_1 are flooded to the entire network through a routing protocol.
  • the node recovers a pair of current remote information and historical remote information corresponding to each non-interrupted link from the local database, and historical remote information corresponding to each interrupted link, and Each link is verified.
  • the node A recovers a pair of current remote information and historical remote information corresponding to each non-interrupted link that is saved before the restart, and re-verifies each piece from the local data.
  • Non-disruptive link If it is determined that there is an interrupt link, the current remote information of the interrupt link is deleted, and the historical remote information of the interrupt link is retained. If it is determined that there is an uninterrupted link in which the current remote information is inconsistent with the current remote information saved before the restart, the historical remote information of the uninterrupted link is updated, so that the current remote information of the uninterrupted link is Historical remote information remains consistent.
  • Node A recovers the historical remote information of each interrupted link that is saved before the restart from the local database, and re-verifies each interrupted link. If it is determined that there is a link that returns to normal, then it is determined. The current remote information corresponding to the normal link is restored, and a pair of current remote information and historical remote information corresponding to the restored link are saved.
  • the above recovery and verification process can ensure the accuracy of the link information.
  • the node A passes the pair of current remote information and the historical remote information corresponding to all the verified non-interrupted links by the routing protocol. And the historical remote information corresponding to all the verified interrupted links is flooded to the entire network.
  • each node can perform end-to-end service route calculation of the interrupted link.
  • the route calculation process can be completed by the node or by a third party such as a node controller.
  • a node When performing route calculation, a node needs to know the link information of all nodes in the entire network, and the link information of all nodes on the entire network is obtained by flooding the link information of each node to the entire network. Therefore, the function of flooding mentioned in the link information corresponding to each link of the above-mentioned node management is reflected in the route calculation process.
  • the node N1 is taken as an example to describe the calculation process of the interrupted link route:
  • Step 701 The node N1 receives a service path establishment request initiated by the user.
  • the service path establishment request may specify that the LSP must be established through the link, for example, N2->N5, N7->N9, or a complete LSP planned by the planning optimization tool, for example, N1->N2->N5 ->N7->N9.
  • Node A also supports user-initiated service path pre-computation requests. Pre-computation refers to computing only paths and no path establishment.
  • Step 702 The node N1 performs route calculation according to the service path establishment request, determines a first node corresponding to the request, and a downstream node adjacent to the first node, and determines whether the connection between the first node and the adjacent downstream node is interrupted, if the step is not interrupted. 703, otherwise step 704 is performed.
  • the node N1 may be the first node, or may request any node in the corresponding LSP for the service path, or other nodes in the network.
  • the first node may be specified by the service path establishment request, or may be calculated according to the service path establishment request.
  • the downstream node adjacent to the first node may be specified by the service path establishment request, or may be calculated according to the service path establishment request.
  • Step 703 The node N1 performs verification according to the current remote information of the link of the first node. If the verification passes, step 705 is performed, otherwise step 708 is performed.
  • the node N1 determines that the remote node ID is the ID of the adjacent downstream node according to the current remote information of the link of the first node, and the remote link ID is the link ID of the adjacent downstream node, and the check passes.
  • Step 704 The node N1 performs verification according to the historical remote information of the link of the first node. If the verification passes, step 705 is performed, otherwise step 708 is performed.
  • the node N1 determines that the remote node ID is the ID of the adjacent downstream node according to the historical remote information of the link of the first node, and the remote link ID is the link ID of the adjacent downstream node, and the verification passes.
  • Step 705 The node N1 performs bandwidth resource calculation on the link of the first node to determine whether there is available bandwidth resource. If it is determined that there is available bandwidth resource, step 706 is performed, otherwise step 708 is performed.
  • the node N1 determines whether there is still a link of the available bandwidth resources allocated to the head node.
  • Step 706 The node N1 continues to determine the downstream node adjacent to the adjacent downstream node according to the service path establishment request, that is, repeats the foregoing steps 702 to 705 until the end-to-end route calculation process of the LSP for the service establishment request is completed.
  • the node N1 After determining that the available bandwidth resource is allocated to the link of the node N1, the node N1 continues. According to the service path establishment request, continue to determine the downstream node adjacent to the node N2, and if N2->N5 is the necessary link specified by the service path establishment request, directly determine that the downstream node adjacent to the node N2 is N5; otherwise, The node N1 needs to determine the downstream node adjacent to the node N2 through the route calculation according to the service path establishment request. The above steps 702 to 705 are repeated to complete the end-to-end route calculation process of the entire LSP for the service path establishment request.
  • Step 707 After the node N1 completes the end-to-end service route calculation process of the LSP for the service establishment request, the LSP is started by using the MPLS/GMPLS signaling protocol.
  • Step 708 The node N1 ends the route calculation, and feeds back to the user a route calculation failure indication.
  • the embodiment of the present invention further provides a method for establishing a label switching path by using an interrupted link. Referring to FIG. 8, the specific process is as follows:
  • Step 801 The first node receives an LSP establishment request for the first LSP.
  • the first node receives an LSP establishment request for the first LSP sent by the neighboring upstream node of the first node;
  • the first node receives an LSP setup request for the first LSP sent by the node controller.
  • the LSP establishment request may carry the complete path information of the first LSP, or carry the path information of the first node to the last node, or carry the path information of the first node to the second node.
  • first node herein may be any one of the first LSPs except the last node.
  • the LSP establishment request may carry an identifier that allows the service path to be established by the interrupted link, and select whether to perform the interrupted link establishment LSP.
  • Step 802 The first node determines, according to the LSP establishment request, that the adjacent downstream node in the first LSP is the second node.
  • the LSP establishment request is to obtain an LSP establishment request of the LSP after completing the end-to-end service route calculation process, and the LSP establishment request includes the route that the entire LSP passes. Therefore, the first node can determine that it is in accordance with the LSP establishment request for the first LSP.
  • Step 803 When the first node determines that the connection between itself and the second node is interrupted, the first node determines, according to the local save, a link corresponding to the connection between itself and the second node, and historical remote information of the link. And further determining that the historical remote information of the link is consistent with the connection information between the first node and the second node carried in the LSP establishment request.
  • the first node further determines that the historical remote information of the link is consistent with the connection information between the first node and the second node that is carried in the LSP establishment request, and includes:
  • the first node further determines that the remote node identity information ID included in the historical remote information of the link is consistent with the ID of the second node included in the connection information between the first node and the second node, and the corresponding link
  • the remote link ID included in the historical remote information is consistent with the link ID of the second node included in the connection information between the first node and the second node.
  • Step 804 The first node completes the input and output port resource reservation according to the LSP establishment request, and establishes its own transport layer physical connection establishment.
  • the first node completes resource reservation and cross-establishment as defined by the standard protocol.
  • the method further includes:
  • the first node determines that the connection between itself and the second node is an interruption, if the first node determines If the service rerouting attribute of the first LSP is locked, the rerouting is not initiated for the first LSP;
  • the first node determines that the connection between the first node and the second node is interrupted, if the first node determines that the service rerouting attribute of the first LSP is not locked, re-routing is initiated for the first LSP.
  • N1->N2->N5->N7->N9 initiates a service path establishment procedure for the LSP from the first node (N1). for:
  • Step 901 The first node receives an LSP establishment request sent by the node controller for the LSP that completes the end-to-end route calculation.
  • the calculation process for the LSP may be performed by the first node or by the node controller, where the LSP establishment request is sent by the node controller to the first node, and the request may carry the path from the first node to the node N2. Message, or path message from the first node to node N9.
  • Step 902 The first node determines its own neighboring downstream node N2 according to the LSP establishment request.
  • Step 903 The first node determines whether the connection between itself and the node N2 is interrupted. If the connection between itself and the node N2 is interrupted, step 904 is performed; otherwise, step 905 is performed.
  • Step 904 The first node determines that the connection between itself and the node N2 is an interruption, and the first node determines a link corresponding to the connection between itself and the node N2 according to the local save, and historical remote information of the link, and further determines the The historical remote information of the link is consistent with the connection information between the first node and the node N2 carried in the LSP establishment request, and step 905 is performed; otherwise, step 906 is performed.
  • the first node determines that the link corresponding to the connection between itself and the node N2 is the link ID_3, and the historical remote information (N2, ID_2) of the link, and according to the first node carried in the LSP establishment request.
  • the information (N2, ID_2) included in the connection information with the node N2 is determined to be completely identical, and the verification is passed, and step 905 is performed.
  • Step 905 The first node completes the input and output port resource reservation according to the LSP establishment request, and The physical transport layer of its own transport is established, and step 907 is continued.
  • Step 906 The first node determines that the establishment of the LSP fails, and ends the process.
  • Step 907 The first node sends a path establishment success message to the node controller.
  • the node controller After receiving the path establishment success message sent by the first node, the node controller sends an LSP establishment request to the node N2, where the LSP establishment request may carry the path message of the node N2 to the node N5, or the path message of the node N2 to the node N9. Or a path message from the first node to the node N9.
  • the node N2 performs the same road construction process as the above-mentioned head node (N1), and after completing the road establishment with the node N5, sends a path establishment success message to the node controller, and the node controller receives the path establishment success message sent by the node N2. After that, the LSP establishment request is sent to the node N5, and so on, until the node controller receives the path establishment success message returned by the node N7, and completes the path establishment process of the entire LSP, that is, N1->N2->N5->N7-> After the N9 is completed, the service path is successfully issued.
  • the re-routing is not initiated for the LSP; or
  • the first node determines that the connection between itself and the node N2 is interrupted, if the first node determines that the service rerouting attribute of the LSP is not locked, the re-routing is initiated for the LSP.
  • N1->N3->N4->N5->N8 assuming that the road construction process between node N1 and node N3 is completed, this The service path establishment process between the slave node N3 and the node N4 is:
  • Step 1001 Node N3 receives an LSP establishment request sent by node N1.
  • the path establishment request carries path information of the node N3 to the node N8.
  • Step 1002 The node N3 determines its own neighboring downstream node N4 according to the LSP establishment request.
  • Step 1003 Node N3 determines whether the connection between itself and node N4 is interrupted. If the connection between itself and node N4 is interrupted, step 1004 is performed; otherwise, step 1005 is performed.
  • Step 1004 When the node N3 determines that the connection between itself and the node N4 is interrupted, the node N3 determines the link corresponding to the connection between itself and the node N4 according to the local save, and the historical remote information of the link, and further determines Historical remote information of the link and carried in the LSP establishment request
  • the connection information between the node N3 and the node N4 is consistent, and step 1005 is performed; otherwise, step 1006 is performed.
  • the node N3 determines that the link corresponding to the connection between itself and the node N4 is the link ID_1, and the historical remote information (N4, ID_2) of the link, and according to the node N3 carried in the LSP establishment request.
  • the information (N4, ID_2) included in the connection information with the node N4 is determined to be completely identical, and the verification is passed, and step 1005 is performed.
  • Step 1005 The node N3 completes the input and output port resource reservation according to the LSP establishment request, and establishes its own transport layer physical connection, and proceeds to step 1007.
  • Step 1006 The node N3 determines that the road establishment for the LSP fails, and ends the process.
  • Step 1007 Node N3 sends an LSP setup request to node N4.
  • the path information of the node N4 to the node N8 is carried in the LSP establishment request sent by the node N3.
  • the node N4 After receiving the LSP establishment request sent by the node N3, the node N4 continues the service path establishment process between the node N4 and the node N5.
  • an embodiment of the present invention provides an apparatus for establishing a label switching path by using an interrupt link, which specifically includes:
  • the receiving unit 1101 is configured to receive an LSP establishment request for the first LSP.
  • the determining unit 1102 is configured to determine, according to the LSP establishment request, that the adjacent downstream node in the first LSP is the second node;
  • the analyzing unit 1103 is configured to, when determining that the connection between the self and the second node is interrupted, determine a link corresponding to the connection between the self and the second node according to the local storage, and historical remote information of the link, and further determine The historical remote information of the link is consistent with the connection information between the first node and the second node carried in the LSP establishment request.
  • the establishing unit 1104 is configured to complete the input and output port resource reservation according to the LSP establishment request, and establish its own transport layer physical connection establishment.
  • the analyzing unit 1103 is specifically configured to:
  • the remote link ID included in the historical remote information of the corresponding link is consistent with the link ID of the second node included in the connection information between the first node and the second node.
  • it also includes:
  • the management unit 1105 is configured to determine a non-interrupt link corresponding to each node connected to itself, and corresponding current remote information of each non-interrupted link, and flood the obtained current remote information of all non-interrupted links. To the whole network.
  • the management unit 1105 is specifically used to:
  • For the current non-interrupted link determine the node ID of the current node connected to itself and the link ID of the current node through the link management protocol LMP;
  • the direction of the current non-interrupted link is the device to the current node, and the direction of the link of the current node is the current node to the device.
  • the management unit 1105 is further configured to:
  • the link corresponding to any node is determined as the target link, and the current remote information saved by the target link before the interruption is saved as the historical remote information of the target link, and Delete the current remote information of the target link.
  • the management unit 1105 is further configured to:
  • each functional module in each embodiment of the present application may be used. It can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules.
  • the integrated modules if implemented in the form of software functional modules and sold or used as separate products, may be stored in a computer readable storage medium.
  • a computer readable storage medium A number of instructions are included to cause a computer device (which may be a personal computer, server, or network device, etc.) or a processor to perform all or part of the steps of the methods described in various embodiments of the present application.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like. .
  • FIG. 12 is a schematic structural diagram of a label switching router according to an embodiment of the present invention.
  • the device includes a transceiver 1201, a processor 1202, and a memory 1203.
  • the transceiver 1201, the processor 1202, and the memory 1203 are connected to each other.
  • the specific connecting medium between the above components is not limited in the embodiment of the present invention.
  • the memory 1203, the processor 1202, and the transceiver 1201 are connected by a bus 1204 in FIG. 12, and the bus is indicated by a thick line in FIG. 12, and the connection manner between other components is only schematically illustrated. , Not limited to limits.
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 12, but it does not mean that there is only one bus or one type of bus.
  • the transceiver 1201 is configured to receive an LSP establishment request for the first LSP.
  • the processor 1202 is configured to determine, according to the LSP establishment request, that the adjacent downstream node in the first LSP is the second node; when determining that the connection between the self and the second node is interrupted, determining that the corresponding self and the second The link between the nodes and the historical remote information of the link, and further determining that the historical remote information of the link is consistent with the connection information between the first node and the second node carried in the LSP establishment request;
  • the LSP setup request completes the input and output port resource reservation and its own transport layer physical connection establishment.
  • the memory 1203 is used to store the program code executed by the processor 1202, and may be a volatile memory, such as a random access memory (English: random-access memory, abbreviation: RAM);
  • the memory 1203 may also be a non-volatile memory (English: non-volatile memory), such as read-only memory (English: read-only memory, abbreviation: ROM), flash memory (English: flash memory), hard disk (English: hard Disk drive, abbreviated as: HDD) or solid state drive (English: solid-state drive, SSD), or memory 1203 can be used to carry or store desired program code in the form of an instruction or data structure and can be accessed by a computer. Any other medium, but not limited to this.
  • the memory 1203 may be a combination of the above memories.
  • the processor 1202 in the embodiment of the present invention may be a central processing unit (CPU).
  • CPU central processing unit
  • the embodiment of the present invention provides a method and an apparatus for establishing a label switching path by using an interrupted link.
  • the first node receives an LSP establishment request for the first LSP, where the first LSP may be an offline planned LSP. Determining, according to the LSP establishment request, that the neighboring downstream node in the first LSP is the second node.
  • the first node determines, according to the local save, a link corresponding to the connection between itself and the second node, and historical remote information of the link, And further determining the historical remote information of the link and the LSP construction
  • the connection information between the first node and the second node carried in the request is the same.
  • the historical remote information of the link saved by the first node determines that the link is available, and can continue to use the link to issue services. Finally, the first node completes the input and output port resource reservation according to the LSP establishment request, and establishes its own transport layer physical connection establishment.
  • the solution provided by the embodiment of the present invention can realize the seamless connection between the offline planning and the online operation and maintenance. Even if there is a link interruption, the label switching path can be successfully imported into the existing network, so that the network planning and network operation and maintenance are consistent. .
  • the operation and maintenance personnel can realize the rapid release of services, and the first release of the service is to repair the faulty optical fiber, thereby improving the service opening efficiency.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device. Having a series of operational steps performed on a computer or other programmable device to produce computer-implemented processing such that instructions executed on a computer or other programmable device are provided for implementing one or more processes and/or block diagrams in the flowchart. The steps of a function specified in a box or multiple boxes.

Abstract

本发明涉及通信技术领域，特别是涉及一种过中断链路建立标签交换路径的方法及装置，用以解决由于存在链路中断而导致无法按规划的标签交换路径成功导入的问题。该方法为：第一节点接收针对第一LSP的LSP建立请求，根据该LSP建立请求确定自身在第一LSP中的相邻下游节点为第二节点。当第一节点确定自身与第二节点之间的连接中断时，第一节点根据本地保存确定对应自身与第二节点之间的连接的链路，以及该链路的历史远端信息，并进一步确定链路的历史远端信息与LSP建立请求中携带的第一节点与所述第二节点之间的连接信息一致。第一节点根据LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立，提高了业务开通效率。

Description

一种过中断链路建立标签交换路径的方法及装置 技术领域
本发明涉及通信技术领域，特别是涉及一种过中断链路建立标签交换路径的方法及装置。
背景技术
在传统的网络规划中，网络规划完全通过人工方式完成。而与传统的网络规划不同，标签交换网络由于其动态智能、抗多重故障的特性，其网络规划设计的复杂度也相对较高，需要结合多方面因素综合考虑。因此，采用传统的人工方式已经不能满足标签交换网络的规划优化需求，此时的网络规划设计需要通过专门的规划优化工具完成。
规划优化工具中的规划优化算法能够快速计算出满足业务需求的最优网络资源和业务路由。利用它来离线完成网络的规划设计，能够帮助网络运营商合理地规划整个网络，得出网络结构、资源分配、业务分布等多方面的详细方案。
在实际应用过程中，规划优化工具与网络管理***(Network Management System，NMS)需要有互连的接口，参阅图1所示。通过该接口能够实现将网络管理***中的现网数据导出到规划优化工具，以及将网络规划优化设计结果从规划优化工具导入到网络管理***中。通常情况下，网络规划优化设计结果是指标签交换路径(Label Switch Path，LSP)经过的路由，而网络管理***进行业务导入或业务发放，就是指建立一条标签交换路径，即在路径节点上建立交叉连接，形成一条连通的业务路径。因此，将规划优化工具设计的LSP快速通过网络管理***导入现网，使网络的规划和运维融为一体，能够极大地提升运维效率。
但是，由于规划优化工具通常是一种独立的离线工具，因此，在将网络规划优化设计结果通过网络管理***导入到现网时，会存在规划时的网络情 况与业务导入时的网络情况不一致的情形。如果规划的标签交换路径在导入现网时经过中断链路，将会出现端到端的业务发放失败，或者发放的结果与规划的路径不符，导致无法按规划的标签交换路径成功导入，并且可能会影响到整个网络的维护。
发明内容
本发明实施例提供一种过中断链路建立标签交换路径的方法及装置，用以解决将标签交换路径导入现网时，由于存在链路中断而导致无法按规划的标签交换路径成功导入的问题。
本发明实施例提供的具体技术方案如下：
一种过中断链路建立标签交换路径的方法，包括：
第一节点接收针对第一标签交换路径LSP的LSP建立请求；
所述第一节点根据所述LSP建立请求确定自身在所述第一LSP中的相邻下游节点为第二节点；
当所述第一节点确定自身与所述第二节点之间的连接中断时，所述第一节点根据本地保存确定对应自身与所述第二节点之间的连接的链路，以及所述链路的历史远端信息，并进一步确定所述链路的历史远端信息与所述LSP建立请求中携带的所述第一节点与所述第二节点之间的连接信息一致；
所述第一节点根据所述LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立。
可选的，所述第一节点进一步确定所述链路的历史远端信息与所述LSP建立请求中携带的所述第一节点与所述第二节点之间的连接信息一致，包括：
所述第一节点进一步确定所述链路的历史远端信息中包括的远端节点身份信息ID，与所述第一节点与所述第二节点之间的连接信息中包括的所述第二节点的ID一致；
且对应所述链路的历史远端信息中包括的远端链路ID与所述第一节点与所述第二节点之间的连接信息中包括的所述第二节点的链路ID一致。
可选的，还包括：
所述第一节点确定每一个与自身相连的节点对应的非中断链路，以及对应每一个非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网。
可选的，所述第一节点确定每一个与自身相连的节点对应的非中断链路，以及对应每一条非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网，具体包括：
所述第一节点确定每一个与自身相连的节点对应的非中断链路，并针对每一条非中断链路，分别执行：
所述第一节点针对当前非中断链路，通过链路管理协议LMP确定与自身相连的当前节点的节点ID，以及所述当前节点的链路ID；
所述第一节点将所述当前节点的节点ID作为远端节点ID，以及将所述当前节点的链路ID作为远端链路ID；
所述第一节点将所述远端节点ID和所述远端链路ID作为所述当前非中断链路的当前远端信息；
所述第一节点将所述当前非中断链路的当前远端信息编码到路由协议中，并通过所述路由协议洪泛到全网；
其中，所述当前非中断链路的方向为所述第一节点到所述当前节点，所述当前节点的链路的方向为所述当前节点到所述第一节点。
可选的，还包括：
所述第一节点确定与任一节点的连接中断时，所述第一节点确定对应与所述任一节点连接的链路作为目标链路，将所述目标链路在中断前保存的当前远端信息另存为所述目标链路的历史远端信息，并删除所述目标链路的当前远端信息。
所述第一节点将所述目标链路的历史远端信息编码到路由协议中，并通过所述路由协议洪泛到全网。
可选的，还包括：
所述第一节点确定与任一节点的连接中断恢复后，所述第一节点确定对应与所述任一节点连接的链路作为恢复链路；
所述第一节点通过LMP重新获得所述恢复链路的当前远端信息，并删除所述恢复链路的历史远端信息；
所述第一节点将所述恢复链路的最新当前远端信息编码到路由协议中，并通过所述路由协议洪泛到全网。
一种过中断链路建立标签交换路径的装置，包括：
接收单元，用于接收针对第一LSP的LSP建立请求；
确定单元，用于根据所述LSP建立请求确定自身在所述第一LSP中的相邻下游节点为第二节点；
分析单元，用于当确定自身与所述第二节点之间的连接中断时，根据本地保存确定对应自身与所述第二节点之间的连接的链路，以及所述链路的历史远端信息，并进一步确定所述链路的历史远端信息与所述LSP建立请求中携带的所述第一节点与所述第二节点之间的连接信息一致；
建立单元，用于根据所述LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立。
可选的，确定所述链路的历史远端信息与所述LSP建立请求中携带的所述第一节点与所述第二节点之间的连接信息一致时，所述分析单元具体用于：
确定所述链路的历史远端信息中包括的远端节点身份信息ID，与所述第一节点与所述第二节点之间的连接信息中包括的所述第二节点的ID一致；
且对应所述链路的历史远端信息中包括的远端链路ID与所述第一节点与所述第二节点之间的连接信息中包括的所述第二节点的链路ID一致。
可选的，还包括：
管理单元，用于确定每一个与自身相连的节点对应的非中断链路，以及对应每一个非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网。
可选的，确定每一个与自身相连的节点对应的非中断链路，以及对应每 一条非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网时，所述管理单元具体用于：
确定每一个与自身相连的节点对应的非中断链路，并针对每一条非中断链路，分别执行：
针对当前非中断链路，通过链路管理协议LMP确定与自身相连的当前节点的节点ID，以及所述当前节点的链路ID；
将所述当前节点的节点ID作为远端节点ID，以及将所述当前节点的链路ID作为远端链路ID；
将所述远端节点ID和所述远端链路ID作为所述当前非中断链路的当前远端信息；
以及将所述当前非中断链路的当前远端信息编码到路由协议中，并通过所述路由协议洪泛到全网；
其中，所述当前非中断链路的方向为所述装置到所述当前节点，所述当前节点的链路的方向为所述当前节点到所述装置。
可选的，所述管理单元还用于：
确定与任一节点的连接中断时，确定对应与所述任一节点连接的链路作为目标链路，将所述目标链路在中断前保存的当前远端信息另存为所述目标链路的历史远端信息，并删除所述目标链路的当前远端信息。
以及将所述目标链路的历史远端信息编码到路由协议中，并通过所述路由协议洪泛到全网。
可选的，所述管理单元还用于：
确定与任一节点的连接中断恢复后，确定对应与所述任一节点连接的链路作为恢复链路；
通过LMP重新获得所述恢复链路的当前远端信息，并删除所述恢复链路的历史远端信息；
以及将所述恢复链路的最新当前远端信息编码到路由协议中，并通过所述路由协议洪泛到全网。
一种标签交换路由器，该设备包括收发器、处理器、存储器。收发器、处理器以及存储器相互连接；
收发器，用于接收针对第一LSP的LSP建立请求；
处理器，用于根据LSP建立请求确定自身在第一LSP中的相邻下游节点为第二节点；当确定自身与第二节点之间的连接中断时，根据本地保存确定对应自身与第二节点之间的连接的链路，以及链路的历史远端信息，并进一步确定链路的历史远端信息与LSP建立请求中携带的第一节点与第二节点之间的连接信息一致；根据LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立；
存储器，用于存储处理器执行的程序代码。
综上所述，本发明实施例提供一种过中断链路建立标签交换路径的方法和装置，第一节点接收针对第一LSP的LSP建立请求，这里的第一LSP可以为离线规划的LSP，根据该LSP建立请求确定自身在所述第一LSP中的相邻下游节点为第二节点。当第一节点确定自身与第二节点之间的连接中断时，第一节点根据本地保存确定对应自身与所述第二节点之间的连接的链路，以及该链路的历史远端信息，并进一步确定链路的历史远端信息与所述LSP建立请求中携带的第一节点与所述第二节点之间的连接信息一致。通过第一节点保存的链路的历史远端信息，确定该链路可用，可以继续使用该链路发放业务。最后，第一节点根据LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立。这样采用本发明实施例提供的方案能够实现让离线规划与在线运维的无缝衔接，即使存在链路中断也能按规划的标签交换路径成功导入现网，使得网络规划和网络运维保持一致。进一步地，运维人员能够实现快速发放业务，实现先发放业务在对故障光纤进行修复，提高了业务开通效率。
附图说明
图1为本发明背景技术中通过网络管理***导入规划优化工具计算路径 的示意图；
图2为本发明实施例中MPLS网络架构示意图；
图3为本发明实施例中节点A和节点B连接示意图；
图4为本发明实施例中路由协议携带历史远端对象的示意图；
图5为本发明实施例中节点A、节点B以及节点C的连接关系示意图；
图6为本发明实施例中标签交换网络中各节点的连接关系示意图；
图7为本发明实施例中过中断链路路由计算流程图；
图8为本发明实施例中过中断链路建立标签交换路径的概述流程图；
图9为本发明实施例中过中断链路建立标签交换路径的实施例1的流程图；
图10为本发明实施例中过中断连接建立标签交换路径的实施例2的流程图；
图11为本发明实施例中过中断链路建立标签交换路径的装置结构示意图；
图12为本发明实施例中一种标签交换路由器的结构示意图。
具体实施方式
为使本发明实施例的目的、技术方案和优点更加清楚，下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护的范围。
本发明实施例提供了一种过中断链路建立标签交换路径的方法及装置，用以解决规划的标签交换路径在导入现网时存在链路中断，导致无法按规划的标签交换路径成功导入的问题。其中，方法和装置是基于同一发明构思的，由于方法及装置解决问题的原理相似，因此装置与方法的实施可以相互参见，重复之处不再赘述。
本发明实施例的主要应用场景为通用多标签交换协议(Generalized Multiprotocol Label Switching，GMPLS)网络、多标签交换协议(Multiprotocol Label Switching，MPLS)网络。下面以MPLS网络为例对MPLS网络的架构进行简要说明，GMPLS网络的架构与MPLS网络的架构基本相同。参阅图2所示，MPLS网络的基本构成单元为标签交换路由器，即节点，每个节点由两部分组成，控制平面和转发平面。其中，控制平面负责标签的分配、路由选择、标签转发表的建立、标签交换路径的建立、拆除等工作。转发平面负责依据标签转发表对收到的分组进行转发。此外，在MPLS网络中还可以包括节点控制器，用于对每个节点发出控制指令。
下面结合附图对本发明优选的实施方式进行详细说明。
在本发明实施例中，不涉及用户数据的转发，因此下文提到的节点的各种行为均由节点的控制平面完成。
节点管理经过自身的每一条链路对应的链路信息，具体至少包括以下三个方面：
第一，节点确定每一个与自身相连的节点对应的非中断链路，以及对应每一个非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网。
例如，参阅图3所示，节点A与节点B相连，假设节点A和节点B之间的连接正常，为非中断链路。节点A根据自身保存的链路索引标识确定该连接的链路ID为ID_1，方向从节点A到节点B，节点B根据自身保存的链路索引标识确定该连接的链路ID为ID_2，方向从节点B到节点A。进一步地，节点A通过链路管理协议(Link Management Protocol，LMP)确定针对链路ID_1的当前远端信息，
具体的，节点A针对链路ID_1，通过链路管理协议LMP确定与自身相连的当前节点为节点B，以及节点B的链路ID，ID_2。
节点A将节点B的节点ID作为远端节点ID，以及将节点B的链路ID作为远端链路ID。
当前远端信息至少包括：远端节点ID和远端链路ID。因此，链路ID_1的当前远端信息为：(B、ID_2)。同理，节点B通过LMP确定针对链路ID_2的当前远端信息，得到链路ID_2的当前远端信息为：(A、ID_1)。
在确定链路ID_1的当前远端信息后，节点A将链路ID_1的当前远端信息保存到本地数据库，以及将链路ID_1的当前远端信息编码在路由协议开放式最短路径优先(Open Shortest Path First，OSPF)的OSPF/IS-IS对象中，并通过该路由协议将链路ID_1的当前远端信息洪泛到全网。节点B与节点A的处理过程相同，因此不再赘述。
第二，节点确定与任一节点的连接中断时，节点确定对应与该任一节点连接的链路作为目标链路，将目标链路在中断前保存的当前远端信息另存为目标链路的历史远端信息，并删除目标链路的当前远端信息，以及将目标链路的历史远端信息编码到路由协议中，并通过路由协议洪泛到全网。
具体的，仍以图3为例，假设节点A通过LMP确定与节点B之间的连接中断，即链路ID_1中断时，节点A将链路ID_1在中断前的当前远端信息(B、ID_2)另存为链路ID_1的历史远端信息，并删除链路ID_1的当前远端信息，以及通过路由协议将链路ID_1的历史远端信息洪泛到全网。这里需要在路由协议中扩展新的对象，即历史远端信息对象，参阅图4所示。
此外，节点确定与任一节点的连接中断恢复后，节点确定对应与该任一节点连接的链路作为恢复链路，并通过LMP重新获得该恢复链路的当前远端信息，并删除所恢复链路的历史远端信息。
接着，节点将该恢复链路的最新当前远端信息编码到路由协议中，并通过路由协议洪泛到全网。
具体的，假如故障中断链路ID_1重新恢复正常，节点A通过LMP重新校验，得到链路ID_1的当前远端信息(B、ID_2)，并删除链路ID_1的历史远端信息，以及通过路由协议将链路ID_1的最新当前远端信息洪泛到全网。
第三，在节点重启恢复后，节点从本地数据库中恢复每一条链路的当前远端信息或历史远端信息，并对每一条链路进行校验。
例如，当节点A重启恢复后，节点A从本地数据中恢复重启前保存的与自身相连的每一条非中断链路的当前远端信息，并重新校验每一条非中断链路。若确定其中存在中断链路时，将该中断链路的当前远端信息另存为该中断链路的历史远端信息，并删除该中断链路的当前远端信息。若确定其中存在当前远端信息与重启前保存的当前远端信息不一致的未中断链路时，则更新该未中断链路的当前远端信息。
节点A从本地数据库中恢复重启前保存的与自身相连的每一条中断链路的历史远端信息，并重新校验每一条中断链路，若确定其中存在恢复正常的链路时，则确定该恢复正常的链路对应的当前远端信息，并将该恢复正常的链路对应的历史远端信息删除。
上述恢复和校验过程能够保证链路信息的准确性，在检验完成后，节点A通过路由协议将所有校验后的非中断链路分别对应的当前远端信息，以及所有校验后的中断链路分别对应的历史远端信息洪泛到全网。
可选的，本发明实施例还提供另一种节点管理经过自身的每一条链路对应的链路信息的方法：
第一，节点保存与自身相连的每一条链路对应的一对当前远端信息和历史远端信息。
例如，仍以图3为例，在节点A确定链路ID_1的当前远端信息后，节点A将将链路ID_1的当前远端信息同时另存为链路ID_1的历史远端信息，并将这两个相同的信息保存到本地数据库，以及通过路由协议将链路ID_1对应的一对当前远端信息和历史远端信息洪泛到全网。
此外，当节点确定任一链路的当前远端信息变化时，更新该链路的历史远端信息，使该链路的当前远端信息和历史远端信息保持一致。
例如，参阅图5所示，假设节点A的链路ID_1的当前远端信息为(B、ID_2)，某一时刻之后，节点A与节点B不再具有连接关系，而节点A与节点C建立连接关系，通过LMP校验，节点A确定链路ID_1的当前远端信息为：(C、ID_3)，此时链路ID_1的历史远端信息仍为:(B、ID_2)，节点A 确定与链路ID_1的当前远端信息与历史远端信息不一致，节点A采用链路ID_1的当前远端信息更新其历史远端信息使两者保持一致，并通过路由协议将链路ID_1对应的一对最新的当前远端信息与历史远端信息洪泛到全网。
第二，节点确定与任一节点的连接中断时，删除对应该连接的链路的当前远端信息，保留对应该链路的历史远端信息。
例如，仍以图3为例，假设节点A通过LMP确定与节点B之间的连接中断，即链路ID_1中断时，节点A将链路ID_1在中断前的当前远端信息(B、ID_2)删除，保留链路ID_1的历史远端信息(B、ID_2)，以及通过路由协议将链路ID_1的历史远端信息洪泛到全网。
进一步地，假如故障中断链路ID_1重新恢复正常，节点A通过LMP重新校验，得到链路ID_1的当前远端信息(B、ID_2)，并始终使得链路ID_1的当前远端信息和历史远端信息保持一致，然后通过路由协议将链路ID_1对应的一对最新当前远端信息和历史远端信息洪泛到全网。
第三，在节点重启恢复后，节点从本地数据库中恢复每一条非中断链路对应的一对当前远端信息和历史远端信息，以及每一条中断链路对应的历史远端信息，并对每一条链路进行校验。
例如，当节点A重启恢复后，节点A从本地数据中恢复重启前保存的与自身相连的每一条非中断链路对应的一对当前远端信息和历史远端信息，并重新校验每一条非中断链路。若确定其中存在中断链路时，则删除该中断链路的当前远端信息，保留该中断链路的历史远端信息。若确定其中存在当前远端信息与重启前保存的当前远端信息不一致的未中断链路时，则更新该未中断链路的历史远端信息，使得该未中断链路的当前远端信息和历史远端信息保持一致。
节点A从本地数据库中恢复重启前保存的与自身相连的每一条中断链路的历史远端信息，并重新校验每一条中断链路，若确定其中存在恢复正常的链路时，则确定该恢复正常的链路对应的当前远端信息，并保存该恢复正常的链路对应的一对当前远端信息和历史远端信息。
上述恢复和校验过程能够保证链路信息的准确性，在检验完成后，节点A通过路由协议将所有校验后的非中断链路分别对应的一对当前远端信息和历史远端信息，以及所有校验后的中断链路分别对应的历史远端信息洪泛到全网。
进一步地，每一个节点都能执行过中断链路的端到端业务路由计算，此外，该路由计算过程可以由节点完成，也可以由节点控制器等第三方完成。
节点在进行路由计算时，需要知道全网所有节点的链路信息，而全网所有节点的链路信息是通过每一个节点将自身的链路信息洪泛到全网得到的。因此，上述节点管理经过自身的每一条链路对应的链路信息中提到的信息洪泛的作用在路由计算过程得以体现。
参阅图6和图7所示，下面以节点N1为例，具体说明过中断链路路由计算过程：
步骤701：节点N1接收用户发起的业务路径建立请求。
其中，业务路径建立请求中可以指定必经链路建立LSP，例如，N2->N5，N7->N9，也可以是由规划优化工具规划得到的完整LSP，例如，N1->N2->N5->N7->N9。
此外，节点A还支持用户发起的业务路径预计算请求，预计算是指只计算路径，不进行路径建立。
步骤702：节点N1根据业务路径建立请求进行路由计算确定该请求对应的首节点以及与首节点相邻的下游节点，并判断首节点与相邻下游节点之间连接是否中断，若未中断执行步骤703，否则执行步骤704。
这里节点N1可以为首节点，也可以为该业务路径请求对应的LSP中的任一节点，或者网络中其他节点。首节点可以由业务路径建立请求指定，也可以根据业务路径建立请求计算得到，同理，与首节点相邻的下游节点可以由业务路径建立请求指定，也可以根据业务路径建立请求计算得到。
步骤703：节点N1根据首节点的链路的当前远端信息进行校验，若校验通过，执行步骤705，否则执行步骤708。
具体的，节点N1根据首节点的链路的当前远端信息确定远端节点ID为相邻下游节点的ID，且远端链路ID为相邻下游节点的链路ID，则校验通过。
步骤704：节点N1根据首节点的链路的历史远端信息进行校验，若校验通过，执行步骤705，否则执行步骤708。
具体的，节点N1根据首节点的链路的历史远端信息确定远端节点ID为相邻下游节点的ID，且远端链路ID为相邻下游节点的链路ID，则校验通过。
步骤705：节点N1针对首节点的链路进行带宽资源计算，判断是否有可用带宽资源，若确定有可用的带宽资源，则执行步骤706，否则执行步骤708。
具体的，节点N1判断是否还有可用的带宽资源分配给首节点的链路。
步骤706：节点N1根据业务路径建立请求继续确定与该相邻下游节点相邻的下游节点，即重复上述步骤702至705，直到完成针对该业务建立请求的LSP的端到端路由计算过程。
具体的，假设该业务路径请求对应的LSP的首节点为节点N1，与节点N1相邻的下游节点为N2，则在步骤705确定有可用带宽资源分配给节点N1的链路之后，节点N1继续根据业务路径建立请求，继续确定与节点N2相邻的下游节点，假设N2->N5为业务路径建立请求规定的必经链路，则直接确定与节点N2相邻的下游节点为N5，否则，节点N1需根据业务路径建立请求经过路由计算确定与节点N2相邻的下游节点。重复上述步骤702至步骤705，完成针对该业务路径建立请求的整个LSP的端到端路由计算过程。
步骤707：节点N1完成针对该业务建立请求的LSP的端到端业务路由计算过程后，通过MPLS/GMPLS信令协议启动建立该LSP。
步骤708：节点N1结束路由计算，反馈给用户路由计算失败指示。
本发明实施例还提供了一种过中断链路建立标签交换路径的方法，参阅图8所示，其具体流程为：
步骤801：第一节点接收针对第一LSP的LSP建立请求。
具体的，第一节点接收由第一节点的相邻上游节点发送的针对第一LSP的LSP建立请求；
或者，第一节点接收由节点控制器发送的针对第一LSP的LSP建立请求。
这里的LSP建立请求可以携带第一LSP的完整路径信息，或者携带第一节点到末节点的路径信息，或者携带第一节点到第二节点的路径信息。
须知，这里的第一节点可以是除末节点外的第一LSP中的任意一个节点。
可选地，在该LSP建立请求中可以携带允许过中断链路建立业务路径的标识，选择是否执行过中断链路建立LSP。
步骤802：第一节点根据LSP建立请求确定自身在第一LSP中的相邻下游节点为第二节点。
LSP建立请求是针对完成端到端业务路由计算过程后得到LSP的LSP建立请求，LSP建立请求中包含整个LSP经过的路由，因此，第一节点根据针对第一LSP的LSP建立请求可以确定自身在第一LSP中的相邻下游节点，即第二节点。
步骤803：当第一节点确定自身与第二节点之间的连接中断时，第一节点根据本地保存确定对应自身与第二节点之间的连接的链路，以及链路的历史远端信息，并进一步确定链路的历史远端信息与LSP建立请求中携带的第一节点与第二节点之间的连接信息一致。
具体的，第一节点进一步确定链路的历史远端信息与LSP建立请求中携带的第一节点与第二节点之间的连接信息一致，包括：
第一节点进一步确定链路的历史远端信息中包括的远端节点身份信息ID，与第一节点与第二节点之间的连接信息中包括的第二节点的ID一致，且对应链路的历史远端信息中包括的远端链路ID与第一节点与第二节点之间的连接信息中包括的第二节点的链路ID一致。
步骤804：第一节点根据LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立。
第一节点完成标准协议规定的资源预留和交叉建立。
此外，在第一标签交换路径的建立完成之后，还包括：
当第一节点确定自身与第二节点之间的连接为中断时，若第一节点确定 第一LSP的业务重路由属性为锁定，则不针对第一LSP发起重路由；
或者，当第一节点确定自身与第二节点之间的连接为中断时，若第一节点确定第一LSP的业务重路由属性为不锁定，则针对第一LSP发起重路由。
实施例1：
参阅图6和图9所示，针对一条完成端到端的路由计算的LSP，N1->N2->N5->N7->N9，从首节点(N1)开始发起针对该LSP的业务路径建立流程为：
步骤901：首节点接收由节点控制器发送的针对该完成端到端的路由计算的LSP的LSP建立请求。
这里针对该LSP的算路过程可以是由首节点完成，也可以由节点控制器完成，这里的LSP建立请求是由节点控制器发送给首节点，该请求中可以携带首节点至节点N2的路径消息，或者首节点至节点N9的路径消息。
步骤902：首节点根据LSP建立请求确定自身的相邻下游节点N2。
步骤903：首节点判断自身与节点N2之间的连接是否中断，若自身与节点N2之间的连接为中断，执行步骤904；否则执行步骤905。
步骤904：首节点确定自身与节点N2之间的连接为中断，首节点根据本地保存确定对应自身与节点N2之间的连接的链路，以及该链路的历史远端信息，并进一步确定该链路的历史远端信息与该LSP建立请求中携带的首节点与节点N2之间的连接信息一致，执行步骤905；否则，执行步骤906。
具体的，假设首节点确定对应自身与节点N2之间的连接的链路为链路ID_3，和该链路的历史远端信息(N2、ID_2)，并根据该LSP建立请求中携带的首节点与节点N2之间的连接信息中包含的信息(N2、ID_2)，确定两者完全一致，校验通过，执行步骤905。
若该链路的历史远端信息(N2、ID_3)，而该LSP建立请求中携带的首节点与节点N2之间的连接信息中包含的信息(N2、ID_3)，则校验失败，执行步骤906。
步骤905：首节点根据LSP建立请求完成输入输出端口资源预留，以及 自身的传送层物理连接建立，继续执行步骤907。
步骤906：首节点确定针对该LSP的建路失败，结束流程。
步骤907：首节点发送路径建立成功消息至节点控制器。
节点控制器接收到首节点发送的路径建立成功消息后，发送LSP建立请求至节点N2，该LSP建立请求中可以携带节点N2至节点N5的路径消息，或者，节点N2至节点N9的路径消息，又或者首节点至节点N9的路径消息。
节点N2执行与上述首节点(N1)相同的建路过程，并在完成与节点N5的建路后发送路径建立成功消息至节点控制器，节点控制器收到由节点N2发送的路径建立成功消息后，发送LSP建立请求至节点N5，以此类推，直至节点控制器收到节点N7返回的路径建立成功消息，完成整个LSP的建路过程，即N1->N2->N5->N7->N9的建路完毕，业务路径发放成功。
此外，在该LSP建立完成后，当首节点确定自身与节点N2之间的连接为中断时，若首节点确定该LSP的业务重路由属性为锁定，则不针对该LSP发起重路由；或者，首节点确定自身与节点N2之间的连接为中断时，若首节点确定该LSP的业务重路由属性为不锁定，则针对该LSP发起重路由。
实施例2：
参阅图6和图10所示，针对一条完成端到端的路由计算的LSP，N1->N3->N4->N5->N8，假设节点N1与节点N3之间的建路过程已完成，此时从节点N3与节点N4之间的业务路径建立流程为：
步骤1001：节点N3接收由节点N1发送的LSP建立请求。
该路径建立请求中携带节点N3至节点N8的路径信息。
步骤1002：节点N3根据LSP建立请求确定自身的相邻下游节点N4。
步骤1003：节点N3判断自身与节点N4之间的连接是否中断，若自身与节点N4之间的连接为中断，执行步骤1004；否则执行步骤1005。
步骤1004：节点N3确定自身与节点N4之间的连接为中断时，节点N3根据本地保存确定对应自身与节点N4之间的连接的链路，以及该链路的历史远端信息，并进一步确定该链路的历史远端信息与该LSP建立请求中携带的 节点N3与节点N4之间的连接信息一致，执行步骤1005；否则，执行步骤1006。
具体的，假设节点N3确定对应自身与节点N4之间的连接的链路为链路ID_1，和该链路的历史远端信息(N4、ID_2)，并根据该LSP建立请求中携带的节点N3与节点N4之间的连接信息中包含的信息(N4、ID_2)，确定两者完全一致，校验通过，执行步骤1005。
步骤1005：节点N3根据LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立，继续执行步骤1007。
步骤1006：节点N3确定针对该LSP的建路失败，结束流程。
步骤1007：节点N3发送LSP建立请求至节点N4。
节点N3发送的LSP建立请求中携带节点N4至节点N8的路径信息。
节点N4接收到节点N3发送的LSP建立请求后，继续节点N4与节点N5之间的业务路径建立流程。
参阅图11所示，本发明实施例提供一种过中断链路建立标签交换路径的装置，具体包括：
接收单元1101，用于接收针对第一LSP的LSP建立请求；
确定单元1102，用于根据LSP建立请求确定自身在第一LSP中的相邻下游节点为第二节点；
分析单元1103，用于当确定自身与第二节点之间的连接中断时，根据本地保存确定对应自身与第二节点之间的连接的链路，以及链路的历史远端信息，并进一步确定链路的历史远端信息与LSP建立请求中携带的第一节点与第二节点之间的连接信息一致；
建立单元1104，用于根据LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立。
可选的，确定链路的历史远端信息与LSP建立请求中携带的第一节点与第二节点之间的连接信息一致时，分析单元1103具体用于：
确定链路的历史远端信息中包括的远端节点身份信息ID，与第一节点与 第二节点之间的连接信息中包括的第二节点的ID一致；
且对应链路的历史远端信息中包括的远端链路ID与第一节点与第二节点之间的连接信息中包括的第二节点的链路ID一致。
可选的，还包括：
管理单元1105，于确定每一个与自身相连的节点对应的非中断链路，以及对应每一个非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网。
可选的，确定每一个与自身相连的节点对应的非中断链路，以及对应每一条非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网时，管理单元1105具体用于：
确定每一个与自身相连的节点对应的非中断链路，并针对每一条非中断链路，分别执行：
针对当前非中断链路，通过链路管理协议LMP确定与自身相连的当前节点的节点ID，以及当前节点的链路ID；
将当前节点的节点ID作为远端节点ID，以及将当前节点的链路ID作为远端链路ID；
将远端节点ID和远端链路ID作为当前非中断链路的当前远端信息；
以及将当前非中断链路的当前远端信息编码到路由协议中，并通过路由协议洪泛到全网；
其中，当前非中断链路的方向为装置到当前节点，当前节点的链路的方向为当前节点到装置。
可选的，管理单元1105还用于：
确定与任一节点的连接中断时，确定对应与任一节点连接的链路作为目标链路，将目标链路在中断前保存的当前远端信息另存为目标链路的历史远端信息，并删除目标链路的当前远端信息。
以及将目标链路的历史远端信息编码到路由协议中，并通过路由协议洪泛到全网。
可选的，管理单元1105还用于：
确定与任一节点的连接中断恢复后，确定对应与任一节点连接的链路作为恢复链路；
通过LMP重新获得恢复链路的当前远端信息，并删除恢复链路的历史远端信息；
以及将恢复链路的最新当前远端信息编码到路由协议中，并通过路由协议洪泛到全网。
需要说明的是，本发明实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，另外，在本申请各个实施例中的各功能模块可以集成在一个处理模块中，也可以是各个模块单独物理存在，也可以两个或两个以上模块集成在一个模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。
所述集成的模块如果以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)或处理器(processor)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
本发明实施例还提供了一种标签交换路由器，如图12所示，图12为本发明实施例中标签交换路由器的结构示意图，该设备包括收发器1201、处理器1202、存储器1203。收发器1201、处理器1202以及存储器1203相互连接。本发明实施例中不限定上述部件之间的具体连接介质。本发明实施例在图12中以存储器1203、处理器1202以及收发器1201之间通过总线1204连接，总线在图12中以粗线表示，其它部件之间的连接方式，仅是进行示意性说明， 并不引以为限。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示，图12中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
本发明实施例中，收发器1201，用于接收针对第一LSP的LSP建立请求。
处理器1202，用于根据LSP建立请求确定自身在第一LSP中的相邻下游节点为第二节点；当确定自身与第二节点之间的连接中断时，根据本地保存确定对应自身与第二节点之间的连接的链路，以及链路的历史远端信息，并进一步确定链路的历史远端信息与LSP建立请求中携带的第一节点与第二节点之间的连接信息一致；根据LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立。
本发明实施例中存储器1203，用于存储处理器1202执行的程序代码，可以是易失性存储器(英文：volatile memory)，例如随机存取存储器(英文：random-access memory，缩写：RAM)；存储器1203也可以是非易失性存储器(英文：non-volatile memory)，例如只读存储器(英文：read-only memory，缩写：ROM)，快闪存储器(英文：flash memory)，硬盘(英文：hard disk drive，缩写：HDD)或固态硬盘(英文：solid-state drive，缩写：SSD)、或者存储器1203是能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。存储器1203可以是上述存储器的组合。
本发明实施例中处理器1202，可以是一个中央处理单元(英文：central processing unit，简称CPU)。
综上所述，本发明实施例提供一种过中断链路建立标签交换路径的方法和装置，第一节点接收针对第一LSP的LSP建立请求，这里的第一LSP可以为离线规划的LSP，根据该LSP建立请求确定自身在所述第一LSP中的相邻下游节点为第二节点。当第一节点确定自身与第二节点之间的连接中断时，第一节点根据本地保存确定对应自身与所述第二节点之间的连接的链路，以及该链路的历史远端信息，并进一步确定链路的历史远端信息与所述LSP建 立请求中携带的第一节点与所述第二节点之间的连接信息一致。通过第一节点保存的链路的历史远端信息，确定该链路可用，可以继续使用该链路发放业务。最后，第一节点根据LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立。
这样采用本发明实施例提供的方案能够实现让离线规划与在线运维的无缝衔接，即使存在链路中断也能按规划的标签交换路径成功导入现网，使得网络规划和网络运维保持一致。
进一步地，运维人员能够实现快速发放业务，实现先发放业务在对故障光纤进行修复，提高了业务开通效率。
本领域内的技术人员应明白，本发明的实施例可提供为方法、***、或计算机程序产品。因此，本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(***)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上， 使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管已描述了本发明的优选实施例，但本领域内的技术人员一旦得知了基本创造性概念，则可对这些实施例作出另外的变更和修改。所以，所附权利要求意欲解释为包括优选实施例以及落入本发明范围的所有变更和修改。
显然，本领域的技术人员可以对本发明实施例进行各种改动和变型而不脱离本发明实施例的精神和范围。这样，倘若本发明实施例的这些修改和变型属于本发明权利要求及其等同技术的范围之内，则本发明也意图包含这些改动和变型在内。

Claims (12)

  1. 一种过中断链路建立标签交换路径的方法，其特征在于，包括：
    第一节点接收针对第一标签交换路径LSP的LSP建立请求；
    所述第一节点根据所述LSP建立请求确定自身在所述第一LSP中的相邻下游节点为第二节点；
    当所述第一节点确定自身与所述第二节点之间的连接中断时，所述第一节点根据本地保存确定对应自身与所述第二节点之间的连接的链路，以及所述链路的历史远端信息，并进一步确定所述链路的历史远端信息与所述LSP建立请求中携带的所述第一节点与所述第二节点之间的连接信息一致；
    所述第一节点根据所述LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立。
  2. 如权利要求1所述的方法，其特征在于，所述第一节点进一步确定所述链路的历史远端信息与所述LSP建立请求中携带的所述第一节点与所述第二节点之间的连接信息一致，包括：
    所述第一节点进一步确定所述链路的历史远端信息中包括的远端节点身份信息ID，与所述第一节点与所述第二节点之间的连接信息中包括的所述第二节点的ID一致；
    且对应所述链路的历史远端信息中包括的远端链路ID与所述第一节点与所述第二节点之间的连接信息中包括的所述第二节点的链路ID一致。
  3. 如权利要求1所述的方法，其特征在于，还包括：
    所述第一节点确定每一个与自身相连的节点对应的非中断链路，以及对应每一个非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网。
  4. 如权利要求3所述的方法，其特征在于，所述第一节点确定每一个与自身相连的节点对应的非中断链路，以及对应每一条非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网，具体包括：
    所述第一节点确定每一个与自身相连的节点对应的非中断链路，并针对每一条非中断链路，分别执行：
    所述第一节点针对当前非中断链路，通过链路管理协议LMP确定与自身相连的当前节点的节点ID，以及所述当前节点的链路ID；
    所述第一节点将所述当前节点的节点ID作为远端节点ID，以及将所述当前节点的链路ID作为远端链路ID；
    所述第一节点将所述远端节点ID和所述远端链路ID作为所述当前非中断链路的当前远端信息；
    所述第一节点将所述当前非中断链路的当前远端信息编码到路由协议中，并通过所述路由协议洪泛到全网；
    其中，所述当前非中断链路的方向为所述第一节点到所述当前节点，所述当前节点的链路的方向为所述当前节点到所述第一节点。
  5. 如权利要求4所述的方法，其特征在于，还包括：
    所述第一节点确定与任一节点的连接中断时，所述第一节点确定对应与所述任一节点连接的链路作为目标链路，将所述目标链路在中断前保存的当前远端信息另存为所述目标链路的历史远端信息，并删除所述目标链路的当前远端信息。
    所述第一节点将所述目标链路的历史远端信息编码到路由协议中，并通过所述路由协议洪泛到全网。
  6. 如权利要求5所述的方法，其特征在于，还包括：
    所述第一节点确定与任一节点的连接中断恢复后，所述第一节点确定对应与所述任一节点连接的链路作为恢复链路；
    所述第一节点通过LMP重新获得所述恢复链路的当前远端信息，并删除所述恢复链路的历史远端信息；
    所述第一节点将所述恢复链路的最新当前远端信息编码到路由协议中，并通过所述路由协议洪泛到全网。
  7. 一种过中断链路建立标签交换路径的装置，其特征在于，包括：
    接收单元，用于接收针对第一LSP的LSP建立请求；
    确定单元，用于根据所述LSP建立请求确定自身在所述第一LSP中的相邻下游节点为第二节点；
    分析单元，用于当确定自身与所述第二节点之间的连接中断时，根据本地保存确定对应自身与所述第二节点之间的连接的链路，以及所述链路的历史远端信息，并进一步确定所述链路的历史远端信息与所述LSP建立请求中携带的所述第一节点与所述第二节点之间的连接信息一致；
    建立单元，用于根据所述LSP建立请求完成输入输出端口资源预留，以及自身的传送层物理连接建立。
  8. 如权利要求7所述的装置，其特征在于，确定所述链路的历史远端信息与所述LSP建立请求中携带的所述第一节点与所述第二节点之间的连接信息一致时，所述分析单元具体用于：
    确定所述链路的历史远端信息中包括的远端节点身份信息ID，与所述第一节点与所述第二节点之间的连接信息中包括的所述第二节点的ID一致；
    且对应所述链路的历史远端信息中包括的远端链路ID与所述第一节点与所述第二节点之间的连接信息中包括的所述第二节点的链路ID一致。
  9. 如权利要求7所述的装置，其特征在于，还包括：
    管理单元，用于确定每一个与自身相连的节点对应的非中断链路，以及对应每一个非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网。
  10. 如权利要求9所述的装置，其特征在于，确定每一个与自身相连的节点对应的非中断链路，以及对应每一条非中断链路的当前远端信息，并将获得的所有非中断链路的当前远端信息洪泛到全网时，所述管理单元具体用于：
    确定每一个与自身相连的节点对应的非中断链路，并针对每一条非中断链路，分别执行：
    针对当前非中断链路，通过链路管理协议LMP确定与自身相连的当前节点的节点ID，以及所述当前节点的链路ID；
    将所述当前节点的节点ID作为远端节点ID，以及将所述当前节点的链路ID作为远端链路ID；
    将所述远端节点ID和所述远端链路ID作为所述当前非中断链路的当前远端信息；
    以及将所述当前非中断链路的当前远端信息编码到路由协议中，并通过所述路由协议洪泛到全网；
    其中，所述当前非中断链路的方向为所述装置到所述当前节点，所述当前节点的链路的方向为所述当前节点到所述装置。
  11. 如权利要求10所述的装置，其特征在于，所述管理单元还用于：
    确定与任一节点的连接中断时，确定对应与所述任一节点连接的链路作为目标链路，将所述目标链路在中断前保存的当前远端信息另存为所述目标链路的历史远端信息，并删除所述目标链路的当前远端信息。
    以及将所述目标链路的历史远端信息编码到路由协议中，并通过所述路由协议洪泛到全网。
  12. 如权利要求11所述的装置，其特征在于，所述管理单元还用于：
    确定与任一节点的连接中断恢复后，确定对应与所述任一节点连接的链路作为恢复链路；
    通过LMP重新获得所述恢复链路的当前远端信息，并删除所述恢复链路的历史远端信息；
    以及将所述恢复链路的最新当前远端信息编码到路由协议中，并通过所述路由协议洪泛到全网。
PCT/CN2015/091983 2015-10-15 2015-10-15 一种过中断链路建立标签交换路径的方法及装置 WO2017063166A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/091983 WO2017063166A1 (zh) 2015-10-15 2015-10-15 一种过中断链路建立标签交换路径的方法及装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/091983 WO2017063166A1 (zh) 2015-10-15 2015-10-15 一种过中断链路建立标签交换路径的方法及装置

Publications (1)

Publication Number Publication Date
WO2017063166A1 true WO2017063166A1 (zh) 2017-04-20

Family

ID=58516978

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/091983 WO2017063166A1 (zh) 2015-10-15 2015-10-15 一种过中断链路建立标签交换路径的方法及装置

Country Status (1)

Country Link
WO (1) WO2017063166A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108809679A (zh) * 2017-05-03 2018-11-13 腾讯科技（深圳）有限公司 对网络节点的控制方法、装置及监控设备
CN112039765A (zh) * 2019-06-03 2020-12-04 中兴通讯股份有限公司 路由信息发送的方法、路由选路的方法和装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030223371A1 (en) * 2002-06-03 2003-12-04 Alcatel Device and method for controlling profiles, in particular data flows, in a communications network
US20060080421A1 (en) * 2003-09-03 2006-04-13 Sbc Knowledge Ventures, L.P. Method and system for automating membership discovery in a distributed computer network
CN102136936A (zh) * 2010-11-24 2011-07-27 华为技术有限公司 避免控制平面故障影响转发平面运行的方法、节点及***
CN102142969A (zh) * 2010-12-31 2011-08-03 华为技术有限公司 一种p2mp的建立方法、装置和***

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030223371A1 (en) * 2002-06-03 2003-12-04 Alcatel Device and method for controlling profiles, in particular data flows, in a communications network
US20060080421A1 (en) * 2003-09-03 2006-04-13 Sbc Knowledge Ventures, L.P. Method and system for automating membership discovery in a distributed computer network
CN102136936A (zh) * 2010-11-24 2011-07-27 华为技术有限公司 避免控制平面故障影响转发平面运行的方法、节点及***
CN102142969A (zh) * 2010-12-31 2011-08-03 华为技术有限公司 一种p2mp的建立方法、装置和***

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108809679A (zh) * 2017-05-03 2018-11-13 腾讯科技（深圳）有限公司 对网络节点的控制方法、装置及监控设备
CN108809679B (zh) * 2017-05-03 2021-11-05 腾讯科技（深圳）有限公司 对网络节点的控制方法、装置及监控设备
CN112039765A (zh) * 2019-06-03 2020-12-04 中兴通讯股份有限公司 路由信息发送的方法、路由选路的方法和装置
CN112039765B (zh) * 2019-06-03 2023-05-30 中兴通讯股份有限公司 路由信息发送的方法、路由选路的方法和装置

Similar Documents

Publication Publication Date Title
US10516478B2 (en) Controller based path estimation and path provisioning using optical impairment data
CN103368843B (zh) 受保护标签交换路径快速重路由的oam标签交换路径
JP5919046B2 (ja) パス計算方法
CN110535763B (zh) 一种路由备份方法、装置、服务器及可读存储介质
JP2013510459A (ja) 分離的なパス計算アルゴリズム
JP6508051B2 (ja) 通信制御装置、通信制御システム、通信制御方法及び通信制御プログラム
US20150312088A1 (en) System and method for primary switch election in peer groups
US20070019652A1 (en) Method and apparatus for updating label-switched paths
US11121975B2 (en) Framework for temporal label switched path tunnel services
US10666562B2 (en) Network path computation method, apparatus, and system
WO2017177647A1 (zh) 基于rsvp-te动态隧道的高效lsp保护方法
WO2016206502A1 (zh) 一种业务控制方法及装置、计算机存储介质
WO2017063166A1 (zh) 一种过中断链路建立标签交换路径的方法及装置
WO2016165061A1 (zh) 一种业务保护方法及装置
WO2017190675A1 (zh) 链路信息的处理方法、装置及***
EP3082306A1 (en) Re-routing method and system, and network device
CN102055662A (zh) 预置路由的确定方法与装置
CN106130895B (zh) Sdn网络故障的重路由方法及装置
JP2015173378A (ja) 管理システム、管理サーバ、および管理方法
CN110247845B (zh) 一种通信网络中生成保护路由方法
CN110392318B (zh) Ason中控制平面层lsp通道的校验方法及***
CN103023780A (zh) 一种路由计算方法和装置
KR100431208B1 (ko) 멀티프로토콜 레이블 스위칭 시스템의 결함을 허용하는명시적 경로 관리방법 및 장치
CN108390780B (zh) 用于处理信息的方法和装置
CN107181684A (zh) 一种响应网络拓扑变化的方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15906051

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15906051

Country of ref document: EP

Kind code of ref document: A1