CN107347034B - Link information processing method, device and system - Google Patents

Link information processing method, device and system Download PDF

Info

Publication number
CN107347034B
CN107347034B CN201610293852.3A CN201610293852A CN107347034B CN 107347034 B CN107347034 B CN 107347034B CN 201610293852 A CN201610293852 A CN 201610293852A CN 107347034 B CN107347034 B CN 107347034B
Authority
CN
China
Prior art keywords
node
path
information
label
tunnel
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201610293852.3A
Other languages
Chinese (zh)
Other versions
CN107347034A (en
Inventor
付志涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN201610293852.3A priority Critical patent/CN107347034B/en
Priority to PCT/CN2017/083122 priority patent/WO2017190675A1/en
Publication of CN107347034A publication Critical patent/CN107347034A/en
Application granted granted Critical
Publication of CN107347034B publication Critical patent/CN107347034B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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]

Abstract

The invention provides a method, a device and a system for processing link information; the processing method comprises the following steps: receiving link information issued by an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system based on traffic engineering to the intermediate system; the link information carries the following information: label resource information of nodes in the domain, wherein the label resource information is used for indicating whether label resources exist in the nodes. By the method and the device, the problem of tunnel establishment delay in the related technology is solved.

Description

Link information processing method, device and system
Technical Field
The present invention relates to the field of data network communications, and in particular, to a method, an apparatus, and a system for processing link information.
Background
RSVP-TE (Resource Reservation Protocol-Traffic engineering-based Resource Reservation Protocol) is a Traffic engineering technology based on MPLS. The service traffic is forwarded in the TE tunnel through four components of information issuing, path calculation, signaling interaction (RSVP-TE) and traffic forwarding.
Fig. 1 is a schematic diagram of tunnel establishment topology in the related art, as shown in fig. 1, in the topology of three nodes, a tunnel from R1 to R3 needs to be established, according to the above four components, information is First published, the information publication is completed by an internal Gateway Protocol (IGP-TE for short) based on Traffic engineering, and two protocols, namely an Open Shortest Path First-Traffic engine (OSPF-TE for short) based on Traffic engineering, and an internal Protocol (ISIS-TE for short) from an Intermediate System to an Intermediate System based on Traffic engineering, publish link status, bandwidth, and other TE-related link information, corresponding to TE information of links L12, L23, and L13 in the diagram. RFC3630 and RFC5305 extend the subtype Length value Sub TLV for OSPF-TE and ISIS-TE, respectively. Through information publishing, each node in the domain has TE information of the whole topological link; next, path calculation is performed, wherein a tunnel is established from R1 to R3 in fig. 1, then the path calculation is initiated by R1, is destined to R3 and carries constraints of the tunnel, and the calculated path is assumed to be R1-R3 (reaching R3 along a link of L13); and then carrying out signaling interaction, mainly completed by RSVP-TE protocol, and carrying out resource reservation and label table down-sending on paths R1-R3 according to the extension of RFC 3209. And after the signaling interaction is completed, the corresponding label forwarding table is also completely issued. Finally, the traffic can be forwarded along the path established by the tunnel.
The reservation of the resource mainly comprises resource information such as bandwidth, label and the like. After the signaling component, since the available bandwidth information of the link L13 changes, a new release will be made, and the nodes of the topology will update the link state information of the link L13 from the new one.
The label resource space is generally divided into a label space per platform and a label space per interface. For a node or an interface, there is no information whether the issuing node or the interface has an available label, and it can only be confirmed in the signaling component through the RSVP signaling interaction process. In the process of establishing the tunnel, the establishment of the tunnel is delayed. Meanwhile, if the information that whether the publishing node or the interface has the available label is not provided, the reestablishment and the re-optimization of the tunnel cannot be triggered in time. In short, a tunnel cannot be established or is established to a suboptimal path due to insufficient resource of a certain node or interface label. At a certain moment, the label resource of the node or the interface is provided, the change is not issued in time, and the tunnel is triggered to be rebuilt or re-optimized so that the tunnel is still in a down state for a long time or moves on a suboptimal path. Thereby affecting the forwarding of traffic and the user experience.
In view of the above technical problems, no effective solution has been proposed at present.
Disclosure of Invention
The embodiment of the invention provides a method, a device and a system for processing link information, which are used for at least solving the problem of tunnel establishment delay in the related technology.
According to an embodiment of the present invention, a method for processing link information is provided, including: receiving link information issued by an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system based on traffic engineering to the intermediate system; the link information carries the following information: and label resource information of the nodes in the autonomous domain, wherein the label resource information is used for indicating whether label resources exist in the nodes.
Optionally, after receiving the link information published through OSPF-TE or ISIS-TE, the method further includes calculating the path by using the label resource information as a parameter for calculating the path; wherein the path is a path between the head node and the destination node.
Optionally, after the path is calculated, the method further includes, when the path calculation fails and the reason of the path calculation failure is that the label resource is insufficient, saving path information of the calculation failure, where the path information includes: tunnel identification, tunnel entry identification, tunnel exit identification.
Optionally, when the acquired tag resource information changes, the reconstruction or re-optimization of the tunnel is triggered; wherein the tag resource information is changed by: the label resource information is changed from the condition that the label resource does not exist in the indication node to the condition that the label resource exists in the indication node.
Optionally, when the tunnel is a far-end tunnel, the tag resource information is obtained to change in the following manner: after the autonomous domain boundary node acquires that the label resource information changes, receiving a notification message sent by the autonomous domain boundary node; the notification message is used for notifying the head node that the label resource information changes; and the autonomous domain boundary node is a node shared by an autonomous domain where the node with the changed label resource information is located and an autonomous domain where the head node is located.
Alternatively, the tag resource information is represented by an extended field or an added field in the link information.
According to another embodiment of the present invention, a method for processing link information is provided, including: issuing link information through an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system to the intermediate system based on traffic engineering; the link information carries the following information: and label resource information of the nodes in the autonomous domain, wherein the label resource information is used for indicating whether label resources exist in the nodes.
Alternatively, the tag resource information is represented by an extended field or an added field in the link information.
According to another embodiment of the present invention, there is provided a link information processing apparatus including: a receiving module, configured to receive link information issued by an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system to the intermediate system based on traffic engineering; the link information carries the following information: and label resource information of the nodes in the autonomous domain, wherein the label resource information is used for indicating whether label resources exist in the nodes.
Optionally, the apparatus further comprises: the operation module is used for calculating the path by taking the label resource information as a parameter of the calculated path; wherein the path is a path between the head node and the destination node.
Optionally, the apparatus further comprises: the storage module is configured to store path information of a failure in path computation when the path computation fails and a reason of the failure in path computation is that a label resource is insufficient, where the path information includes: tunnel identification, tunnel entry identification, tunnel exit identification.
Optionally, the apparatus further comprises: the triggering module is used for triggering the reconstruction or the re-optimization of the tunnel when the acquired label resource information changes; wherein the tag resource information is changed by: the label resource information is changed from the label resource which indicates that the node does not exist into the label resource.
Optionally, the receiving module is further configured to obtain that the label resource information changes in the following manner when the tunnel is a far-end tunnel: after the autonomous domain boundary node acquires that the label resource information changes, receiving a notification message sent by the autonomous domain boundary node; the notification message is used for notifying the head node that the label resource information changes; and the autonomous domain boundary node is a node shared by an autonomous domain where the node with the changed label resource information is located and an autonomous domain where the head node is located.
According to another embodiment of the present invention, there is provided a link information processing apparatus including: the release module is used for releasing link information through an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system to the intermediate system based on traffic engineering; the link information carries the following information: and label resource information of the nodes in the autonomous domain, wherein the label resource information is used for indicating whether label resources exist in the nodes.
According to another embodiment of the present invention, there is provided a system including: a first node and a second node; the first node is used for issuing link information to the second node through an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system to the intermediate system based on traffic engineering; the link information carries the following information: and label resource information of a first node in the autonomous domain, wherein the label resource information is used for indicating whether the first node has label resources.
Optionally, the second node is configured to calculate the path by using the label resource information as a parameter for calculating the path after receiving the link information; wherein the path is a path between the head node and the destination node.
Optionally, the second node is further configured to store path information of the path computation failure when the path computation failure is caused by insufficient label resources, where the path information includes: tunnel identification, tunnel entry identification, tunnel exit identification.
Optionally, the second node is further configured to trigger the tunnel to perform reconstruction or re-optimization when the obtained tag resource information changes; wherein the tag resource information is changed by: the tag resource information is changed from indicating that the first node does not have a tag resource to indicating that the first node has a tag resource.
Optionally, the system further comprises: the autonomous domain boundary nodes are nodes shared by an autonomous domain where the first node is located and an autonomous domain where the second node is located; the autonomous domain boundary node is used for sending a notification message to the head node after the change of the label resource information of the first node is acquired; the notification message is used for notifying the head node that the label resource information changes; the second node and the head node are located in the same autonomous domain.
According to still another embodiment of the present invention, there is also provided a storage medium. The storage medium is configured to store program code for performing the steps of: receiving link information issued by an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system based on traffic engineering to the intermediate system; the link information carries the following information: and label resource information of the nodes in the autonomous domain, wherein the label resource information is used for indicating whether label resources exist in the nodes.
Optionally, the storage medium is further arranged to store program code for performing the steps of: taking the label resource information as a parameter for calculating the path, and calculating the path; wherein the path is a path between the head node and the destination node.
Optionally, the storage medium is further arranged to store program code for performing the steps of: when path calculation fails and the reason of the path calculation failure is insufficient label resources, path information of the calculation failure is saved, wherein the path information comprises: tunnel identification, tunnel entry identification, tunnel exit identification.
Optionally, the storage medium is further arranged to store program code for performing the steps of: when the acquired label resource information changes, the reconstruction or re-optimization of the tunnel is triggered; wherein the tag resource information is changed by: the label resource information is changed from the condition that the label resource does not exist in the indication node to the condition that the label resource exists in the indication node.
Optionally, when the tunnel is a far-end tunnel, the tag resource information is obtained to change in the following manner: after the autonomous domain boundary node acquires that the label resource information changes, receiving a notification message sent by the autonomous domain boundary node; the notification message is used for notifying the head node that the label resource information changes; and the autonomous domain boundary node is a node shared by an autonomous domain where the node with the changed label resource information is located and an autonomous domain where the head node is located.
Alternatively, the tag resource information is represented by an extended field or an added field in the link information.
According to the invention, the link information is adopted to carry the label resource information of the nodes in the autonomous domain, and each node has the label resource information of the node.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
fig. 1 is a schematic diagram of tunnel establishment topology in the related art;
FIG. 2 is a schematic diagram of a topological environment of an OSPF-TE within a single domain according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a single Level ISIS-TE topology environment provided according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a topological environment of a cross-domain OSPF-TE according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a topological environment across Level ISIS-TE provided in accordance with an embodiment of the present invention;
fig. 6 is a first flowchart of a link information processing method according to an embodiment of the present invention;
FIG. 7 is a flow chart diagram two of a method of processing link information according to an embodiment of the invention;
fig. 8 is a flowchart three of a link information processing method according to an embodiment of the present invention;
fig. 9 is a first block diagram of a link information processing apparatus according to an embodiment of the present invention;
fig. 10 is a block diagram of the configuration of a link information processing apparatus according to an embodiment of the present invention;
fig. 11 is a block diagram of the configuration of a link information processing apparatus according to an embodiment of the present invention;
fig. 12 is a block diagram of the configuration of a link information processing apparatus according to an embodiment of the present invention;
FIG. 13 is a first block diagram illustrating an architecture of a system according to an embodiment of the present invention;
fig. 14 is a second schematic architecture diagram of a system according to an embodiment of the present invention.
Detailed Description
The invention will be described in detail hereinafter with reference to the accompanying drawings in conjunction with embodiments. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
Example 1
The embodiment of the present application can be applied to the topology environment shown in fig. 2, fig. 3, fig. 4 or fig. 5, fig. 2 is a schematic diagram of the topology environment of OSPF-TE in a single domain according to the embodiment of the present invention; as shown in fig. 2, the topological environment includes 4 nodes, where two tunnels Tunnel1 and Tunnel2 are established at R1 to R3 node, and the path plans of the two tunnels are: R1-R2-R3; R1-R4-R3. FIG. 3 is a schematic diagram of a single Level ISIS-TE topology environment provided according to an embodiment of the present invention; as shown in fig. 3, the topological environment includes 4 nodes, where two tunnels Tunnel1 and Tunnel2 are established at R1 to R3 node, and the path plans of the two tunnels are: R1-R2-R3; R1-R4-R3. FIG. 4 is a schematic diagram of a topological environment of OSPF-TE across autonomous domains provided according to an embodiment of the present invention; the topological environment comprises 6 nodes, two tunnels from Tunnel1 and Tunnel2 are established at R1 to R6 node, R1 and R6 belong to two different autonomous domains, and for Tunnel1, the path is planned to be R1-R3-R4-R6; for Tunnel2, the path plan is: the method is preferably carried out by R1-R2-R3-R4-R6, and the suboptimal path is R1-R2-R3-R5-R6. FIG. 5 is a schematic diagram of a topological environment across Level ISIS-TE provided in accordance with an embodiment of the present invention, where the topological environment includes 6 nodes, two tunnels Tunnel1 and Tunnel2 are established at R1 to R6 node, R1 and R6 belong to two different autonomous domains, and for Tunnel1, the path planning is R1-R3-R4-R6; for Tunnel2, the path plan is: the method is preferably carried out by R1-R2-R3-R4-R6, and the suboptimal path is R1-R2-R3-R5-R6.
It should be noted that the application scenario of the present embodiment is not limited to the listed topology environments.
In this embodiment, a method for processing link information applied to the topology environment is provided, and fig. 6 is a first flowchart of a method for processing link information according to an embodiment of the present invention, as shown in fig. 6, the flowchart includes the following steps:
step S602, receiving the link information issued by the open shortest path first OSPF-TE based on traffic engineering or the internal protocol ISIS-TE from the intermediate system to the intermediate system based on traffic engineering; the link information carries the following information: label resource information of nodes in the autonomous domain, wherein the label resource information is used for indicating whether label resources exist in the nodes or not;
step S604, taking the label resource information as a parameter for calculating the path, and calculating the path; wherein the path is a path between the head node and the destination node.
Through the steps, the label resource information of the nodes in the autonomous domain is carried in the link information, so that each node has the label resource information of the node, and the label information of the node is considered in the path calculation process.
It should be noted that step S602 may be executed separately.
Optionally, the executing subject of the above steps may be each node in the autonomous domain, but is not limited thereto.
It should be noted that the tag resource information may be represented by an extended field or a newly added field in the link information, and optionally, the tag resource information may be represented by an extended subtype length value Sub TLV. In one embodiment, the length may be 1 byte, and the least significant 1bit indicates whether there is a tag resource, where a value of 1 indicates that there is a tag resource, a value of 0 indicates that there is no tag resource, the most significant 1bit indicates a tag space, where a value of 1 indicates a global tag space, and a value of 0 indicates an interface tag space.
In an optional embodiment, if there is no label resource in a node, it may be considered that a path passing through the node is unreachable, that is, in the process of calculating the path, label resource information is taken into consideration, and it is only possible to know in advance whether the path is available, so that an optimal path can be obtained. That is, in the path calculation, CSPF (constraint-based shortest path calculation) may be performed according to some attributes of the tunnel, and for example, the path calculation may be performed using bandwidth, SRLG (risk link group), and factors that the link must have a label resource, as some constraints.
In an embodiment of the present invention, fig. 7 is a flowchart of a method for processing link information according to an embodiment of the present invention, and as shown in fig. 7, after step S604, the method may further include:
step S702, when the path calculation fails and the reason of the path calculation failure is insufficient label resources, saving the path information of the calculation failure, where the path information includes: tunnel identification, tunnel entry identification, tunnel exit identification.
It should be noted that the label resource deficiency may be expressed by the absence of the label resource in one or more nodes through which the path passes, but is not limited thereto.
By storing the path information of the path failure, the path is not considered in the tunnel establishment process, and the tunnel establishment time is further saved.
In an embodiment of the present invention, the method may further include: when the acquired label resource information changes, triggering the tunnel to carry out reconstruction or re-optimization; wherein the tag resource information is changed by: the label resource information is changed from the condition that the label resource does not exist in the indication node to the condition that the label resource exists in the indication node.
It should be noted that, when the tunnel is a home-end tunnel, the reconstruction or re-optimization of the tunnel may be directly triggered when the obtained tag resource information changes; when the tunnel is a far-end tunnel, the label resource information is acquired to be changed in the following mode: after the autonomous domain boundary node acquires that the label resource information changes, receiving a notification message sent by the autonomous domain boundary node; the notification message is used for notifying the head node that the label resource information changes; and the autonomous domain boundary node is a node shared by an autonomous domain where the node with the changed label resource information is located and an autonomous domain where the head node is located.
Note that, the change of the tag resource information may further include: the label resource information is changed from indicating node existence label resource to indicating node nonexistence label resource. At this time, when the tunnel is a home-end tunnel, the label resource information can be directly acquired; when the tunnel is a far-end tunnel, the label resource information of the nodes outside the autonomous domain can be obtained through the boundary nodes of the autonomous domain.
It should be noted that, when the head node is in the down state, the tunnel is triggered to be reconstructed, and when the head node is in the UP state, the re-optimization of the tunnel is triggered.
Through the steps, the change of the label resource from the absence to the presence and from the presence to the absence can be sensed by the nodes in the same autonomous domain or the nodes outside the autonomous domain, and then the reconstruction and the re-optimization of the tunnel can be triggered in time, so that the tunnel can be opened in time or can be taken on a better path, the interruption of the service is avoided, and the user experience is improved.
In this embodiment, a method for processing link information applied to the topology environment is further provided, and fig. 8 is a flowchart three of a method for processing link information according to an embodiment of the present invention, as shown in fig. 8, the method includes:
step S802, issuing link information through an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system to the intermediate system based on traffic engineering; the link information carries the following information: and label resource information of the nodes in the autonomous domain, wherein the label resource information is used for indicating whether label resources exist in the nodes.
Through the steps, the label resource information of the nodes in the autonomous domain is carried in the link information, so that each node has the label resource information of the node.
Optionally, the executing subject of the above steps may be each node in the autonomous domain, but is not limited thereto.
It should be noted that the tag resource information may be represented by an extended field or a newly added field in the link information, and optionally, the tag resource information may be represented by an extended subtype length value Sub TLV. In one embodiment, the length may be 1 byte, and the least significant 1bit indicates whether there is a tag resource, where a value of 1 indicates that there is a tag resource, a value of 0 indicates that there is no tag resource, the most significant 1bit indicates a tag space, where a value of 1 indicates a global tag space, and a value of 0 indicates an interface tag space.
Other limitations in this embodiment may refer to the description of the embodiment shown in fig. 6 and fig. 7, and are not described herein again.
For a better understanding of the present invention, the present invention is further explained below with reference to preferred examples.
The embodiment of the present invention provides a preferred method for notifying a label resource (which is equivalent to the method for processing link information in the foregoing embodiment), so that a change in a node or an interface label resource can be issued in a domain, and thus a tunnel can sense the change in time to perform related path calculation and adjustment.
The above preferred embodiment comprises the steps of:
step 1, expanding link Sub TLV information (equivalent to the link information in the above embodiment) of OSPF-TE and ISIS-TE, and increasing the issue of tag resource information Sub TLV information when issuing the link information; (corresponding to step S802 in the above-described embodiment or step S602 in the above-described embodiment);
step 2, when calculating the path, the label resource of the link is considered when calculating the path, and an optimal path is selected; (corresponding to step S604 in the above-described embodiment)
Step 3, recording tunnel information of path calculation failure caused by insufficient label resources, and storing the tunnel information in a local node; (corresponding to step S702 in the above-described embodiment)
And 4, when the label resource of the node or the link is changed, triggering the tunnel reconstruction or the re-optimization for the local tunnel, and sending a notify message to trigger the tunnel head node to trigger the tunnel reconstruction or the re-optimization for the remote tunnel. (equivalent to the above embodiment, when the obtained label resource information changes, the tunnel is triggered to be rebuilt or re-optimized)
It should be noted that, in step 1, tag resource information Sub TLV of OSPF-TE and ISIS-TE is extended, the length is 1 byte, the lowest bit 1bit indicates whether a tag resource exists, 1 indicates existence, and 0 indicates absence; the most significant bit 1bit represents the label space, 1 represents the global label space, and 0 represents the interface label space. In the step 2, the path calculation considers the link label resource, which means that the flooded label resource Sub TLV needs to be taken into account during the path calculation, and if no label resource exists in the link, the path is considered to be unreachable. The step 3 of recording tunnel information of path computation failure caused by insufficient label resources means that the tunnel information of path computation failure caused by insufficient label resources is recorded at a node initiating path computation. The tunnel information includes a tunnel identifier tunnelId, an entrance identifier IngressId, and an exit identifier EgressId. And 4, when the label resource of the node or the link is changed, the change process of the label resource from nothing to nothing is referred to. Step 4, triggering tunnel reconstruction or re-optimization for the local tunnel, namely triggering the local tunnel as a head node to perform the following operations when the node receives the label resource of certain link information in the domain from the beginning: if the state is down, triggering the tunnel reconstruction; if the state is the UP state, the tunnel re-optimization is triggered. And 4, sending a notify message to a tunnel head node to trigger the tunnel reconstruction or the re-optimization for the far-end tunnel. The node receives the label resource of a certain link in the domain from the beginning, checks the entry belonging to the remote tunnel in the step 3, and sends a notify message to the head node to indicate that the available label resource exists. The head node receives the notify message and carries out the following operations: if the state is down, triggering the tunnel reconstruction; if the state is the UP state, the tunnel re-optimization is triggered.
By adopting the method provided by the preferred embodiment of the invention, whether the label resource of the node or the link is available can be issued to participate in the path calculation decision, and the reconstruction and the re-optimization of the tunnel can be triggered in time. The tunnel service is prevented from being interrupted for a long time and the optimization of the path is triggered in time, and the user experience is improved.
Example 1.1:
in the topology environment shown in fig. 2, when R2 has no available label resource, R2 is advertised by OSPF-TE to nodes throughout the domain via the extended Sub TLV described above. The information can be received by all of R1, R3, R4.
When R1 receives that R2 has no available label resources, the Tunnel1 path is planned as R1-R2-R3, and label resource information participates in path computation, in which case the path computation fails because of insufficient label resources. At this point, the information of the Tunnel is recorded (R1, R3, Tunnel 1). The path planning of the Tunnel2 has two paths, wherein R1-R2-R3 are optimal paths, R1-R4-R3 are suboptimal paths, and similarly, the Tunnel can only walk the suboptimal paths R1-R4-R3.
At a certain moment, when R2 has a label resource available, R2 is announced to nodes in the whole domain by OSPF-TE through an extended Sub TLV. The information can be received by all of R1, R3, R4.
When R1 receives that R2 has available label resources, the local tunnel1 in the down state is reconstructed, the tunnel is successfully established, and the path is R1-R2-R3; the Tunnel2 which has been UP is re-optimized, after which Tunnel2 takes the optimal path R1-R2-R3.
Example 1.2:
in the topology environment shown in FIG. 3, when R2 has no available label resource, R2 is advertised by ISIS-TE to the entire Level interior node through the extended Sub TLV described above. The information can be received by all of R1, R3, R4.
When R1 receives that R2 has no available label resource, the Tunnel1 path planning dynamically calculates the path, the label resource information participates in the path calculation, and the Tunnel Tunnel1 has the bandwidth requirement of 100M, in which case the path calculation is failed due to insufficient label resource and insufficient bandwidth. At this point, the information of the Tunnel is recorded (R1, R3, Tunnel 1). The path planning of the Tunnel2 has two paths, wherein R1-R2-R3 are optimal paths, R1-R4-R3 are suboptimal paths, and only the suboptimal paths R1-R4-R3 can be selected through calculation.
At a certain moment, when R2 has label resources available, R2 is notified to the whole Level inner node by ISIS-TE through the extended Sub TLV. The information can be received by all of R1, R3, R4.
When R1 receives that R2 has available label resources, the local tunnel1 in the down state is rebuilt, the tunnel is successfully established, and the path is R1-R2-R3 (the bandwidth of the R1-R4-R3 path is insufficient); the Tunnel2 which has been UP is re-optimized, after which Tunnel2 takes the optimal path R1-R2-R3.
Example 1.3:
in the topology environment shown in fig. 4, when R4 has no available label resource, R4 is advertised by OSPF-TE to nodes throughout the domain via the extended Sub TLV described above. All of R3, R5, R6 can receive this information, which is not received by nodes R1 and R2 outside the domain.
According to the path plan, Tunnel1 calculates a path at R1, first to domain boundary R3, the path is R1-R3, and initiates path calculation again at R3, the destination is tail node R6. Since the information that the R4 node has no available label resources is informed to the R3, the calculation fails when the planned path R3-R4-R6 is calculated, because the label resources are insufficient. At this time, the information of the Tunnel is recorded at the path calculation point R3(R1, R6, Tunnel 1).
Similarly, the Tunnel2 calculates a path at R1, and first of all, it also calculates to domain boundary R3, the path is R1-R2-R3, and starts path calculation again at R3, and the destination is R6, and because the calculation of the planned optimal path R3-R4-R6 fails, the Tunnel information is recorded (R1, R6, Tunnel2), and only the suboptimal path R3-R5-R6 can be followed. Therefore, the path finally established by the Tunnel2 is the suboptimal path R1-R2-R3-R5-R6.
At some point when R4 has tag resources available, R4 is advertised by OSPF-TE to nodes throughout the domain via an extended Sub TLV. The information can be received by all of R3, R5, R6. The R1 and R2 nodes outside the domain do not receive this information.
When the R3 receives the information that the label is available, the records of the route calculation failure are checked, the two failed records belong to the remote tunnel, and the records are sent to the head node R1 through notify messages, and the information that the label resource is available is informed that R4 has the label resource.
After receiving the notify message sent by the R3, the R1 resolves that the tunnels are Tunnel1 and Tunnel2, the Tunnel1 initiates reconstruction for the down state, and the path is successfully established according to the planned R1-R3-R4-R6. And the Tunnel2 is subjected to re-optimization for the UP state, and the path is adjusted to be R1-R2-R3-R4-R6 above the planned optimal path.
Example 1.4:
in the topology environment shown in fig. 5, this embodiment is the same as the procedure of embodiment 1.3, except that it is notified whether the label resource is available, and is notified by ISIS-TE, which will not be described again here.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
Example 2
In this embodiment, a device for processing link information is further provided, where the device is used to implement the foregoing embodiments and preferred embodiments, and details are not repeated for what has been described. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 9 is a block diagram of a first configuration of a link information processing apparatus according to an embodiment of the present invention, and as shown in fig. 9, the apparatus includes:
a receiving module 92, configured to receive link information issued by an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system to the intermediate system based on traffic engineering; the link information carries the following information: label resource information of nodes in the domain, wherein the label resource information is used for indicating whether label resources exist in the nodes or not;
an operation module 94, connected to the receiving module 92, for calculating the path by using the label resource information as a parameter for calculating the path; wherein the path is a path between the head node and the destination node.
Through the device, the label resource information of the nodes in the domain is carried in the link information, so that each node has the label resource information of the node, and the operation module 94 considers the label information of the node in the process of path calculation.
It should be noted that the apparatus may also include the receiving module 92 alone, but is not limited thereto. The above-mentioned apparatus may be located in a node in a domain, or may be independent of a node, and is not limited thereto.
For the explanation of the tag resource information, reference may be made to the above method embodiment, which is not described herein again.
Fig. 10 is a block diagram of a second structure of a link information processing apparatus according to an embodiment of the present invention, and as shown in fig. 10, the apparatus may further include:
a storage module 1002, connected to the operation module 94, configured to store path information of a path calculation failure when the path calculation failure is caused by insufficient label resources, where the path information includes: tunnel identification, tunnel entry identification, tunnel exit identification.
It should be noted that the label resource deficiency may be expressed by the absence of the label resource in one or more nodes through which the path passes, but is not limited thereto.
Fig. 11 is a block diagram of a third structure of a link information processing apparatus according to an embodiment of the present invention, and as shown in fig. 11, the apparatus may further include:
a triggering module 1102 connected to the receiving module 92, configured to trigger the tunnel reconstruction or re-optimization when the obtained tag resource information changes; wherein the tag resource information is changed by: the label resource information is changed from the label resource which indicates that the node does not exist into the label resource.
Optionally, the receiving module 92 is further configured to obtain, when the tunnel is a far-end tunnel, that the tag resource information changes by: after the domain boundary node acquires that the label resource information changes, receiving a notification message sent by the domain boundary node; the notification message is used for notifying the head node that the label resource information changes; the domain boundary node is a node shared by a domain where the node with changed label resource information is located and a domain where the head node is located.
For the explanation of the reconstruction and re-optimization of the triggered tunnel, reference may be made to the above method embodiment, and details are not described here.
Through the device, the change of the label resource from the existence to the existence and from the existence to the nonexistence can be sensed by the nodes in the same domain or the nodes outside the domain, and then the reconstruction and the optimization of the tunnel can be triggered in time, so that the tunnel can be opened in time or can be moved on a better path, the interruption of service is avoided, and the user experience is improved.
It should be noted that, the above modules may be implemented by software or hardware, and for the latter, the following may be implemented, but not limited to: the modules are all positioned in the same processor; alternatively, the modules are respectively located in different processors in any combination.
Example 3
In this embodiment, there is further provided a link information processing apparatus, and fig. 12 is a block diagram of a fourth structure of the link information processing apparatus according to the embodiment of the present invention, and as shown in fig. 12, the apparatus may include: a publishing module 1202, configured to publish link information via an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system to the intermediate system based on traffic engineering; the link information carries the following information: label resource information of nodes in the domain, wherein the label resource information is used for indicating whether label resources exist in the nodes.
Through the device, the label resource information of the nodes in the domain is carried in the link information, so that each node has the label resource information of the node, compared with the prior art, whether the available label resource exists or not is not required to be confirmed in the signaling interaction process, therefore, whether the node has the available label resource or not can be known in advance, whether a path is available or not can be found in advance, the tunnel establishment time is shortened, and the problem of tunnel establishment delay in the related technology is solved.
Alternatively, the above-mentioned devices may be located at each node in the domain, or may be independent of each node in the domain, but are not limited thereto.
It should be noted that, for the explanation of this embodiment, reference may be made to the corresponding method embodiment described above, and details are not described here again.
Example 4
In this embodiment, a system is further provided, and fig. 13 is a first schematic architecture diagram of the system provided in the embodiment of the present invention, as shown in fig. 13, 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 an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system to the intermediate system based on traffic engineering; the link information carries the following information: label resource information of the first node 1302 in the domain, wherein the label resource information is used for indicating whether the label resource exists in the first node 1302.
Through the system, the label resource information of the nodes in the domain is carried in the link information, and each node has the label resource information of the node.
In an embodiment of the present invention, the second node 1304 is configured to, after receiving the link information, calculate a path by using the label resource information as a parameter for calculating the path; wherein the path is a path between the head node and the destination node.
It should be noted that the second node 1304 may also be configured to, when the path computation fails and the reason for the path computation failure is that the label resource is insufficient, store path information of the computation failure, where the path information includes: tunnel identification, tunnel entry identification, tunnel exit identification.
In an embodiment of the present invention, the second node 1304 is further configured to trigger a tunnel to be reestablished or re-optimized when the obtained tag resource information changes; wherein the tag resource information is changed by: the label resource information is changed from indicating that the first node 1302 does not have a label resource to indicating that the first node 1302 has a label resource.
Fig. 14 is a schematic structural diagram of a system according to an embodiment of the present invention, and as shown in fig. 14, the system may further include: a domain border node 1402 connected to the first node 1302 and the second node 1304, wherein the domain border node 1402 is a node shared by a domain in which the first node 1302 is located and a domain in which the second node 1304 is located;
the domain border node 1402 is configured to send a notification message to the head node after obtaining that the label resource information of the first node 1302 changes; the notification message is used for notifying the head node that the label resource information changes; the second node 1304 and the head node are located in the same domain.
It should be noted that, for the explanation of the present embodiment, reference may be made to the explanation of the above method embodiment, and details are not described here.
Example 5
The embodiment of the invention also provides a storage medium. Alternatively, in the present embodiment, the storage medium may be configured to store program codes for performing the following steps:
s1, receiving the link information issued by the open shortest path first OSPF-TE based on traffic engineering or the internal protocol ISIS-TE from the intermediate system based on traffic engineering to the intermediate system; the link information carries the following information: label resource information of nodes in the domain, wherein the label resource information is used for indicating whether label resources exist in the nodes.
Optionally, the storage medium is further arranged to store program code for performing the steps of:
s2, calculating the path by using the label resource information as the parameter of the calculated path; wherein the path is a path between the head node and the destination node.
Optionally, the storage medium is further arranged to store program code for performing the steps of:
s3, when the path computation fails and the reason of the path computation failure is insufficient label resources, saving the path information of the computation failure, where the path information includes: tunnel identification, tunnel entry identification, tunnel exit identification.
Optionally, the storage medium is further arranged to store program code for performing the steps of:
s4, when the obtained label resource information changes, the reconstruction or re-optimization of the tunnel is triggered; wherein the tag resource information is changed by: the label resource information is changed from the condition that the label resource does not exist in the indication node to the condition that the label resource exists in the indication node
Optionally, in this embodiment, the storage medium may include, but is not limited to: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments and optional implementation manners, and this embodiment is not described herein again.
It will be apparent to those skilled in the art that the modules or steps of the present invention described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (10)

