Technology and engineering · 2005

RFC 4206: Label Switched Paths (LSP) Hierarchy with Generalized Multi-Protocol Label Switching (GMPLS) Traffic Engineering (TE)

by K. Kompella, Y. Rekhter

To improve scalability of Generalized Multi-Protocol Label Switching (GMPLS) it may be useful to aggregate Label Switched Paths (LSPs) by creating a hierarchy of such LSPs. A way to create such a hierarchy is by (a) a Label Switching Router (LSR) creating a Traffic Engineering Label Switched Path (TE LSP), (b) the LSR forming a forwarding adjacency (FA) out of that LSP (by advertising this LSP as a Traffic Engineering (TE) link into the same instance of ISIS/OSPF as the one that was used to create the LSP), (c) allowing other LSRs to use FAs for their path computation, and (d) nesting of LSPs originated by other LSRs into that LSP (by using the label stack construct). This document describes the mechanisms to accomplish this. [PROPOSED STANDARD]

Anyone can see what's on the shelves. Open a book with a free account, and stay in touch with its book club.

First published
2005
Status
Proposed Standard
Pages
14
Updated by
RFC 6001, RFC 6107
Copyright
✓ Free to read · Copied in full, as published

Where it comes from

RFC Editor · IETF Datatracker · IETF Trust Legal Provisions

Copied in full and unchanged from the RFC Editor, with the RFC's own notices. © IETF Trust and the persons identified as the document authors. The IETF Trust allows copying and distributing an RFC in full and without modification, so Micwyn shows it exactly as published and makes no study guide, audio or other version of it.

Discuss a passage

Select any passage in the reader and press Discuss to talk about it in public.

Join free to discuss a passage

Ask Micwyn about this book

Join (free) to ask about a PDF
Try asking

If you like this one