Further considerations for Forwarding Adjacency LSPs
draft-vandenbosch-mpls-fa-considerations-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Sven Van den Bosch , Dimitri Papadimitriou | ||
| Last updated | 2002-07-05 | ||
| 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
Forwarding adjacencies (FA) as described in [2] are a useful tool for improving the scalability of Generalized MPLS (GMPLS) Traffic Engineering (TE). Through the aggregation of TE LSPs this concept enables the creation of a TE-LSP Hierarchy. Forwarding adjacency LSPs (FA-LSP or simply FA) may be advertised as TE link into the same instance of ISIS/OSPF as the one that was used to create the LSP, allowing other LSRs to use FAs as TE-links for their path computation. As such, forwarding adjacency LSP have characteristics of both links and LSPs. This document list a number of topics for further study regarding forwarding adjacencies in an attempt to identify what future work may result in the MPLS WG (or other) from the link/LSP duality.
Authors
Sven Van den Bosch
Dimitri Papadimitriou
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)