Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node

Abstract

The invention discloses a path calculation method of a loose node in an RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel, the loose node, a non-loose node and the RSVP-TE network. The method comprises the following steps that: each node in the RSVP-TE network sends a PATH message carrying the router ID (Identifier) of the node to a downstream node; when the path of the loose node is calculated, the router ID is used as a constraint condition of path exclude to submit to CSPF (Constrained Shortest Path First) to calculate the path. The loose node comprises a receiving module, a path calculation module and a message generating module; the non-loose node comprises a message generating module and a sending module; and the RSVP-TE network comprises the loose node and the non-loose node. The local router ID of an upstream node is used as a constraint condition of the path exclude, so that the possibility of a loop generated when the path of the loose node is calculated is greatly reduced.

Description

technical field [0001] The present invention relates to the field of data network communication, in particular to a method for calculating the path of loose nodes in a traffic engineering-based Resource Reservation Protocol-Traffic Engineer (RSVP-TE) tunnel, loose nodes and non-loose nodes, and RSVP-TE network. Background technique [0002] RSVP-TE is a traffic engineering technology based on MPLS (Multi-Protocol Label Switching, Multi-Protocol Label Switching). After RSVP is extended, it can support the distribution of MPLS labels, and carry resource reservation information while transmitting label binding messages. This extended RSVP is called RSVP-TE, and is used as a signaling protocol in MPLS TE LSP tunnels are established, and service traffic can be forwarded in TE tunnels (TE Tunnels) through the combined use of the four functions of information publishing, path calculation, signaling exchange (RSVP-TE), and data forwarding. [0003] The path calculation process of ...

AI Technical Summary

Problems solved by technology

At this time, there will be such a problem: when the tunnel is rebuilt, the above steps are repeated, and the tunnel cannot be established.

[0006] From the above analysis, it can be seen that there is no mechanism in the subsequent tunnel reconstruction process to automatically avoid such loop calculation results during the path calculation process of loose nodes, so that the tunnel is always in the process of path calculation, loop detection, and teardown. loop without being able to build a successful

Images