1 cs 520 – fall 2004 - lecture 15 mpls and its applications (with modifications for cs 520) philip...

71
1 CS 520 – Fall 2004 - CS 520 – Fall 2004 - Lecture 15 Lecture 15 MPLS and its MPLS and its Applications Applications (with modifications for (with modifications for CS 520) CS 520) Philip Matthews Philip Matthews Nortel Networks Nortel Networks April 2000 April 2000 (Material prepared by (Material prepared by Dr. Bilel Jamoussi and Dr. Bilel Jamoussi and Peter Ashwood-Smith) Peter Ashwood-Smith)

Upload: rosalind-wood

Post on 03-Jan-2016

218 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

1

CS 520 – Fall 2004 - Lecture 15CS 520 – Fall 2004 - Lecture 15MPLS and its ApplicationsMPLS and its Applications

(with modifications for CS (with modifications for CS 520)520)Philip MatthewsPhilip MatthewsNortel NetworksNortel NetworksApril 2000April 2000

(Material prepared by(Material prepared byDr. Bilel Jamoussi and Dr. Bilel Jamoussi and Peter Ashwood-Smith)Peter Ashwood-Smith)

Page 2: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

2

Outline

• Overview

• Label EncapsulationsLabel Encapsulations

• Label Distribution ProtocolsLabel Distribution Protocols

• Constraint-Based RoutingConstraint-Based Routing

• MPLS and VPNs

• Network SurvivabilityNetwork Survivability

• SummarySummary

Page 3: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

3

What is MPLS?

• MPLS is an IETF Standardized mechanism for controlling packet routing.

• MPLS Framework and Architecture— Defines the scope, the various components and their interactions

• Encapsulations — Labels are used at the data plane to make forwarding decisions

• Signaling Protocols— Distribute Labels to establish Label Switched Paths

• Routing Protocol Traffic Engineering Extensions— Distribute Bandwidth and other link attributes to make routing

decisions

Page 4: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

4

“Label Substitution” what is it?

Have a friend go to B ahead of you. At every road they reserve a lane just for you. At every intersection they post a big sign that says for a given lane which way to turn and what new lane to take.

LANE#1

LANE#2

LANE#1 TURN RIGHT USE LANE#2

Page 5: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

5

Label Switched Path (LSP)

#1 RIGHT #2

#1 RIGHT #2

#2 LEFT #1

#2 LEFT #1

Page 6: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

6

What is a “LABEL”?

A property that uniquely identifies a flow on a logical or physical interface

Labels may be platform wide unique or more commonly interface wide unique.

But are not globally unique, so label values can be reused in many places.

Page 7: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

7

Label Switched Path

#7

#99

#9

#3 Right #7

#99 RIGHT #9#7 LEFT #99

#9 LEFT #4072

#3IP

#4072 IP

Page 8: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

8

Another context: An Optical Label Switched Path – “labels” are colors of light

RED RIGHT BLUE

WHITE RIGHT ORANGEBLUE LEFT WHITE

ORANGE LEFT RED

IP

IP

RED

BLUE

WHITE

ORANGE

RED

Page 9: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

9

MPLS Labels

• Hop-by-hop or source routing can be used to establish labels— Hop-by-hop can use OSPF, RIP, etc. to define labels

— Source routing lets sources define routes and their labels

• Multiple levels of labels (stacks of labels within labels).— Allows groups of flows to carry the same label for part of a

route.

Page 10: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

10

ROUTE AT EDGE, SWITCH IN CORE

IP ForwardingLABEL SWITCHINGIP Forwarding

IP IP #L1 IP #L2 IP #L3 IP

Page 11: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

11

Routers Do Both Routing and Switching

• Routing— Deciding the next hop based on

the destination address.

— A Layer 3 (L3) function.

• Switching— Moving a packet from an input

port to an output port and out.

— A layer 2 function.

INPUT PORTS OUTPUT PORTS

Page 12: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

12

MPLS Turns Routing into Switching

• So we can avoid performing the layer 3 function.— Use labels to decide next hops.

• What benefit does this provide?

• In what situations would this benefit not be very significant?

Page 13: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

13

MPLS: Flexible Forwarding

LSP to IPLABEL SWITCHINGIP to LSP

IP IP #L1 IP #L2 IP #L3 IP

IP DA

IP: Packets are forwarded based on Destination Address (DA). We can call this “destination based routing”.

MPLS:

• Map packets to LSP based on (Source Address, Destination Address, protocol, port, DSCP, interface, etc.)

