GBS MPLS Introduction

MPLS Introduction Executive Training Session Delivered to CW (M&I)
Monaco, 2011-09-08
GBS-MKT-Global-10_001 confidential
Agenda
Introduction Application Features Implementation Audit Service
Global Business Solutions SAL
GBS-MKT-Global-10_001
Introduction
Basic Concept Architecture Operation Modes LSR Architecture Forwarding Label & Stack
Basic Concept
MPLS?
Multi-Protocol Label Switching New forwarding mechanism based on labels
Destination IP networks (traditional routing) Source network, QoS, bandwidth, etc
Support other forwarding mechanism
MPLS Example
Edge routers:
Lookup routes Assign labels
Core routers:
Switch packets Swap labels
All forwarding based
MPLS Example (image)
10.1.1.1
10.1.1.1
Label removal and routing lookup L=3
Routing lookup and label assignment 10.0.0.0/8 L=5 Label swapping L=5 L=3
MPLS Architecture
MPLS architecture is divided between 2 main components: Control plane:
Exchange L3 routing info and labels
Routing: OSPF, EIGRP, BGP, IS-IS, etc Labels: TDP, LDP, BGP, RSVP, etc
Maintain the label switching database

LFIB: label forwarding information base
Data plane:
Simple forwarding engine
MPLS Architecture (image)
Control plane
OSPF: 10.0.0.0/8 LDP: 10.0.0.0/8 Label 17 Labeled packet Label 17
OSPF
OSPF: 10.0.0.0/8 LDP: 10.0.0.0/8 Label 4 Labeled packet Label 4
LDP
Data plane LFIB 4 17
MPLS Operation Modes

MPLS can be used everywhere regardless of L1/2 (media/protocol) MPLS have 2 modes of operations:
Frame mode: insert a 32b label field between L2 and L3 Cell mode: use other layer header (MPLS over ATM)
MPLS domain is the group of core and edge routers (LSR) that work together.
MPLS Domain (image)
MPLS Domain 10.1.1.1 L=3 L=3 L=5 L=5 10.1.1.1
20.1.1.1
L=31 L=31
L=43 L=43
20.1.1.1
Edge LSR
LSR
LSR Architecture
LSR (Label Switch Router) types:
Core LSR: forward labeled packet (swap labels) Edge LSR: labels packets and send them to domain
LSR functions:
Exchange routing info Exchange labels Forward packets or cell (data plane)
LSR Architecture (image)

LSR Control plane Exchange of routing information
Routing protocol IP routing table
Exchange of labels
Label distribution protocol
Data plane Incoming labeled packets

Label forwarding table
Outgoing labeled packets
FEC
FEC (Forwarding Equivalent Class):
IP Packet classification Group having same forwarding manner
Over the same path Having the same treatment
MPLS Forwarding
MPLS forwarding:
Assign a packet to a FEC (label) Determine the next-hop (routing)
LSR perform the following functions:

Insert (impose) a label or a stack of labels on ingress. Swap a label with a next-hop label or a stack of labels in the core. Remove (pop) a label on egress.
MPLS Forwarding (image)

MPLS Domain 10.1.1.1 3 10.1.1.1 5 10.1.1.1 10.1.1.1
IP Lookup 10.0.0.0/8 label 3 LFIB 10.1.1.1/8 label 3
IP Lookup 10.0.0.0/8 label 5 LFIB label 3 label 5
IP Lookup 10.0.0.0/8 next hop LFIB label 5
pop
Label & Stack

Label 32b field between L2 & L3:
20b: label (number) 3b: experimental (carry precedence value) 1b: bottom-of-stack (indicator if last label) 8b: TTL (prevent indefinite looping)
Label Stack Scenarios:

MPLS/VPN (next router / VPN tunnel) Traffic Engineering (endpoint tunnel / destination) Combined MPLS/VPN & Traffic Engineering
Applications
Unicast IP routing Multicast IP routing Traffic Engineering QoS VPN
Applications differ only in the control plane
Unicast IP routing
IP routing protocol (OSPF, EIGRP, )
Carry info about network reachability
Label distribution protocol (LDP or TDP)

Bind labels to networks learned
FEC = destination network

Stored in the routing table
Multicast IP routing
No dedicated protocol is needed
Natively built into MPLS PIMv2 propagate routes and labels
FEC = destination multicast address

Stored in the multicast table
Traffic Engineering
IP routing protocol (OSPF or IS-IS)
Holds the entire routing topology IGP is an extension to MPLS/TE
Establish tunnel (RSVP or CR-LDP)

