Hierarchical LSP
draft-hummel-mpls-hierarchical-lsp-03
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Heinrich K. Hummel | ||
| Last updated | 2002-10-22 | ||
| 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
This draft pursues the standardization of the 'Hierarchical LSP' being a label-switched sequence of other LSPs (and interfaces), i.e. of hierarchically next-lower LSPs, which eventually, after some recursive cycles, consist of label-switched sequences of physical interfaces, i.e. of LSPs as of today. Hierarchically stacked LSPs will eliminate the notorious N-square problem when virtual networks (or even virtual networks on top of virtual networks) are to be built. Version 03 is based on RSVP-TE (not on CR-LDP anymore).
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)