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 Henrik (talk | contribs) at 21:27, 22 March 2006 (Moving {{technical}} template to talk page). 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), a type of Label Distribution Protocol, is 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, an Label Switched Path can be setup 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.

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=45000397"