Traffic Engineering with MPLS

Agenda

Introduction to traffic engineering

Brief history Vocabulary Requirements for Traffic Engineering Basic Examples

RSVP signaling protocol RSVP objects Extensions to RSVP

Signaling LSPs with RSVP

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 2

Agenda

Constraint-based traffic engineering

Extensions to IS-IS and OSPF Traffic Engineering Database User defined constraints Path section using CSPF algorithm
Secondary LSPs Hot-standby LSPs Fast Reroute

Traffic protection

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 3

Agenda

Advanced traffic engineering features

Circuit cross connect (CCC) IGP Shortcuts Configuring for transit traffic Configuring for internal destinations

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 4

Introduction to Traffic Engineering

Why Engineer Traffic?

What problem are we trying to solve with Traffic Engineering?

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 6

Brief History

Early 1990s
Internet core was connected with T1 and T3 links between routers Only a handful of routers and links to manage and configure Humans could do the work manually IGP (Interior Gateway Protocol) Metricbased traffic control was sufficient

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 7

IGP Metric-Based Traffic Engineering

Traffic sent to A or B follows path with lowest metrics

A
1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 8

IGP Metric-Based Traffic Engineering

Drawbacks

Redirecting traffic flow to A via C causes traffic for B to move also! Some links become underutilized or overutilized

A
1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 9

IGP Metric-Based Traffic Engineering

Drawbacks

Only serves to move problem around

Some links underutilized Some links overutilized

Lacks granularity
All traffic follows the IGP shortest path

Continuously adjusting IGP metrics adds instability to the network

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 10

Discomfort Grows

Mid 1990s

ISPs became uncomfortable with size of Internet core Large growth spurt imminent Routers too slow IGP metric engineering too complex IGP routing calculation was topology driven, not traffic driven Router based cores lacked predictability

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 11

Why Traffic Engineering?

There is a need for a more granular and deterministic solution A major goal of Internet Traffic Engineering is to facilitate efficient and reliable network operations while simultaneously optimizing network resource utilization and performance.
RFC 2702
Requirements for Traffic Engineering over MPLS
Slide 12

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Overlay Networks are Born

ATM switches offered performance and predictable behavior ISPs created overlay networks that presented a virtual topology to the edge routers in their network Using ATM virtual circuits, the virtual network could be reengineered without changing the physical network Benefits

Full traffic control Per-circuit statistics More balanced flow of traffic across links
Slide 13

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Overlay Networks
ATM core ringed by routers PVCs overlaid onto physical network

A Physical View B

Logical View

A C B

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 14

Path Creation

Off-line path calculation tool uses

Link utilization Historic traffic patterns

Primary and backup PVCs

Produces virtual network topology

Generates switch and router configurations

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 15

Overlay Network Drawbacks

Growth in full mesh of ATM PVCs stresses everything

With 5 routers, adding 1 requires only 10 new PVCs With 200 routers, adding 1 requires 400 new PVCs
From 39,800 to 40,200 PVCs total

Router IGP runs out of steam Practical limitation of atomically updating configurations in each switch and router Network does not participate in path selection and setup

Not well integrated

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 16

Overlay Network Drawbacks

ATM cell overhead

Approximately 20% of bandwidth OC-48 link wastes 498 Mbps in ATM cell overhead OC-192 link wastes 1.99 Gbps
OC-48 SAR
Trailing behind the router curve Very difficult to build

ATM SAR speed

OC-192 SAR?
Slide 17

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Routers Caught Up

Current generation of routers have

High speed, wire-rate interfaces Deterministic performance Software advances

Solution
Fuse best aspects of ATM PVCs with highperformance routing engines Use low-overhead circuit mechanism Automate path selection and configuration Implement quick failure recovery

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 18

Benefits of MPLS

Low-overhead virtual circuits for IP

Originally designed to make routers faster

Fixed label lookup faster than longest match used by IP routing

Not true anymore!

