Overview
![](/assets/images/picto-drapeau-france-3a76576a5d60a512053b4612ab58dae5.png)
Read this article from a comprehensive knowledge base, updated and supplemented with articles reviewed by scientific committees.
Read the articleAUTHOR
-
Jean-Marie BONNIN: Lecturer at the École nationale supérieure des télécommunications (ENST) in Brittany, France
INTRODUCTION
The article presents the principles of label switching, and more specifically the MPLS (MultiProtocol Label Switching) protocol. In an MPLS core network, IP packets in transit are encapsulated in MPLS packets and relayed on the basis of the label in the MPLS header. To do this, the LSRs (Label Switching Routers) in an MPLS cloud have to agree on the meaning of the labels - this is known as label distribution. There are several ways to populate MPLS switching tables. The first is to do it manually, which is only realistic for a very limited number of Forwarding Equivalence Classes (FECs). It is also possible to use a fully automatic protocol that builds MPLS paths (LSP Label Switched Paths) for each of the equivalence classes recognized in the routing tables, based on the information contained in the IP routing tables. With this approach, paths are constructed on a hop-by-hop basis, similar to that of IP routing protocols. The use of the new Label Distribution Protocol (LDP) is an example of this approach, as is the addition of label distribution information in Border Gateway Protocol 4 (BGP4). Finally, there are solutions based on centralized control. These offer tools for establishing LSPs by explicitly providing the path they must take and the quality of service they must ensure. These solutions are based on two protocols: the first, CR-LDP (Constraint Routing – Label Distribution Protocol) is an extension of LDP, whose presence in the network is required, while the second, RSVP-TE (ReSerVation Protocol – Tunnel Extension) is a modification of RSVP already present in many manufacturers' routers. There is some debate between CR-LDP and RSVP-TE proponents as to which protocol should be used to explicitly establish paths. We won't get into the controversy, especially as they offer essentially the same functions. And, if we have chosen to deal with CR-LDP here, it's only because we're already dealing with LDP.
First, we'll look at the principles of LDP, then at how it works by giving a number of examples. Finally, we describe the possibilities of CR-LDP, before concluding by outlining the state of the market and the proposals for evolving and extending LDP that have already been submitted to the IETF (Internet Engineering Task Force).
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference
This article is included in
Networks and Telecommunications
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
LDP and CR-LDP
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference