WO2017190675A1 - Procédé, appareil et système de traitement d'informations de liaison - Google Patents

Procédé, appareil et système de traitement d'informations de liaison Download PDF

Info

Publication number
WO2017190675A1
WO2017190675A1 PCT/CN2017/083122 CN2017083122W WO2017190675A1 WO 2017190675 A1 WO2017190675 A1 WO 2017190675A1 CN 2017083122 W CN2017083122 W CN 2017083122W WO 2017190675 A1 WO2017190675 A1 WO 2017190675A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
path
tunnel
information
label resource
Prior art date
Application number
PCT/CN2017/083122
Other languages
English (en)
Chinese (zh)
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 中兴通讯股份有限公司
Publication of WO2017190675A1 publication Critical patent/WO2017190675A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

Definitions

  • the present disclosure relates to the field of communications, for example, to a method, apparatus, and system for processing link information.
  • FIG. 1 is a schematic diagram of a tunnel establishment topology in the related art. As shown in FIG. 1 , in a topology of three nodes R1, R2, and R3, a tunnel of R1 to R3 needs to be established. According to the above four parts, in the information release process, The information release is completed by the Interior Gateway Protocol-Traffic Engineer (IGP-TE) based on traffic engineering, mainly by Open Shortest Path First-Traffic Engineer (OSPF-TE) based on traffic engineering.
  • the protocol and the Intermediate System-Intermediate System-Traffic Engineer (ISIS-TE) protocol publish link-related information such as link status and bandwidth, and the link information in Figure 1 includes the chain.
  • RFC3630 extends the sub-type length value (Sub TLV (Type, Length, Value)) of the OSPF-TE protocol
  • RFC5305 extends the sub-type length value of the ISIS-TE protocol.
  • each node in the autonomous domain has TE information of the entire topology link.
  • the tunnel is established from R1 to R3 in Figure 1, the path calculation is initiated by R1, the destination is R3 and carries the constraints of the tunnel, and the calculated path is R1-R3 (R1 arrives along link L13). R3).
  • the RSVP-TE protocol is mainly used.
  • resource reservation and label table are delivered on the path R1-R3. After the signaling interaction is completed, the corresponding label forwarding table is delivered. Traffic can be forwarded along the path established by this tunnel.
  • the reservation of resources mainly includes resource information such as bandwidth and tags.
  • the tag resource space is divided into a per-platform tag space and a per-interface tag space.
  • the RSVP-TE signaling can be used to confirm whether the node or the interface has the information of the available labels.
  • the tunnel reconstruction and re-optimization cannot be triggered in time. That is, the tunnel cannot be established due to insufficient resources of one node or interface label, or the tunnel.
  • the present disclosure provides a method, a device, and a system for processing link information, which speed up the establishment of a tunnel.
  • the present disclosure provides a method for processing link information, including:
  • the first node receives the link information advertised by the second node through the traffic engineering-based open shortest path first OSPF-TE protocol or the traffic engineering based intermediate system to the intermediate system ISIS-TE protocol, where the link information carries Having the label resource information of the second node, and the label resource information is used to indicate whether the second node has a label resource;
  • the first node calculates the path by using the label resource information of the second node as a path calculation parameter, where the path is a path between the first node and the destination node.
  • the method further includes:
  • the first node saves the tunnel information of the path that fails to be calculated, where the tunnel information includes: a tunnel ID, tunnel entry ID, and tunnel exit ID.
  • the method further includes:
  • the tunnel is a local tunnel, and the first node acquires label resource information of the second node.
  • the first node triggers the reconstruction or re-optimization of the tunnel; wherein the label resource information of the second node changes, the label resource information of the second node is indicated by the second node not being The label resource changes to indicate that the second node has a label resource.
  • the method further includes: when the tunnel is a remote tunnel, the first node acquires, by using the following manner, the label resource information of the second node changes:
  • the first node After the first node acquires the label resource information of the second node, the first node receives the notification message sent by the border node of the autonomous domain; wherein the notification message is used by the first node. Notifying that the label resource information of the second node of the first node is changed, where the border node of the autonomous domain is a node shared by the autonomous domain where the second node where the label resource information changes and the autonomous domain where the first node is located .
  • the label resource information of the second node is represented by an extended field or a newly added field in the link information.
  • the present disclosure provides a method for processing link information, including:
  • the label resource information is represented by an extended field or a newly added field in the link information.
  • the present disclosure provides a processing device for link information, including:
  • a receiving module configured to receive link information advertised by the first node through the traffic engineering-based Open Shortest Path First OSPF-TE protocol or the traffic engineering based intermediate system to the intermediate system ISIS-TE protocol, where the link information is Carrying label resource information of the first node, and the label resource information is used to indicate whether the first node has a label resource;
  • the operation module is configured to calculate the path by using the label resource information as a parameter of the calculation path, where the path is a path between the second node and the destination node.
  • the device further includes:
  • the device further includes: a triggering module, configured to trigger a reconstruction or re-optimization of the tunnel when the information about the label resource is changed, where the label resource information changes include: the label resource The information is changed by indicating that the first node does not have a label resource to indicate that the first node has a label resource.
  • a triggering module configured to trigger a reconstruction or re-optimization of the tunnel when the information about the label resource is changed, where the label resource information changes include: the label resource The information is changed by indicating that the first node does not have a label resource to indicate that the first node has a label resource.
  • the present disclosure provides a processing device for link information, including:
  • a publishing module configured to release link information by using an open shortest path first OSPF-TE protocol based on traffic engineering or an intermediate system based on traffic engineering to an intermediate system ISIS-TE protocol; wherein the link information carries the first a label resource information of the node, the label resource information is used to indicate whether the first node has a label resource, and the label resource information of the first node is used as a parameter calculated by the second node path, so that the second node pairs the path A calculation is performed, the path being a path between the second node and the destination node.
  • the present disclosure provides a system including: a first node and a second node; wherein
  • the first node is configured to issue link information to the second node by using an open shortest path first OSPF-TE protocol based on traffic engineering or an intermediate system to intermediate system ISIS-TE protocol based on traffic engineering, where
  • the link information carries the label resource information of the first node, and the label resource information is used to indicate whether the first node has a label resource;
  • the second node is configured to calculate the path by using the label resource information as a parameter of a calculation path after receiving the link information; the path is a path between the second node and the destination node .
  • the second node is further configured to fail in the path calculation, and the path calculation is lost.
  • the reason for the failure is that when the label resource of the first node is insufficient, the tunnel information of the path that fails to be calculated is saved, where the tunnel information includes: a tunnel identifier, a tunnel entry identifier, and a tunnel exit identifier.
  • the system further includes: an autonomous domain border node, where the autonomous domain border node is a node shared by the autonomous domain where the first node is located and the autonomous domain where the second node is located;
  • the boundary node is configured to acquire, when the tunnel is a remote tunnel, the label resource information of the first node is changed, and send a notification message to the second node, where the notification message is used to notify the The label resource information of the first node of the second node changes.
  • the present disclosure also provides a computer readable storage medium storing program code for performing the method of any of the above.
  • the present disclosure also provides a node, the node comprising:
  • At least one processor At least one processor
  • the technical solution of the present disclosure adopts the label resource information of the node in the autonomous domain in the link information, and each node has the label resource information of the node, and does not need to wait until the signaling interaction process to confirm whether the label resource is available, and thus can be advanced It is known whether the node has available tag resources, shortens the tunnel establishment time, and speeds up the tunnel establishment.
  • FIG. 1 is a schematic diagram of a tunnel establishment topology in the related art
  • FIG. 2 is a schematic diagram of a topology environment of an OSPF-TE in a single autonomous domain according to Embodiment 1;
  • FIG. 4 is a schematic diagram of a topology environment of an OSPF-TE across an autonomous area according to Embodiment 1;
  • FIG. 5 is a flowchart 1 of a method for processing link information according to Embodiment 1;
  • FIG. 6 is a second flowchart of a method for processing link information in Embodiment 1;
  • FIG. 7 is a third flowchart of a method for processing link information in Embodiment 1;
  • FIG. 8 is a block diagram 1 of a structure of a processing device for link information according to Embodiment 2;
  • FIG. 9 is a second structural block diagram of a processing device for link information according to Embodiment 2;
  • Figure 10 is a block diagram 3 of the structure of the processing device for link information of the second embodiment
  • Figure 11 is a block diagram showing the structure of a link information processing apparatus of Embodiment 3.
  • Figure 12 is a block diagram 5 of the structure of the processing apparatus for link information of the third embodiment
  • FIG. 13 is a schematic structural diagram 1 of a system provided in Embodiment 4.
  • FIG. 14 is a second schematic diagram of the architecture of the system provided in Embodiment 4.
  • FIG. 15 is a schematic diagram showing the hardware structure of a node provided in Embodiment 6.
  • FIG. 2 is an open shortest path first based on traffic engineering in a single autonomous domain provided by this embodiment.
  • the autonomous domain can be called a single autonomous domain.
  • the topology includes four nodes: R1, R2, R3, and R4.
  • R1 to R3 can establish two tunnels: tunnel 1 and tunnel 2, and path planning for two tunnels. They are: R1-R2-R3 and R1-R4-R3.
  • the links of R1 to R2 are L12
  • the links of R1 to R4 are L14
  • the links of R2 to R3 are L23
  • the links of R4 to R3 are L34.
  • FIG. 3 is a flow system-based intermediate system to an intermediate system in a single autonomous domain provided by this embodiment.
  • the topology includes four nodes: R1, R2, R3, and R4.
  • R1 to R3 can establish two tunnels: tunnel 1 and tunnel 2.
  • the path planning of the two tunnels is: R1- R2-R3 and R1-R4-R3.
  • the link of R1 to R2 is L12
  • the link of R1 to R4 is L14
  • the link of R2 to R3 is L23
  • the link of R4 to R3 is L34
  • the bandwidth of link L12 is 200M.
  • the bandwidth of link L23 is 200M
  • the bandwidth of link L12 is 10M
  • the bandwidth of link L34 is 10M.
  • FIG. 4 is a schematic diagram of a topology environment of an Open Shortest Path First-Traffic Engineer (OSPF-TE) in a cross-autonomous domain according to the embodiment.
  • the topology environment includes R1, R2, R3, R4, R5, and R6 are six nodes.
  • R1 to R6 can establish two tunnels: tunnel 1 and tunnel 2.
  • R1 and R6 belong to two different autonomous domains.
  • the path that tunnel 1 can adopt is R1-R3-R4-R6, the path plan that tunnel 2 can adopt is: optimal path R1-R2-R3-R4-R6, or sub-optimal path R1-R2-R3-R5-R6.
  • FIG. 5 is a flowchart 1 of a method for processing link information according to the embodiment.
  • the first node receives the link information advertised by the second node by using the OSPF-TE protocol or the ISIS-TE protocol, where the link information carries the label resource information of the second node in the autonomous domain, and the label resource information Used to indicate whether the second node has a label resource.
  • the first node calculates the path by using the tag resource information as a parameter of the calculation path, where the path is a path between the first node and the destination node.
  • the first node may be the source node of the tunnel, or the node of the non-source node of the tunnel that does not have a downstream path.
  • the downstream path refers to the path between the node and the destination node.
  • the label resource information of the node in the autonomous domain is carried in the link information, so that each node in the autonomous domain has the tag resource information of the node, and the tag information of the node is considered in the process of path calculation, and does not need to wait until During the signaling interaction process, it is confirmed whether the node has available label resources, so that it can know in advance whether the node has available label resources, can find out whether the path is available in advance, shorten the tunnel establishment time, and speed up the tunnel establishment.
  • any node in the autonomous domain can receive the link information advertised by the second node through the OSPF-TE protocol or the ISIS-TE protocol.
  • the label resource information may be represented by an extended field or a newly added field in the link information.
  • the label resource information may be represented by an extended subtype length value (Sub TLV (Type, Length, Value)).
  • the length may be 1 byte, and the lowest 1 bit may indicate whether there is a tag resource, wherein a 1 bit value of the lowest bit may indicate that a tag resource exists, and the lowest bit value is 1 bit.
  • a value of 0 indicates that no tag resource exists.
  • the highest bit can represent the tag space.
  • the highest bit value of 1 can represent the global tag space.
  • the highest bit value of 0 can represent the interface tag space.
  • a node (the second node) does not have a label resource, it can be regarded as a path unreachable through the node, that is, in the process of calculating the path of the first node, the label resource information is considered. Going in, you can know in advance if the path is available, and you can get an optimized path. Constrained Shortest Path First (CSPF) calculations can be performed based on some attributes of the tunnel, such as bandwidth, Shared Risk Link Groups (SRLG), and The link must have factors such as label resources as some constraints for path calculation.
  • CSPF Constrained Shortest Path First
  • FIG. 6 is a second flowchart of a method for processing link information according to an embodiment. As shown in FIG. 7, after the foregoing step 620, the method may further include: step 710.
  • the first node saves the tunnel information of the path that fails to be calculated, where the tunnel information includes: a tunnel identifier, a tunnel entry identifier, and Tunnel exit identification.
  • Insufficient tag resources may be manifested in the absence of tag resources in one or more of the nodes through which the path passes.
  • the path is no longer considered in the process of establishing the tunnel, and the time for establishing the tunnel is saved.
  • the method may further include: when the tunnel is a local tunnel, and the first node acquires the second node label resource information, the first node triggers the tunnel to perform reconstruction or re-optimization;
  • the change of the label resource information may include: the label resource information is changed by indicating that the second node does not have the label resource to indicate that the second node has the label resource.
  • the tunnel When the source node of the tunnel initiates path calculation, the tunnel is the local tunnel. When the path calculation is initiated by a node other than the source node in the tunnel, the tunnel is a remote tunnel.
  • the method may further include: when the tunnel is a remote tunnel, the first node acquires, by using the following manner, the label resource information of the second node is changed: acquiring the second node in the boundary node of the first node autonomous domain After the label resource information is changed, the first node receives the notification message sent by the autonomous domain border node, where the notification message is used to notify the first node that the label resource information of the second node has changed, and the autonomous domain border node is the label resource information.
  • the node in which the autonomous domain in which the second node is located is shared with the autonomous domain in which the first node is located.
  • the foregoing method may further include: the label resource information is changed by indicating that the second node exists the label resource to indicate that the second node does not have the label resource.
  • the first node when the tunnel is the local tunnel, the first node can directly obtain the label resource information of the second node.
  • the tunnel is the remote tunnel, the first node can obtain the first node by using the autonomous domain boundary node. Tag resource information of the second node outside the autonomous domain.
  • the first node When the first node is in a down state, the first node triggers the reconstruction of the tunnel. When the first node is in the UP state, the first node triggers re-optimization of the tunnel.
  • the first node that is in the same autonomous domain as the second node or the first node that is outside the autonomous domain in which the second node is located can sense that the label resource of the second node changes from scratch and from nothing to nothing.
  • the tunnel reconstruction and re-optimization can be triggered in time, so that the tunnel can be opened or selected in a timely manner, thereby avoiding service interruption and improving the user experience.
  • FIG. 7 is a flowchart 3 of the method for processing link information in this embodiment.
  • the second node issues link information to the first node by using an OSPF-TE based protocol or an ISIS-TE based protocol.
  • the link information carries the label resource information of the second node, where the label resource information is used to indicate whether the second node has a label resource, and the label resource information of the second node is used as a parameter calculated by the first node path.
  • the first node is caused to calculate the path, and the path is a path between the first node and the destination node.
  • the foregoing step is to carry the label resource information of the second node in the link information, so that the first node has the label resource information of the node, and does not need to wait until the signaling interaction process to confirm whether the label resource is available, and thus can be advanced. It is known whether the node has available label resources, can find out whether the path is available in advance, shortens the tunnel establishment time, and speeds up the tunnel establishment.
  • any node in the autonomous domain can publish link information.
  • the label resource information of the second node may be represented by an extended field or a newly added field in the link information.
  • the label resource information may be represented by extending the subtype length value.
  • the length may be 1 byte
  • the lowest bit 1 bit may indicate whether there is a tag resource, wherein a 1 bit value of the lowest bit indicates that the tag resource exists, and the lowest bit value is 1 bit value. 0 means there is no tag resource.
  • the highest bit can represent the tag space.
  • the highest bit value of 1 indicates the global tag space, and the highest bit value of 0 indicates the interface tag space.
  • the embodiment provides a method for label resource advertisement in an optional embodiment (corresponding to the method for processing link information in the foregoing embodiment), so that changes in node or interface label resources can be released in the autonomous domain, so that the tunnel It is able to sense this change in time and perform related path calculations and adjustments.
  • the above alternative embodiments include the following four steps.
  • step 1 the second node extends the link subtype length value information of the OSPF-TE and the ISIS-TE (corresponding to the link information in the foregoing embodiment), and adds the label resource information when the link information is released.
  • the issuance of subtype length value information) (corresponding to step 810 in the above embodiment or step 610 in the above embodiment).
  • the first node can consider the label resource of the link and select an optimal path (corresponding to step 620 in the foregoing embodiment).
  • step 3 the first node records the tunnel information that the path calculation failed due to insufficient label resources and stores the tunnel information in the first node (corresponding to step 710 in the above embodiment).
  • tunnel reconstruction or re-optimization may be triggered for the local tunnel.
  • a notification message may be sent to trigger the tunnel source node to trigger tunnel reconstruction.
  • re-optimization (corresponding to the triggering of the tunnel for reconstruction or re-optimization when the label resource information of the second node is changed in the foregoing embodiment).
  • the sub-type length value information of the OSPF-TE and the ISIS-TE is extended, and the length may be 1 byte.
  • the lowest bit (bit) may indicate whether there is a tag resource, and the lowest bit value is 1 bit. It can indicate that there is a tag resource.
  • the highest bit value of 0 can represent no tag resource; the highest bit can represent the tag space, and the highest bit value of 1 can represent the global tag space, the highest bit.
  • a bit value of 0 can indicate the interface label space.
  • the link label resource is considered in the path calculation.
  • the length of the flooded label resource subtype can be taken into consideration. If there is no label resource in the link, the path is unreachable.
  • the tunnel information in the path of the fault that the path calculation fails due to the insufficient label resources is recorded in the node that initiates the path calculation, and the tunnel information that fails the path calculation due to insufficient label resources is recorded.
  • the tunnel information may include a tunnel identification (ID), an ingress identification (ID), and an egress identification (ID).
  • step 4 when the label resource of the node or the link changes, the label resource may change from scratch.
  • step 4 for the local tunnel to trigger tunnel re-establishment or re-optimization, the first node receives the label resource of a link information in the autonomous domain where the node is located from scratch, and performs the following operations: if the first node is disappeared (down) state, triggering tunnel reconstruction; if the first node is in the presence (UP) state, triggering tunnel re-optimization.
  • step 4 for the remote tunnel the sending of the advertisement message is triggered to trigger the tunnel reconstruction or re-optimization of the first node of the tunnel, and the first node receives the label resource of a link in the autonomous domain where the node is located from scratch.
  • step 3 the entry belonging to the remote tunnel is checked, and an advertisement message is sent to the first node, indicating that the label resource is available.
  • the first node receives the advertisement message and performs the following operations: if the first node is in a down state, tunnel reconstruction may be triggered; if the first node is in an existing (UP) state, tunnel re-optimization may be triggered.
  • UP existing
  • the label resource of the node or the link can be advertised, and the path calculation decision can be performed, and the tunnel reconstruction and re-optimization can be triggered in time to avoid long-term interruption of the tunnel service and trigger the path in time. Optimize to improve the user experience.
  • R2 when R2 has no available label resources, R2 advertises the available label resources of R2 to the nodes R1, R3, and R4 in the autonomous domain where R2 is located by using the extended subtype length value. . Nodes R1, R3, and R4 can both receive this information.
  • the path of tunnel 1 is planned to be R1-R2-R3, and the R2 label resource information participates in path calculation. In this case, the path calculation fails. The reason is that R2 label resources are insufficient, and R1 can record. Tunnel information for this tunnel (R1, R3, Tunnel 1).
  • the path plan of the tunnel 2 includes the optimal path R1-R2-R3 and the sub-optimal path R1-R4-R3. Since R2 has no available tag resources, tunnel 1 can only select the sub-optimal path R1-R4-R3.
  • R2 can advertise the available label resources of R2 to nodes R1, R3, and R4 in the autonomous domain by using the extended subtype length value by using the OSPF-TE protocol. Nodes R1, R3, and R4 can both receive this information.
  • R1 When R1 receives the available label resources of R2, it reestablishes the local tunnel 1 in the down state. The tunnel is successfully established, and the path is R1-R2-R3. For the connection (UP) The tunnel 2 can be re-optimized. After re-optimization, tunnel 2 adopts the optimal path R1-R2-R3.
  • R2 advertises the available label resources of R2 to the nodes R1, R3, and R4 in the autonomous domain by using the ISIS-TE protocol according to the extended subtype length value. Nodes R1, R3, and R4 can both receive this information.
  • R1 When R1 receives no tag resources available for R2, the tunnel 1 path is planned to be dynamically calculated, and the tag resource information is involved in the path calculation.
  • the tunnel 1 has a bandwidth requirement of 100 M. In this case, the path calculation fails. The reason is that the R2 tag resources are insufficient. Insufficient bandwidth. At this time, you can record the information of this tunnel (R1, R3, Tunnel 1).
  • R1-R2-R3 is the optimal path
  • R1-R4-R3 is the sub-optimal path. After calculation, the sub-optimal path R1-R4-R3 can be selected.
  • R2 may advertise R2 with available label resources to nodes R1, R3, and R4 in the autonomous domain by using the extended subtype length value using the ISIS-TE protocol. R1, R3, and R4 can all receive this information.
  • R1 When R1 receives the available label resources of R2, the local tunnel 1 in the down state is reconstructed, and the tunnel is successfully established.
  • the path is R1-R2-R3 (the R1-R4-R3 path bandwidth is insufficient).
  • the tunnel 2 for the connection (UP) state is re-optimized, and after the re-optimization, the tunnel 2 selects the optimal path R1-R2-R3.
  • the R4 advertises the available label resources of the R4 to the autonomous domain 1 by using the OSPF-TE protocol.
  • Nodes R3, R5, and R6 Nodes R3, R5, and R6 can all receive this information, and nodes R1 and R2 outside the autonomous domain 1 cannot receive this information.
  • tunnel 1 can calculate the path at R1, calculate to the boundary node R3 of the autonomous domain 0, the path is R1-R3, and the path calculation is performed at R3, and the destination node is R6.
  • the R3 node has no information about the available label resources and is advertised to R3. The calculation fails when the planned path R3-R4-R6 is calculated. The reason is that the R4 tag resources are insufficient.
  • the information of the tunnel (R1, R6, tunnel 1) can be recorded at the path computation node R3.
  • Tunnel 2 is calculated on R1 and is also calculated to the boundary R3 of the autonomous domain 1.
  • the path is R1-R2-R3.
  • the path calculation is performed at R3.
  • the destination node is R6.
  • the calculation fails due to the planned optimal path R3-R4-R6. Record the tunnel information (R1, R6, tunnel 2), and select the sub-optimal path R3-R5-R6. Therefore, the path established by tunnel 2 is the sub-optimal path R1-R2-R3-R5-R6.
  • R4 At a time when R4 has a label resource available, R4 advertises R4 with available label resources to nodes R3, R5, and R6 in the autonomous domain 1 by using the extended subtype length value. This information can be received by R3, R5 and R6. The R1 and R2 nodes of the autonomous domain 0 do not receive this information.
  • R3 After R3 receives the information available for the label, it checks the record of the failed path. The two failed records belong to the remote tunnel and are sent to the first node (the source node of the tunnel) R1 through the advertisement message to inform R4 that the label resource is available. Information available.
  • R1 After receiving the advertisement message sent by R3, R1 resolves to the tunnel that belongs to tunnel 1 and tunnel 2, and tunnel 1 initiates the reconstruction in the down state.
  • the path is successfully established according to the planned R1-R3-R4-R6.
  • Tunnel 2 initiates re-optimization for the connection (UP) state, and the path is adjusted to the planned optimal path R1-R2-R3-R4-R6.
  • the OSPF-TE protocol can be replaced with the ISIS-TE protocol, that is, the ISIS-TE protocol can be used to advertise whether the label resource of the second node of the first node is available.
  • the method of the foregoing embodiment may be implemented by means of a software plus a hardware platform, or may be implemented by using a hardware.
  • the technical solution of the above embodiment can be embodied in the form of a software product stored in a storage medium (such as a read-only memory (ROM), a random access memory (Random Access Memory, RAM).
  • ROM read-only memory
  • RAM random access memory
  • the disk or the optical disk includes one or more instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the method described in the above embodiments.
  • a processing device for link information is also provided, which can implement the foregoing method embodiments and optional implementation manners.
  • the term "module" can implement at least one of software and hardware for a predetermined function.
  • the apparatus described in the following embodiments may be implemented in software, hardware, or a combination of software and hardware.
  • FIG. 8 is a block diagram showing the structure of the link information processing apparatus of the present embodiment. As shown in FIG. 8, the apparatus includes: a receiving module 92 and an arithmetic module 94.
  • the receiving module 92 is configured to receive link information advertised by the second node through the traffic engineering-based Open Shortest Path First OSPF-TE protocol or the traffic engineering based intermediate system to the intermediate system ISIS-TE protocol; wherein the link information carries There is label resource information of the second node, and the label resource information is used to indicate whether the label resource exists in the second node.
  • the operation module 94 is connected to the receiving module 92, and is configured to calculate the path by using the label resource information as a parameter of the calculation path; wherein the path is a path between the first node and the destination node.
  • the label information carries the label resource information of the second node in the link information, so that the first node has the label resource information of the second node, and the operation module 94 considers the label information of the node in the path calculation process, and does not need Wait until the signaling interaction process confirms whether there is available tag resource, so it can know in advance whether the node has available tag resources, can find out whether the path is available in advance, shorten the tunnel establishment time, and speed up the tunnel establishment.
  • FIG. 9 is a block diagram showing the structure of the link information processing apparatus of the embodiment. As shown in FIG. 9, on the basis of FIG. 8, the apparatus may further include: a storage module 1002.
  • the storage module 1002 is connected to the operation module 94, and is configured to: when the path calculation fails, and the path calculation fails because the label resource is insufficient, the tunnel information of the path that fails to be calculated is saved, where the tunnel information may include: a tunnel identifier, a tunnel Ingress ID and tunnel exit ID.
  • Insufficient tag resources may be manifested in the absence of tag resources in one or more of the nodes through which the path passes.
  • FIG. 10 is a block diagram 3 of the structure of the link information processing apparatus of the embodiment. As shown in FIG. 10, the apparatus may further include: a trigger module 1102.
  • FIG. 11 is a block diagram showing the structure of the link information processing apparatus of the present embodiment. As shown in FIG. 11, the apparatus may further include: a triggering module 1102.
  • the triggering module 1102 is connected to the receiving module 92, and is configured to trigger the reconstruction or re-optimization of the tunnel when the label resource information of the second node is changed.
  • the label resource information changes include: The two nodes do not have a label resource change to indicate that the second node has a label resource.
  • the receiving module 92 is further configured to: when the tunnel is a remote tunnel, obtain the change of the second node label resource information by: after the border node of the autonomous domain acquires the label resource information of the second node, Receiving a notification message sent by the autonomous domain border node, where the notification message is used to notify the first node that the tag resource information has changed; and the autonomous domain boundary node is the autonomous domain where the second node of the tag resource information changes and the first The node shared by the autonomous domain where the node is located.
  • the node in the autonomous domain where the second node is located or the second node may be
  • the nodes outside the autonomous domain can perceive the change of the label resources from scratch and from nothing to nothing, and can trigger the reconstruction and re-optimization of the tunnel in time, so that the tunnel can be opened or the better path can be avoided in time to avoid the service.
  • the interruption has improved the user experience.
  • the above modules may be implemented by software or hardware.
  • the above modules may all be located in the same processor; or the modules are respectively located in different processors.
  • FIG. 12 is a block diagram 5 of the processing device for the link information of the embodiment.
  • the device may include: a publishing module 1202.
  • the publishing module 1202 is configured to issue link information through the traffic engineering-based Open Shortest Path First OSPF-TE protocol or the traffic engineering based intermediate system to the intermediate system ISIS-TE protocol.
  • the link information carries the label resource information of the second node, and the label resource information is used to indicate whether the second node has a label resource.
  • the device carries the label resource information of the second node in the link information, so that the first node has the label resource information of the second node, and does not need to wait until the signaling interaction process to confirm whether the label resource is available, and thus It is possible to know in advance whether the second node has available tag resources, can find out whether the path is available in advance, shorten the time for establishing the tunnel, and speed up the tunnel establishment.
  • FIG. 13 is a schematic diagram 1 of the architecture of the system provided in this embodiment.
  • the system includes: a first node 1302 and a second node 1304.
  • the first node 1302 is configured to issue link information to the second node 1304 through the traffic engineering-based Open Shortest Path First OSPF-TE protocol or the traffic engineering based intermediate system to the intermediate system ISIS-TE protocol.
  • the link information carries the label resource information of the first node 1302, and the label resource information is used to indicate whether the first node 1302 has a label resource.
  • the system carries the label resource information of the first node in the link information, and the second node has the label resource information of the first node, and does not need to wait until the signaling interaction process to confirm whether the label resource is available, and thus can It is known in advance whether the first node has available tag resources, shortens the tunnel establishment time, and speeds up the tunnel establishment.
  • the foregoing second node 1304 may be configured to calculate the path by using the label resource information as a parameter of the calculation path after receiving the link information, where the path is the first section. The path between the point and the destination node.
  • the second node 1304 may be configured to: when the path calculation fails, and the path calculation fails because the label resource of the first node is insufficient, the tunnel information of the path that fails to be calculated is saved, where the tunnel information includes: a tunnel identifier, a tunnel entry. Identification and tunnel exit identification.
  • the foregoing second node 1304 may be further configured to: when the label resource information is changed, triggering the tunnel to perform reconstruction or re-optimization, where the label resource information changes, the label resource information is indicated by the first node. 1302 There is no tag resource change to indicate that the first node 1302 has a tag resource.
  • FIG. 14 is a schematic diagram 2 of the architecture of the system provided in this embodiment.
  • the foregoing system may further include: an autonomous domain border node 1402.
  • the autonomous domain border node 1402 is connected to the first node 1302 and the second node 1304.
  • the autonomous domain border node 1402 is a node shared by the autonomous domain in which the first node 1302 is located and the autonomous domain in which the second node 1304 is located.
  • the domain border node 1402 is configured to send a notification message to the second node after the label resource information of the first node 1302 is changed, where the notification message is used to notify the second node that the label resource information of the first node has changed.
  • This embodiment also provides a computer readable storage medium.
  • the foregoing storage medium may be configured to store program code that performs the following steps:
  • the link information carries the label resource information of the intra-domain node, And the label resource information is used to indicate whether the node has a label resource;
  • the path is calculated by using the tag resource information as a parameter of the calculation path, where the path is a path between the first node and the destination node.
  • the storage medium is further configured to store program code that performs the following steps:
  • the tunnel information includes: a tunnel identifier, a tunnel entry identifier, and a tunnel exit identifier.
  • the storage medium is further arranged to store program code for performing the following steps:
  • the reconstruction or re-optimization of the tunnel is triggered, where the change of the label resource information includes: the label resource information is changed by indicating that the second node does not have the label resource to indicate that the second node has the label resource.
  • the foregoing storage medium may include, but is not limited to, a U disk, a ROM, a RAM, a mobile hard disk, a magnetic disk, or an optical disk, and the like, and may store a program code.
  • examples in this embodiment may refer to the examples described in the foregoing embodiments and optional embodiments.
  • the node includes:
  • At least one processor 150 is exemplified by a processor 150 in FIG. 15; and a memory 151 may further include a communication interface 152 and a bus 153.
  • the processor 150, the memory 151, and the communication interface 152 can complete communication with each other through the bus 153.
  • Communication interface 152 can transmit information.
  • the processor 150 can call logic instructions in the memory 151 to perform the methods in the above embodiments.
  • logic instructions in the memory 151 described above may be implemented in the form of a software functional unit and sold or used as a stand-alone product, and may be stored in a computer readable storage medium.
  • the memory 151 is a computer readable storage medium, and can store a software program, a computer executable program, such as a program instruction or a module corresponding to the method in the above embodiment.
  • the processor 150 executes the function application and the data processing by executing a software program, an instruction or a module stored in the memory 151, that is, implementing the method in the above method embodiment.
  • the memory 151 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to usage of the terminal device, and the like. Further, the memory 151 may include a high speed random access memory, and may also include a nonvolatile memory.
  • the modules or steps of the above embodiments may be implemented in a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices. Alternatively, they may be implemented by a computing device
  • the program code is implemented such that they can be stored in a storage device by a computing device, and in some cases, the steps shown or described can be performed in an order different than that herein, or separately.
  • Multiple modules or steps are made into a single integrated circuit module.
  • the method, device and system for processing link information provided by the present disclosure accelerate the speed of tunnel establishment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un procédé, un appareil et un système de traitement d'informations de liaison. Le procédé de traitement comprend les étapes suivantes : un premier nœud reçoit des informations de liaison émises par un deuxième nœud sur la base d'un protocole d'ingénieur de trafic de premier trajet ouvert le plus court (OSPF-TE) ou sur la base d'un protocole interne d'un ingénieur de trafic de système intermédiaire-système intermédiaire (ISIS-TE), les informations de liaison transportant des informations de ressource d'étiquette concernant le deuxième nœud, les informations de ressource d'étiquette étant utilisées pour indiquer si le deuxième nœud possède une ressource d'étiquette ; et le premier nœud utilise les informations de ressource d'étiquette concernant le deuxième nœud en tant que paramètre de calcul de trajet pour calculer un trajet, le trajet étant un trajet entre le premier nœud et un nœud destinataire.
PCT/CN2017/083122 2016-05-05 2017-05-05 Procédé, appareil et système de traitement d'informations de liaison WO2017190675A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610293852.3 2016-05-05
CN201610293852.3A CN107347034B (zh) 2016-05-05 2016-05-05 链路信息的处理方法及装置、系统

Publications (1)

Publication Number Publication Date
WO2017190675A1 true WO2017190675A1 (fr) 2017-11-09

Family

ID=60202747

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/083122 WO2017190675A1 (fr) 2016-05-05 2017-05-05 Procédé, appareil et système de traitement d'informations de liaison

Country Status (2)

Country Link
CN (1) CN107347034B (fr)
WO (1) WO2017190675A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112054958A (zh) * 2019-06-06 2020-12-08 中兴通讯股份有限公司 路径计算方法及存储介质、电子装置

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112558504B (zh) * 2019-09-10 2021-11-02 中国电信股份有限公司 基于ospf协议的关键路径信息转发方法、装置和系统
CN110958181B (zh) * 2019-12-06 2021-08-17 Ut斯达康通讯有限公司 ISIS协议发布跨SRv6的切片网络的方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008043229A1 (fr) * 2006-10-09 2008-04-17 Huawei Technologies Co., Ltd. Procédé et appareil de calcul du trajet de service
US20080151783A1 (en) * 2006-12-26 2008-06-26 Fujitsu Limited Communication apparatus and protocol processing method
CN101835066A (zh) * 2009-03-13 2010-09-15 中兴通讯股份有限公司 基于链路捆束的标签交换路径处理方法
EP2403171A1 (fr) * 2009-02-26 2012-01-04 Huawei Technologies Co., Ltd. Procédé, dispositif et système pour émettre le message de protocole de routage et calculer le routage
US20140056581A1 (en) * 2011-01-21 2014-02-27 Telefonaktiebolaget L M Ericsson (Publ) Timer value negotiation for path configuration based on rsvp-te

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101155135B (zh) * 2006-09-28 2011-04-20 华为技术有限公司 一种泛洪自治系统边界路由器能力信息的方法及装置
EP2071772B1 (fr) * 2006-10-06 2012-11-21 Nippon Telegraph and Telephone Corporation Appareil de noeud de communication, systeme de communication, et procede d'affectation de ressources de trajet
CN101521601A (zh) * 2008-02-29 2009-09-02 华为技术有限公司 一种通告相邻网络域ds-te信息的方法和系统及设备
CN101674231B (zh) * 2008-09-11 2012-11-21 华为技术有限公司 一种流量工程链路信息的处理方法及网络设备
CN102571530A (zh) * 2010-12-16 2012-07-11 中兴通讯股份有限公司 域间链路状态信息的处理方法及路径计算单元
US9019865B2 (en) * 2011-03-04 2015-04-28 Juniper Networks, Inc. Advertising traffic engineering information with the border gateway protocol

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008043229A1 (fr) * 2006-10-09 2008-04-17 Huawei Technologies Co., Ltd. Procédé et appareil de calcul du trajet de service
US20080151783A1 (en) * 2006-12-26 2008-06-26 Fujitsu Limited Communication apparatus and protocol processing method
EP2403171A1 (fr) * 2009-02-26 2012-01-04 Huawei Technologies Co., Ltd. Procédé, dispositif et système pour émettre le message de protocole de routage et calculer le routage
CN101835066A (zh) * 2009-03-13 2010-09-15 中兴通讯股份有限公司 基于链路捆束的标签交换路径处理方法
US20140056581A1 (en) * 2011-01-21 2014-02-27 Telefonaktiebolaget L M Ericsson (Publ) Timer value negotiation for path configuration based on rsvp-te

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112054958A (zh) * 2019-06-06 2020-12-08 中兴通讯股份有限公司 路径计算方法及存储介质、电子装置
US12047274B2 (en) 2019-06-06 2024-07-23 Zte Corporation Path computation method, storage medium and electronic apparatus

Also Published As

Publication number Publication date
CN107347034A (zh) 2017-11-14
CN107347034B (zh) 2021-11-19

Similar Documents

Publication Publication Date Title
US10187301B2 (en) Establishing label switched paths having refresh interval independent fast reroute facility protection
US9350639B2 (en) Forwarding data in a data communications network
US8842522B2 (en) Incremental deployment of MRT based IPFRR
CN103380605B (zh) 使用ldp的mpls快速重新路由ldp-frr的方法和网络单元
WO2019120042A1 (fr) Procédé et nœud pour transmettre un paquet dans un réseau
US7707307B2 (en) Method and apparatus for constructing a backup route in a data communications network
US7675848B2 (en) Dynamic forwarding adjacency
US9853854B1 (en) Node-protection and path attribute collection with remote loop free alternates
US20220272032A1 (en) Malleable routing for data packets
US7920566B2 (en) Forwarding data in a data communication network
EP3200402A1 (fr) Procédé d'obtention d'informations sr, et procédé d'établissement de réseau sr
US9210075B2 (en) Method and apparatus for managing end-to-end consistency of bi-directional MPLS-TP tunnels via in-band communication channel (G-ACH) protocol
CN103368843A (zh) 受保护标签交换路径快速重路由的oam标签交换路径
US9154412B2 (en) Multicast label distribution protocol over a remote loop-free alternative
WO2017190675A1 (fr) Procédé, appareil et système de traitement d'informations de liaison
US20190379596A1 (en) Methods and Systems preventing Make Before Break failures during soft preemption in MPLS
WO2017063585A1 (fr) Environnement d'application pour services de tunnel à trajet commuté par étiquette (lsp)
WO2018059290A1 (fr) Procédés et dispositifs d'obtention et de notification de paramètre, et support de stockage
JP2022522175A (ja) Ｉｇｐフラッディングトポロジー不一致を処理するためのシステムおよび方法
WO2017143958A1 (fr) Système, procédé et appareil de mise en œuvre d'un réacheminement rapide (frr)
WO2015184862A1 (fr) Procédé et dispositif pour calcul de trajet de ré-optimisation de tunnel
JP6377738B2 (ja) Ｒｓｖｐ−ｔｅシグナリングを処理するための方法及びシステム
WO2012055230A1 (fr) Procédé et système de mise à jour de transfert d'attribut de contiguïté dans un réseau multicouche
EP2649758B1 (fr) Minimiser le nombre d'adresses "non-via"
WO2016177186A1 (fr) Procédé et dispositif de protection de bande passante

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 17792501

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 17792501

Country of ref document: EP

Kind code of ref document: A1