ECE544: Communication Networks-II Spring 2009 H. Liu Lecture 9 (MPLS) Includes teaching materials from D. Saha.

Slides:



Advertisements
Similar presentations
QoS Strategy in DiffServ aware MPLS environment Teerapat Sanguankotchakorn, D.Eng. Telecommunications Program, School of Advanced Technologies Asian Institute.
Advertisements

MPLS: The Magic Behind the Myths Grenville Armitage (author) Scott Crosby (presenter)
Identifying MPLS Applications
IETF Differentiated Services Concerns with Intserv: r Scalability: signaling, maintaining per-flow router state difficult with large number of flows r.
Multi-Protocol Label Switch (MPLS)
Internetworking II: MPLS, Security, and Traffic Engineering
MULTIPROTOCOL LABEL SWITCHING Muhammad Abdullah Shafiq.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—2-1 Label Assignment and Distribution Introducing Typical Label Distribution in Frame-Mode MPLS.
Introducing MPLS Labels and Label Stacks
MPLS Complied from NT, NANOG, and other sources…. Ram Dantu.
This teaching material is a part of e-Photon/ONe Master study in Optical Communications and Networks Course and module: Author(s): This tutorial is licensed.
Introduction to MPLS and Traffic Engineering Zartash Afzal Uzmi.
CS Summer 2003 Lecture 6. CS Summer 2003 Hierarchical LSP LSP1 LSP2 LSP3 Ingress LSR for LSP1 Egress LSR for LSP1 Ingress LSR for LSP3 Hierarchical.
CS Summer 2003 Lecture 7. CS Summer 2003 MPLS Forwarding MPLS forwarding can be described in terms of: Label imposition Label disposition.
MPLS H/W update Brief description of the lab What it is? Why do we need it? Mechanisms and Protocols.
A Comparison Of MPLS Traffic Engineering Initiatives Robert Pulley & Peter Christensen.
MPLS Multiple Protocol Label Switching 2003/2/19.
MPLS and Traffic Engineering
Performance Measurements of MPLS Traffic Engineering and QoS By Tamrat Bayle Reiji Aibara Kouji Nishimura.
CS Summer 2003 Lecture 8. CS Summer 2003 Populating LFIB with LDP Assigned/Learned Labels Changes in the LFIB may be triggered routing or.
Introduction to MPLS and Traffic Engineering
Advanced Topics in Networking: MPLS and GMPLS Hang Liu Thomson Inc., Corporate Research Lab Princeton, NJ Note: Thank Dr. Debanjan Saha for the teaching.
Path Protection in MPLS Networks Using Segment Based Approach.
Multi-Protocol Label Switching
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Multiprotocol Label Switching (MPLS) 中正大學資工系 黃仁竑.
COS 420 Day 16. Agenda Assignment 3 Corrected Poor results 1 C and 2 Ds Spring Break?? Assignment 4 Posted Chap Due April 6 Individual Project Presentations.
A Study of MPLS Department of Computing Science & Engineering DE MONTFORT UNIVERSITY, LEICESTER, U.K. By PARMINDER SINGH KANG
1 MPLS Architecture. 2 MPLS Network Model MPLS LSR = Label Switched Router LER = Label Edge Router LER LSR LER LSR IP MPLS IP Internet LSR.
SMUCSE 8344 MPLS Virtual Private Networks (VPNs).
1 Multi-Protocol Label Switching (MPLS) presented by: chitralekha tamrakar (B.S.E.) divya krit tamrakar (B.S.E.) Rashmi shrivastava(B.S.E.) prakriti.
Multiprotocol Label Switching (MPLS)
1 Multi Protocol Label Switching Presented by: Petros Ioannou Dept. of Electrical and Computer Engineering, UCY.
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Introduction to MPLS and Traffic Engineering Zartash Afzal Uzmi.
Connection-Oriented Networks1 Chapter 6: The Multi-Protocol Label Switching Architecture TOPICS –IP: A primer –The MPLS architecture Label allocation schemes.
1 Multiprotocol Label Switching. 2 “ ” It was designed to provide a unified data-carrying service for both circuit-based clients and packet-switching.
MPLS MultiProtocol Label Switching.
IP/MPLS Multiprotocol Label Switching
1 © 2001, Cisco Systems. MPLS Architecture Overview Jay Kumarasamy Adopted from Stefano Previdi’s presentation.
P Packets and Circuits: Chris Cooper Feb 2005 MPLS Topics: Introduction to MPLS Tutorial Questions and Recommended Reading.
MultiProtocol Label Switching (MPLS) July 29, 2000TECON 2000 Pramoda Nallur Alcatel Internetworking Division.
Multiprotocol Label Switching (MPLS) References: Juniper white papers on MPLS and DiffServ at: white_papers/
MPLS Architecture Overview Adopted from Stefano Previdi’s presentation 麟瑞科技 技術經理 張晃崚.
MPLS: Multi-protocol Label Switching 2000/05/152 Topics Introduction History and motivation MPLS mechanisms MPLS protocols RSVP-TE/CR-LDP MPLS applications.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS Introduction Module 4: Frame Mode MPLS Implementation.
MPLS Architecture Overview V1.1. Course Objectives MPLS overview MPLS Concepts LSRs and labels Label assignment and distribution Label Switch Paths Loops.
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
MPLS Forwarder Preliminary 1 Outline MPLS Overview MPLS Overview MPLS MRD MPLS Data Path HLD 48K MPLS Fwder HLD IPE MPLS Fwder HLD Issues Summary.
Lab MPLS Basic Configuration Last Update Copyright 2011 Kenneth M. Chipps Ph.D. 1.
MPLS (MultiProtocol Labeling Switching) School of Electronics and Information Kyung Hee University. Choong Seon HONG.
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Graceful Label Numbering in Optical MPLS Networks Ibrahim C. Arkut Refik C. Arkut Nasir Ghani
MPLS Label Last Update Copyright 2011 Kenneth M. Chipps Ph.D. 1.
MPLS Some notations: LSP: Label Switched Path
1 Multiprotocol Label Switching (MPLS) and its Applications Network Architecture Spring 2009 Lecture 17.
June 4, 2003Carleton University & EIONGMPLS - 1 GMPLS Generalized Multiprotocol Label Switching Vijay Mahendran Sumita Ponnuchamy Christy Gnanapragasam.
(Slide set by Norvald Stol/Steinar Bjørnstad
Module 2 MPLS Concepts.
Multiple Protocol Support: Multiprotocol Level Switching.
Chapter 5 MPLS Labels There are many examples of label substitution protocols already in existence. ATM - label is called VPI/VCI and travels with cell.
Label Distribution Protocols LDP: hop-by-hop routing RSVP-TE: explicit routing CR-LDP: another explicit routing protocol, no longer under development.
MULTI-PROTOCOL LABEL SWITCHING By: By: YASHWANT.V YASHWANT.V ROLL NO:20 ROLL NO:20.
Multi-protocol Label Switching
Multiprotocol Label Switching (MPLS) Routing algorithms provide support for performance goals – Distributed and dynamic React to congestion Load balance.
Multi-protocol Label Switching (MPLS) RFC 3031 MPLS provides new capabilities: QoS support Traffic engineering VPN Multiprotocol support.
Advanced Computer Networks
Multi Protocol Label Switching (MPLS)
MPLS Basics 2 2.
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Presentation transcript:

ECE544: Communication Networks-II Spring 2009 H. Liu Lecture 9 (MPLS) Includes teaching materials from D. Saha

2 MPLS: Multi-protocol Label Switching Introduction History and motivation MPLS mechanisms MPLS protocols RSVP-TE/CR-LDP MPLS applications VPNSs, traffic engineering, protection & restoration

3 Multiprotocol Lable Switching (MPLS) MPLS: Combine some properties of virtual circuits with flexibility & robustness of datagrams Relies on IP addresses and IP routing protocols to set up the path MPLS-enabled routers forwards packets by examining a short, fixed-length lables Labels have local scope, similar to VC Layer 2.5 protocol Support different link layer technologies (ATM, Ethernet, PPP)

4 WHY MPLS ? Ultra fast forwarding Use switching instead of routing IP Traffic Engineering Constraint-based routing Virtual Private Networks Controllable tunneling mechanism Protection and restoration

5 IP Forwarding Table 47.1.*.* 47.2.*.* 47.3.*.*

6 Hop-by-Hop IP Forwarding IP

7 Routing Lookup Longest prefix match is (was) expensive. Label matching is much less expensive. 10 Gbps 20M packets/sec Switch fabric Control CPU I/F 9.*.*.* *.* *.* * * PrefixNext Hop Interface

8 MPLS Label ATM-encapsulated packets: VPI and VCI => label Frame-based packets (Ethernet, PPP): “ Shim ” header GFCVPI VCI PTI CLP HEC DATA Label Label: local scope as VCI Exp: to identify the class of service (ToS) Stack bit: indicate whether to encapsulate another shim label header MPLS encapsulation is specified over various media types. For example, top labels may use existing ATM format, lower label(s) use a new “ shim ” label header TTL: time-to-live counter. Special processing rules are used to mimic IP TTL semantics. Ethernet Header Shim Header IP Header IP Payload Label (20 bits)Exp (3 bits) Stack (1 bit) TTL(8 bits) Ether Trailer

9 MPLS Labels Mapping: 0.40 Request: 47.1 Mapping: 0.50 Request: 47.1

10 Label Switched Path IP If no label mapping, pass up to L3 and IP routing is used to forward packets

11 Forwarding Equivalence Classes (FEC) FEC = “A subset of packets that are all treated the same way by a router” a MPLS label is associated with a FEC, FEC label binding The concept of FECs provides for a great deal of flexibility and scalability In conventional routing, a packet is assigned to a FEC at each hop (i.e. L3 look-up) in MPLS it is only done once at the network ingress At the ingressof a MPLS network, a packet is classified and assigned a FEC/label Packet forwarding is done according to the label in the MPLS network Packets are destined for different address prefixes, but can be mapped to the same FEC and follows a common path from the ingress to the egress IP1 IP2 IP1 IP2 LSR LER LSP IP1#L1 IP2#L1 IP1#L2 IP2#L2 IP1#L3 IP2#L3

12 MPLS Terminology LDP: Label Distribution Protocol LSP: Label Switched Path FEC: Forwarding Equivalence Class LSR: Label Switching Router LER: Label Edge Router

13 Label Distribution Methods LSR1 LSR2 Downstream Label Distribution Label-FEC Binding LSR2 discovers a ‘next hop’ for a particular FEC LSR2 generates a label for the FEC and communicates the binding to LSR1 LSR1 inserts the binding into its forwarding tables If LSR2 is the next hop for the FEC, LSR1 can use that label knowing that its meaning is understood LSR1 LSR2 Downstream-on-Demand Label Distribution Label-FEC Binding LSR1 recognizes LSR2 as its next-hop for an FEC A request is made to LSR2 for a binding between the FEC and a label If LSR2 recognizes the FEC and has a next hop for it, it creates a binding and replies to LSR1 Both LSRs then have a common understanding Request for Binding Both methods are supported, even in the same network at the same time

14 Distribution Control Independent LSP Control Ordered LSP Control Next Hop (for FEC) Outgoing Label Incoming Label Each LSR makes independent decision on when to generate labels and communicate them to upstream peers Communicate label-FEC binding to peers once next-hop has been recognized LSP is formed as incoming and outgoing labels are spliced together Label-FEC binding is communicated to peers if: - LSR is the ‘egress’ LSR to particular FEC - label binding has been received from upstream LSR LSP formation ‘flows’ from egress to ingress Definition Comparison Labels can be exchanged with less delay Does not depend on availability of egress node Granularity may not be consistent across the nodes at the start May require separate loop detection/mitigation method Requires more delay before packets can be forwarded along the LSP Depends on availability of egress node Mechanism for consistent granularity and freedom from loops Used for explicit routing and multicast Both methods are supported in the standard and can be fully interoperable

15 Label Retention Methods Liberal Label Retention Conservative Label Retention LSR1 LSR2 LSR3 LSR4 Label Bindings for LSR4 Valid Next Hop LSR4’s Label LSR3’s Label LSR2’s Label LSR1 LSR2 LSR3 LSR4 Label Bindings for LSR4 Valid Next Hop LSR4’s Label LSR3’s Label LSR2’s Label LSR maintains bindings received from LSRs other than the valid next hop If the next-hop changes, it may begin using these bindings immediately May allow more rapid adaptation to routing changes Requires an LSR to maintain many more labels LSR only maintains bindings received from valid next hop If the next-hop changes, binding must be requested from new next hop Restricts adaptation to changes in routing Fewer labels must be maintained by LSR Label Retention method trades off between label capacity and speed of adaptation to routing changes

16 Label Distribution Protocols Label Distribution Protocol (LDP) Constraint-based Routing LDP (CR-LDP) Extensions to RSVP Extensions to BGP

17 LDP:Label Distribution Protocol Label distribution ensures that adjacent routers have a common view of FEC label bindings Routing Table: Addr-prefix Next Hop /8 LSR2 Routing Table: Addr-prefix Next Hop /8 LSR2 LSR1 LSR2 LSR3 IP Packet Routing Table: Addr-prefix Next Hop /8 LSR3 Routing Table: Addr-prefix Next Hop /8 LSR3 For /8 use label ‘17’ Label Information Base: Label-In FEC Label-Out /8 XX Label Information Base: Label-In FEC Label-Out /8 XX Label Information Base: Label-In FEC Label-Out XX /8 17 Label Information Base: Label-In FEC Label-Out XX /8 17 Step 1: LSR creates binding between FEC and label value Step 2: LSR communicates binding to adjacent LSR Step 3: LSR inserts label value into forwarding base Common understanding of which FEC the label is referring to!

18 LDP: Basic Characteristics Provides LSR discovery mechanisms to enable LSR peers to find each other and establish communication Defines four classes of messages DISCOVERY: deals with finding neighboring LSRs ADJACENCY: deals with initialization, keep alive, and shutdown of sessions LABEL ADVERTISEMENT: deals with label binding advertisements, request, withdrawal, and release NOTIFICATION: deals with advisory information and signal error information Runs over TCP for reliable delivery of messages, except for discovery, which uses UDP and IP multicast Designed to be extensible, using messages specified as TLVs (type, value, length) encoded objects.

19 LDP Messages INITIALIZATION KEEPALIVE LABEL MAPPING LABEL WITHDRAWAL LABEL RELEASE LABEL REQUEST

20 IP IP Explicitly Routed (ER) LSP Forward packets along “ explicit routes ” - pre-calculated routes that don ’ t necessarily match those that normal IP routing protocols would select.

21 ER LSP - Advantages Operator has routing flexibility policy-based, QoS-based Can use routes other than shortest path Can compute routes based on constraints in exactly the same manner as ATM based on distributed topology database.(traffic engineering)

22 ER LSP - discord! Two signaling options proposed in the standards: CR-LDP, RSVP extensions: CR-LDP = LDP + Explicit Route RSVP ext = Traditional RSVP + Explicit Route +Scalability Extensions RSVP-TE: RSVP traffic engineering Market will probably have to resolve it Survival of the fittest not such a bad thing.

23 MPLS and QoS in IP Network Integrated Services Assign a FEC/label to a flow RSVP was extended to RSVP-TE to support traffic engineering RSVP was further extend to add MPLS support for label distribution Differentiated Services LSRs don ’ t sort based on IP headers, hence DSCPs need to be mapped to EXP field in MPLS shim header Exp field is only 3-bit wide – can support only 8 DSCPs/PHBs Labels can be used if more than 8 PHBs need to be supported Assign different labels to different classes Some signaling is needed to specify the PHB Same approach can be used for link layers which do not use Shim headers, e.g. ATM

24 Traffic Engineering with RSVP Sender Receiver PATH {Tspec} RESV {Rspec} PATH {Tspec} RESV {Rspec}

25 Label Distribution with RSVP-TE PATH {Tspec} RESV {Rspec} {Label = 5} RESV {Rspec} {Label = 10} Sender PATH {Tspec} RESV {Rspec} PATH {Tspec} RESV {Rspec}

26 MPLS Protection End-to-end protection Fast node and link reroute

27 MPLS Protection End-to-end Path Protection A C B D E F Backup LSP Primary LSP Backup and primary LSPs should be route diverse

28 MPLS Protection: Fast Reroute LSR A LSR F LSR E LSR D LSR C LSR B Detour to avoid AB Detour to avoid BC Detour to avoid CD Detour to avoid DE Detour to avoid link DE Detour around node or link failures Example LSP shown traverses (A, B, C, D, E, F) Each detour avoids Immediate downstream node & link towards it Except for last detour: only avoids link DE

29 Detour Merging LSR A LSR F LSR E LSR D LSR C LSR B Detour to avoid AB Detour to avoid BC Merged detour to avoid AB and BC Reduces state maintained Improves resource utilization

30 MPLS Protection Types 1+1: Backup LSP established in advance, resources dedicated, data simultaneously sent on both primary and backup Switchover performed only by egress LSR Fastest, but most resource intensive 1:1 : Same as 1+1 with the difference that data is not sent on the backup Requires failure notification to the ingress LSR to start transmitting on backup Notification may be send to egress also Resources in the backup may be used by other traffic Low priority traffic (e.g., plain IP traffic), shared by other backup paths

31 MPLS VPN: The Problem 10.1/ / /16 Provider Network Customer 1 Site 1 Customer 1 Site 2 Customer 1 Site 3 Customer 2 Site 3 Customer 2 Site 1 Customer 2 Site 2

32 MPLS VPN: The Model 10.1/ / /16 Customer 1 Site 1 Customer 2 Site 1 Customer 2 Site 3 Customer 1 Site 3 Customer 2 Site 2 Customer 1 Site 2 Customer 1 Virtual Network Customer 2 Virtual Network MPLS is used to tunnel data across a network of MPLS-enabled routers

33 MPLS VPN: The Solution 10.1/ / /16 Customer 1 Site 1 Customer 1 Site 2 Customer 1 Site 3 Customer 2 Site 3 Customer 2 Site 1 Customer 2 Site 2 VRF 1 VRF 2 MPLS LSP