Chapter II

Multi Protocol Label Switching

1
(MPLS)
2 Contents

 Introduction
 The Role of MPLS
 MPLS Operation
 FECs, LSPs, and Labels
 Traffic Engineering
 Elements of MPLS Traffic Engineering
 Constrained Shortest-Path First Algorithm
 Virtual Private Networks (Layer 2 and Layer 3)
3 Definition

 MPLS is a routing technique in telecommunications networks that directs

data from one node to the next based on short path labels rather than
long network addresses, thus avoiding complex lookups in a
routing table and speeding traffic flows.
 The labels identify virtual links (paths) between distant nodes rather
than endpoints.
 MPLS can encapsulate packets of various network protocols, hence the
"multiprotocol" reference on its name.
 MPLS supports a range of access technologies, including T1/E1, ATM,
Frame Relay, and DSL.
 Introduction
4
 During the 1980s, several vendors created routers that implement switching
technology to provide a comprehensive set of QoS and traffic engineering
capabilities in IP-based networks..
 Later IETF (internet engineering task force)approved a standard that is called Multi-
Protocol Label Switching. In this standard, some conventional routers in the Internet
can be replaced by MPLS routers, which can behave like a router and a switch.
 When behaving like a router, MPLS can forward the packet based on the destination
address; when behaving like a switch, it can forward a packet based on the label.
 MPLS reduces the amount of per-packet processing required at each router in an IP-
based network, enhancing router performance even more.
 MPLS provides significant new capabilities in four areas that have ensured its
popularity:
 Connection-oriented QoS support,
 Traffic Engineering,
 Virtual Private Networks, and
 Multiprotocol Support
 Introduction cont….
5
 Forwarding using MPLS has two components; these are label switching
forwarding and control component:
 Label switching forwarding component:
 Uses a single forwarding algorithm based on label swapping.
 The label has both forwarding and resource reservation semantics.
 It doesn’t place any constraints on the forwarding granularity that could be
associated with a label.
 It can support multiple network layer protocols as well as multiple link layer
protocols.
 The control component of label switching is responsible for:
 Distributing routing information among LSRs (Label Switching Router)/LER (Label
edge router) using LDP (Label distribution Protocol), and
 the procedures (algorithms) that these routers use to convert this information
into a forwarding table that is used by the label switching forwarding component.
6 Introduction cont…
 To simulate connection-oriented switching using a protocol like IP add a field to the
packet that carries the label.
 However, IPv4 packet format does not allow this extension (although this field is
provided in the IPv6 packet format).
 The solution is to encapsulate the IPv4 packet in an MPLS packet (as though MPLS
were a layer between the data-link layer and the network layer).
 The whole IP packet is encapsulated as the payload in an MPLS packet and an MPLS
header is added.

 A stack of labels in MPLS allows hierarchical switching. This is similar to

conventional hierarchical routing.
7 Introduction cont….

 The following is a brief description of each field:

 Label: this 20-bit field defines the label that is used to index the forwarding
table in the router.
 Exp: this 3-bit field is reserved for experimental purposes (used for grading
service). Also used for QoS priority ,ECN-Explicit Congestion Notification
 S: the one-bit stack field defines the situation of the sub-header in the stack.
When the bit is 1, it means that the header is the last one in the stack.
 TTL: this 8-bit field is Time To Live. Each visited router decrements the value
of this field. When it reaches zero, the packet is discarded to prevent looping.
 Functioning
8  MPLS is scalable and protocol-independent. In an MPLS network, data packets are
assigned labels. Packet-forwarding decisions are made solely on the contents of this
label, without the need to examine the packet itself.
 In an MPLS network, incoming packets are assigned a "label" by a " label switch
router (LSR)". Packets are forwarded along a "label switch path (LSP)" where each
"label switch router (LSR)" makes forwarding decisions based solely on the contents
of the label. At each hop, the LSR strips off the existing label and applies a new
label which tells the next hop how to forward the packet.
 This allows one to create end-to-end circuits across any type of transport medium,
