MPLS Traffic Engineering
Constraint-based routing and explicit path setup for optimal resource utilization.
Introduction: Beyond the Shortest Path
Imagine planning a road trip from New York City to Los Angeles. A standard GPS, focused solely on the shortest distance, might route you through Chicago. This is the logic of a traditional like OSPF. It diligently calculates the mathematically lowest-cost path and sends all traffic down that route, regardless of any other factors.
Now, what if there is a massive traffic jam in Chicago? The standard GPS does not care; it will stubbornly keep sending you into the gridlock because it is still the shortest path on the map. This is a major limitation of standard IP routing. While it is excellent at finding paths, it is fundamentally unaware of network resources like available bandwidth. It cannot see traffic jams, and it has no mechanism to steer traffic onto a slightly longer but completely empty highway to avoid them. In a large service provider network, this leads to inefficient resource utilization: some core links become heavily congested while others sit idle.
MPLS Traffic Engineering (MPLS-TE) is the solution to this problem. It is a sophisticated set of tools that allows network administrators to move beyond simple shortest-path routing and exert fine-grained, intelligent control over the paths that data takes. It is the network equivalent of a modern navigation app like Waze or Google Maps, which can see live traffic conditions and route you around congestion, even if it means taking a longer route. MPLS-TE enables the network to make decisions based not just on topology, but also on real-time network constraints and resource availability.
The Three Pillars of MPLS Traffic Engineering
MPLS-TE is not a single protocol, but a system that works by combining three key functional components.
- The Information Distribution Component:
First, routers need a way to see the "live traffic map." They need more information than just the simple cost of a link. MPLS-TE achieves this by adding extensions to existing IGPs (like OSPF or IS-IS), allowing them to advertise not just connectivity, but also resource information like available bandwidth on each link. This creates a rich database of network constraints.
- The Path Calculation Component:
Once a router has this detailed map, it needs an algorithm to calculate a path that meets specific requirements. This is done by a modified algorithm called Constrained Shortest Path First (CSPF). It can answer questions like, "Find me the shortest path from New York to LA that has at least 1 Gbps of free bandwidth on every link."
- The Signaling Component:
After a valid path has been calculated, a mechanism is needed to establish the traffic-engineered tunnel across the network. This is the job of a signaling protocol, most commonly RSVP-TE (Resource Reservation Protocol - Traffic Engineering). RSVP-TE travels along the path calculated by CSPF, "reserving" the required bandwidth on each router and building the Label Switched Path (LSP).
Pillar 1: Building the Traffic Map with IGP Extensions
A standard OSPF router only advertises basic information about its links in its Link-State Advertisements (LSAs): the link's cost and the networks connected to it. This is enough for a basic topological map but provides no insight into the link's capabilities or current load.
To enable Traffic Engineering, these protocols were enhanced. OSPF-TE and IS-IS-TE add new, optional fields (called Type-Length-Value or TLVs) to their update messages. These extensions allow routers to advertise a wealth of additional information about their links, including:
- Maximum Link Bandwidth: The total configured bandwidth of the link.
- Reservable Link Bandwidth: How much of the total bandwidth is available for TE tunnel reservations.
- Unreserved Bandwidth: How much reservable bandwidth is currently free.
- Administrative Group (Link Color): An administrator can assign "colors" (represented by a 32-bit number) to links to group them logically, for example, tagging all fiber links as "blue" and all satellite links as "red".
This extra information is flooded throughout the network just like standard link-state information. Every TE-enabled router collects this data and stores it in a separate database called the Traffic Engineering Database (TED). The TED is the rich, detailed, "live traffic" map that MPLS-TE needs to make intelligent decisions.
Pillar 2: Calculating the Path with CSPF
With a complete TED, the ingress router (the router at the start of the desired tunnel) can now calculate a path. It does not use the standard SPF algorithm. Instead, it uses the Constrained Shortest Path First (CSPF) algorithm.
CSPF is an enhancement of SPF. Before running the shortest-path calculation, it first prunes the network topology stored in the TED. It temporarily removes any links that do not meet the explicit constraints defined for the traffic engineering tunnel.
CSPF in Action: A Step-by-Step Example
An administrator wants to create a tunnel from Router A to Router F with a guaranteed bandwidth of .
Router A will perform the following CSPF process:
- Step 1 (Receive Constraint): The router receives the request for a tunnel to F requiring .
- Step 2 (Prune the TED): The router consults its TED. It looks at the A→B link and sees that the unreserved bandwidth is only . Since , this link does not meet the constraint. CSPF temporarily removes the A→B link from the map for this calculation.
- Step 3 (Run SPF on the Pruned Topology): CSPF now runs the standard SPF algorithm on the remaining, modified topology. On this pruned map, the only available path is A→C→D→F, which has sufficient bandwidth on all segments.
- Step 4 (Return Path): The algorithm concludes that the best constrained path is A → C → D → F and returns this explicit list of hops.
The result is a path that not only works but also meets the specific resource requirements of the service.
Pillar 3: Signaling the Tunnel with RSVP-TE
Calculating the path is just the first step. Now, that path must be established, and resources must be reserved along it. This is the role of the signaling protocol, RSVP-TE.
RSVP (Resource Reservation Protocol) was originally designed for reserving resources for individual data flows, but it was extended to support the specific needs of Traffic Engineering, creating RSVP-TE. It works by sending two key messages along the path calculated by CSPF.
The PATH and RESV Message Exchange
- The PATH Message (Forward Pass):
The ingress router (A) creates an RSVP PATH message. This message contains the explicit path calculated by CSPF (A → C → D → F) and the required resources (e.g., bandwidth). It sends this message to the first hop, Router C.
Router C receives the PATH message. It checks if it has available on its link to D. If it does, it makes a provisional reservation and forwards the PATH message to Router D. Router D does the same, forwarding the message to the egress router, F.
- The RESV Message (Backward Pass):
The egress router (F) receives the PATH message. This confirms that a path with sufficient resources exists. It then initiates the reservation process by sending an RSVP RESV (Reservation) message back upstream, following the exact reverse path. This RESV message also contains the label that the upstream router should use.
The RESV message arrives at Router D. This confirms the reservation, and D now knows that it should use the label provided by F for packets on this tunnel. Router D then allocates its own label for the tunnel and includes it in the RESV message it sends back to Router C. This process continues backward until the RESV message reaches the ingress router, A.
- Tunnel Established:
When the ingress router A receives the RESV message from C, the process is complete. A full, end-to-end LSP has been signaled, bandwidth has been reserved on every link, and every router along the path knows which label to use to forward traffic through the newly created tunnel. The router can now start sending traffic into the MPLS-TE tunnel.