RSVP-TE TE++ Shortcuts

Link-state protocols, such as OSPF and IS-IS, use the shortest-path-first (SPF) algorithm to compute the shortest-path tree to all nodes in the network. The results of such computations can be represented by the destination node, next-hop address, and output interface, where the output interface is a physical interface. You can use label-switched paths (LSPs) to augment the SPF algorithm. This feature enables support for IGP shortcuts over container LSPs in an RSVP-TE TE++ architecture.