using any protocol. The primary benefit is to eliminate dependence on a particular
OSI model data link layer (layer 2) technology,
 such as Asynchronous Transfer Mode (ATM), Frame Relay, Synchronous Optical
Networking (SONET) or Ethernet, and eliminate the need for multiple layer-2
networks to satisfy different types of traffic.
 Multiprotocol label switching belongs to the family of packet-switched
networks.
 It is lie between traditional definitions of OSI Layer 2 (data link layer) and Layer 3 (
network layer), and thus is often referred to as a layer 2.5 protocol.
 It can be used to carry many different kinds of traffic, including IP packets, as well
as native ATM, SONET, and Ethernet frames.
9 Layer 2.5 MPLS
10 The Role of MPLS
 The MPLS label contains all the information needed by an MPLS-enabled
router to perform routing, delivery, QoS, and traffic management functions. It
is connection oriented.
 A 2009 survey found that 84% of companies are now using MPLS for their
wide area networks. MPLS is deployed in almost every major IP network.
 Scholars lists the following reasons for the dramatic growth in MPLS
acceptance.
 MPLS embraced IP
 MPLS has built-in flexibility in several ways
 MPLS is protocol neutral
 MPLS is realistic
 MPLS is adaptable
 MPLS supports metrics
 MPLS scales
 MPLS Operation
11
12 MPLS operation cont…..
 An MPLS network (internet) consists of a set of nodes, called label
switching routers (LSRs).
 Labels define a flow of packets between two endpoints (a multicast
group of destination endpoints).
 For each distinct flow, called a Forwarding Equivalence Class (FEC),
a specific path through the network of LSRs is defined, called a Label
Switched Path (LSP).
 In essence, an FEC represents a group of packets that share the same
transport requirements (follow the same path and receive the same QoS
treatment at each hop).
 Each LSR builds a table, called a Label Information Base (LIB), to
specify how a packet must be treated and forwarded.
13 MPLS operation cont…..
 Label assignment decisions may be based on the following criteria:
 Destination Unicast Routing: in the absence of other criteria, packets flowing
from one source to one destination may be assigned to the same FEC.
 Traffic Engineering: packet flows may be split up or aggregated to
accommodate traffic engineering requirements.
 Multicast: multicast routes through the network may be defined.
 Virtual Private Network (VPN): traffic among end systems for a particular
customer may be segregated from other traffic on a public MPLS network by
means of a dedicated set of LSPs.
 QoS: traffic may be assigned different FECs for different QoS requirements.
14 MPLS operation cont…..
 The following are key elements of the operation:
 First Laurel Provisioning System must be defined and assign the QoS parameters.
Two protocols are used to exchange the necessary information among routers:
 An interior routing protocol (OSPF), is used to exchange reachability and routing
information.
 Labels must be assigned to the packets for a particular FEC (using Label Distribution
Protocol (LDP)).
 A packet enters an MPLS domain through an ingress edge LSR, where it is
processed to determine which network-layer services it requires, defining its QoS.
The LSR assigns this packet to a particular FEC.
 Within the MPLS domain, as each LSR receives a labeled packet, it
 Removes the incoming label and attaches the appropriate outgoing label to the packet
 Forwards the packet to the next LSR along the LSP.
 The egress edge LSR strips the label, reads the IP packet header, and forwards
the packet to its final destination.
15 MPLS operation cont….
17 MPLS operation cont…..
18
19

Label Path: R1 => R2 => R3 => R4

 FECs, LSPs, and Labels
20
Label stacking
 One of the most powerful features of MPLS is label stacking. A labeled packet may
carry a number of labels, organized as a last-in-first-out stack.
 Label stacking allows the aggregation of LSPs into a single LSP for a portion of the
route through a network, creating a tunnel.
 The term tunnel refers to the fact that traffic routing is determined by labels, and is
exercised below normal IP routing and filtering mechanisms.
 FECs, LSPs, and Labels cont….
21
Position of MPLS Label Stack
22 FECs, LSPs, and Labels cont….
 In order to define appropriate LSPs for FECs. We can consider the following issues
related to casting and edge LSRs:
 Unique ingress and egress LSR: in this case a single path through the MPLS