• Forward packets based on the Label

IP DA IP DA IP DA IP DA

Page 14: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

14

MPLS-based Solutions

• Enable QoS in IP Networks— Support Diffserv using connection-oriented QoS

— “Connections” can be flows or large aggregates

• IP Traffic Engineering— Use constraint-based routing to adapt to latest network loading

and QoS performance

• Virtual Private Networks— Use controllable tunneling mechanisms

• L2/L3 Integration— Integrate with L1 and L2 technologies like Optical Cross

Connects (OXC’s) and ATM

• Resilient Network Design— Automatic Failover and Backup

Page 15: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

15

BEST OF BOTH WORLDS

PACKETForwarding

CIRCUITSWITCHING

• MPLS + IP forms a middle ground that combines the best of IP and the best of circuit switching

technologies.

• MPLS + IP forms a middle ground that combines the best of IP and the best of circuit switching

technologies.

MPLS+IP

IP ATM

HYBRID

Page 16: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

16

MPLS Terminology

• LDP: Label Distribution Protocol

• LSP: Label Switched Path

• LER: Label Edge Router (edge of an area that supports MPLS)

• LSR: Label Switching Router (inside an area that supports MPLS)

• FEC: Forwarding Equivalence Class

Page 17: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

17

LER’s and LSR’s

LSP to IPLABEL SWITCHINGIP to LSP

IP IP #L1 IP #L2 IP #L3 IP

LER LERLSR’s

Page 18: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

18

Forwarding Equivalence Classes• FEC = “A subset of packets that are all treated (forwarded) the same way by a router”

• The concept of FECs provides for a great deal of flexibility and scalability. Traffic can be aggregated or differentiated in many ways

• In conventional routing, a packet is assigned to an FEC at each hop (i.e. L3 look-up), in MPLS it is only done once at the network ingress.

Packets are destined for different address prefixes, but can bemapped to common pathPackets are destined for different address prefixes, but can bemapped to common path

IP1

IP2

IP1

IP2

LSRLSRLER LER

LSP

IP1 #L1

IP2 #L1

IP1 #L2

IP2 #L2

IP1 #L3

IP2 #L3

Page 19: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

19

Two types of Label Switched Paths:• Hop by hop (“Vanilla” LDP)

• Explicit Routing (LDP+”ER”)

#18

#427

#819

#216

#14

#612

#5 #99 #311

#963

#462

#77

Label Switched Path (Two Types)

Page 20: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

20

#216

#612

#5#311

#14

#99

#963

#462

- A Vanilla LSP creates MPLS paths for standard IP routing (from IP routing tables).

- A Vanilla LSP is actually part of a tree from every source to that destination (unidirectional).

#963

#14

#99

#311

#311

#311

LABEL SWITCHED PATH (vanilla)

Page 21: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

21

STANDARD IP

47.1

47.2

Network 47.3

Dest Out

47.1 147.2 2

47.3 3

1

23

Dest Out

47.1 147.2 2

47.3 3

Dest Out

47.1 147.2 2

47.3 3

1

2

1

2

3

• Destination based forwarding tables as built by OSPF, IS-IS, RIP, etc.

Page 22: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

22

47.1

47.247.3

IP 47.1.1.1

Dest Out

47.1 147.2 2

47.3 3

1

23

Dest Out

47.1 147.2 2

47.3 3

1

2

1

2

3

IP 47.1.1.1

IP 47.1.1.1IP 47.1.1.1

Dest Out

47.1 147.2 2

47.3 3

STANDARD IP

Page 23: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

23

Label Switched Path (LSP)

Intf In

Label In

Dest Intf Out

3 40 47.1 1

Intf In

Label In

Dest Intf Out

Label Out

3 50 47.1 1 40

47.1

47.247.3

1

2

31

2

1

2

3

3Intf In

Dest Intf Out

Label Out

3 47.1 1 50

IP 47.1.1.1

IP 47.1.1.1

Page 24: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

24

Intf In

Label In

Dest Intf Out

3 40 47.1 1

Intf In

Label In

Dest Intf Out

Label Out

3 50 47.1 1 40

MPLS Label Distribution

47.1

47.247.3

12

3

1

2

1

2

3

3Intf In

Dest Intf Out

Label Out

3 47.1 1 50

Mapping: 40

Request: 47.1

Mapping: 50

Request: 47.1

Page 25: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

25

Benefits and Limitations

• Why might the MPLS approach be better than normal IP forwarding that does not use MPLS?— Remember, all packets still travel the same paths.

• What else might we be able to do with MPLS that could be even more powerful if we went beyond following normal IP Routing?

Page 26: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

26

#216

#14

#462

- ER-LSP follows the route that source chooses. In other words, the control message to establish the LSP (label request) is source routed.

#972

#14 #972

A

B

C

Route={A,B,C}

EXPLICITLY ROUTED OR ER-LSP

Page 27: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

27

Intf In

Label In

Dest Intf Out

3 40 47.1 1

Intf In

Label In

Dest Intf Out

Label Out

3 50 47.1 1 40

47.1

47.247.3

1

2

3

1

2

1

2

3

3

Intf In

Dest Intf Out

Label Out

3 47.1.1 2 33 3 47.1 1 50

IP 47.1.1.1

IP 47.1.1.1

EXPLICITLY ROUTED LSP ER-LSP

Explicitly Routing LSP that does not follow the standard IP path.

Explicitly Routing LSP that does not follow the standard IP path.

This entry gives the longest prefix match.

Page 28: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

28

ER LSP - Advantages

• Operator has routing flexibility

— Can establish LSP’s based on policy, QoS, etc.

— Can have pre-established LSP’s that can be used in case of failures.

• Can use routes other than the shortest path

• Can compute routes based on dynamic constraints (available bandwidth, delay, etc.) in exactly the same manner as ATM based on a distributed topology database.(traffic engineering)

Page 29: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

29

ER LSP - Discord!

• Two signaling options are proposed in the standards: CR-LDP and RSVP extensions:

– CR-LDP = Label Distribution Protocol (LDP) + Explicit Routing

– RSVP-TE = Traditional Resource Reservation Protocol (RSVP) + Explicit Route + Scalability Extensions

• RSVP was established several years ago to be able to reserve resources along a path.

— To ensure QoS by making sure each flow had enough resources.

— Had significant scalability problems.

• ITU has decided on LDP/CR-LDP for public networks.

Page 30: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

30

Outline

• Overview

• Label Encapsulations

• Label Distribution Protocols

• Constraint Based Routing

• MPLS and VPNs

• Network SurvivabilityNetwork Survivability

• Summary

Page 31: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

31

Upper Layer Consistency Across Lower Layers

Ethernet ATM FrameRelay

• MPLS is “multiprotocol” below the network layer (for the link layer and below)

• MPLS can be used with all of the above technologies

• Provides for consistent operations, engineering across multiple technologies

• Allows operators to leverage existing infrastructure

• Co-existence with other protocols is provided for

WD

M

GigEthernet Optical Cross Connect (OXC)

Page 32: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

32

MPLS Encapsulation - PPP & LAN Data Links

Layer 2 Header(eg. PPP, 802.3)

•••Network Layer Header

and Packet (eg. IP)

MPLS ‘Shim’ Headers (1-n)

1n

• Network layer must be inferable from value of bottom label of the stack

MPLS on LANs uses a ‘Shim’ Header Inserted Between Layer 2 and Layer 3 Headers

(other technologies use different approaches)

MPLS on LANs uses a ‘Shim’ Header Inserted Between Layer 2 and Layer 3 Headers

(other technologies use different approaches)

Label Exp. S TTL

Label: Label Value, 20 bits (Values 0 through 16 are reserved)Exp.: Experimental, 3 bits (was Class of Service)S: Bottom of Stack, 1 bit (1 = last entry in label stack)TTL: Time to Live, 8 bits

4 Octets

Label StackEntry Format

Page 33: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

33

Outline

• Overview

• Label Encapsulations

• Label Distribution Protocols

• Constraint-Based Routing

• MPLS and VPNs

• Network SurvivabilityNetwork Survivability

• Summary

Page 34: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

34

Label Distribution Protocols

• Label Distribution Protocol (LDP)

• Constraint-based Routing LDP (CR-LDP)

• Extensions to RSVP

Page 35: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

35

Label Distribution Protocol (LDP) - PurposeLabel distribution ensures that adjacent routers have

a common view of bindings of FEC’s to labels

Routing Table:

Addr-prefix Next Hop47.0.0.0/8 LSR2

Routing Table:

Addr-prefix Next Hop47.0.0.0/8 LSR2

LSR1 LSR2 LSR3

IP Packet 47.80.55.3

Routing Table:

Addr-prefix Next Hop47.0.0.0/8 LSR3

Routing Table:

Addr-prefix Next Hop47.0.0.0/8 LSR3

Common understanding of which FEC the label is referring to!

Label distribution can either piggyback on top of an existing routing protocol,or a dedicated label distribution protocol (LDP) can be created.

Label distribution can either piggyback on top of an existing routing protocol,or a dedicated label distribution protocol (LDP) can be created.

Label Information Base:

Label-In FEC Label-Out17 47.0.0.0/8 XX

Label Information Base:

Label-In FEC Label-Out17 47.0.0.0/8 XX

Step 1: LSR creates bindingbetween FEC and label value

For 47.0.0.0/8use label ‘17’

Step 2: LSR communicatesbinding to adjacent LSR

Label Information Base:

Label-In FEC Label-OutXX 47.0.0.0/8 17

Label Information Base:

Label-In FEC Label-OutXX 47.0.0.0/8 17

Step 3: LSR inserts labelvalue into forwarding base

Page 36: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

36

Labels are Downstream Assigned

• Note that label assignments are decided at the downstream node and communicated to the upstream node.

• Why does it need to be done this way?

• What flexibility does this approach provide?

Page 37: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

37

Label Distribution Protocols

• Label Distribution Protocol (LDP)

• Constraint-based Routing LDP (CR-LDP)

• Extensions to RSVP

Page 38: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

38

Traffic Engineering RequirementsConstraint-Based Routing is one method of Traffic Engineering. Traffic

Engineering seeks to engineer the best use of capacity.

RFC 2702:

• Strict & Loose ER

• Specification of QoS

• Specification of Traffic Parameters

• Route Pinning

• Preemption

• Failure Recovery

Page 39: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

39

Constraint Based Routing using LDP (CR-LDP)

• Built on existing LDP messages over TCP.

• Defines an Explicit Route:— Detailed path that can traverse any links supporting CR-LDP.

• Defines a set of constraints for LSP computation and admission:— Expectation and Allocation of resources:

– Peak burst & rate, Committed burst & rate, Excess burst, Frequency, Weight.

— Preemption Level:– Setup and Holding Priority with respect to other LSPs.

— Resource Class:– Color of traffic inclusion, exclusion rules for links.

Page 40: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

40

CR-LDP Preemption

• Preemption may or may not be a good idea in a particular context – recall our discussion in previous lectures.

• A CR-LSP carries an LSP priority. This priority can be used to allow new LSPs to bump existing LSPs of lower priority in order to steal their resources.

• This is especially useful during times of failure and allows you to rank the LSPs such that the most important obtain resources before less important LSPs.

Page 41: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

41

#216

#14

#462

#972A

B

C

Route={A,B,C}

Preemption A.K.A. BumpingThis LSP must be preempted.

Now this one can proceed.

Page 42: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

42

Label Distribution Protocols

• Label Distribution Protocol (LDP)

• Constraint-based Routing LDP (CR-LDP)

• Extensions to RSVP

Page 43: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

43

ER-LSP setup using RSVP-TE

• TE (Traffic Engineering) extensions to RSVP

• Built on RSVP messages over IP.— In RSVP, a source requests resources along a path.

— Then the source regularly sends refresh messages to keep the reservations active.

• Extensions to RSVP:— Explicit Route Object

— Label Request

— Label Object

— Session Attribute

— Record Route Object

• Defines a set of constraints for LSP computation and admission:— Expectation and Allocation of resources: Uses Inserv-style reservations

— Preemption Level: Setup and Holding Priority with respect to other LSPs.

Page 44: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

44

Outline

• Overview

• Label Encapsulations

• Label Distribution Protocols

• Constraint Based Routing

• MPLS and VPNs

• Network SurvivabilityNetwork Survivability

• Summary

Page 45: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

45

- IP will over-utilize best paths and under-utilize not-so-good paths.

Dest=a.b.c.d

Dest=a.b.c.d

Dest=a.b.c.d

IP Follows a Tree to the Destination

a.b.c.d

Page 46: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

46

#216

#14

#612

#5 #99 #311

#963

#462

- Ultra fast, simple forwarding a.k.a switching

- Follows same route as normal IP datapath

- So like IP, LDP will over-utilize best paths and under-utilize less good paths.

HOP-BY-HOP (A.K.A Vanilla) LDP

Page 47: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

47

Two types of Label Switched Paths:• Hop by hop (“Vanilla” LDP)

• Explicit Routing (LDP+”ER”)

#18

#427

#819

#216

#14

#612

#5 #99 #311

#963

#462

#77

Label Switched Path (Two Types)

Page 48: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

48

CR = “Constraint” based “Routing”

Example: USE: (links with sufficient resources) AND

(links of type “someColor”) AND

(links that have delay less than 200 ms)

&&

=

CR-LDP

Page 49: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

49

Traffic Engineering

A

B C

D

Traffic engineering is the process of mapping traffic demand onto a networkTraffic engineering is the process of mapping traffic demand onto a network

Demand

NetworkTopology

Purpose of traffic engineering:• Maximize utilization of links and nodes throughout the network• Engineer links to achieve required delay, grade-of-service• Spread the network traffic across network links to minimize impact of failure• Ensure available spare link capacity for re-routing traffic on failure• Meet policy requirements imposed by the network operator

Traffic engineering is key to optimizing cost/performance

Page 50: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

50

MPLS Traffic Engineering Methods

• MPLS can use the source routing capability to steer traffic on desired paths

• An operator may manually configure LSRs along the desired paths.

• What are limitations of manual configuration?

Page 51: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

51

WHEN SHOULD TE BE USED?

• When traffic is being thrown away but you have other viable routes that are unused or underutilized.

• When it is not acceptable to simply rank packets and throw away the least important traffic first.

• Don’t use TE if it is not necessary. In fact don’t use MPLS if vanilla IP is working for you. Use LDP, CR-LDP and RSVP-TE if/when they are needed.

Page 52: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

52

Reactive traffic engineering

Wait till you have a problem and then patch around it.

1- Identify a flow to move Q: how?

2- Establish an LSP on some other route Q: what route?

Page 53: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

53

How to identify a flow to move? Good Statistics!

A) move the flow that has packets being discarded. For this you need to have stats that show {src, dest, protocol} that are being thrown away. (note this is TE of least important traffic)

B) move some other high priority user on the link somewhere else. For this you need to have stats that show {src, dest, protocol} of high users. (note, this is TE of more important traffic)

Page 54: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

54

What route should be used for an LSP? An non-shortest path!

A) Explicitly route without the help of constraint based routing.

B) Use constraint “not this link” so that MPLS can pick all the other links dynamically but is not allowed to pick the congested one.

Neither of these approaches will result in shortest paths and both are hard to administer as things scale up.

Page 55: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

55

Pro-active traffic engineering (plan ahead)

1- Start with rough idea on {Si, D} B/W requirements.

2- Establish constraint based tunnels {Si -> D}

3- repeat forever at regular planning intervals (days, weeks, months)

3a- Remeasure {Si -> D} B/W utilization.

3b- Adjust reservations on {Si ->D} to be closer

to actual utilization using hot swaps.

S1S2

S6

S3

S4

S5

D

Page 56: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

56

MPLS Traffic engineering

•Imperative to be able to monitor flow rates to the granularity of {source, dest, protocol} .

•Try to adjust the reservations periodically to reflect changes in utilization.

•MPLS aims to do a really good job of placing routes given the reservations are accurate.

•MPLS allows dynamic changes to reservations so they can slowly converge to reality over time.

Page 57: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

57

MPLS Traffic engineering interactions with vanilla IP.

•There are non trivial interaction issues to deal with when some of the traffic is traffic engineered (MPLS) and the rest (vanilla IP) is not.

•What problems might occur?

Page 58: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

58

Outline

• Overview

• Label Encapsulations

• Label Distribution Protocols

• Constraint Based Routing

• MPLS and VPNs

• Network SurvivabilityNetwork Survivability

• Summary

Page 59: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

59

MPLS Provides Benefits for Establishing Virtual Private Networks

• Virtual Private Network (VPN)— Connects two or more separate sites over the Internet

— Allows them to function as if they were a single, private network.

— Key Features: Security, control over performance, management ability.

• Use of MPLS for VPN’s— MPLS can set up one or more LSP’s between sites.

— Organizations can choose how they use the LSP’s.

— Can view the LSP’s as virtual “network links”.

• Will study VPN’s more in a later lecture.

Page 60: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

60

Outline

• Overview

• Label Encapsulations

• Label Distribution Protocols

• Constraint Based Routing

• MPLS and VPNs

• Network Survivability

• Summary

Page 61: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

61

The need for MPLS protection

• MPLS-based services have been growing— VPN’s

— Migration of ATM and Frame Relay onto MPLS

— Traffic Engineering

• MPLS-based services are more demanding of resiliency and reliability— Because MPLS promises more reliability.

— That’s one reason why customers would use MPLS-based services.

Page 62: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

62

The need for MPLS protection

• Layer 3 recovery is too slow.— OSPF, RIP, etc. require a redistribution of updated link status

information in response to a fault.

— Then routers must recompute their routes.

— Takes on the order of seconds.

— Can have looping and lost packets in the meantime.

• Other technologies are very fast.— SONET can establish an alternate route around a failure within

50 milliseconds.

— By having active backup resources immediately available.

• It would be good to have millisecond failovers with MPLS.

Page 63: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

63

MPLS protection approaches

• Headend reroute— Recompute LSP’s to find a new LSP after a failure.

— Initiated by the source or LER.

— But this is just has slow as using OSPF or RIP – not good.

• Pre-signaled standby LSP’s— Backup LSP is signaled in advance from primary ingress to egress.

— It does not share any links or LSR’s with the primary path.

— Called “link and node disjoint”.

— Has millisecond failover, around 500 milliseconds.

— These backup LSP’s need to have resources reserved for them, but these resources are not used very often.

— Note: But SONET also has a lot of unused resources just on standby for failures.

Page 64: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

64

Pre-signaled Standby LSP’s

• Planning occurs before failure— Then LSP ingress learns of the failure

— Moves traffic to use standby LSP

• Ingress must first know about the failure— The farther away from the failure, the longer it will take to start

the reroute.

Page 65: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

65

MPLS protection approaches

• MPLS Fast Reroute— During the establishment of a primary LSP, a protected path for each

possible link or node failure is pre-signaled.

— Even faster failover, around 50 milliseconds.

— But many more LSP’s are established, with resources reserved to them

— Much more to manage.

• Midpoint LSR’s could make their own LSP’s to the egress.— To go around the immediate downstream link or node that could fail.

— LSP’s are established using the same criteria used for the primary LSP.

— Since the PLR (Protection Label-Switched Router) is immediately connected to the failed link, it will know about the failure very quickly from the hardware.

— Then the backup LSP can be used.

Page 66: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

66

MPLS Fast Reroute

— A merge node joins traffic back onto the primary LSP.

Page 67: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

67

Outline

• Overview

• Label Encapsulations

• Label Distribution Protocols

• Constraint Based Routing

• MPLS and VPNs

• Network SurvivabilityNetwork Survivability

• Summary

Page 68: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

68

Summary of Motivations for MPLS

• Simplified forwarding based on an exact match of a fixed length label

— Initial driver for MPLS was based on the existence of cheap, fast ATM switches

• Separation of routing and forwarding in IP networks— Facilitates evolution of routing techniques by fixing the forwarding

method

— New routing functionality can be deployed without changing the forwarding techniques of every router in the Internet

• Facilitates the integration of ATM and IP— Allows carriers to leverage their large investment of ATM equipment

Page 69: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

69

Summary of Motivations for MPLS

• Enables the use of explicit routing/source routing in IP networks— Can easily be used for such things as traffic management, QoS

routing

• Promotes the partitioning of functionality within the network— Move detailed processing of packets to the edge; restrict core to

simple packet forwarding

— Assists in maintaining scalability of IP protocols in large networks

• MPLS can enable fast restoration from failures.

Page 70: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

70

• Applicability to both cell and packet link-layers— Can be deployed on both cell (eg. ATM) and packet (eg. FR, Ethernet)

media

— Common management and techniques simplifies engineering

• But MPLS is much more complex than traditional IP forwarding— Routers need to be able to forward based on labels (in addition to their

normal functions).

— LSP’s must be signalled and maintained.

— Some ISP’s have said they are not using MPLS and do not plan to.– This will continue to be true if overprovisioning remains effective.– But MPLS is more seriously being considered to carry legacy ATM

and Frame Relay traffic (connection-oriented traffic).– And some of these ISP’s are realizing that their customers want

MPLS to provide more assurance about their IP-based services.

Summary of Motivations for MPLS

Page 71: 1 CS 520 – Fall 2004 - Lecture 15 MPLS and its Applications (with modifications for CS 520) Philip Matthews Nortel Networks April 2000 (Material prepared

71

Summary

• MPLS is an important emerging technology.

• MPLS/LDP/CR-LDP have been recommended by the ITU for IP transport on ATM in public networks.

• Basic functionality (Encapsulation and basic Label Distribution) has been defined by the IETF.

• Traffic Engineering based on MPLS/CR-LDP is being developed (protocols and research).