Propagate labels
IGP: internal gateway protocol RSVP: resource reservation protocol CR-LDP: constraint-based routed LDP
QoS
Extension to unicast
Differentiated services LDP/TDP extension
FEC = destination network + service class
VPN
Networks are learned via:
IGP from a customer BGP from internal routers
Label propagate via multi-protocol BGP

1st: points to the egress router (LDP or TDP) 2nd: points to a routing table or egress interface
FEC=VPN site descriptor or routing table
Applications (image)
Control plane
Unicast IP Routing
Any IGP Unicast IP routing table LDP/TDP Multicast IP routing table PIM version 2
Multicast IP Routing
MPLS Traffic Engineering

OSPF or IS-IS Unicast IP routing table LDP RSVP
QoS
Any IGP Unicast IP routing table LDP/TDP
MPLS/VPN
Any IGP Unicast IP routing tables LDP BGP
Data plane
Label forwarding table
AToM
AToM: Any Transport over MPLS
L2 frames: Ethernet, FR, ATM, PPP, HDLC Transport L2 traffic over IP/MPLS backbone Single, integrated, packet based infrastructure Higher availability, performance, scalability
Examples:
Ethernet over MPLS, application: TLS and VPLS Frame-Relay over MPLS, carry: BECN, FECN, BE ATM over MPLS
Features
Neighbors Discovery Label Distribution Packet Propagation Convergence
Neighbours Discovery
LDP & TDP have similar process:
Send Hello message on the interface (UDP) Respond by establishing a session (TCP) LDP port number is 646 UDP multicast address 224.0.0.2
LSR establish one LDP session per label space

Combination of frame mode, cell mode or multi cell mode results in multiple LDP sessions
Neighbours Discovery (image)

UDP: Hello UDP: UDP:Hello Hello (1.0.0.2:1064 224.0.0.2:646) (1.0.0.2:1065 MPLS_B (1.0.0.2:1066 224.0.0.2:646) 224.0.0.2:646) 1.0.0.2
UDP: Hello UDP: UDP:Hello Hello (1.0.0.1:1050 224.0.0.2:646) MPLS_A(1.0.0.1:1051 (1.0.0.1:1052 224.0.0.2:646) 224.0.0.2:646) 1.0.0.1
NO_MPLS_C 1.0.0.3
UDP: Hello UDP: UDP:Hello Hello (1.0.0.4:1033 224.0.0.2:646) (1.0.0.4:1034 MPLS_D (1.0.0.4:1035 224.0.0.2:646) 224.0.0.2:646) 1.0.0.4
Label Distribution
Frame mode:
New field is used for forwarding decisions Labels are advertised to reachable peers
Packet mode:
Build routing table Each LSR assign label to every destination All LSR announce their labels Each LSR build its data structures (LIB, LFIB, FIB)
LIB: label table, FIB: forwarding table, LFIB: current label table
Label Distribution (image)

LSR Control Plane OSPF: 10.0.0.0/8 RT: 10.0.0.0/8 LDP: 10.0.0.0/8, L=5 5 LIB: 10.0.0.0/8 Data Plane 10.1.1.1 L=5 10.1.1.1 FIB: 10.0.0.0/8 LFIB: L=5 L=3 1.2.3.4 , L=3 L=3 10.1.1.1 L=3 10.1.1.1 1.2.3.4 1.2.3.4 3 Next-hop L=3, LocalLDP: L=5 10.0.0.0/8, L=3 OSPF: 10.0.0.0/8
Packet Propagation (1)

IP routing table:
Tables are build based on the routing protocol (L3) FIB are build based on routing table with no labeling
Allocating labels:
Each LSR allocates a label asynchronously (local significance) LIB and LFIB setup, action pop
Advertisement:
Each LSR advertise all its neighbors (up/down stream) ALL LSR store received label on LIB Edge LSR store label from their next-hop in FIB Every LSR insert outgoing labels in LFIB
Packet Propagation (2)

Packet propagation:
IP lookup is done in FIB, packet labeled (ingress LSR) Labeled packet lookup is performed in LFIB, label switched Label lookup is performed on LFIB, label removed (egress LSR) if action is pop
Advantages:
Liberal label retention improves convergence speed
Packet Propagation (image)

Routing table of A Network Next-hop X B Routing table of B Network Next-hop X C Routing table of C Network Next-hop X D
A
FIB on A Network Next hop Label X B
C
Routing table of E Network Next-hop X C
D Network X
Building the IP Routing Table IP routing protocols are used to build IP routing tables on all LSRs. FIBs are built based on IP routing tables with no labeling information.