domain is needed.
 Unique egress LSR, multiple ingress LSRs: this situation would call for multiple
paths through the MPLS domain, probably sharing a final few hops.
 Multiple egress LSRs for unicast traffic
 Multicast
 Route selection refers to the selection of an LSP for a particular FEC. The MPLS
architecture supports two options:
 Hop-by-hop routing:
 Explicit routing: a single LSR, usually the ingress or egress LSR, specifies some
or all of the LSRs in the LSP for a given FEC.
 FECs, LSPs, and Labels cont….
23
 An MPLS traffic engineering specification suggests that the QoS-related information
falls into two categories:
 A set of attributes associated with an FEC or a collection of similar FECs that
collectively specify their behavioral characteristics
 A set of attributes associated with resources (nodes, links) that constrain the
placement of LSPs through them
 A routing algorithm that consider the above issues is referred to as a constraint-
based routing algorithm.
 Examples of metrics that would be useful to constraint-based routing are:
 Maximum link data rate
 Current capacity reservation
 Packet loss ratio
 Link propagation delay
24 Traffic Engineering
 It is concerned with performance optimization of operational networks.
 It encompasses the application of technology and scientific principles to the
measurement, modeling, characterization, and control of Internet traffic, and
the application of such knowledge and techniques to achieve specific
performance objectives.
 The aspects of traffic engineering that are of interest concerning MPLS are
measurement and control.
 The goal of MPLS traffic engineering is twofold:
 Traffic engineering seeks to allocate traffic to the network to maximize utilization of
the network capacity.
 Traffic engineering seeks to ensure the most desirable route through the network for
packet traffic, taking into account the QoS requirements of the various packet flows.
 In performing traffic engineering, MPLS may override the shortest path or
least-cost route selected by the interior routing protocol for a given source-
destination flow.
25 Traffic Engineering cont…..
26 Elements of MPLS Traffic Engineering
 The following components work together to implement MPLS traffic
engineering:
 Information distribution: a link state protocol, such as OSPF, is necessary to
discover the topology of the network. OSPF uses Type 10 Link State
Advertisements (LSAs) for this purpose.
 Path calculation: a constraint-based routing scheme is used for finding the
shortest path through a particular network that meets the resource
requirements of the traffic flow.
 Path setup: A signaling protocol to reserve the resources for a traffic flow and
to establish the LSP for a traffic flow.
 Traffic forwarding: This is accomplished with MPLS, using the LSP set up by
the traffic engineering components just described.
27 Constrained Shortest-Path First
Algorithm
 The Constrained Shortest Path First algorithm is used with Link State
routing protocols such as OSPF and ISIS. It resolves Quality of Service routing
queries, finding the best route (to an IPv4 or IPv6 destination address) that
meets specified constraints, such as a specified minimum bandwidth. (follows
dijktra’s algorithm)
 A constraint could be minimum bandwidth required per link (also known as
bandwidth guaranteed constraint), end-to-end delay, maximum number of links
traversed, include/exclude nodes.
 Also CSPF is known as Constraint Based Routing (CBR).
28

 Consider the network to the right, where a route has to be computed from router-A to the router-C
satisfying bandwidth constrained of x- units, and link cost for each link is based on hop-count (i.e.,
1).
 If x = 50 units then CSPF will give path A → B → C.
 If x = 55 units then CSPF will give path A → D → E → C.
 If x = 90 units then CSPF will give path A → D → E → F → C.
 In all of these cases OSPF (open shortest path first)and IS-IS (intermediate system to intermediate
system)will result in path A → B → C.
29 Virtual Private Networks (Layer 2 and
Layer 3)
 VPNs are private data networks over public network – usually the
Internet.
 VPNs extend corporate networks to remote offices, mobile users,
telecommuters and other extranet partners.
 VPNs use advanced encryption and ‘tunneling’ technology to establish
secure, end-to-end private network connections over Internet.
30 VPN- MODEL
31

 Since we all understand that IP is used to transport information between LANs if

