3. MPLS Basics
In this section, we introduce some of the basic concepts of MPLS and
describe the general approach to be used.
A label is a short, fixed length, locally significant identifier
which is used to identify a FEC. The label which is put on a
particular packet represents the Forwarding Equivalence Class to
which that packet is assigned.
Most commonly, a packet is assigned to a FEC based (completely or
partially) on its network layer destination address. However, the
label is never an encoding of that address.
If Ru and Rd are LSRs, they may agree that when Ru transmits a packet
to Rd, Ru will label with packet with label value L if and only if
the packet is a member of a particular FEC F. That is, they can
agree to a "binding" between label L and FEC F for packets moving
from Ru to Rd. As a result of such an agreement, L becomes Ru's
"outgoing label" representing FEC F, and L becomes Rd's "incoming
label" representing FEC F.
Note that L does not necessarily represent FEC F for any packets
other than those which are being sent from Ru to Rd. L is an
arbitrary value whose binding to F is local to Ru and Rd.
When we speak above of packets "being sent" from Ru to Rd, we do not
imply either that the packet originated at Ru or that its destination
is Rd. Rather, we mean to include packets which are "transit
packets" at one or both of the LSRs.
Sometimes it may be difficult or even impossible for Rd to tell, of
an arriving packet carrying label L, that the label L was placed in
the packet by Ru, rather than by some other LSR. (This will
typically be the case when Ru and Rd are not direct neighbors.) In
such cases, Rd must make sure that the binding from label to FEC is
one-to-one. That is, Rd MUST NOT agree with Ru1 to bind L to FEC F1,
while also agreeing with some other LSR Ru2 to bind L to a different
FEC F2, UNLESS Rd can always tell, when it receives a packet with
incoming label L, whether the label was put on the packet by Ru1 or
whether it was put on by Ru2.
It is the responsibility of each LSR to ensure that it can uniquely
interpret its incoming labels.
3.2. Upstream and Downstream LSRs
Suppose Ru and Rd have agreed to bind label L to FEC F, for packets
sent from Ru to Rd. Then with respect to this binding, Ru is the
"upstream LSR", and Rd is the "downstream LSR".
To say that one node is upstream and one is downstream with respect
to a given binding means only that a particular label represents a
particular FEC in packets travelling from the upstream node to the
downstream node. This is NOT meant to imply that packets in that FEC
would actually be routed from the upstream node to the downstream
3.3. Labeled Packet
A "labeled packet" is a packet into which a label has been encoded.
In some cases, the label resides in an encapsulation header which
exists specifically for this purpose. In other cases, the label may
reside in an existing data link or network layer header, as long as
there is a field which is available for that purpose. The particular
encoding technique to be used must be agreed to by both the entity
which encodes the label and the entity which decodes the label.
3.4. Label Assignment and Distribution
In the MPLS architecture, the decision to bind a particular label L
to a particular FEC F is made by the LSR which is DOWNSTREAM with
respect to that binding. The downstream LSR then informs the
upstream LSR of the binding. Thus labels are "downstream-assigned",
and label bindings are distributed in the "downstream to upstream"
If an LSR has been designed so that it can only look up labels that
fall into a certain numeric range, then it merely needs to ensure
that it only binds labels that are in that range.
3.5. Attributes of a Label Binding
A particular binding of label L to FEC F, distributed by Rd to Ru,
may have associated "attributes". If Ru, acting as a downstream LSR,
also distributes a binding of a label to FEC F, then under certain
conditions, it may be required to also distribute the corresponding
attribute that it received from Rd.
3.6. Label Distribution Protocols
A label distribution protocol is a set of procedures by which one LSR
informs another of the label/FEC bindings it has made. Two LSRs
which use a label distribution protocol to exchange label/FEC binding
information are known as "label distribution peers" with respect to
the binding information they exchange. If two LSRs are label
distribution peers, we will speak of there being a "label
distribution adjacency" between them.
(N.B.: two LSRs may be label distribution peers with respect to some
set of bindings, but not with respect to some other set of bindings.)
The label distribution protocol also encompasses any negotiations in
which two label distribution peers need to engage in order to learn
of each other's MPLS capabilities.
THE ARCHITECTURE DOES NOT ASSUME THAT THERE IS ONLY A SINGLE LABEL
DISTRIBUTION PROTOCOL. In fact, a number of different label
distribution protocols are being standardized. Existing protocols
have been extended so that label distribution can be piggybacked on
them (see, e.g., [MPLS-BGP], [MPLS-RSVP-TUNNELS]). New protocols
have also been defined for the explicit purpose of distributing
labels (see, e.g., [MPLS-LDP], [MPLS-CR-LDP].
In this document, we try to use the acronym "LDP" to refer
specifically to the protocol defined in [MPLS-LDP]; when speaking of
label distribution protocols in general, we try to avoid the acronym.
3.7. Unsolicited Downstream vs. Downstream-on-Demand
The MPLS architecture allows an LSR to explicitly request, from its
next hop for a particular FEC, a label binding for that FEC. This is
known as "downstream-on-demand" label distribution.
The MPLS architecture also allows an LSR to distribute bindings to
LSRs that have not explicitly requested them. This is known as
"unsolicited downstream" label distribution.
It is expected that some MPLS implementations will provide only
downstream-on-demand label distribution, and some will provide only
unsolicited downstream label distribution, and some will provide
both. Which is provided may depend on the characteristics of the
interfaces which are supported by a particular implementation.
However, both of these label distribution techniques may be used in
the same network at the same time. On any given label distribution
adjacency, the upstream LSR and the downstream LSR must agree on
which technique is to be used.
3.8. Label Retention Mode
An LSR Ru may receive (or have received) a label binding for a
particular FEC from an LSR Rd, even though Rd is not Ru's next hop
(or is no longer Ru's next hop) for that FEC.
Ru then has the choice of whether to keep track of such bindings, or
whether to discard such bindings. If Ru keeps track of such
bindings, then it may immediately begin using the binding again if Rd
eventually becomes its next hop for the FEC in question. If Ru
discards such bindings, then if Rd later becomes the next hop, the
binding will have to be reacquired.
If an LSR supports "Liberal Label Retention Mode", it maintains the
bindings between a label and a FEC which are received from LSRs which
are not its next hop for that FEC. If an LSR supports "Conservative
Label Retention Mode", it discards such bindings.
Liberal label retention mode allows for quicker adaptation to routing
changes, but conservative label retention mode though requires an LSR
to maintain many fewer labels.
3.9. The Label Stack
So far, we have spoken as if a labeled packet carries only a single
label. As we shall see, it is useful to have a more general model in
which a labeled packet carries a number of labels, organized as a
last-in, first-out stack. We refer to this as a "label stack".
Although, as we shall see, MPLS supports a hierarchy, the processing
of a labeled packet is completely independent of the level of
hierarchy. The processing is always based on the top label, without
regard for the possibility that some number of other labels may have
been "above it" in the past, or that some number of other labels may
be below it at present.
An unlabeled packet can be thought of as a packet whose label stack
is empty (i.e., whose label stack has depth 0).
If a packet's label stack is of depth m, we refer to the label at the
bottom of the stack as the level 1 label, to the label above it (if
such exists) as the level 2 label, and to the label at the top of the
stack as the level m label.
The utility of the label stack will become clear when we introduce
the notion of LSP Tunnel and the MPLS Hierarchy (section 3.27).
3.10. The Next Hop Label Forwarding Entry (NHLFE)
The "Next Hop Label Forwarding Entry" (NHLFE) is used when forwarding
a labeled packet. It contains the following information:
1. the packet's next hop
2. the operation to perform on the packet's label stack; this is one
of the following operations:
a) replace the label at the top of the label stack with a
specified new label
b) pop the label stack
c) replace the label at the top of the label stack with a
specified new label, and then push one or more specified new
labels onto the label stack.
It may also contain:
d) the data link encapsulation to use when transmitting the packet
e) the way to encode the label stack when transmitting the packet
f) any other information needed in order to properly dispose of
Note that at a given LSR, the packet's "next hop" might be that LSR
itself. In this case, the LSR would need to pop the top level label,
and then "forward" the resulting packet to itself. It would then
make another forwarding decision, based on what remains after the
label stacked is popped. This may still be a labeled packet, or it
may be the native IP packet.
This implies that in some cases the LSR may need to operate on the IP
header in order to forward the packet.
If the packet's "next hop" is the current LSR, then the label stack
operation MUST be to "pop the stack".
3.11. Incoming Label Map (ILM)
The "Incoming Label Map" (ILM) maps each incoming label to a set of
NHLFEs. It is used when forwarding packets that arrive as labeled
If the ILM maps a particular label to a set of NHLFEs that contains
more than one element, exactly one element of the set must be chosen
before the packet is forwarded. The procedures for choosing an
element from the set are beyond the scope of this document. Having
the ILM map a label to a set containing more than one NHLFE may be
useful if, e.g., it is desired to do load balancing over multiple
3.12. FEC-to-NHLFE Map (FTN)
The "FEC-to-NHLFE" (FTN) maps each FEC to a set of NHLFEs. It is
used when forwarding packets that arrive unlabeled, but which are to
be labeled before being forwarded.
If the FTN maps a particular label to a set of NHLFEs that contains
more than one element, exactly one element of the set must be chosen
before the packet is forwarded. The procedures for choosing an
element from the set are beyond the scope of this document. Having
the FTN map a label to a set containing more than one NHLFE may be
useful if, e.g., it is desired to do load balancing over multiple
3.13. Label Swapping
Label swapping is the use of the following procedures to forward a
In order to forward a labeled packet, a LSR examines the label at the
top of the label stack. It uses the ILM to map this label to an
NHLFE. Using the information in the NHLFE, it determines where to
forward the packet, and performs an operation on the packet's label
stack. It then encodes the new label stack into the packet, and
forwards the result.
In order to forward an unlabeled packet, a LSR analyzes the network
layer header, to determine the packet's FEC. It then uses the FTN to
map this to an NHLFE. Using the information in the NHLFE, it
determines where to forward the packet, and performs an operation on
the packet's label stack. (Popping the label stack would, of course,
be illegal in this case.) It then encodes the new label stack into
the packet, and forwards the result.
IT IS IMPORTANT TO NOTE THAT WHEN LABEL SWAPPING IS IN USE, THE NEXT
HOP IS ALWAYS TAKEN FROM THE NHLFE; THIS MAY IN SOME CASES BE
DIFFERENT FROM WHAT THE NEXT HOP WOULD BE IF MPLS WERE NOT IN USE.
3.14. Scope and Uniqueness of Labels
A given LSR Rd may bind label L1 to FEC F, and distribute that
binding to label distribution peer Ru1. Rd may also bind label L2 to
FEC F, and distribute that binding to label distribution peer Ru2.
Whether or not L1 == L2 is not determined by the architecture; this
is a local matter.
A given LSR Rd may bind label L to FEC F1, and distribute that
binding to label distribution peer Ru1. Rd may also bind label L to
FEC F2, and distribute that binding to label distribution peer Ru2.
IF (AND ONLY IF) RD CAN TELL, WHEN IT RECEIVES A PACKET WHOSE TOP
LABEL IS L, WHETHER THE LABEL WAS PUT THERE BY RU1 OR BY RU2, THEN
THE ARCHITECTURE DOES NOT REQUIRE THAT F1 == F2. In such cases, we
may say that Rd is using a different "label space" for the labels it
distributes to Ru1 than for the labels it distributes to Ru2.
In general, Rd can only tell whether it was Ru1 or Ru2 that put the
particular label value L at the top of the label stack if the
following conditions hold:
- Ru1 and Ru2 are the only label distribution peers to which Rd
distributed a binding of label value L, and
- Ru1 and Ru2 are each directly connected to Rd via a point-to-
When these conditions hold, an LSR may use labels that have "per
interface" scope, i.e., which are only unique per interface. We may
say that the LSR is using a "per-interface label space". When these
conditions do not hold, the labels must be unique over the LSR which
has assigned them, and we may say that the LSR is using a "per-
platform label space."
If a particular LSR Rd is attached to a particular LSR Ru over two
point-to-point interfaces, then Rd may distribute to Ru a binding of
label L to FEC F1, as well as a binding of label L to FEC F2, F1 !=
F2, if and only if each binding is valid only for packets which Ru
sends to Rd over a particular one of the interfaces. In all other
cases, Rd MUST NOT distribute to Ru bindings of the same label value
to two different FECs.
This prohibition holds even if the bindings are regarded as being at
different "levels of hierarchy". In MPLS, there is no notion of
having a different label space for different levels of the hierarchy;
when interpreting a label, the level of the label is irrelevant.
The question arises as to whether it is possible for an LSR to use
multiple per-platform label spaces, or to use multiple per-interface
label spaces for the same interface. This is not prohibited by the
architecture. However, in such cases the LSR must have some means,
not specified by the architecture, of determining, for a particular
incoming label, which label space that label belongs to. For
example, [MPLS-SHIM] specifies that a different label space is used
for unicast packets than for multicast packets, and uses a data link
layer codepoint to distinguish the two label spaces.
3.15. Label Switched Path (LSP), LSP Ingress, LSP Egress
A "Label Switched Path (LSP) of level m" for a particular packet P is
a sequence of routers,
<R1, ..., Rn>
with the following properties:
1. R1, the "LSP Ingress", is an LSR which pushes a label onto P's
label stack, resulting in a label stack of depth m;
2. For all i, 1<i<n, P has a label stack of depth m when received
by LSR Ri;
3. At no time during P's transit from R1 to R[n-1] does its label
stack ever have a depth of less than m;
4. For all i, 1<i<n: Ri transmits P to R[i+1] by means of MPLS,
i.e., by using the label at the top of the label stack (the
level m label) as an index into an ILM;
5. For all i, 1<i<n: if a system S receives and forwards P after P
is transmitted by Ri but before P is received by R[i+1] (e.g.,
Ri and R[i+1] might be connected via a switched data link
subnetwork, and S might be one of the data link switches), then
S's forwarding decision is not based on the level m label, or
on the network layer header. This may be because:
a) the decision is not based on the label stack or the network
layer header at all;
b) the decision is based on a label stack on which additional
labels have been pushed (i.e., on a level m+k label, where
In other words, we can speak of the level m LSP for Packet P as the
sequence of routers:
1. which begins with an LSR (an "LSP Ingress") that pushes on a
level m label,
2. all of whose intermediate LSRs make their forwarding decision
by label Switching on a level m label,
3. which ends (at an "LSP Egress") when a forwarding decision is
made by label Switching on a level m-k label, where k>0, or
when a forwarding decision is made by "ordinary", non-MPLS
A consequence (or perhaps a presupposition) of this is that whenever
an LSR pushes a label onto an already labeled packet, it needs to
make sure that the new label corresponds to a FEC whose LSP Egress is
the LSR that assigned the label which is now second in the stack.
We will call a sequence of LSRs the "LSP for a particular FEC F" if
it is an LSP of level m for a particular packet P when P's level m
label is a label corresponding to FEC F.
Consider the set of nodes which may be LSP ingress nodes for FEC F.
Then there is an LSP for FEC F which begins with each of those nodes.
If a number of those LSPs have the same LSP egress, then one can
consider the set of such LSPs to be a tree, whose root is the LSP
egress. (Since data travels along this tree towards the root, this
may be called a multipoint-to-point tree.) We can thus speak of the
"LSP tree" for a particular FEC F.
3.16. Penultimate Hop Popping
Note that according to the definitions of section 3.15, if <R1, ...,
Rn> is a level m LSP for packet P, P may be transmitted from R[n-1]
to Rn with a label stack of depth m-1. That is, the label stack may
be popped at the penultimate LSR of the LSP, rather than at the LSP
From an architectural perspective, this is perfectly appropriate.
The purpose of the level m label is to get the packet to Rn. Once
R[n-1] has decided to send the packet to Rn, the label no longer has
any function, and need no longer be carried.
There is also a practical advantage to doing penultimate hop popping.
If one does not do this, then when the LSP egress receives a packet,
it first looks up the top label, and determines as a result of that
lookup that it is indeed the LSP egress. Then it must pop the stack,
and examine what remains of the packet. If there is another label on
the stack, the egress will look this up and forward the packet based
on this lookup. (In this case, the egress for the packet's level m
LSP is also an intermediate node for its level m-1 LSP.) If there is
no other label on the stack, then the packet is forwarded according
to its network layer destination address. Note that this would
require the egress to do TWO lookups, either two label lookups or a
label lookup followed by an address lookup.
If, on the other hand, penultimate hop popping is used, then when the
penultimate hop looks up the label, it determines:
- that it is the penultimate hop, and
- who the next hop is.
The penultimate node then pops the stack, and forwards the packet
based on the information gained by looking up the label that was
previously at the top of the stack. When the LSP egress receives the
packet, the label which is now at the top of the stack will be the
label which it needs to look up in order to make its own forwarding
decision. Or, if the packet was only carrying a single label, the
LSP egress will simply see the network layer packet, which is just
what it needs to see in order to make its forwarding decision.
This technique allows the egress to do a single lookup, and also
requires only a single lookup by the penultimate node.
The creation of the forwarding "fastpath" in a label switching
product may be greatly aided if it is known that only a single lookup
is ever required:
- the code may be simplified if it can assume that only a single
lookup is ever needed
- the code can be based on a "time budget" that assumes that only
a single lookup is ever needed.
In fact, when penultimate hop popping is done, the LSP Egress need
not even be an LSR.
However, some hardware switching engines may not be able to pop the
label stack, so this cannot be universally required. There may also
be some situations in which penultimate hop popping is not desirable.
Therefore the penultimate node pops the label stack only if this is
specifically requested by the egress node, OR if the next node in the
LSP does not support MPLS. (If the next node in the LSP does support
MPLS, but does not make such a request, the penultimate node has no
way of knowing that it in fact is the penultimate node.)
An LSR which is capable of popping the label stack at all MUST do
penultimate hop popping when so requested by its downstream label
Initial label distribution protocol negotiations MUST allow each LSR
to determine whether its neighboring LSRS are capable of popping the
label stack. A LSR MUST NOT request a label distribution peer to pop
the label stack unless it is capable of doing so.
It may be asked whether the egress node can always interpret the top
label of a received packet properly if penultimate hop popping is
used. As long as the uniqueness and scoping rules of section 3.14
are obeyed, it is always possible to interpret the top label of a
received packet unambiguously.
3.17. LSP Next Hop
The LSP Next Hop for a particular labeled packet in a particular LSR
is the LSR which is the next hop, as selected by the NHLFE entry used
for forwarding that packet.
The LSP Next Hop for a particular FEC is the next hop as selected by
the NHLFE entry indexed by a label which corresponds to that FEC.
Note that the LSP Next Hop may differ from the next hop which would
be chosen by the network layer routing algorithm. We will use the
term "L3 next hop" when we refer to the latter.
3.18. Invalid Incoming Labels
What should an LSR do if it receives a labeled packet with a
particular incoming label, but has no binding for that label? It is
tempting to think that the labels can just be removed, and the packet
forwarded as an unlabeled IP packet. However, in some cases, doing
so could cause a loop. If the upstream LSR thinks the label is bound
to an explicit route, and the downstream LSR doesn't think the label
is bound to anything, and if the hop by hop routing of the unlabeled
IP packet brings the packet back to the upstream LSR, then a loop is
It is also possible that the label was intended to represent a route
which cannot be inferred from the IP header.
Therefore, when a labeled packet is received with an invalid incoming
label, it MUST be discarded, UNLESS it is determined by some means
(not within the scope of the current document) that forwarding it
unlabeled cannot cause any harm.
3.19. LSP Control: Ordered versus Independent
Some FECs correspond to address prefixes which are distributed via a
dynamic routing algorithm. The setup of the LSPs for these FECs can
be done in one of two ways: Independent LSP Control or Ordered LSP
In Independent LSP Control, each LSR, upon noting that it recognizes
a particular FEC, makes an independent decision to bind a label to
that FEC and to distribute that binding to its label distribution
peers. This corresponds to the way that conventional IP datagram
routing works; each node makes an independent decision as to how to
treat each packet, and relies on the routing algorithm to converge
rapidly so as to ensure that each datagram is correctly delivered.
In Ordered LSP Control, an LSR only binds a label to a particular FEC
if it is the egress LSR for that FEC, or if it has already received a
label binding for that FEC from its next hop for that FEC.
If one wants to ensure that traffic in a particular FEC follows a
path with some specified set of properties (e.g., that the traffic
does not traverse any node twice, that a specified amount of
resources are available to the traffic, that the traffic follows an
explicitly specified path, etc.) ordered control must be used. With
independent control, some LSRs may begin label switching a traffic in
the FEC before the LSP is completely set up, and thus some traffic in
the FEC may follow a path which does not have the specified set of
properties. Ordered control also needs to be used if the recognition
of the FEC is a consequence of the setting up of the corresponding
Ordered LSP setup may be initiated either by the ingress or the
Ordered control and independent control are fully interoperable.
However, unless all LSRs in an LSP are using ordered control, the
overall effect on network behavior is largely that of independent
control, since one cannot be sure that an LSP is not used until it is
fully set up.
This architecture allows the choice between independent control and
ordered control to be a local matter. Since the two methods
interwork, a given LSR need support only one or the other. Generally
speaking, the choice of independent versus ordered control does not
appear to have any effect on the label distribution mechanisms which
need to be defined.
One way of partitioning traffic into FECs is to create a separate FEC
for each address prefix which appears in the routing table. However,
within a particular MPLS domain, this may result in a set of FECs
such that all traffic in all those FECs follows the same route. For
example, a set of distinct address prefixes might all have the same
egress node, and label swapping might be used only to get the the
traffic to the egress node. In this case, within the MPLS domain,
the union of those FECs is itself a FEC. This creates a choice:
should a distinct label be bound to each component FEC, or should a
single label be bound to the union, and that label applied to all
traffic in the union?
The procedure of binding a single label to a union of FECs which is
itself a FEC (within some domain), and of applying that label to all
traffic in the union, is known as "aggregation". The MPLS
architecture allows aggregation. Aggregation may reduce the number
of labels which are needed to handle a particular set of packets, and
may also reduce the amount of label distribution control traffic
Given a set of FECs which are "aggregatable" into a single FEC, it is
possible to (a) aggregate them into a single FEC, (b) aggregate them
into a set of FECs, or (c) not aggregate them at all. Thus we can
speak of the "granularity" of aggregation, with (a) being the
"coarsest granularity", and (c) being the "finest granularity".
When order control is used, each LSR should adopt, for a given set of
FECs, the granularity used by its next hop for those FECs.
When independent control is used, it is possible that there will be
two adjacent LSRs, Ru and Rd, which aggregate some set of FECs
If Ru has finer granularity than Rd, this does not cause a problem.
Ru distributes more labels for that set of FECs than Rd does. This
means that when Ru needs to forward labeled packets in those FECs to
Rd, it may need to map n labels into m labels, where n > m. As an
option, Ru may withdraw the set of n labels that it has distributed,
and then distribute a set of m labels, corresponding to Rd's level of
granularity. This is not necessary to ensure correct operation, but
it does result in a reduction of the number of labels distributed by
Ru, and Ru is not gaining any particular advantage by distributing
the larger number of labels. The decision whether to do this or not
is a local matter.
If Ru has coarser granularity than Rd (i.e., Rd has distributed n
labels for the set of FECs, while Ru has distributed m, where n > m),
it has two choices:
- It may adopt Rd's finer level of granularity. This would
require it to withdraw the m labels it has distributed, and
distribute n labels. This is the preferred option.
- It may simply map its m labels into a subset of Rd's n labels,
if it can determine that this will produce the same routing.
For example, suppose that Ru applies a single label to all
traffic that needs to pass through a certain egress LSR,
whereas Rd binds a number of different labels to such traffic,
depending on the individual destination addresses of the
packets. If Ru knows the address of the egress router, and if
Rd has bound a label to the FEC which is identified by that
address, then Ru can simply apply that label.
In any event, every LSR needs to know (by configuration) what
granularity to use for labels that it assigns. Where ordered control
is used, this requires each node to know the granularity only for
FECs which leave the MPLS network at that node. For independent
control, best results may be obtained by ensuring that all LSRs are
consistently configured to know the granularity for each FEC.
However, in many cases this may be done by using a single level of
granularity which applies to all FECs (such as "one label per IP
prefix in the forwarding table", or "one label per egress node").
3.21. Route Selection
Route selection refers to the method used for selecting the LSP for a
particular FEC. The proposed MPLS protocol architecture supports two
options for Route Selection: (1) hop by hop routing, and (2) explicit
Hop by hop routing allows each node to independently choose the next
hop for each FEC. This is the usual mode today in existing IP
networks. A "hop by hop routed LSP" is an LSP whose route is
selected using hop by hop routing.
In an explicitly routed LSP, each LSR does not independently choose
the next hop; rather, a single LSR, generally the LSP ingress or the
LSP egress, specifies several (or all) of the LSRs in the LSP. If a
single LSR specifies the entire LSP, the LSP is "strictly" explicitly
routed. If a single LSR specifies only some of the LSP, the LSP is
"loosely" explicitly routed.
The sequence of LSRs followed by an explicitly routed LSP may be
chosen by configuration, or may be selected dynamically by a single
node (for example, the egress node may make use of the topological
information learned from a link state database in order to compute
the entire path for the tree ending at that egress node).
Explicit routing may be useful for a number of purposes, such as
policy routing or traffic engineering. In MPLS, the explicit route
needs to be specified at the time that labels are assigned, but the
explicit route does not have to be specified with each IP packet.
This makes MPLS explicit routing much more efficient than the
alternative of IP source routing.
The procedures for making use of explicit routes, either strict or
loose, are beyond the scope of this document.
3.22. Lack of Outgoing Label
When a labeled packet is traveling along an LSP, it may occasionally
happen that it reaches an LSR at which the ILM does not map the
packet's incoming label into an NHLFE, even though the incoming label
is itself valid. This can happen due to transient conditions, or due
to an error at the LSR which should be the packet's next hop.
It is tempting in such cases to strip off the label stack and attempt
to forward the packet further via conventional forwarding, based on
its network layer header. However, in general this is not a safe
- If the packet has been following an explicitly routed LSP, this
could result in a loop.
- The packet's network header may not contain enough information
to enable this particular LSR to forward it correctly.
Unless it can be determined (through some means outside the scope of
this document) that neither of these situations obtains, the only
safe procedure is to discard the packet.
3.23. Time-to-Live (TTL)
In conventional IP forwarding, each packet carries a "Time To Live"
(TTL) value in its header. Whenever a packet passes through a
router, its TTL gets decremented by 1; if the TTL reaches 0 before
the packet has reached its destination, the packet gets discarded.
This provides some level of protection against forwarding loops that
may exist due to misconfigurations, or due to failure or slow
convergence of the routing algorithm. TTL is sometimes used for
other functions as well, such as multicast scoping, and supporting
the "traceroute" command. This implies that there are two TTL-
related issues that MPLS needs to deal with: (i) TTL as a way to
suppress loops; (ii) TTL as a way to accomplish other functions, such
as limiting the scope of a packet.
When a packet travels along an LSP, it SHOULD emerge with the same
TTL value that it would have had if it had traversed the same
sequence of routers without having been label switched. If the
packet travels along a hierarchy of LSPs, the total number of LSR-
hops traversed SHOULD be reflected in its TTL value when it emerges
from the hierarchy of LSPs.
The way that TTL is handled may vary depending upon whether the MPLS
label values are carried in an MPLS-specific "shim" header [MPLS-SHIM], or if the MPLS labels are carried in an L2 header, such as an
ATM header [MPLS-ATM] or a frame relay header [MPLS-FRMRLY].
If the label values are encoded in a "shim" that sits between the
data link and network layer headers, then this shim MUST have a TTL
field that SHOULD be initially loaded from the network layer header
TTL field, SHOULD be decremented at each LSR-hop, and SHOULD be
copied into the network layer header TTL field when the packet
emerges from its LSP.
If the label values are encoded in a data link layer header (e.g.,
the VPI/VCI field in ATM's AAL5 header), and the labeled packets are
forwarded by an L2 switch (e.g., an ATM switch), and the data link
layer (like ATM) does not itself have a TTL field, then it will not
be possible to decrement a packet's TTL at each LSR-hop. An LSP
segment which consists of a sequence of LSRs that cannot decrement a
packet's TTL will be called a "non-TTL LSP segment".
When a packet emerges from a non-TTL LSP segment, it SHOULD however
be given a TTL that reflects the number of LSR-hops it traversed. In
the unicast case, this can be achieved by propagating a meaningful
LSP length to ingress nodes, enabling the ingress to decrement the
TTL value before forwarding packets into a non-TTL LSP segment.
Sometimes it can be determined, upon ingress to a non-TTL LSP
segment, that a particular packet's TTL will expire before the packet
reaches the egress of that non-TTL LSP segment. In this case, the
LSR at the ingress to the non-TTL LSP segment must not label switch
the packet. This means that special procedures must be developed to
support traceroute functionality, for example, traceroute packets may
be forwarded using conventional hop by hop forwarding.
3.24. Loop Control
On a non-TTL LSP segment, by definition, TTL cannot be used to
protect against forwarding loops. The importance of loop control may
depend on the particular hardware being used to provide the LSR
functions along the non-TTL LSP segment.
Suppose, for instance, that ATM switching hardware is being used to
provide MPLS switching functions, with the label being carried in the
VPI/VCI field. Since ATM switching hardware cannot decrement TTL,
there is no protection against loops. If the ATM hardware is capable
of providing fair access to the buffer pool for incoming cells
carrying different VPI/VCI values, this looping may not have any
deleterious effect on other traffic. If the ATM hardware cannot
provide fair buffer access of this sort, however, then even transient
loops may cause severe degradation of the LSR's total performance.
Even if fair buffer access can be provided, it is still worthwhile to
have some means of detecting loops that last "longer than possible".
In addition, even where TTL and/or per-VC fair queuing provides a
means for surviving loops, it still may be desirable where practical
to avoid setting up LSPs which loop. All LSRs that may attach to
non-TTL LSP segments will therefore be required to support a common
technique for loop detection; however, use of the loop detection
technique is optional. The loop detection technique is specified in
[MPLS-ATM] and [MPLS-LDP].
3.25. Label Encodings
In order to transmit a label stack along with the packet whose label
stack it is, it is necessary to define a concrete encoding of the
label stack. The architecture supports several different encoding
techniques; the choice of encoding technique depends on the
particular kind of device being used to forward labeled packets.
3.25.1. MPLS-specific Hardware and/or Software
If one is using MPLS-specific hardware and/or software to forward
labeled packets, the most obvious way to encode the label stack is to
define a new protocol to be used as a "shim" between the data link
layer and network layer headers. This shim would really be just an
encapsulation of the network layer packet; it would be "protocol-
independent" such that it could be used to encapsulate any network
layer. Hence we will refer to it as the "generic MPLS
The generic MPLS encapsulation would in turn be encapsulated in a
data link layer protocol.
The MPLS generic encapsulation is specified in [MPLS-SHIM].
3.25.2. ATM Switches as LSRs
It will be noted that MPLS forwarding procedures are similar to those
of legacy "label swapping" switches such as ATM switches. ATM
switches use the input port and the incoming VPI/VCI value as the
index into a "cross-connect" table, from which they obtain an output
port and an outgoing VPI/VCI value. Therefore if one or more labels
can be encoded directly into the fields which are accessed by these
legacy switches, then the legacy switches can, with suitable software
upgrades, be used as LSRs. We will refer to such devices as "ATM-
There are three obvious ways to encode labels in the ATM cell header
(presuming the use of AAL5):
1. SVC Encoding
Use the VPI/VCI field to encode the label which is at the top
of the label stack. This technique can be used in any network.
With this encoding technique, each LSP is realized as an ATM
SVC, and the label distribution protocol becomes the ATM
"signaling" protocol. With this encoding technique, the ATM-
LSRs cannot perform "push" or "pop" operations on the label
2. SVP Encoding
Use the VPI field to encode the label which is at the top of
the label stack, and the VCI field to encode the second label
on the stack, if one is present. This technique some
advantages over the previous one, in that it permits the use of
ATM "VP-switching". That is, the LSPs are realized as ATM
SVPs, with the label distribution protocol serving as the ATM
However, this technique cannot always be used. If the network
includes an ATM Virtual Path through a non-MPLS ATM network,
then the VPI field is not necessarily available for use by
When this encoding technique is used, the ATM-LSR at the egress
of the VP effectively does a "pop" operation.
3. SVP Multipoint Encoding
Use the VPI field to encode the label which is at the top of
the label stack, use part of the VCI field to encode the second
label on the stack, if one is present, and use the remainder of
the VCI field to identify the LSP ingress. If this technique
is used, conventional ATM VP-switching capabilities can be used
to provide multipoint-to-point VPs. Cells from different
packets will then carry different VCI values. As we shall see
in section 3.26, this enables us to do label merging, without
running into any cell interleaving problems, on ATM switches
which can provide multipoint-to-point VPs, but which do not
have the VC merge capability.
This technique depends on the existence of a capability for
assigning 16-bit VCI values to each ATM switch such that no
single VCI value is assigned to two different switches. (If an
adequate number of such values could be assigned to each
switch, it would be possible to also treat the VCI value as the
second label in the stack.)
If there are more labels on the stack than can be encoded in the ATM
header, the ATM encodings must be combined with the generic
3.25.3. Interoperability among Encoding Techniques
If <R1, R2, R3> is a segment of a LSP, it is possible that R1 will
use one encoding of the label stack when transmitting packet P to R2,
but R2 will use a different encoding when transmitting a packet P to
R3. In general, the MPLS architecture supports LSPs with different
label stack encodings used on different hops. Therefore, when we
discuss the procedures for processing a labeled packet, we speak in
abstract terms of operating on the packet's label stack. When a
labeled packet is received, the LSR must decode it to determine the
current value of the label stack, then must operate on the label
stack to determine the new value of the stack, and then encode the
new value appropriately before transmitting the labeled packet to its
Unfortunately, ATM switches have no capability for translating from
one encoding technique to another. The MPLS architecture therefore
requires that whenever it is possible for two ATM switches to be
successive LSRs along a level m LSP for some packet, that those two
ATM switches use the same encoding technique.
Naturally there will be MPLS networks which contain a combination of
ATM switches operating as LSRs, and other LSRs which operate using an
MPLS shim header. In such networks there may be some LSRs which have
ATM interfaces as well as "MPLS Shim" interfaces. This is one
example of an LSR with different label stack encodings on different
hops. Such an LSR may swap off an ATM encoded label stack on an
incoming interface and replace it with an MPLS shim header encoded
label stack on the outgoing interface.
3.26. Label Merging
Suppose that an LSR has bound multiple incoming labels to a
particular FEC. When forwarding packets in that FEC, one would like
to have a single outgoing label which is applied to all such packets.
The fact that two different packets in the FEC arrived with different
incoming labels is irrelevant; one would like to forward them with
the same outgoing label. The capability to do so is known as "label
Let us say that an LSR is capable of label merging if it can receive
two packets from different incoming interfaces, and/or with different
labels, and send both packets out the same outgoing interface with
the same label. Once the packets are transmitted, the information
that they arrived from different interfaces and/or with different
incoming labels is lost.
Let us say that an LSR is not capable of label merging if, for any
two packets which arrive from different interfaces, or with different
labels, the packets must either be transmitted out different
interfaces, or must have different labels. ATM-LSRs using the SVC or
SVP Encodings cannot perform label merging. This is discussed in
more detail in the next section.
If a particular LSR cannot perform label merging, then if two packets
in the same FEC arrive with different incoming labels, they must be
forwarded with different outgoing labels. With label merging, the
number of outgoing labels per FEC need only be 1; without label
merging, the number of outgoing labels per FEC could be as large as
the number of nodes in the network.
With label merging, the number of incoming labels per FEC that a
particular LSR needs is never be larger than the number of label
distribution adjacencies. Without label merging, the number of
incoming labels per FEC that a particular LSR needs is as large as
the number of upstream nodes which forward traffic in the FEC to the
LSR in question. In fact, it is difficult for an LSR to even
determine how many such incoming labels it must support for a
The MPLS architecture accommodates both merging and non-merging LSRs,
but allows for the fact that there may be LSRs which do not support
label merging. This leads to the issue of ensuring correct
interoperation between merging LSRs and non-merging LSRs. The issue
is somewhat different in the case of datagram media versus the case
of ATM. The different media types will therefore be discussed
3.26.1. Non-merging LSRs
The MPLS forwarding procedures is very similar to the forwarding
procedures used by such technologies as ATM and Frame Relay. That
is, a unit of data arrives, a label (VPI/VCI or DLCI) is looked up in
a "cross-connect table", on the basis of that lookup an output port
is chosen, and the label value is rewritten. In fact, it is possible
to use such technologies for MPLS forwarding; a label distribution
protocol can be used as the "signalling protocol" for setting up the
Unfortunately, these technologies do not necessarily support the
label merging capability. In ATM, if one attempts to perform label
merging, the result may be the interleaving of cells from various
packets. If cells from different packets get interleaved, it is
impossible to reassemble the packets. Some Frame Relay switches use
cell switching on their backplanes. These switches may also be
incapable of supporting label merging, for the same reason -- cells
of different packets may get interleaved, and there is then no way to
reassemble the packets.
We propose to support two solutions to this problem. First, MPLS
will contain procedures which allow the use of non-merging LSRs.
Second, MPLS will support procedures which allow certain ATM switches
to function as merging LSRs.
Since MPLS supports both merging and non-merging LSRs, MPLS also
contains procedures to ensure correct interoperation between them.
3.26.2. Labels for Merging and Non-Merging LSRs
An upstream LSR which supports label merging needs to be sent only
one label per FEC. An upstream neighbor which does not support label
merging needs to be sent multiple labels per FEC. However, there is
no way of knowing a priori how many labels it needs. This will
depend on how many LSRs are upstream of it with respect to the FEC in
In the MPLS architecture, if a particular upstream neighbor does not
support label merging, it is not sent any labels for a particular FEC
unless it explicitly asks for a label for that FEC. The upstream
neighbor may make multiple such requests, and is given a new label
each time. When a downstream neighbor receives such a request from
upstream, and the downstream neighbor does not itself support label
merging, then it must in turn ask its downstream neighbor for another
label for the FEC in question.
It is possible that there may be some nodes which support label
merging, but can only merge a limited number of incoming labels into
a single outgoing label. Suppose for example that due to some
hardware limitation a node is capable of merging four incoming labels
into a single outgoing label. Suppose however, that this particular
node has six incoming labels arriving at it for a particular FEC. In
this case, this node may merge these into two outgoing labels.
Whether label merging is applicable to explicitly routed LSPs is for
3.26.3. Merge over ATM
188.8.131.52. Methods of Eliminating Cell Interleave
There are several methods that can be used to eliminate the cell
interleaving problem in ATM, thereby allowing ATM switches to support
1. VP merge, using the SVP Multipoint Encoding
When VP merge is used, multiple virtual paths are merged into a
virtual path, but packets from different sources are
distinguished by using different VCIs within the VP.
2. VC merge
When VC merge is used, switches are required to buffer cells
from one packet until the entire packet is received (this may
be determined by looking for the AAL5 end of frame indicator).
VP merge has the advantage that it is compatible with a higher
percentage of existing ATM switch implementations. This makes it
more likely that VP merge can be used in existing networks. Unlike
VC merge, VP merge does not incur any delays at the merge points and
also does not impose any buffer requirements. However, it has the
disadvantage that it requires coordination of the VCI space within
each VP. There are a number of ways that this can be accomplished.
Selection of one or more methods is for further study.
This tradeoff between compatibility with existing equipment versus
protocol complexity and scalability implies that it is desirable for
the MPLS protocol to support both VP merge and VC merge. In order to
do so each ATM switch participating in MPLS needs to know whether its
immediate ATM neighbors perform VP merge, VC merge, or no merge.
184.108.40.206. Interoperation: VC Merge, VP Merge, and Non-Merge
The interoperation of the various forms of merging over ATM is most
easily described by first describing the interoperation of VC merge
In the case where VC merge and non-merge nodes are interconnected the
forwarding of cells is based in all cases on a VC (i.e., the
concatenation of the VPI and VCI). For each node, if an upstream
neighbor is doing VC merge then that upstream neighbor requires only
a single VPI/VCI for a particular stream (this is analogous to the
requirement for a single label in the case of operation over frame
media). If the upstream neighbor is not doing merge, then the
neighbor will require a single VPI/VCI per stream for itself, plus
enough VPI/VCIs to pass to its upstream neighbors. The number
required will be determined by allowing the upstream nodes to request
additional VPI/VCIs from their downstream neighbors (this is again
analogous to the method used with frame merge).
A similar method is possible to support nodes which perform VP merge.
In this case the VP merge node, rather than requesting a single
VPI/VCI or a number of VPI/VCIs from its downstream neighbor, instead
may request a single VP (identified by a VPI) but several VCIs within
the VP. Furthermore, suppose that a non-merge node is downstream
from two different VP merge nodes. This node may need to request one
VPI/VCI (for traffic originating from itself) plus two VPs (one for
each upstream node), each associated with a specified set of VCIs (as
requested from the upstream node).
In order to support all of VP merge, VC merge, and non-merge, it is
therefore necessary to allow upstream nodes to request a combination
of zero or more VC identifiers (consisting of a VPI/VCI), plus zero
or more VPs (identified by VPIs) each containing a specified number
of VCs (identified by a set of VCIs which are significant within a
VP). VP merge nodes would therefore request one VP, with a contained
VCI for traffic that it originates (if appropriate) plus a VCI for
each VC requested from above (regardless of whether or not the VC is
part of a containing VP). VC merge node would request only a single
VPI/VCI (since they can merge all upstream traffic into a single VC).
Non-merge nodes would pass on any requests that they get from above,
plus request a VPI/VCI for traffic that they originate (if
3.27. Tunnels and Hierarchy
Sometimes a router Ru takes explicit action to cause a particular
packet to be delivered to another router Rd, even though Ru and Rd
are not consecutive routers on the Hop-by-hop path for that packet,
and Rd is not the packet's ultimate destination. For example, this
may be done by encapsulating the packet inside a network layer packet
whose destination address is the address of Rd itself. This creates
a "tunnel" from Ru to Rd. We refer to any packet so handled as a
3.27.1. Hop-by-Hop Routed Tunnel
If a Tunneled Packet follows the Hop-by-hop path from Ru to Rd, we
say that it is in an "Hop-by-Hop Routed Tunnel" whose "transmit
endpoint" is Ru and whose "receive endpoint" is Rd.
3.27.2. Explicitly Routed Tunnel
If a Tunneled Packet travels from Ru to Rd over a path other than the
Hop-by-hop path, we say that it is in an "Explicitly Routed Tunnel"
whose "transmit endpoint" is Ru and whose "receive endpoint" is Rd.
For example, we might send a packet through an Explicitly Routed
Tunnel by encapsulating it in a packet which is source routed.
3.27.3. LSP Tunnels
It is possible to implement a tunnel as a LSP, and use label
switching rather than network layer encapsulation to cause the packet
to travel through the tunnel. The tunnel would be a LSP <R1, ...,
Rn>, where R1 is the transmit endpoint of the tunnel, and Rn is the
receive endpoint of the tunnel. This is called a "LSP Tunnel".
The set of packets which are to be sent though the LSP tunnel
constitutes a FEC, and each LSR in the tunnel must assign a label to
that FEC (i.e., must assign a label to the tunnel). The criteria for
assigning a particular packet to an LSP tunnel is a local matter at
the tunnel's transmit endpoint. To put a packet into an LSP tunnel,
the transmit endpoint pushes a label for the tunnel onto the label
stack and sends the labeled packet to the next hop in the tunnel.
If it is not necessary for the tunnel's receive endpoint to be able
to determine which packets it receives through the tunnel, as
discussed earlier, the label stack may be popped at the penultimate
LSR in the tunnel.
A "Hop-by-Hop Routed LSP Tunnel" is a Tunnel that is implemented as
an hop-by-hop routed LSP between the transmit endpoint and the
An "Explicitly Routed LSP Tunnel" is a LSP Tunnel that is also an
Explicitly Routed LSP.
3.27.4. Hierarchy: LSP Tunnels within LSPs
Consider a LSP <R1, R2, R3, R4>. Let us suppose that R1 receives
unlabeled packet P, and pushes on its label stack the label to cause
it to follow this path, and that this is in fact the Hop-by-hop path.
However, let us further suppose that R2 and R3 are not directly
connected, but are "neighbors" by virtue of being the endpoints of an
LSP tunnel. So the actual sequence of LSRs traversed by P is <R1,
R2, R21, R22, R23, R3, R4>.
When P travels from R1 to R2, it will have a label stack of depth 1.
R2, switching on the label, determines that P must enter the tunnel.
R2 first replaces the Incoming label with a label that is meaningful
to R3. Then it pushes on a new label. This level 2 label has a
value which is meaningful to R21. Switching is done on the level 2
label by R21, R22, R23. R23, which is the penultimate hop in the
R2-R3 tunnel, pops the label stack before forwarding the packet to
R3. When R3 sees packet P, P has only a level 1 label, having now
exited the tunnel. Since R3 is the penultimate hop in P's level 1
LSP, it pops the label stack, and R4 receives P unlabeled.
The label stack mechanism allows LSP tunneling to nest to any depth.
3.27.5. Label Distribution Peering and Hierarchy
Suppose that packet P travels along a Level 1 LSP <R1, R2, R3, R4>,
and when going from R2 to R3 travels along a Level 2 LSP <R2, R21,
R22, R3>. From the perspective of the Level 2 LSP, R2's label
distribution peer is R21. From the perspective of the Level 1 LSP,
R2's label distribution peers are R1 and R3. One can have label
distribution peers at each layer of hierarchy. We will see in
sections 4.6 and 4.7 some ways to make use of this hierarchy. Note
that in this example, R2 and R21 must be IGP neighbors, but R2 and R3
need not be.
When two LSRs are IGP neighbors, we will refer to them as "local
label distribution peers". When two LSRs may be label distribution
peers, but are not IGP neighbors, we will refer to them as "remote
label distribution peers". In the above example, R2 and R21 are
local label distribution peers, but R2 and R3 are remote label
The MPLS architecture supports two ways to distribute labels at
different layers of the hierarchy: Explicit Peering and Implicit
One performs label distribution with one's local label distribution
peer by sending label distribution protocol messages which are
addressed to the peer. One can perform label distribution with one's
remote label distribution peers in one of two ways:
1. Explicit Peering
In explicit peering, one distributes labels to a peer by
sending label distribution protocol messages which are
addressed to the peer, exactly as one would do for local label
distribution peers. This technique is most useful when the
number of remote label distribution peers is small, or the
number of higher level label bindings is large, or the remote
label distribution peers are in distinct routing areas or
domains. Of course, one needs to know which labels to
distribute to which peers; this is addressed in section 4.1.2.
Examples of the use of explicit peering is found in sections
4.2.1 and 4.6.
2. Implicit Peering
In Implicit Peering, one does not send label distribution
protocol messages which are addressed to one's peer. Rather,
to distribute higher level labels to ones remote label
distribution peers, one encodes a higher level label as an
attribute of a lower level label, and then distributes the
lower level label, along with this attribute, to one's local
label distribution peers. The local label distribution peers
then propagate the information to their local label
distribution peers. This process continues till the
information reaches the remote peer.
This technique is most useful when the number of remote label
distribution peers is large. Implicit peering does not require
an n-square peering mesh to distribute labels to the remote
label distribution peers because the information is piggybacked
through the local label distribution peering. However,
implicit peering requires the intermediate nodes to store
information that they might not be directly interested in.
An example of the use of implicit peering is found in section
3.28. Label Distribution Protocol Transport
A label distribution protocol is used between nodes in an MPLS
network to establish and maintain the label bindings. In order for
MPLS to operate correctly, label distribution information needs to be
transmitted reliably, and the label distribution protocol messages
pertaining to a particular FEC need to be transmitted in sequence.
Flow control is also desirable, as is the capability to carry
multiple label messages in a single datagram.
One way to meet these goals is to use TCP as the underlying
transport, as is done in [MPLS-LDP] and [MPLS-BGP].
3.29. Why More than one Label Distribution Protocol?
This architecture does not establish hard and fast rules for choosing
which label distribution protocol to use in which circumstances.
However, it is possible to point out some of the considerations.
3.29.1. BGP and LDP
In many scenarios, it is desirable to bind labels to FECs which can
be identified with routes to address prefixes (see section 4.1). If
there is a standard, widely deployed routing algorithm which
distributes those routes, it can be argued that label distribution is
best achieved by piggybacking the label distribution on the
distribution of the routes themselves.
For example, BGP distributes such routes, and if a BGP speaker needs
to also distribute labels to its BGP peers, using BGP to do the label
distribution (see [MPLS-BGP]) has a number of advantages. In
particular, it permits BGP route reflectors to distribute labels,
thus providing a significant scalability advantage over using LDP to
distribute labels between BGP peers.
3.29.2. Labels for RSVP Flowspecs
When RSVP is used to set up resource reservations for particular
flows, it can be desirable to label the packets in those flows, so
that the RSVP filterspec does not need to be applied at each hop. It
can be argued that having RSVP distribute the labels as part of its
path/reservation setup process is the most efficient method of
distributing labels for this purpose.
3.29.3. Labels for Explicitly Routed LSPs
In some applications of MPLS, particularly those related to traffic
engineering, it is desirable to set up an explicitly routed path,
from ingress to egress. It is also desirable to apply resource
reservations along that path.
One can imagine two approaches to this:
- Start with an existing protocol that is used for setting up
resource reservations, and extend it to support explicit
routing and label distribution.
- Start with an existing protocol that is used for label
distribution, and extend it to support explicit routing and