@misc{rfc4206,
    series =    {Request for Comments},
    number =    4206,
    howpublished =  {RFC 4206},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC4206},
    url =       {https://www.rfc-editor.org/info/rfc4206},
    author =    {Kireeti Kompella and Yakov Rekhter},
    title =     {{Label Switched Paths (LSP) Hierarchy with Generalized Multi-Protocol Label Switching (GMPLS) Traffic Engineering (TE)}},
    pagetotal = 14,
    year =      2005,
    month =     oct,
    abstract =  {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{]}},
}