Reoptimization of MPLS Traffic Engineering loosely routed explicit LSP paths
draft-vasseur-mpls-loose-path-reopt-02
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Yuichi Ikejiri , JP Vasseur | ||
| Last updated | 2003-06-27 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The aim of this document is to propose a mechanism for the reoptimization of MPLS Traffic Engineering loosely routed explicit LSP paths. A loosely routed explicit LSP path is a path specified as a combination of strict and loose hop(s) that contains at least one loose hop and zero or more strict hop(s). The path calculation (which implies ERO expansion) to reach a loose hop is made on the previous hop defined in the TE LSP path. This draft proposes a mechanism that allows: - The TE LSP Head-end LSR to trigger a new ERO expansion on every hop having a next hop defined as a loose hop, - An LSR to signal to the TE LSP head-end that a better path exists to reach a loose hop (than the current path in use). A better path is defined as a path with a lower cost, where the cost is determined by the metric used to compute the path. This primarily applies to inter-area TE LSPs and inter-AS TE LSPs when the path is defined as a list of loose hops (generally the loose hops are the ABRs/ASBRs) but the following mechanism is also applicable to any loosely routed explicit path within a single routing domain.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)