Routing table of B Network Next-hop X C
Router B assigns label 25 to destination X.
D Network X
E
Allocating Labels Every LSR allocates a label for every destination in the IP routing table. Labels have local significance. Label allocations are asynchronous.

Router B assigns label 25 to destination X.
B
LFIB on B Action Next hop E pop C
Label 25
Outgoing action is pop, as B has received no label for X X Network from C. Local label is stored in LIB.
LIB on B Network LSR label X local 25
LIB and LFIB Setup LIB and LFIB structures have to be initialized on the LSR allocating the label.

LIB on B Network LSR label X local 25
X = 25 A B
X = 25 C D Network X E
Label Distribution The allocated label is advertised to all neighbor LSRs, regardless of whether the neighbors are upstream or downstream LSRs for the destination.

LIB on A Network LSR label X B 25 LIB on C Network LSR label X B 25
X = 25 A
FIB on A Network Next hop Label X B 25
X = 25 B C D Network X E
LIB on E Network LSR label X B 25
Receiving Label Advertisement Every LSR stores the received label in its LIB Edge LSRs that receive the label from their next-hop also store the label information in the FIB

LFIB on B Action Next hop pop C
Label lookup is performed in LFIB: label is removed.
Label 25
IP: X
Lab: 25
IP: X
IP lookup is performed in FIB: packet is labeled.

Interim Packet Propagation Forwarded IP packets are labeled only on the path segments where the labels have already been assigned

LIB on C Network LSR label X B 25 local 47
X = 47 A B C D Router C assigns label Network 47 to destination X. X E

Label 47
Further Label Allocation Every LSR will eventually assign a label for every destination
LFIB on C Action Next hop pop D

FIB on B Network Next hop Label X C 47 LIB on B Network LSR label X local 25 C 47
X = 47 A B LFIB on B Action Next hop 47 C C D Network X E
Label 25
Populating LFIB Router B has already assigned a label to X and created an entry in the LFIB The outgoing label is inserted in the LFIB after the label is received from the next-hop LSR

LFIB on B Action Next hop 47 C
Label lookup is performed in the LFIB, label is switched. Egress LSR IP: X
Ingress LSR IP: X
Label 25
Lab: 25
Lab: 47
Label 47
LFIB on C Action Next hop pop D
IP lookup is performed in the FIB, packet is labeled. Label lookup is performed in the LFIB, label is removed.
Convergence
Steady state: all LSR populated their LIB, LFIB and FIB Link failure:
entries are removed from data structure Rebuild the routing and forwarding tables LFIB & FIB rebuilt immediately from LIB
Link recovery:
Routing protocols discovered IP routing tables rebuilt, as well FIB and LFIB Routing protocols optimize forwarding path
Remarks:
End-to-end connectivity intermittently broken Traffic engineering (make-before-break) use
Convergence (image)
FIB on B Network Next hop Label X C 47
B
LIB on B Network LSR label X local 25 C 47 E 75
Label 25 LFIB on B Action Next hop 47 C
D Network X
Steady State Description After the LSRs have exchanged the labels, LIB, LFIB and FIB data structures are completely populated.
Convergence (image)
FIB on B Network Next hop Label X C 47
B
LIB on B Network LSR label X local 25 C 47 E 75 Label 25 LFIB on B Action Next hop 47 C
D Network X
Link Failure Actions Routing protocol neighbors and LDP neighbors are lost after a link failure. Entries are removed from various data structures.
Convergence (image)
Routing table of B Network Next-hop X E
FIB on B Network Next hop Label X E
B
LIB on B Network LSR label X local 25 C 47 E 75 Label 25 LFIB on B Action Next hop 47 C
D Network X
Routing Protocol Convergence Routing protocols rebuild the IP routing table and the IP forwarding table.
Convergence (image)
FIB on B Network Next hop Label X E 75
B
LIB on B Network LSR label X local 25 C 47 E 75 Label 25 LFIB on B Action Next hop 75 E
D Network X
MPLS Convergence The LFIB and labeling information in the FIB are rebuilt immediately after the routing protocol convergence, based on labels stored in the LIB.
Convergence (image)
FIB on B Network Next hop Label X E 75
B
LIB on B Network LSR label X local 25 C 47 E 75 Label 25 LFIB on B Action Next hop 75 E
D Network X
Link Recovery Actions Routing protocol neighbors are discovered after link recovery.
Convergence (image)
Routing table of B Network Next-hop X E C
FIB on B Network Next hop Label C X E 75
B
LIB on B Network LSR label X local 25 C 47 E 75 Label 25 LFIB on B Action Next hop pop C 75 E
D Network X
IP Routing Convergence After Link Recovery IP routing protocols rebuild the IP routing table. The FIB and the LFIB are also rebuilt, but the label information might be lacking.
Implementation
Guidelines Examples
Guidelines
Implementation guidelines depends on:
Size of the network Geographical distribution Service classification Projected level of availability Convergence speed requirements
Example I
CE P/PE
CE
P/PE
CE
Example II
CE PE
CE
CE
P/PE
P/PE
Example III
CE CE CE CE CE
PE
PE
PE
L2/L3 MPLS Routing & Switching Audit
L2/L3 MPLS Audit

