Further considerations for Forwarding Adjacency LSPs
draft-vandenbosch-mpls-fa-considerations-01

Document Type Expired Internet-Draft (individual)
Authors Sven Van den Bosch  , Dimitri Papadimitriou 
Last updated 2002-07-05
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-vandenbosch-mpls-fa-considerations-01.txt

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 (sven.van_den_bosch@alcatel.be)
Dimitri Papadimitriou (dimitri.papadimitriou@alcatel.be)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)