1. A method for processing link information, comprising:
the second node receives link information which is issued by the first node through an Open Shortest Path First (OSPF) -TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system based on traffic engineering to the intermediate system and contains label resource information of nodes in the autonomous domain;
the second node takes the label resource information contained in the link information as a parameter for calculating a path, and calculates the path;
when the path calculation fails and the reason of the path calculation failure is that the label resource is insufficient, saving path information of the calculation failure, wherein the path information comprises: tunnel identification, tunnel entry identification, tunnel exit identification.
2. The method according to claim or 1, characterized in that when the acquired tag resource information changes, the reconstruction or re-optimization of the tunnel is triggered; wherein the tag resource information changing comprises: the label resource information is changed from indicating that the node does not have a label resource to indicating that the node has a label resource.
3. The method of claim 2, wherein when the tunnel is a far-end tunnel, the tag resource information is obtained to be changed by: after acquiring that the label resource information changes, an autonomous domain boundary node receives a notification message sent by the autonomous domain boundary node; wherein, the notification message is used for notifying the head node that the label resource information is changed; and the autonomous domain boundary node is a node shared by an autonomous domain where the node with the changed label resource information is located and an autonomous domain where the head node is located.
4. The method of claim 1, wherein the tag resource information is represented by an extended field or a newly added field in the link information.
5. A link information processing apparatus, comprising:
a receiving module, configured to receive link information including label resource information of nodes in an autonomous domain, where the link information is issued by a first node through an open shortest path first OSPF-TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system based on traffic engineering to the intermediate system;
the operation module is used for taking the label resource information contained in the link information as a parameter for calculating a path and calculating the path;
a storage module, configured to store path information of a failure in computation when the path computation fails and a reason of the failure in path computation is that the label resource is insufficient, where the path information includes: tunnel identification, tunnel entry identification, tunnel exit identification.
6. The apparatus of claim 5, further comprising: the triggering module is used for triggering the reconstruction or the re-optimization of the tunnel when the acquired label resource information changes; wherein the tag resource information changing comprises: the label resource information is changed from indicating that the node has no label resource to having label resource.
7. The apparatus of claim 6, further comprising: an obtaining module, configured to obtain that the tag resource information changes in the following manner when the tunnel is a far-end tunnel: after acquiring that the label resource information changes, an autonomous domain boundary node receives a notification message sent by the autonomous domain boundary node; wherein, the notification message is used for notifying the head node that the label resource information is changed; and the autonomous domain boundary node is a node shared by an autonomous domain where the node with the changed label resource information is located and an autonomous domain where the head node is located.
8. A system for processing link information, comprising: a first node and a second node;
the first node is used for issuing link information containing label resource information of nodes in the autonomous domain to the second node through an Open Shortest Path First (OSPF) -TE based on traffic engineering or an internal protocol ISIS-TE from an intermediate system to the intermediate system based on traffic engineering;
the second node is configured to calculate a path by using the label resource information in the link information as a parameter for calculating the path; and when the path calculation fails and the reason of the path calculation failure is that the label resource is insufficient, saving path information of the calculation failure, wherein the path information comprises: tunnel identification, tunnel entry identification, tunnel exit identification.
9. The system according to claim 8, wherein the second node is further configured to trigger tunnel reconstruction or re-optimization when the obtained tag resource information changes; wherein the tag resource information changing comprises: the tag resource information is changed from indicating that the first node does not have a tag resource to indicating that the first node has a tag resource.
10. The system of claim 9, further comprising: an autonomous domain boundary node, wherein the autonomous domain boundary node is a node shared by an autonomous domain where the first node is located and an autonomous domain where the second node is located; the autonomous domain boundary node is used for sending a notification message to a head node after the change of the label resource information of the first node is acquired; wherein the notification message is used to notify the head node that the tag resource information has changed; the second node and the head node are located in the same autonomous domain.
CN201610293852.3A 2016-05-05 2016-05-05 Link information processing method, device and system Active CN107347034B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201610293852.3A CN107347034B (en) 2016-05-05 2016-05-05 Link information processing method, device and system
PCT/CN2017/083122 WO2017190675A1 (en) 2016-05-05 2017-05-05 Link information processing method, apparatus and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610293852.3A CN107347034B (en) 2016-05-05 2016-05-05 Link information processing method, device and system

