MPLS10S03-Label Assignment and Distribution

Module 3
Label Assignment
and Distribution
© 2001, Cisco Systems, Inc.

Objectives
Upon completion of this chapter, you will be
able to perform the following tasks:
• Describe the need for LDP/TDP in MPLS
network.
• Describe the LDP/TDP neighbor discovery and
session establishment procedures.
• Explain the needs for different LDP/TDP label
distribution modes.
• Explain the difference between independent
and ordered control.
• Describe various LDP/TDP retention modes
(conservative and liberal).
• Explain the functions and benefits of
© 2001, Cisco Systems, Inc. MPLS v1.0—3-2
LDP Role in Unicast
IP Routing

Objectives
Upon completion of this section,

you will be able to perform the
following tasks:
• Explain the need for the Label
Distribution Protocol (LDP) in unicast
IP routing MPLS application.
• Describe the LDP’s interaction with
other Label Switch Router (LSR)
components.

MPLS Unicast IP Routing
• MPLS introduces a new field that is used for

forwarding decisions.
• Although labels are locally significant, they
have to be advertised to directly reachable
peers.
• One option would be to include this
parameter in existing IP routing protocols.
• The other option is to create a new
protocol to exchange labels.
• The second option has been used because
there are too many existing IP routing
protocols that would have to be modified to
carry labels.
MPLS Unicast IP Routing
Architecture
LSR
Exchange of Control Plane

routing information
Routing Protocol
IP Routing Table
Exchange of
labels
LDP
Incoming
Data Plane Outgoing
IP packets IP packets
IP Forwarding Table
Incoming Outgoing
labeled packets labeled packets
Label Forwarding Table

MPLS Unicast IP Routing:
Example
LSR
Control Plane
OSPF: 10.0.0.0/8  1.2.3.4 OSPF: 10.0.0.0/8
RT: 10.0.0.0/8  1.2.3.4
LIB:
Data Plane
10.1.1.1 FIB: 10.0.0.0/8  1.2.3.4 10.1.1.1
L=5 10.1.1.1 LFIB:

MPLS Unicast IP Routing:
Example
LSR
Control Plane
OSPF: 10.0.0.0/8  1.2.3.4 OSPF: 10.0.0.0/8
RT: 10.0.0.0/8  1.2.3.4
LDP: 10.0.0.0/8, L=5 LIB:10.0.0.0/8  Next-hop L=3, Local L=5 LDP: 10.0.0.0/8, L=3
Data Plane
10.1.1.1 FIB: 10.0.0.0/8  1.2.3.4, L=3 L=3 10.1.1.1
L=5 10.1.1.1 LFIB: L=5  L=3 L=3 10.1.1.1

Summary
After completing this section, you

should be able to perform the
following tasks:
• Explain the need for the LDP in unicast
IP routing MPLS application.
• Describe the LDP’s interaction with
other LSR components.

Review Questions
• Why is the LDP/TDP needed?

• What is the forwarding equivalence
class in MPLS unicast IP forwarding?
• Where is this forwarding equivalence
class taken from?
• What is the output of the LDP/TDP?

Typical Label
Distribution in Packet-
mode MPLS

Objectives

following tasks:
• Describe label allocation in packet-
mode MPLS environments.
• Describe TDP/LDP label distribution in
packet-mode MPLS environments.
• Explain how the MPLS data structures
are built based on label allocation and
distribution.
Label Allocation in a Packet-
Mode MPLS Environment
Label allocation and distribution in a

packet-mode MPLS environment follows
these steps:
• IP routing protocols build the IP routing
table.
• Each LSR assigns a label to every
destination in the IP routing table
independently.
• LSRs announce their assigned labels to all
other LSRs.
Building the IP Routing Table
Routing table of A Routing table of B Routing table of C

Network Next-hop Network Next-hop Network Next-hop
X B X C X D
A B C D
FIB on A
Network Next hop Label Routing table of E
Network X
X B — Network Next-hop
E
X C
• 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.
Allocating Labels
Routing table of B
Router B assigns label 25 to
Network Next-hop
destination X.
X C
A B C D
Network X
E
• Every LSR allocates a label for every

