Jump to content

Constraint-based Routing Label Distribution Protocol

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by BG19bot (talk | contribs) at 00:37, 11 December 2014 (WP:CHECKWIKI error fix for #03. Missing Reflist. Do general fixes if a problem exists. - using AWB (10511)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Constraint-based Routing Label Distribution Protocol (CR-LDP) is a control protocol used in some computer networks. As of February 2003, the IETF MPLS working group deprecated CR-LDP and decided to focus purely on RSVP-TE.[1]

It is an extension of the Label Distribution Protocol (LDP), one of the protocols in the Multiprotocol Label Switching architecture. CR-LDP contains extensions for LDP to extend its capabilities such as setup paths beyond what is available for the routing protocol. For instance, a Label Switched Path can be set up based on explicit route constraints, quality of service constraints, and other constraints. Constraint-based routing (CR) is a mechanism used to meet traffic engineering requirements. These requirements are met by extending LDP for support of constraint-based routed label switched paths (CR-LSPs). Other uses for CR-LSPs include MPLS-based virtual private networks. CR-LDP is almost same as basic LDP, in packet structure, but it contains some extra TLVs which basically set up the constraint-based LSP.

References

  1. ^ L. Andersson; G. Swallow (February 2003). "The Multiprotocol Label Switching (MPLS) Working Group decision on MPLS signaling protocols". p. 6. RFC 3468. {{cite web}}: Missing or empty |url= (help)CS1 maint: multiple names: authors list (link)


Stub icon

This computer networking article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Constraint-based_Routing_Label_Distribution_Protocol&oldid=637550922"