Value of MPLS is now in traffic engineering One, integrated network Same forwarding mechanism can support multiple applications

Traffic Engineering, VPNs, etc.

Slide 19

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

What are the fundamental requirements?

RFC 2702

Requirement for Traffic Engineering over MPLS

Requirements

Control Measure Characterize Integrate routing and switching All at a lower cost
Slide 20

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Fundamental Requirements

Need the ability to:

Map traffic to an LSP Monitor and measure traffic Specify explicit path of an LSP
Partial explicit route Full explicit route

Characterize an LSP
Bandwidth Priority/ Preemption Affinity (Link Colors)

Reroute or select an alternate LSP

Slide 21

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

MPLS Fundamentals

MPLS Header

IP packet is encapsulated in MPLS header and sent down LSP

IP Packet
32-bit MPLS Header

IP packet is restored at end of LSP by egress router

TTL is adjusted by default

Slide 23

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

MPLS Header
Label EXP S TTL

Label

Used to match packet to LSP Carries packet queuing priority (CoS)

Experimental bits

Stacking bit Time to live

Copied from IP TTL

Slide 24

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Router Based Traffic Engineering

Standard IGP routing IP prefixes bound to physical next hop

Typically based on IGP calculation

192.168.1/24 134.112/16

New York

San Francisco

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 25

Router Based Traffic Engineering

Engineer unidirectional paths through your network without using the IGPs shortest path calculation
IGP shortest path

New York

San Francisco

JUNOS traffic engineered path

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc. Slide 26

Router Based Traffic Engineering

IP prefixes can now be bound to LSPs

192.168.1/24

New York

San Francisco
134.112/16

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 27

MPLS Labels
Assigned manually or by a signaling protocol in each LSR during path setup Labels change at each segment in path LSR swaps incoming label with new outgoing label Labels have local significance

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 28

MPLS Forwarding Example

An IP packet destined to 134.112.1.5/32 arrives in SF San Francisco has route for 134.112/16

Next hop is the LSP to New York

134.112/16

IP
134.112.1.5

New York

0 1965

San Francisco

1026
Santa Fe

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 29

MPLS Forwarding Example

San Francisco prepends MPLS header onto IP packet and sends packet to first transit router in the path

134.112/16 New York

San Francisco

Santa Fe
Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc. Slide 30

MPLS Forwarding Example

Because the packet arrived at Santa Fe with an MPLS header, Santa Fe forwards it using the MPLS forwarding table MPLS forwarding table derived from mpls.0 switching table
134.112/16 New York

San Francisco

Santa Fe
Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc. Slide 31

MPLS Forwarding Example

Packet arrives from penultimate router with label 0 Egress router sees label 0 and strips MPLS header Egress router performs standard IP forwarding decision

IP

134.112/16 New York

San Francisco

Santa Fe
Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc. Slide 32

Router Y

Example Topology
Router X

IGP Link Metric

10

Router B
192.168.0.1

10

Router C
192.168.2.1

10
Router D
192.168.24.1

Router A

192.168.16.1

30
Router E
192.168.5.1

30

20 30

20

Router F
192.168.8.1

20

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 33

Router Y

Example Topology
Router X

Router B
192.168.0.1

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 34

Traffic Engineering Signaled LSPs

Static vs Signaled LSPs

Static LSPs

Are nailed up manually Have manually assigned MPLS labels Needs configuration on each router Do not re-route when a link fails Signaled by RSVP Have dynamically assigned MPLS labels Configured on ingress router only Can re-route around failures

Signaled LSPs

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 36

Signaled Label-Switched Paths

Configured at ingress router only

RSVP sets up transit and egress routers automatically Path through network chosen at each hop using routing table Intermediate hops can be specified as transit points
StrictMust use hop, must be directly connected LooseMust use hop, but use routing table to find it

Advantages over static paths

Performs keepalive checking Supports fail-over to unlimited secondary LSPs Excellent visibility

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 37

RSVP Path Signaling

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 38

Path Signaling

JUNOS uses RSVP for Traffic Engineering

Internet standard for reserving resources Extended to support

Explicit path configuration Path numbering Route recording

Provides keepalive status

For visibility For redundancy

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 39

RSVP
A generic QoS signaling protocol An Internet control protocol

Uses IP as its network layer

Originally designed for host-to-host Uses the IGP to determine paths RSVP is not

A data transport protocol A routing protocol

RFC 2205
Slide 40

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Basic RSVP Path Signaling

Simplex flows Ingress router initiates connection Soft state

Path and resources are maintained dynamically Can change during the life of the RSVP session

Path message sent downstream Resv message sent upstream

Sender

PATH RESV

Router

PATH RESV

Router

PATH RESV

Receiver

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 41

Other RSVP Message Types

PathTear

Sent to egress router

Sent to ingress router Sent to ingress router

ResvTear

PathErr

ResvErr

Sent to egress router

ResvConf
Slide 42

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Extended RSVP

Extensions added to support establishment and maintenance of LSPs

Maintained via hello protocol

Used now for router-to-router connectivity Includes the distribution of MPLS labels

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 43

MPLS Extensions to RSVP

Path and Resv message objects

Explicit Route Object (ERO) Label Request Object Label Object Record Route Object Session Attribute Object Tspec Object
daft-ietf-mpls-rsvp-lsp-tunnel-04.txt Extensions to RSVP for LSP Tunnels

For more detail on contents of objects:

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 44

Explicit Route Object

Used to specify the route RSVP Path messages take for setting up LSP Can specify loose or strict routes

Loose routes rely on routing table to find destination Strict routes specify the directly-connected next router

A route can have both loose and strict components

Slide 45

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

ERO: Strict Route

Next hop must be directly connected to previous hop

C E F Egress LSR

ERO B strict; C strict; E strict; D strict; F strict;

A Ingress LSR

D Strict

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 46

ERO: Loose Route

Consult the routing table at each hop to determine the best path
C E F Egress LSR

ERO

D loose;

A Ingress LSR

D Loose

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 47

ERO: Strict/Loose Path

Strict and loose routes can be mixed

ERO C strict; D loose; F strict;

Egress LSR

A Ingress LSR

Strict Loose

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 48

Router Y

Partial Explicit Route

Loose hop to Router G Follow the IGP shortest path to G first

Router B
192.168.0.1

Router X

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 49

Router Y

Full (Strict) Explicit Route

AFGECD Follow the Explicit Route

Router B
192.168.0.1

Router X

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 50

Hop-by-Hop ERO Processing

If Destination Address of RSVP message belongs to your router

You are the egress router End ERO processing Send RESV message along reverse path to ingress Consult routing table Determine physical next hop

Otherwise, examine next object in ERO

If ERO object is strict

Verify next router is directly connected

Forward to physical next hop

Slide 51

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Label Objects

Label Request Object

Added to PATH message at ingress LSR Requests that each LSR provide label to upstream LSR
Carried in RESV messages along return path upstream Provides label to upstream LSR

Label Object

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 52

Record Route Object PATH Message

Added to PATH message by ingress LSR Adds outgoing IP address of each hop in the path

In downstream direction Sends Routing problem, loop detected PathErr message Drops PATH message

Loop detection mechanism

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 53

Record Route Object RESV Message

Added to RESV message by egress LSR Adds outgoing IP address of each hop in the path

In upstream direction Sends Routing problem, loop detected ResvErr message Drops RESV message

Loop detection mechanism

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 54

Session Attribute Object

Added to PATH message by ingress router Controls LSP

Priority Preemption Fast-reroute ASCII character string for LSP name

Identifies session

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 55

Tspec Object

Contains link management configuration

Requested bandwidth Minimum and maximum LSP packet size

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 56

Path Signaling Example

Signaling protocol sets up path from San Francisco to New York, reserving bandwidth along the way
New York (Egress)

Seattle

San Francisco (Ingress)

Miami

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 57

Path Signaling Example

Once path is established, signaling protocol assigns label numbers in reverse order from New York to San Francisco

Seattle New York (Egress)

3
San Francisco (Ingress)

Miami

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 58

Adjacency Maintenance Hello Message

New RSVP extension

Hello message Hello Request Hello Acknowledge

Asynchronous updates 3 second default update timer 12 second default dead timer

Rapid node to node failure detection

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 59

Path Maintenance Refresh Messages

Maintains reservation of each LSP Sent every 30 seconds by default Consists of PATH and RESV messages Node to node, not end to end

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 60

RSVP Message Aggregation

Bundles up to 30 RSVP messages within single PDU Controls

Flooding of PathTear or PathErr messages Periodic refresh messages (PATH and RESV)

Enhances protocol efficiency and reliability Disabled by default

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 61

Traffic Engineering Constrained Routing

Signaled vs Constrained LSPs

Common Features

Signaled by RSVP MPLS labels automatically assigned Configured on ingress router only CSPF not used User configured ERO handed to RSVP for signaling RSVP consults routing table to make next hop decision

Signaled LSPs

Constrained LSPs

CSPF used Full path computed by CSPF at ingress router Complete ERO handed to RSVP for signaling
Slide 63

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Constrained Shortest Path First Algorithm

Modified shortest path first algorithm Finds shortest path based on IGP metric while satisfying additional constraints Integrates TED (Traffic Engineering Database)

IGP topology information Available bandwidth Link color Maximum hop count Bandwidth Strict or loose routing Administrative groups
Slide 64

Modified by administrative constraints

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Computing the ERO

Ingress LSR passes user defined restrictions to CSPF

Strict and loose hops Bandwidth constraints Admin Groups Factors in user defined restrictions Runs computation against the TED Determines the shortest path

CSPF algorithm

CSPF hands full ERO to RSVP for signaling

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 65

Traffic Engineering Database

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 66

Traffic Engineering Database

CSPF uses TED to calculate explicit paths across the physical topology Similar to IGP link-state database Relies on extensions to IGP

Network link attributes Topology information

Separate from IGP database

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 67

TE Extensions to ISIS/OSPF

Describes traffic engineering topology

Traffic engineering database (TED)

Bandwidth Administrative groups

Does not necessarily match regular routed topology

Subset of IGP domain

ISIS Extensions IP reachability TLV IS reachability TLV Type 10 Opaque LSA

Slide 68

OSPF Extension

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

ISIS TE Extensions

IP Reachability TLV

IP prefixes that are reachable IP link default metric

Extended to 32 bits (wide metrics)

Up/down bit
Avoids loops in L1/L2 route leaking

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 69

ISIS TE Extensions

IS Reachability TLV

IS neighbors that are reachable ID of adjacent router

IP addresses of interface (/32 prefix length)

Sub-TLVs describe the TE topology

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 70

ISIS IS Reachability TLV

Sub-TLVs contain
Local interface IP address Remote interface IP address Maximum link bandwidth Maximum reservable link bandwidth Reservable link bandwidth Traffic engineering metric Administrative group Reserved TLVs for future expansion

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 71

OSPF TE Extensions

Opaque LSA

Original Router LSA not extensible Type 10 LSA Area flooding scope Standard LSA header (20 bytes) TE capabilities
Work in progress

Traffic Engineering LSA

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 72

Configuring Constraints LSP 1 with 40 Mbps

Router Y

Follows the IGP shortest path to D since sufficient bandwidth available

Router B
192.168.0.1

Router X

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 73

Configuring Constraints LSP 2 with 70 Mbps

Router Y

Insufficient bandwidth available on IGP shortest path

Router B
192.168.0.1

Router X

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 74

Affinity (Link Colors)

Ability to assign a color to each link

Gold Silver Bronze

Up to 32 colors available Can define an affinity relationship

Include Exclude

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 75

Configuring Constraints LSP 3 with 50 Mbps

Router Y

Exlcude all Bronze links

Router X

Router B
192.168.0.1

Router C

Bronze

192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

Bronze
Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 76

Preemption

Defines relative importance of LSPs on same ingress router CSPF uses priority to optimize paths Higher priority LSPs

Are established first Offer more optimal path selection May tear down lower priority LSPs when rerouting

Default configuration makes all LSPs equal

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 77

Preemption

Controlled by two settings

Setup priority and hold (reservation) priority

New LSP compares its setup priority with hold priority of existing LSP If setup priority is less than hold priority, existing LSP is rerouted to make room

Priorities from 0 (strong) through 7 (weak) Defaults

Setup priority is 7 (do not preempt) Reservation priority is 0 (do not allow preemption)

Use with caution

No large scale experience with this feature

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 78

LSP Reoptimization

Reroutes LSPs that would benefit from improvements in the network

Special rules apply

Disabled by default in JUNOS

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 79

LSP Reoptimization Rules

Reoptimize if new path can be found that meets all of the following
Has lower IGP metric Has fewer hops Does not cause preemption Reduces congestion by 10%

Compares aggregate available bandwidth of new and old path

Intentionally conservative rules, use with care

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 80

LSP Load Balancing

Two categories

Selecting path for each LSP

Multiple equal cost IP paths to egress are available Random Least-fill Most-fill

Balance traffic over multiple LSP

Multiple equal cost LSPs to egress are available BGP can load balance prefixes over 8 LSPs

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 81

LSP Load Balancing

Selecting path for each LSP

Random is default
Distributes LSPs randomly over available equal cost paths

Least-fill
Distributes LSPs over available equal cost paths based on available link bandwidth

Most-fill
LSPs fill one link first, then next

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 82

Selecting paths for each LSP

Router Y

Most fill, Least fill, Random Configure 12 LSPs, each with 10 Mbps
Router B
192.168.0.1

Router X

Router C

20 30

192.168.2.1

20
Router A
192.168.16.1

20

Router D
192.168.24.1

30

Router E
192.168.5.1

20 30 20

20

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 83

Load Balancing

Balancing traffic over multiple LSPs

Up to 16 equal cost paths for BGP JUNOS default is per-prefix Per-packet (per-flow) knob available

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 84

Balancing traffic over equal cost IGP paths

Router Y

Without LSPs configured, prefixes are distributed over equal cost IGP paths
Router B
192.168.0.1

Router X

Router C

20 30

192.168.2.1

20
Router A
192.168.16.1

20

Router D
192.168.24.1

30

Router E
192.168.5.1

20 30 20

20

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 85

Balancing traffic over equal cost LSPs

Router Y

Same behavior, now over LSPs Prefixes distributed over multiple LSPs
Router B
192.168.0.1

Router X

Router C

20 30

192.168.2.1

20
Router A
192.168.16.1

20

Router D
192.168.24.1

30

Router E
192.168.5.1

20 30 20
Router F
192.168.8.1

20

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 86

Advanced Traffic Engineering Features

Traffic Protection

Traffic Protection

Primary LSP

Retry timer Retry limit

Standby option

Secondary LSPs

Fast Reroute Adaptive mode

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 89

Primary LSP

Optional

If configured, becomes preferred path for LSP

LSR makes all decisions to reach egress

If no primary configured

Zero or one primary path Revertive capability

Revertive behavior can be modified

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 90

Primary LSP

Revertive Capability

Retry timer
Time between attempts to bring up failed primary path Default is 30 seconds Primary must be stable two times (2x) retry timer before reverts back

Retry limit
Number of attempts to bring up failed primary path Default is 0 (unlimited retries) If limit reached, human intervention then required

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 91

Secondary LSP
Optional Zero or more secondary paths All secondary paths are equal

Selection based on listed order of configuration Maintains secondary path in up condition Eliminates call-setup delay of secondary LSP Additional state information must be maintained
Slide 92

Standby knob

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Secondary Paths LSP 1, exclude Bronze

Router Y

Secondary avoid primary if possible

10
Router B
192.168.0.1

Router X

20
Router C
192.168.2.1

10

Bronze

Router D
192.168.24.1

Router A

192.168.16.1

30
Router E
192.168.5.1

30

20

30

20

Bronze
Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

20

Slide 93

Adaptive Mode

Applies to

LSP rerouting Primary & secondary sharing links

Avoids double counting SE Reservation style

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 94

Shared Links
B E

Shared link
Ingress LSR

Egress LSR

Session 1 Session 2

FF reservation style:
Each session has its own identity Each session has its own bandwidth reservation

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

SE Reservation style:
Each session has its own identity Sessions share a single bandwidth reservation

Slide 95

Secondary Paths LSP 1, exclude Bronze

Router Y

Secondary in Standby mode, 20M exclude Gold

10
Router B
192.168.0.1

Router X

20
Router C
192.168.2.1

10

Bronze

Router D
192.168.24.1

Router A

192.168.16.1

30
Router E
192.168.5.1

30

20

30

20

Bronze
Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

20

Slide 96

Fast Reroute
Configured on ingress router only Detours around node or link failure

~100s of ms reroute time

Detour paths immediately available Crank-back to node, not ingress router Uses TED to calculate detour

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 97

Fast Reroute
Short term solution to reduce packet loss If node or link fails, upstream node

Immediately detours Signals failure to ingress LSR Ingress computes alternate route
Based on configured secondary paths

Only ingress LSR knows policy constraints

Initiates long term reroute solution

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 98

Fast Reroute Example

Primary LSP from A to E

F E

B
Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 99

Fast Reroute Example

Enable fast reroute on ingress

A creates detour around B B creates detour around C C creates detour around D

F E

B
Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 100

Fast Reroute Example Short Term Solution

B to C link fails

B immediately detours around C B signals to A that failure occurred

F E

B
Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 101

Fast Reroute Example Long Term Solution

A calculates and signals new primary path

F
E

B
Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 102

LSP Rerouting

Initiated by ingress LSR

Exception is fast reroute More optimal route becomes available Failure of a resource along the LSP path Preemption occurs Manual configuration change Establish new LSP with SE style Transfer traffic to new LSP Tear down old LSP
Slide 103

Conditions that trigger reroute

Make before break (if adaptive)

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Advanced Route Resolution

Mapping Transit Traffic

Mapping transit destinations

JUNOS default mode Only BGP prefixes are bound to LSPs Only BGP can use LSPs for its recursive route calculations Only BGP prefixes that have the LSP destination address as the BGP next-hop are resolvable through the LSP

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 105

Route Resolution Transit Traffic Example

I-BGP
134.112/16

Router Y

Router X

Router B
192.168.0.1

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

Configure a next hop self policy on Router D

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 106

What if BGP next hop does not align with LSP endpoint?
I-BGP
134.112/16

Router Y

Router X

Router B
192.168.0.1

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

IGP Passive interface

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 107

Traffic Engineering Shortcuts

Configure TE Shortcuts on ingress router

Good for BGP nexthops that are not resolvable directly through an LSP If LSP exists that gets you closer to BGP nexthop Installs prefixes that are downstream from egress router into ingress routers inet.3 route table

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 108

BGP next hops beyond the egress router can use the LSP!
I-BGP
134.112/16

Router Y

Router X

Router B
192.168.0.1

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

BGP Next hop is down stream from LSP endpoint

Router G
192.168.12.1

Router F
192.168.8.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 109

TE Shortcuts
By itself, still only usable by BGP Installs additional prefixes in ingress routers inet.3 table Only BGP can use routes in inet.3 for BGP recursive lookups

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 110

But, cannot use the LSP for traffic destined to web servers
I-BGP
134.112/16

Router Y

Router X

Router B
192.168.0.1

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

part of IGP domain

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 111

BGP-IGP knob

Traffic-engineering bgp-igp knob

Forces all MPLS prefixes into main routing table (inet.0) All destinations can now use all LSPs
IGP and BGP prefixes

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 112

Now all traffic destined to egress router and beyond use LSP
I-BGP
134.112/16

Router Y

Router X

Router B
192.168.0.1

Router C
192.168.2.1

Router D
192.168.24.1

Router A

192.168.16.1

Router E
192.168.5.1

part of IGP domain

Router F
192.168.8.1

Router G
192.168.12.1

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 113

TTL Decrement

Default is to decrement TTL on all LSR hops

Loop prevention Topology discovery via traceroute

No topology discovery TTL decrement at egress router only

Disable TTL decrement inside LSP

[edit protocols mpls label-switched-path lsp-path-name] user@host# set no-decrement-ttl

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 114

Circuit Cross Connect

Circuit Cross-Connect (CCC)

Transparent connection between two Layer 2 circuits Supports

PPP, Cisco HDLC, Frame Relay, ATM, MPLS Any protocol can be carried in packet payload Only like interfaces can be connected (for example, Frame Relay to Frame Relay, or ATM to ATM)

Router looks only as far as Layer 2 circuit ID

Three types of cross-connects

Layer 2 switching MPLS tunneling Stitching MPLS LSPs

Slide 116

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

CCC Layer 2 Switching

A
DLCI 600

M40

DLCI 601

A and B have Frame Relay connections to M40, carrying any type of traffic M40 behaves as switch Layer 2 packets forwarded transparently from A to B without regard to content; only DLCI is changed CCC supports switching between PPP, Cisco HDLC, Frame Relay PVCs, or ATM PVCs ATM AAL5 packets are reassembled before sending

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 117

CCC Layer 2 Switching

A
DLCI 600

M40

DLCI 601

so-5/1/0.600

so-2/2/1.601

[edit protocols] user@host# show connections { interface-switch connection-name { interface so-5/1/0.600; interface so-2/2/1.601; } }

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 118

CCC MPLS Interface Tunneling

ATM access network IP backbone ATM access network

ATM VC 514

M40

MPLS LSP

M20

ATM VC 590

Transports packets from one interface through an MPLS LSP to a remote interface Bridges Layer 2 packets from end-to-end Supports tunneling between like ATM, Frame Relay, PPP, and Cisco HDLC connections
Slide 119

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

CCC MPLS Interface Tunneling

ATM access network IP backbone ATM access network

ATM VC 514

M40

MPLS LSP1 MPLS LSP2

M20

ATM VC 590

at-7/1/1.514

at-3/0/1.590

[edit protocols] user@M40# show connections { remote-interface-switch m40-to-m20 interface at-7/1/1.514; transmit-lsp lsp1; receive-lsp lsp2; }

[edit protocols] user@M20# show connections { remote-interface-switch m20-to-m40 interface at-3/0/1.590; transmit-lsp lsp2; receive-lsp lsp1; }

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 120

CCC LSP Stitching

LSR

TE domain 2
LSR

TE domain 1
LSR LSR LSR

TE domain 3
LSR

LSP stitching

Large networks can be separated into several traffic engineering domains (supports IS-IS area partitioning) CCC allows establishment of LSP across domains by stitching together LSPs from separate domains
Slide 121

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

CCC LSP Stitching

LSR-E

TE domain 1
LSR-B LSR-C LSR-D

TE domain 2
LSR-A

LSP stitching

[edit protocols] user@LSR-B# show connections { lsp-switch LSR-A_to_LSR-E { transmit-lsp lsp2; receive-lsp lsp1; } lsp-switch LSR-E_to_LSR-A { receive-lsp lsp3; transmit-lsp lsp4; }

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 122

www.juniper.net

Traffice Engineering with MPLSAPRICOT 20004 August 2012 Copyright 2000, Juniper Networks, Inc.

Slide 123