CR-LDP Constraint-based Routing LDP
LDP and CR-LDP
Article REF: TE7540 V1
CR-LDP Constraint-based Routing LDP
LDP and CR-LDP

Author : Jean-Marie BONNIN

Publication date: November 10, 2003

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

2. CR-LDP Constraint-based Routing LDP

CR-LDP meets the needs of network operators for traffic engineering tools. It is essential to be able to reproduce, at least in part, in an MPLS network what operators used to use in ATM networks (cf. ) and Frame Relay (see [H 2 285] ). For this reason, LDP has been extended to include functions for constraining the routing of LSPs and associating QoS characteristics with them.

The most important change was to create a much stronger notion of LSP than that which existed diffusely in LDP. In CR-LDP, an LSP is a path voluntarily established from a point,...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

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?


Article included in this offer

"Networks and Telecommunications"

( 170 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details