May 26, 2008

CBR(Constraint Based Routing)

In general, path computation for an LSP may seek to satisfy a set of requirements associated with the LSP, taking into account a set of constraints imposed by administrative policies and the prevailing state of the network -- which usually relates to topology data and resource availability. Computation of an engineered path that satisfies an arbitrary set of constraints is referred to as "constraint based routing".

Draft-li-mpls-igp-te-00.txt
Post a Comment