1 / 7

Tomonori Takeda (NTT) Yuichi Ikejiri (NTT Communications) Adrian Farrel (Old Dog Consulting)

Analysis of Inter-domain Label Switched Path (LSP) Recovery draft-takeda-ccamp-inter-domain-recovery-analysis-00.txt. Tomonori Takeda (NTT) Yuichi Ikejiri (NTT Communications) Adrian Farrel (Old Dog Consulting) Jean-Philippe Vasseur (Cisco). Summary.

gervin
Download Presentation

Tomonori Takeda (NTT) Yuichi Ikejiri (NTT Communications) Adrian Farrel (Old Dog Consulting)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Analysis of Inter-domain Label Switched Path (LSP) Recoverydraft-takeda-ccamp-inter-domain-recovery-analysis-00.txt Tomonori Takeda (NTT) Yuichi Ikejiri (NTT Communications) Adrian Farrel (Old Dog Consulting) Jean-Philippe Vasseur (Cisco) 66th IETF Montreal July 2006

  2. Summary • Submitted to CCAMP WG, presented here for information (L1VPN is a special case of inter-domain) • The whole scope • Framework and analysis of inter-domain MPLS/GMPLS TE LSP recovery techniques • Based on existing inter-domain framework • Specifically for this version • End-to-end diversity • Path computation and signaling aspects • List of various schemes • Use cases • Inter-area/AS/Provider • GMPLS UNI/L1VPNs • MPLS over GMPLS 66th IETF Montreal July 2006

  3. Key Technical Elements • With or without confidentiality • Per-domain path computation or inter-domain collaborative path computation • Sequential path computation or simultaneous path computation • By combining above (and plus some) elements, list 12 schemes (in broad category) 66th IETF Montreal July 2006

  4. Example1 • Without confidentiality • Per-domain path computation • Sequential path computation  XRO Obtain RRO via Resv msg Working LSP Copy RRO into XRO in Path msg Recovery LSP 66th IETF Montreal July 2006

  5. Example2 • With confidentiality • Inter-domain collaborative path computation • Simultaneous path computation  Cookie or Encryption Partial path Partial path Result of path computation (temporary cash) PCE PCE PCE Partial path Working LSP Result of path computation (temporary cash) Query PCE for ERO expansion Return cash Recovery LSP 66th IETF Montreal July 2006

  6. Relevance to L1VPN WG 1/2 • Specific case of inter-domain recovery  L1VPN CE-CE recovery • 3 domains, the first and the last domain contain only a single node  domain level routing is not a problem • With confidentiality • Private address usage (optional) Working LSP PE1 PE3 P1 CE1 CE2 PE2 PE4 Protecting LSP P2 P3 66th IETF Montreal July 2006

  7. Relevance to L1VPN WG 2/2 • Review the document • Make sure L1VPN recovery is going to be correctly covered • Authors are planning to respin the document, then ask for CCAMP WG document 66th IETF Montreal July 2006

More Related