destination in the IP routing table.
• Labels have local significance.
• Label allocations are asynchronous.
LIB and LFIB Setup
Routing table of B
Router B assigns label 25 to
Network Next-hop
destination X.
X C
A B C D
LFIB on B Outgoing action is pop, as B

Label Action Next hop has received no label for
Network X X
25 pop EC from C.
LIB on B
Network LSR label Local label is stored in LIB.
X local 25
LIB and LFIB structures have to be initialized on

the LSR allocating the label.
Label Distribution
LIB on B
Network LSR label
X local 25
X = 25 X = 25
A B C D
X
= Network X
25
E
The allocated label is advertised to all neighbor

LSRs, regardless of whether the neighbors are
upstream or downstream LSRs for the
destination.
Receiving Label
Advertisement
LIB on A LIB on C
Network LSR label Network LSR label
X B 25 X B 25
X = 25 X = 25
A B X C D
=
25
FIB on A
Network Next hop Label Network X
X B 25
E LIB on E
Network LSR label
X B 25
• 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.
Interim Packet Propagation
Label lookup is performed

LFIB on B
in LFIB: label is removed.
Label Action Next hop
25 pop C
IP: X Lab: 25 IP: X

A B C
FIB on A
Network Next hop Label
X B 25
E
IP lookup is performed in
FIB: packet is labeled.
Forwarded IP packets are labeled only on the

path segments where the labels have already
been assigned.
Further Label Allocation
LIB on C
Network LSR label
X B 25
local 47
X = 47
A B C D
47
= Router C assigns label
X Network
47 to destination X.X
E
LFIB on C
47 pop D
Every LSR will eventually assign a label for

every destination.
Receiving Label
Advertisement
FIB on B LIB on B
Network Next hop Label Network LSR label
X C 47 X local 25
C 47
X = 47
A B C D
47
=
X Network X
FIB on E
E LIB on E
X C 47 X B 25
C 47
• Every LSR stores received information in its
LIB.
• LSRs that receive their label from their next-
hop LSR will also populate the IP forwarding
Populating LFIB
FIB on B LIB on B
X C 47 X local 25
C 47
X = 47
A B C D
47
LFIB on B
=
X Network X
25 47 C E
• 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.
Packet Propagation Across
an MPLS Network
LFIB on B in the LFIB, label is switched.
Ingress LSR 25 47 C Egress LSR
IP: X Lab: 25 Lab: 47 IP: X

A B C
FIB on A LFIB on C
Network Next hop Label Label Action Next hop
X B 25 47 pop D
E
IP lookup is performed in
the FIB, packet is labeled.

in the LFIB, label is removed.

Per-Platform Label Allocation
LFIB on B
25 75 D
X = 25
A B D
= 25 Network X
X
C
• An LFIB on a router usually does not contain
an incoming interface.
• The same label can be used on any interface—
per-platform label allocation.
• LSR announces a label to adjacent LSR only
once even if there are parallel links between
them.
Benefits and Drawbacks of
Per-Platform Label Allocation
Label for X is announced LFIB on B
only to A. Label Action Next hop
25 75 D
X = 25
AA BB DD
Lab: 47
b : 25 Network
N e tw o rk X
X
La
A third-party router can still send
packets toward network X, even though
the label was not announced to it.
Benefits: Drawbacks:
• Smaller LFIB • Insecure—any
• Quicker label neighbor LSR can send
packets with any label
exchange in the LFIB
Summary of Packet-Mode
MPLS Label Allocation and
Distribution
Packet-mode MPLS label allocation and
distribution follows these rules:
• Every LSR assigns a label for every destination
in the IP routing table.
• Labels are assigned once per LSR (per-
platform).
• Every LSR advertises its label assignments to
all neighbors.
• Every LSR stores all advertised labels in the
LIB.
• Labels received from next-hop LSRs are used to
populate label information in the FIB and the
outgoing label in the LFIB.
Review Questions
• Where are received labels stored?

• Which forwarding table is used to
forward a labeled packet?
• Which forwarding table is used to
forward an unlabeled packet?
• What happens if the next-hop label is
not in the LFIB table?
• How many labels are usually assigned
to one destination network?

Convergence in
Packet-mode MPLS

Objectives
Upon completion of this section, you