Publications (2)

Publication Number Publication Date
CN107347034A CN107347034A (en) 2017-11-14
CN107347034B true CN107347034B (en) 2021-11-19

Family

ID=60202747

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610293852.3A Active CN107347034B (en) 2016-05-05 2016-05-05 Link information processing method, device and system

Country Status (2)

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

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112054958B (en) * 2019-06-06 2023-07-14 中兴通讯股份有限公司 Path calculation method, storage medium and electronic device
CN112558504B (en) * 2019-09-10 2021-11-02 中国电信股份有限公司 Method, device and system for forwarding critical path information based on OSPF protocol
CN110958181B (en) * 2019-12-06 2021-08-17 Ut斯达康通讯有限公司 Method and device for distributing SRv 6-crossing slicing network by ISIS protocol

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101155135A (en) * 2006-09-28 2008-04-02 华为技术有限公司 Method and device for flooding autonomous system border router ability information
CN101521601A (en) * 2008-02-29 2009-09-02 华为技术有限公司 Method, system and device for advertising adjacent network domain of DS-TE information
CN101674231A (en) * 2008-09-11 2010-03-17 华为技术有限公司 Method and network device for processing traffic engineering link information
CN101820556A (en) * 2009-02-26 2010-09-01 华为技术有限公司 Method, device and system for routing protocol message issuance and routing computation
CN102571530A (en) * 2010-12-16 2012-07-11 中兴通讯股份有限公司 Inter-domain link status information processing method and PCE

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008044646A1 (en) * 2006-10-06 2008-04-17 Nippon Telegraph And Telephone Corporation Communication node apparatus, communication system, and path resource assigning method
CN101163090B (en) * 2006-10-09 2010-08-04 华为技术有限公司 Service path calculating method
JP4764325B2 (en) * 2006-12-26 2011-08-31 富士通株式会社 Communication apparatus and protocol processing method
CN101835066A (en) * 2009-03-13 2010-09-15 中兴通讯股份有限公司 Label switched path (LSP) processing method based on link bundle
WO2012097878A1 (en) * 2011-01-21 2012-07-26 Telefonaktiebolaget Lm Ericsson (Publ) Timer value negotiation for path configuration based on rsvp-te
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
CN101155135A (en) * 2006-09-28 2008-04-02 华为技术有限公司 Method and device for flooding autonomous system border router ability information
CN101521601A (en) * 2008-02-29 2009-09-02 华为技术有限公司 Method, system and device for advertising adjacent network domain of DS-TE information
CN101674231A (en) * 2008-09-11 2010-03-17 华为技术有限公司 Method and network device for processing traffic engineering link information
CN101820556A (en) * 2009-02-26 2010-09-01 华为技术有限公司 Method, device and system for routing protocol message issuance and routing computation
CN102571530A (en) * 2010-12-16 2012-07-11 中兴通讯股份有限公司 Inter-domain link status information processing method and PCE

Also Published As

Publication number Publication date
CN107347034A (en) 2017-11-14
WO2017190675A1 (en) 2017-11-09

Similar Documents

Publication Publication Date Title
US10187301B2 (en) Establishing label switched paths having refresh interval independent fast reroute facility protection
US8817591B2 (en) Inter-domain signaling to update remote path computation elements after a call set-up failure
US9088485B2 (en) System, method and apparatus for signaling and responding to ERO expansion failure in inter-domain TE LSP
US20130232193A1 (en) Control-Plane Interface Between Layers in a Multilayer Network
EP3780514B1 (en) Tunnel setup method, apparatus, and system
US10462045B1 (en) Topology independent fast reroute for node and SRLG local protection
US9300564B2 (en) Ordered flooding requests for path computation elements
WO2013188764A2 (en) Dynamically triggered traffic engineering routing advertisements in stateful path computation element environments
US11588725B2 (en) Method and apparatus for path computation
US8824451B2 (en) Method and system for establishing an associated bidirectional label-switched path
US11121975B2 (en) Framework for temporal label switched path tunnel services
US10666562B2 (en) Network path computation method, apparatus, and system
CN107347034B (en) Link information processing method, device and system
US20210281507A1 (en) Parameter notification and obtaining methods and devices, and storage medium
US20190379596A1 (en) Methods and Systems preventing Make Before Break failures during soft preemption in MPLS
CN110266587A (en) A kind of processing method and processing device of link-state information
CN109150716A (en) Change in topology response method, path calculating client and path computing system
WO2017143958A1 (en) System, method and apparatus for implementing fast reroute (frr)
US10715420B2 (en) System, method and apparatus for implementing fast reroute (FRR)
CN108243104B (en) Multi-layer LSP control method and device
CN109729006B (en) Message processing method and device and computer readable storage medium
US20140269737A1 (en) System, method and apparatus for lsp setup using inter-domain abr indication
WO2023156016A1 (en) Recovery from a failure of an inter-domain link between two domains
WO2016177186A1 (en) Bandwidth protection method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant