MPLS Introduction

Multi-Protocol Label Switching

Presented by: Yun Teng

Dept. of Computer Science, UMBC
 MPLS Introduction
 Motivation
 MPLS Basics
 Components and Protocols
 Operation
 Protocol Stack Architecture
 Advantages and Disadvantages
 Motivation
 IP
 The first defined and used protocol
 De facto the only protocol for global Inte
rnet working

… but there are disadvantages

 Motivation (cont.)
 IP Routing disadvantages
 Connectionless
- e.g. no QoS
 Each router has to make independent forwarding
decisions based on the IP-address
 Large IP Header
- At least 20 bytes
 Routing in Network Layer
- Slower than Switching
 Usually designed to obtain shortest path
- Do not take into account additional metrics
 Motivation (cont.)
 ATM
 connection oriented
- Supports QoS
 fast packet switching with fixed length
packets (cells)
 integration of different traffic types
(voice, data, video)

… but there are also disadvantages

 Motivation (cont.)
 ATM disadvantages
 Complex
 Expensive
 Not widely adopted
 Motivation (cont.)
 Idea: Combine the forwarding algorit
hm used in ATM with IP.
 MPLS Introduction
 Motivation
 MPLS Basics
 Components and Protocols
 Operation
 Protocol Stack Architecture
 Advantages and Disadvantages
 MPLS Basics
 Multi Protocol Label Switching is
arranged between Layer 2 and Layer
3
 MPLS Basics (cont.)
 MPLS Characteristics
 Mechanisms to manage traffic flows of
various granularities (Flow Management)
 Is independent of Layer-2 and Layer-3
protocols
 Maps IP-addresses to fixed length labels
 Interfaces to existing routing protocols
(RSVP, OSPF)
 Supports ATM, Frame-Relay and
Ethernet
 MPLS Introduction
 Motivation
 MPLS Basics
 MPLS Components and Protocols
 MPLS Operation
 MPLS Protocol Stack Architecture
 Advantages and Disadvantages
 Label
 Generic label format
 Label (cont.)
 Label distribution
 MPLS does not specify a single method fo
r label distribution
 BGP has been enhanced to piggyback the
label information within the contents of t
he protocol
 RSVP has also been extended to support
piggybacked exchange of labels.
 Label (cont.)
 IETF has also defined a new protocol
known as the label distribution protocol
(LDP) for explicit signaling and
management
 Extensions to the base LDP protocol have
also been defined to support explicit
routing based on QoS requirements.
Label (cont.)
 Label Edge Router - LER
 Resides at the edge of an MPLS
network and assigns and removes the
labels from the packets.
 Support multiple ports connected to
dissimilar networks (such as frame
relay, ATM, and Ethernet).
Label Switching Router - LSR
 Is a high speed router in the core on
an MPLS network.
 ATM switches can be used as LSRs wi
thout changing their hardware. Label
switching is equivalent to VP/VC swit
ching.
Positions of LERs & LSRs
 Forward Equivalence Class - FEC
 Is a representation of a group of pack
ets that share the same requirements
for their transport.
 The assignment of a particular packet
to a particular FEC is done just once
(when the packet enters the network)
.
 Label-Switched Paths - LSPs
 A path is established before the data
transmission starts.
 A path is a representation of a FEC.
 LSP Details
 MPLS provides two options to set up an LSP
 hop-by-hop routing
Each LSR independently selects the next hop for
a given FEC. LSRs support any available routing
protocols (OSPF, ATM …).
 explicit routing
Is similar to source routing. The ingress LSR spe
cifies the list of nodes through which the packet
traverses.
 The LSP setup for an FEC is unidirectional.
The return traffic must take another LSP!
 Label Distribution Protocol - LDP
 An application layer protocol for the d
istribution of label binding information
to LSRs.
 It is used to map FECs to labels, which, i
n turn, create LSPs.
 LDP sessions are established between LD
P peers in the MPLS network (not necess
arily adjacent).
 Sometimes employs OSPF or BGP.
 LDP details
 LDP message types:
 discovery messages—announce and maintain
the presence of an LSR in a network
 session messages—establish, maintain, and te
rminate sessions between LDP peers
 advertisement messages—create, change, an
d delete label mappings for FECs
 notification messages—provide advisory infor
mation and signal error information
 Traffic Engineering
 In MPLS, traffic engineering is inherently
provided using explicitly routed paths.
 The LSPs are created independently,
specifying different paths that are based on
user-defined policies. However, this may
require extensive operator intervention.
 RSVP-TE and CR-LDP are two possible
approaches to supply dynamic traffic
engineering and QoS in MPLS.
 RSVP-TE
 Request bandwidth and traffic
conditions on a defined path.
 Drawback:
 Requires regular refreshes
 Scalability
 CR-LDP
 Takes into account parameters, such
as link characteristics (bandwidth,
delay, etc.), hop count, and QoS.
 It is entirely possible that a longer (in
terms of cost) but less loaded path is
selected.
 Drawback: It adds more complexity
to routing calculations.
 MPLS Introduction
 Motivation
 MPLS Basics
 Components and Protocols
 Operation
 Protocol Stack Architecture
 Advantages and Disadvantages
 MPLS Operation
 The following steps must be taken for
a data packet to travel through an
MPLS domain.
 label creation and distribution
 table creation at each router
 label-switched path creation
 label insertion/table lookup
 packet forwarding
 Step 1
 Label creation and label distribution
 Before any traffic begins the routers make the
decision to bind a label to a specific FEC and
build their tables.
 In LDP, downstream routers initiate the
distribution of labels and the label/FEC binding.
 In addition, traffic-related characteristics and
MPLS capabilities are negotiated using LDP.
 A reliable and ordered transport protocol should
be used for the signaling protocol.
 Step 2
 Table creation
 On receipt of label bindings each LSR
creates entries in the label information
base (LIB).
 The contents of the table will specify the
mapping between a label and an FEC.
 mapping between the input port and input
label table to the output port and output
label table.
 The entries are updated whenever
renegotiation of the label bindings occurs.
 Example of LIB Table

Incoming Output Outgoing

Input Port
Port Label Port Port Label
1 3 3 6

2 9 1 7
MPLS Operation Example
 Step 3
 Label switched path creation
 The LSPs are created in the reverse direc
tion to the creation of entries in the LIBs.
MPLS Operation Example
 Step 4
 Label insertion/table-lookup
 The first router (LER1) uses the LIB table
to find the next hop and request a label
for the specific FEC.
 Subsequent routers just use the label to
find the next hop.
 Once the packet reaches the egress LSR
(LER4), the label is removed and the
packet is supplied to the destination.
MPLS Operation Example
 Step 5
 Packet forwarding
 LER1 may not have any labels for this packet as
it is the first occurrence of this request. In an IP
network, it will find the longest address match
to find the next hop. Let LSR1 be the next hop
for LER1.
 LER1 will initiate a label request toward LSR1.
 This request will propagate through the network
as indicated by the broken green lines.
 Step 5 (cont.)
 Each intermediary router will receive a label fro
m its downstream router starting from LER2 and
going upstream till LER1. The LSP setup is indica
ted by the broken blue lines using LDP or any ot
her signaling protocol. If traffic engineering is re
quired, CR–LDP will be used in determining the a
ctual path setup to ensure the QoS/CoS require
ments are complied with.
 LER1 will insert the label and forward the packet
to LSR1.
 Step 5 (cont.)
 Each subsequent LSR, i.e., LSR2 and
LSR3, will examine the label in the
received packet, replace it with the
outgoing label and forward it.
 When the packet reaches LER4, it will
remove the label because the packet is
departing from an MPLS domain and
deliver it to the destination.
 The actual data path followed by the
packet is indicated by the broken red
lines.
MPLS Operation Example
 Tunneling in MPLS
 Control the entire path of a packet wit
hout explicitly specifying the intermed
iate routers.
 Creating tunnels through the intermediar
y routers that can span multiple segment
s.
 MPLS based VPNs.
 MPLS Introduction
 Motivation
 MPLS Basics
 Components and Protocols
 Operation
 Protocol Stack Architecture
 Advantages and Disadvantages
MPLS Protocol Stack Architecture
 MPLS Introduction
 Motivation
 Basics
 Components and Protocols
 Operation
 Protocol Stack Architecture
 Advantages and Disadvantages
 MPLS Advantages
 Improves packet-forwarding performa
nce in the network
 Supports QoS and CoS for service diff
erentiation
 Supports network scalability
 Integrates IP and ATM in the network
 Builds interoperable networks
 MPLS Disadvantages
 An additional layer is added
 The router has to understand MPLS
 References
 http://www.iec.org/online/tutorials/mpls/index.
html
 http://www.iaik.tu-graz.ac.at/teaching/03_adv
anced%20computer%20networks/ss2004/vo3/
MPLS.pdf
 http://ica1www.epfl.ch/cn2/0304/doc/lecture/
mpls.pdf
MPLS Introduction

Q&A
MPLS Introduction

Thank you!