we add some security stuff to IP then this transport can be made more secure
 Can be done two ways:
 At the network level using IPSec (IP security protocol)
 Currently the most widely used method
 But requires special client installation on each workstation (more IT $)
 At the Transport level using SSL (secures socket layer)
 Quickly gaining popularity because there are no special software installation requirements
for end user workstations
 All that’s required is a browser with SSL support
 Mozilla
 Internet Explorer
 Netscape
 Opera
 Characteristics
32
 Cheaper than WANs
 dedicated leased lines are very expensive
 Easier to establish than WANs
 ISPs will usually help make the initial IP connection
 hours for VPNs vs. weeks for WANs
 slower than LANs
 encryption/decryption takes time
 typical LANS are 10-100 Mbps
 endpoints connected by VPM may go through many router hops
 minimize by using same ISP for everything
 dial in users are going to be typically 56Kbps
 less reliable than WANs
 with WANs routers are under your control and performance is negotiated with
provider, not so with VPN you only control initial IP connection
 less secure than isolated LANs or WANs
 because Internet is used hackers can find you
 Types
33

 Server based
 Windows
 Routing and Remote Access Service
 NT supports only PPTP, W/2000 supports PPTP, L2TP and IPSec
 comes with everything needed to establish a VPN
 Linux
 Blowfish, Free S/WAN, PPP over SSL, PPTP, L2TP
 with IP masquerading/IP Chains and additional open source software can be used to create
a very robust VPN
 UNIX
 many incorporating IPSec into their TCP/IP stacks
 Be aware that VPN traffic leaving your LAN traverses the LAN twice
 once to the RRAS service as regular LAN traffic, once encapsulated to the firewall
34

 Firewall based
 Since firewalls already do all kinds of packet analysis, adding IP
tunneling is relatively easy
 Rapid acceptance of IPSec and IKE are making VPNing at the
firewall more common
 not all vendors versions of IPSec+IKE work together
 make sure that remote clients software works with your firewall VP
35

 Router based (including VPN appliances

 Typically used on big networks
 specialized devices for to isolate internal LAN traffic and quickly
convey inter-LAN traffic
 IBM 2210
 CISCO Routers running IOS
 Ascend’s MAX switches
 Layer-2 VPN
36
 A Layer 2 VPN is different than the VPLS(virtual private LAN service), because it is working
with the CE switch. It has to connect to the right circuit in order to control traffic in a secure
manner. Customers have to configure their own switches in order to have this work. It will
also be able to carry any Layer 3 traffic that might be passing through, but the provider
still needs to be able to detect how much traffic that the Layer 2 VPN will have to carry.
 This is also sometimes referred to as the Layer 2 point-to-point rather than VPN. The MPLS
Layer 2 point-to-point is a cheaper alternative to having high bandwidth leased lines.
Whole network operators tend to base their entire core network infrastructure along
Ethernet with Layer 2. It is considered “protocol agnostic,” because it allows anything
running along the LAN to also be sent over the WAN without getting caught up in
converters or having router trouble.
 Pros To Layer 2:
 Easy to upgrade without altering the hardware
 Low latency switches rather than routers
 Plug and play, so easy to set up and get going
 Traffic is monitored by MAC address rather than an IP
 All sites appear to be on the same LAN regardless of geography
 The provider does not need information about the customer directly
 Layer-3 VPN
37  Layer 3 IP VPN: A Layer 3 IP VPN is normally used by vast enterprises or
retailers that have an incredible amount of locations and servers to handle.
Layer 3 can work with business on a global level, and is the alternative to the
legacy frame relay as well as ATM. It also can provide monitoring for
troubleshooting while still providing the increase level of security that most
businesses are looking for.
 Layer 3 VPNs require a lot more configuration from the service provider since
the PE’s routers have to store and process all of the customer routes in order
for them to have a smooth and uninterrupted connection.
 Pros To Layer 3:
 IP/VPN has a high scalability for fast deployment
 Short hop count between two local sites
 Prioritization is simplified, even across multi-site networks
 Works for global locations that normally have a high latency
 Providers can offer extra services easily through network convergence
 Excellent choice for multi-location businesses
38

NEXT
CHAPTER-3