Pre-Requisites & Deliverables Activities Description Case Studies
Pre-Requisites & Deliverables

Pre-Requisites
Network Diagram: logical diagrams representing the physical and logical connectivity of all IP based nodes in the transport layer Systems Configuration: collection of both high and low level data representing the running setup of all the nodes in question Logging information: only if quickly available, a history of 1 month would be fine, otherwise we will highlight major node to collect output from upon reception of the network diagram
Deliverables
High level service delivery diagram End to end service availability, performance, security and capacity Nodes status, highlighting major issues and impact on the service
Activities Description
Assessment
Facts findings (LLD collection) Running Configuration building simulation Availability, performance, security and capacity
Recommendation
Quick wins solutions (low cost that induce big results) Pitfalls avoidance (potential issues or problems) Phased plan (with cost & time estimate)
Case Studies
Availability
End to end service identifications Highlighting potential failure scenarios Convergence latency issues
Performance
Per LSR analysis (utilization, log, etc) End to end service classification analysis Convergence speed matching service requirements
Example
C
Internet
A
Data-1
B
Voice-2 Voice-1 The MPLS domain carriers both voice and data traffic In this example, end users on B are communicating with peers/destination through A. If the link between A and B fails, all traffic will be routed through C. Even with proper dimensioning, both links B-C & C-A will be congested and the LSR C will be overloaded, thus performance issue. In order to remediate this issue, simply converge voice traffic quickly, delay data convergence until platform is stable, (possibly limit further voice and/or data calls) and prioritize important traffic.
Thank You

GBS MPLS Introduction

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

GBS MPLS Introduction

Загружено:

Авторское право:

Доступные форматы

MPLS Introduction Executive Training Session Delivered to CW (M&I)

Support other forwarding mechanism

Global Business Solutions SAL

All forwarding based

Global Business Solutions SAL

MPLS Example (image)

Label removal and routing lookup L=3

Global Business Solutions SAL

Maintain the label switching database

Global Business Solutions SAL

MPLS Architecture (image)

OSPF: 10.0.0.0/8 LDP: 10.0.0.0/8 Label 17 Labeled packet Label 17

OSPF: 10.0.0.0/8 LDP: 10.0.0.0/8 Label 4 Labeled packet Label 4

Data plane LFIB 4 17

Global Business Solutions SAL

MPLS Operation Modes

Global Business Solutions SAL

MPLS Domain (image)

MPLS Domain 10.1.1.1 L=3 L=3 L=5 L=5 10.1.1.1

Global Business Solutions SAL

Global Business Solutions SAL

LSR Architecture (image)

Label distribution protocol

Data plane Incoming labeled packets

Outgoing labeled packets

Global Business Solutions SAL

Global Business Solutions SAL

LSR perform the following functions:

Global Business Solutions SAL

MPLS Forwarding (image)

IP Lookup 10.0.0.0/8 label 3 LFIB 10.1.1.1/8 label 3

IP Lookup 10.0.0.0/8 label 5 LFIB label 3 label 5

IP Lookup 10.0.0.0/8 next hop LFIB label 5

Global Business Solutions SAL

Label & Stack

Label Stack Scenarios:

Global Business Solutions SAL

Label distribution protocol (LDP or TDP)

FEC = destination network

Global Business Solutions SAL

FEC = destination multicast address

Global Business Solutions SAL

Establish tunnel (RSVP or CR-LDP)

Global Business Solutions SAL

FEC = destination network + service class

Global Business Solutions SAL

Label propagate via multi-protocol BGP

FEC=VPN site descriptor or routing table

Global Business Solutions SAL

MPLS Traffic Engineering

Global Business Solutions SAL

Global Business Solutions SAL

Global Business Solutions SAL

LSR establish one LDP session per label space

Global Business Solutions SAL

Neighbours Discovery (image)

Global Business Solutions SAL

Global Business Solutions SAL

Label Distribution (image)

Global Business Solutions SAL

Packet Propagation (1)

Global Business Solutions SAL

Packet Propagation (2)

Global Business Solutions SAL