will be able to perform the following
tasks:
• Identify TDP/LDP convergence issues.
• Describe the interaction between
routing protocol convergence and LDP
convergence.
• Describe the packet-mode MPLS
convergence after link failure and link
recovery.
Steady State Description
Routing table of B FIB on B

Network Next-hop Network Next hop Label
X C X C 47
A B C D
LIB on B
Network LSR label Network X
X local 25
C 47
E
E 75
LFIB on B
25 47 C
• After the LSRs have exchanged the labels,
LIB, LFIB and FIB data structures are
completely populated.
Link Failure Actions

X C X C 47
A B ✖ C D
LIB on B
X local 25
C 47
E
E 75 • Routing protocol
LFIB on B neighbors and LDP
Label Action Next hop neighbors are lost after
25 47 C
a link failure.
• Entries are removed
from various data
structures. MPLS v1.0—3-31
Routing Protocol
Convergence

X E X E —
A B ✖ C D
LIB on B
X local 25
C 47
E
E 75 Routing protocols rebuild
LFIB on B the IP routing table and
Label Action Next hop the IP forwarding table.
25 47 C

MPLS Convergence

X E X E 75
A B ✖ C D
LIB on B
X local 25
C 47
E
E 75 The LFIB and labeling
LFIB on B information in the FIB are
Label Action Next hop rebuilt immediately after
25 75 E the routing protocol
convergence, based on
labels stored in the LIB.
MPLS Convergence
After a Link Failure
• MPLS convergence in packet-mode

MPLS does not affect the overall
convergence time.
• MPLS convergence occurs
immediately after the routing
protocol convergence, based on
labels already stored in the LIB.

Link Recovery Actions

X E X E 75
A B C D
LIB on B
X local 25
C 47
E
E 75 • Routing protocol
LFIB on B neighbors are
Label Action Next hop discovered after link
25 75 E recovery.

IP Routing Convergence After
Link Recovery

X C
E X C
E —
75
A B C D
LIB on B
X local 25
C 47
E
E 75 • IP routing protocols
LFIB on B rebuild the IP routing
Label Action Next hop table.
25 pop
75 C
E • The FIB and the LFIB are
also rebuilt, but the label
information might be
lacking. MPLS v1.0—3-36
MPLS Convergence
After a Link Recovery
• Routing protocol convergence optimizes

the forwarding path after a link recovery.
• The LIB might not contain the label from
the new next hop by the time the IP
convergence is complete.
• End-to-end MPLS connectivity might be
intermittently broken after link recovery.
• Use MPLS traffic engineering for make-
before-break recovery.

Summary

following tasks:
• Identify TDP/LDP convergence issues.
• Describe the interaction between
routing protocol convergence and LDP
convergence.
• Describe the packet-mode MPLS
convergence after link failure and link
recovery.
Review Questions
• What is the impact of LDP/TDP

convergence time on overall
convergence when a link is lost?
• What is the impact of LDP/TDP
convergence time on overall
convergence when a link is restored?

Typical Label Distribution
over LC-ATM Interfaces and
VC-Merge

Objectives

tasks:
• Describe ATM-related issues that dictate
additional needs for label-distribution
procedures over
LC-ATM interfaces.
• Describe TDP/LDP label distribution in cell-
mode MPLS environments.
• Identify the need for per-edge-LSR VC
allocation over ATM network.
• Describe the functions, benefits and
Issues of Cell-Mode MPLS
Environments
• An MPLS label is encoded as the virtual

path identifier/virtual channel identifier
(VPI/VCI) value in cell-mode MPLS
environments.
• Each VPI/VCI combination represents a
virtual circuit in ATM.
• The number of virtual circuits supported
by router and switch hardware is
severely limited.
• Conclusion: labels in cell-mode MPLS
are a scarce resource.
Building the IP Routing Table
Routing table of A Routing table of C Routing table of D Routing table of E

Network Next-hop Network Next-hop Network Next-hop Network Next-hop
X C X D X E X conn
A
C D
E
B Routing table of B Network X

Network Next-hop
X C
• IP routing protocols are used to build IP

routing tables on all LSRs.
• The routing tables are built as if the ATM
switches were regular routers.
Building the IP Forwarding
Table
X C X D X E X conn
A
C D
E
B Routing table of B Network X

Network Next-hop
X C
• Unlabeled IP packets cannot be propagated

across LC-ATM interfaces.
• Forwarding tables are not built until the labels
are assigned to destinations in IP routing
tables.
Requesting a Label

X C X D X E X conn
RQ X RQ X RQ X
A
C D
E
An ATM switch can allocate an
incoming label only if it already A switch requests a
has a corresponding outgoing label from itsNetwork X
next hop.
label.
• Labels have to be explicitly requested over LC-
ATM interfaces.
• A router requests a label for every destination
in the routing table with the next hop
reachable over an LC-ATM interface.
Allocating a Label

X C X D X E X conn
RQ X RQ X RQ X
A
X=1/56 C X=2/82 D X=1/37
E
LFIB on C LIB on D
Label Action Next hop Network LSR label LIB on E
Network X
1/56 2/82 D X E 1/37 Network LSR label
local 2/82 X local 1/37
The LFIB is actually LFIB on D LFIB on E
the ATM switching Label Action Next hop Label Action Next hop
matrix. 2/82 1/37 — 1/37 pop —
An ATM LSR can allocate an incoming The egress ATM edge

label after receiving an outgoing label. It LSR allocates a label
replies with the allocated label to the and replies to the
incoming request.
© 2001, Cisco Systems, Inc. request. MPLS v1.0—3-46
Processing Label
Allocation Reply
Routing table of A
Network Next-hop
X C
RQ X
A
X=1/56 C D
E
LIB on A
X C 1/56
FIB on A
Network Next hop Label
X C 1/56
The ingress ATM edge LSR requesting a label

inserts the received label in its LIB, FIB, and
(optionally) LFIB.
Allocation Requests from
Additional Upstream LSRs
X C X D X E X conn
A
X=1/43 C D
E
RQ X
LIB on C LFIB on C
B
Network LSR label Label Action Next hop
Routing table of B X D 2/82 1/56 2/82 D
Network Next-hop local 1/56 1/43 2/82 D
X C local 1/43
The ATM LSR could reuse an

Every upstream LSR will
already allocated downstream
request a label for downstream
label for the second upstream
destinations from an ATM LSR.
label.
Cell Interleave Issue
FIB on A LFIB on C
Network Next hop Label Label Action Next hop
X C 1/56 1/56 2/82 D
1/43 2/82 D
A 1/56
1/56 C 2/82 2/82 D
E
1/43 If an ATM LSR reuses a
1/43
B downstream label, cells from
FIB on B several upstream LSRs might
Network Next hop Label become interleaved.
X C 1/43
• Solution #1—allocate a separate downstream label for every

upstream request.
• Solution #2—prevent cell interleave by blocking incoming cells
until a whole frame is collected.
Additional Label Allocation

X C X D X E X conn
RQ X (2) RQ X (2)
A
X=1/43 C X=2/87 D X=1/38
E
RQ X
LIB on E LFIB on E
B
Network LSR label Label Action Next hop
Routing table of B X local 1/37 1/37 pop —
Network Next-hop local 1/38 1/38 pop —
X C
The ATM egress router has to

The ATM LSR requests a new
allocate a unique label for every
label from downstream LSRs
ATM ingress router for every
for every upstream request.
destination.
Virtual Circuit Merge
AA 1/56
1/56 C 2/82 2/82 2/82 2/82 D
1/43 LFIB on C
1/43 Label Action Next hop
B
1/56 2/82 D
1/43 2/82 D
• VC merge is a solution in which incoming cells

are blocked until the last cell in a frame
arrives.
• All buffered cells are then forwarded to the
next-hop ATM LSR.

Benefits and Drawbacks
of VC Merge
Benefits of VC merge
• The Merging ATM LSR can reuse the
same downstream label for multiple
upstream LSRs.
Drawbacks of VC merge
• Buffering requirements increase on
the ATM LSR.
• Jitter and delay across the ATM
network increase.
• The ATM network is effectively
transformed into a frame-based
network.
Per-Interface Label
Allocation
The ATM edge
LFIB on C
LSR has to
request a label Incoming I/F VPI/VCI Outgoing I/F VPI/VCI
X=1/73
over every ATM 0/0 1/73 ATM 1/3 1/39
interface. RQ X
A C
E
RQ X
X=1/69 Network X
• The LFIB on an ATM switch (ATM switching

matrix) always contains the incoming interface.
• Labels have to be assigned for individual
interfaces—per-interface label allocation.
• The same label can be reused (with a different
meaning) on different interfaces.
Security of Per-Interface
Label Allocation
LFIB on C
Incoming I/F VPI/VCI Outgoing I/F VPI/VCI
ATM 0/0 1/73 ATM 1/3 1/39
The packet or cell arriving

1/73
through the proper
1/39
interface is forwarded.
AA C
C EE
3
1/7 NNetwork
e t w o r k XX
A labeled packet or cell coming through
a wrong interface is dropped.
Per-interface label allocation is secure—labeled

packets (or ATM cells) are accepted only from
the interface where the label was actually
assigned.
Summary

following tasks:
• Describe ATM-related issues that
dictate additional needs for label-
distribution procedures over LC-ATM
interfaces.
• Describe TDP/LDP label distribution in
cell-mode MPLS environments.
• Identify the need for per-edge-LSR VC
allocation over ATM network.
• Describe the functions, benefits and
Review Questions
• What is ATM switching matrix called in

MPLS terminology?
• Why is it necessary to have the next-
hop label before propagating the local
label?
• What are the benefits of VC-Merge?
• What are the drawbacks of VC-Merge?

MPLS Label Allocation,
Distribution and Retention
Modes

Objectives

tasks:
• Describe the difference between per-
interface and per-platform label space.
• Describe TDP/LDP unsolicited downstream
and downstream-on-demand label
distribution.
• Describe the difference between ordered
and independent label allocation control.
• Describe the difference between
conservative and liberal retention mode.
• Identify parameter sets used in Cisco IOS
Label Distribution
Parameters
MPLS architecture defines several

label allocation and distribution
parameters:
• Per-interface or per-platform label
space
• Unsolicited downstream and
downstream-on-demand label
distribution
• Ordered or independent LSP tunnel
control
Label Space: Per Interface
LFIB on C
Incoming I/F VPI/VCI Outgoing I/F VPI/VCI
ATM 0/0 1/73 ATM 1/3 1/39
AA C
C EE
NNetwork
e t w o r k XX
• The LFIB on an LSR contains incoming an

interface.
• Labels have to be assigned for individual
interfaces.
• The same label can be reused (with a different
meaning) on different interfaces.
• Label allocation is secure—LSRs cannot send
Label Space: Per Platform
LFIB on B
25 75 D
X = 25
A B D
= 25 Network X
X
C
• The LFIB on an LSR does not contain an incoming
interface.
• The same label can be used on any interface and is
announced to all adjacent LSRs.
• The label is announced to adjacent LSRs only once
and can be used on any link.
• Per-platforms label space is less secure than per-
interface label space.
Label Distribution:
Unsolicited Downstream
LIB on B
Network LSR label
X local 25
X = 25 X = 25
A B C D
X
= Network X
25
E
The Label for a prefix is allocated and

advertised to all neighbor LSRs, regardless of
whether the neighbors are upstream or
downstream LSRs for the destination.
Label Distribution:
Downstream-on-Demand
X C X D X E X conn
RQ X
A
C D
E
Network X
• An LSR will assign a label to a prefix only

when asked for a label by an upstream LSR.
• Label distribution is a hop-by-hop parameter—
different label distribution mechanisms can
coexist in an MPLS network.
LSP Control: Independent
Control
X C X D X E X conn
RQ X
A
C D X=1/37
E
LFIB on E
Label Network
Action NextX hop
1/37 pop —
• An LSR can always assign a label for a prefix,

even if it has no downstream label.
• Independent control can be used only for
LSRs with Layer 3 capabilities.
LSP Control: Ordered Control

X C X D X E X conn
RQ X RQ X RQ X
A
X=1/56 C X=2/82 D X=1/37
E
LFIB on C LFIB on D LFIB on E

Label Action Next hop Label Action Next hop Label Network
Action NextX hop
1/56 2/82 D 2/82 1/37 — 1/37 pop —
An LSR can assign a label only if it has already

received a label from the next-hop LSR;
otherwise it must request a label from the next-
hop LSR.
Label Retention: Liberal
Retention Mode
LIB on A LIB on C
X B 25 X B 25
X = 25 X = 25
A B C D
X
=
25
Network X
E LIB on E
Network LSR label
X B 25
• Every LSR stores the received label in its LIB,

even when the label is not received from a
next-hop LSR.
• Liberal label retention mode improves
Label Retention:
Conservative Retention Mode
LIB on A LIB on C
X B 25 X B 25
X = 25 X = 25
A B C D
X
=
25
Network X
E
• An LSR stores only the labels received from

next-hop LSRs; all other labels are ignored.
• Downstream-on-demand distribution is
required during the convergence phase.
Standard Parameter Sets in
Cisco IOS Platform MPLS
Implementation
Routers with packet interfaces:
• Per-platform label space, unsolicited
distribution, liberal label retention,
independent control
Routers with ATM interfaces:
• Per-interface label space, on-demand
distribution, conservative or liberal
label retention, independent control
ATM switches:
• Per-interface label space, on-demand
distribution, conservative label
retention, ordered control
Summary

should be able to perform the following
tasks:
• Describe the difference between per-
interface and per-platform label space.
• Describe TDP/LDP unsolicited downstream
and downstream-on-demand label
distribution.
• Describe the difference between ordered
and independent label allocation control.
• Describe the difference between
conservative and liberal retention mode.
• Identify parameter sets used in Cisco IOS
Review Questions
• Why and where is downstream-on-

demand label propagation used?
• What are the benefits and drawbacks
of liberal retention mode?
• What are the benefits and drawbacks
of per-platform label space?
• Why is per-interface label space on
ATM LSRs needed?

LDP Neighbor
Discovery

Objectives

following tasks:
• Describe LDP/TDP neighbor discovery.
• Describe LDP/TDP session
establishment process.

LDP Session Establishment
•LDP and TDP use a similar process to establish
a session:
• Hello messages are periodically sent on all
interfaces enabled for MPLS.
• If there is another router on that interface, it
will respond by trying to establish a session
with the source of the hello messages.
•User Datagram Protocol (UDP) is used for hello
messages. It is targeted at “all routers on this
subnet” multicast address (224.0.0.2).
•Transmission Control Protocol (TCP) is used to
establish the session.
•Both TCP and UDP use well-known LDP port
number 646 (711 for TDP).
LDP Hello Message
IP Header UDP Header LDP Hello Message

Source address=1.0.0.1 Source port=1050
Transport address=1.0.0.1 LDP ID=1.0.0.1:0
Destination address=224.0.0.2Destination port=646
Well-know multicast Optional TLV 6-byte TLV

IP address Well-know port used to identify identifying the
identifying all number used for the source IP router and
routers on the LDP. address for LDP label space.
subnet. session.
• Hello messages are targeted at all routers reachable

through an interface.
• LDP uses well-known UDP and TCP port number 646.
• The source address used for an LDP session can be set
by adding the transport address TLV to the hello
message.
• A 6-byte LDP identifier TLV identifies the router (first
four bytes) and label space (last two bytes).
Label Space
• LSRs establish one LDP session per

label space.
• Per-platform label space requires only
one LDP session, even if there are
multiple parallel links between a pair of
LSRs.
• Per-platform label space is announced
by setting the label space ID to zero
(for example, LDP ID=1.0.0.1:0).
• A combination of frame-mode and cell-
mode, or multiple cell-mode links,
results in multiple LDP sessions.
Label Space Negotiation
Example
1.0.0.1:0 1.0.0.1:0
1.0.0.1:0 1.0.0.1:0
1.0.0.1:10 1.0.0.1:10
ATM
ATM
ATM 1.0.0.1:0
1.0.0.1:20
• One LDP session is established for each announced LDP

identifier (router ID + label space).
• The number of LDP sessions is determined by the
number of different label spaces.
• The bottom right example is not common, since ATM
LSRs do not use Ethernet for packet forwarding, and
frame-mode MPLS across ATM uses per-platform label
space.
LDP Neighbor Discovery
UDP: Hello
UDP: Hello
UDP:
(1.0.0.2:1064 Hello
224.0.0.2:646)
(1.0.0.2:1065
(1.0.0.2:1066 224.0.0.2:646)
224.0.0.2:646) MPLS_B
TCP (1.0.0.4:1066  1.0.0.2:646)

1.0.0.2
.0.1:6 46)
.0 .2 :1 0 43  1.0
TCP (1.0
UDP: Hello
UDP: Hello
UDP:
(1.0.0.1:1050  Hello
224.0.0.2:646) NO_MPLS_C
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 1.0.0.3
TCP (1
.0.0.4:
1 065 
1.0.0.1
:6 46)
UDP: Hello
UDP: Hello
UDP:
(1.0.0.4:1033 Hello
224.0.0.2:646)
(1.0.0.4:1034
(1.0.0.4:1035 224.0.0.2:646)
224.0.0.2:646) MPLS_D
1.0.0.4
• An LDP session is established from the router
with the higher IP address.
LDP Session Negotiation
MPLS_A MPLS_B
Establish TCP session
1.0.0.1 1.0.0.2
Initialization message
Initialization message
Keepalive
Keepalive
• Peers first exchange initialization

messages.
• The session is ready to exchange label
mappings after receiving the first
keepalive.
LDP Sessions
Between ATM LSRs
OSPF OSPF
LDP LDP
OSPF 0/32 0/32 OSPF
0/32
LDP LDP
VSI VSI
LFIB LFIB
LFIB LFIB
• An IP adjacency between ATM LSRs is

established through the control virtual circuit
(0/32).
• The control virtual circuit is used for LDP or TDP
as well as for IP routing protocols.
• Virtual Switch Interface (VSI) protocol is used to
populate the ATM switching matrix (LFIB) in the
data plane of some ATM switches (Cisco-specific
implementation).
LDP or TDP Discovery
of Nonadjacent Neighbors
• LDP or TDP neighbor discovery of

nonadjacent neighbors differs from normal
discovery only in the addressing of hello
packets.
• Hello packets use unicast IP addresses
instead of multicast addresses.
• Once a neighbor is discovered, the
mechanism to establish a session is the
same.

Summary

following tasks:
• Describe LDP/TDP neighbor discovery.
• Describe the LDP/TDP session
establishment process.

Review Questions
• How do routers find LDP/TDP peers

reachable through an interface?
• Which protocol is used to discover
neighboring LSRs?
• Which protocol is used for the session
itself?
• How do ATM LSRs establish an LDP/TDP
session?
• What is different in an LDP session
establishment between non-adjacent peers?
Penultimate Hop
Popping

Objectives

tasks:
• Describe penultimate hop popping.
• Describe how LSRs request PHP through
TDP/LDP.
• Identify when the PHP could be used in
MPLS network.
• Describe the benefits and drawbacks of
PHP.
Double Lookup Scenario
MPLS Domain
10.0.0.0/8 10.0.0.0/8 10.0.0.0/8 10.0.0.0/8
L=17 L=18 L=19
17 10.1.1.1 18 10.1.1.1 19 10.1.1.1 10.1.1.1
FIB FIB FIB FIB

10/8  NH, 17 10/8  NH, 18 10/8  NH, 19 10/8  NH 
LFIB LFIB LFIB LFIB
35  17  17  18  18  19  19  untagged 
Double lookup is
needed:
• Double lookup is not an 1. LFIB: remove the
label.
optimal way of forwarding 2. FIB: forward the IP
packet based on IP
labeled packets. next-hop address.
• A label can be removed one

hop earlier.
Penultimate Hop Popping
Pop or implicit
null label is
MPLS Domain advertised.
10.0.0.0/8 10.0.0.0/8 10.0.0.0/8 10.0.0.0/8

L=17 L=18 L=pop
17 10.1.1.1 18 10.1.1.1 10.1.1.1 10.1.1.1
FIB FIB FIB FIB

10/8  NH, 17 10/8  NH, 18 10/8  NH, 19 10/8  NH 
LFIB LFIB LFIB LFIB
35  17  17  18  18  pop
One single lookup.
• A label is removed on the router

before the last hop within an MPLS
domain.
Penultimate Hop Popping
• Penultimate hop popping optimizes

MPLS performance (one less LFIB
lookup).
• PHP does not work on ATM
(VPI/VCI cannot be removed).
• The pop or implicit null label uses
value 3 when being advertised to a
neighbor.

Objectives

following tasks:
• Describe penultimate hop popping.
• Describe how LSRs request PHP
through TDP/LDP.
• Identify when the PHP could be used in
MPLS network.
• Describe the benefits and drawbacks of
PHP.
Review Questions
• What is the main benefit of

penultimate hop popping?
• How does a router know that it has to
pop the label?

Summary
After completing this chapter, you should be

able to perform the following tasks:
• Describe the need for LDP/TDP in MPLS network.
• Describe the LDP/TDP neighbor discovery and
session establishment procedures.
• Explain the needs for different LDP/TDP label
distribution modes.
• Explain the difference between independent and
ordered control.
• Describe LDP/TDP retention modes
(conservative and liberal).
• Explain the functions and benefits of penultimate-
hop-popping.
© 2000, Cisco Systems, Inc. www.cisco.co
Blank for Pagination

MPLS10S03-Label Assignment and Distribution

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MPLS10S03-Label Assignment and Distribution

Uploaded by

Copyright:

Available Formats

Module 3

© 2001, Cisco Systems, Inc.

© 2001, Cisco Systems, Inc. MPLS v1.0—3-3

Upon completion of this section,

© 2001, Cisco Systems, Inc. MPLS v1.0—3-4

• MPLS introduces a new field that is used for

Exchange of Control Plane

© 2001, Cisco Systems, Inc. MPLS v1.0—3-6

RT: 10.0.0.0/8  1.2.3.4

L=5 10.1.1.1 LFIB:

© 2001, Cisco Systems, Inc. MPLS v1.0—3-7

RT: 10.0.0.0/8  1.2.3.4

L=5 10.1.1.1 LFIB: L=5  L=3 L=3 10.1.1.1

© 2001, Cisco Systems, Inc. MPLS v1.0—3-8

After completing this section, you

© 2001, Cisco Systems, Inc. MPLS v1.0—3-9

• Why is the LDP/TDP needed?

© 2001, Cisco Systems, Inc. MPLS v1.0—3-10

© 2001, Cisco Systems, Inc. MPLS v1.0—3-11

Upon completion of this section,

Label allocation and distribution in a

Routing table of A Routing table of B Routing table of C

• IP routing protocols are used to build IP

• Every LSR allocates a label for every

LFIB on B Outgoing action is pop, as B

LIB and LFIB structures have to be initialized on

The allocated label is advertised to all neighbor

• Every LSR stores the received label in its LIB.

Label lookup is performed

IP: X Lab: 25 IP: X

Forwarded IP packets are labeled only on the

Every LSR will eventually assign a label for

• Router B has already assigned a label to X and

IP: X Lab: 25 Lab: 47 IP: X

Label lookup is performed

© 2001, Cisco Systems, Inc. MPLS v1.0—3-23

• Where are received labels stored?

© 2001, Cisco Systems, Inc. MPLS v1.0—3-27

© 2001, Cisco Systems, Inc. MPLS v1.0—3-28

Upon completion of this section, you

Routing table of B FIB on B

Routing table of B FIB on B

Routing table of B FIB on B

© 2001, Cisco Systems, Inc. MPLS v1.0—3-32

Routing table of B FIB on B

• MPLS convergence in packet-mode

© 2001, Cisco Systems, Inc. MPLS v1.0—3-34

Routing table of B FIB on B

© 2001, Cisco Systems, Inc. MPLS v1.0—3-35

Routing table of B FIB on B

• Routing protocol convergence optimizes

© 2001, Cisco Systems, Inc. MPLS v1.0—3-37

After completing this section, you

• What is the impact of LDP/TDP

© 2001, Cisco Systems, Inc. MPLS v1.0—3-39

© 2001, Cisco Systems, Inc. MPLS v1.0—3-40

Upon completion of this section, you

• An MPLS label is encoded as the virtual

Routing table of A Routing table of C Routing table of D Routing table of E

B Routing table of B Network X

• IP routing protocols are used to build IP

B Routing table of B Network X

• Unlabeled IP packets cannot be propagated