This section describes how traffic is mapped to tunnels. It describes how conventional
hop-by-hop link-state routing protocols interact with MPLS TE capabilities. This section
describes how the shortest path first (SPF) algorithm, sometimes called a Dijkstra
algorithm, is enhanced. This enhancement allows a link-state IGP to forward traffic
automatically over tunnels that MPLS traffic engineering establishes.
Link-state protocols, such as integrated IS-IS or OSPF, use an SPF algorithm to compute
a shortest path tree from the headend node to all the nodes in the network. Routing
tables are derived from this shortest path tree. The routing tables contain ordered sets
of destination and first-hop information. If a router does normal hop-by-hop routing,
the first hop is over a physical interface attached to the router.
New traffic engineering algorithms calculate explicit routes to one or more nodes in the
network. The originating router views these explicit routes as logical interfaces. In
the context of this document, these explicit routes are represented by LSPs and referred
to as traffic engineering tunnels (TE tunnels).
The following sections describe how link-state IGPs can use these shortcuts, and how
they can install routes in the routing table that point to these TE tunnels. These
tunnels use explicit routes. The path taken by a TE tunnel is controlled by the router
that is the headend of the tunnel. In the absence of errors, TE tunnels are guaranteed
to not loop, but routers must agree on how to use the TE tunnels. Otherwise, traffic
might loop through two or more tunnels.
When specifying an explicit path for an MPLS TE tunnel, you can specify link or node
addresses of the next-hop routers in an explicit path. You can also specify a mixture of
link and node addresses. There are no restrictions when specifying a mixture of link and
node addresses.