1. 66th IETF Montreal July 2006 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)

2. 66th IETF Montreal July 2006 Summary 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

3. 66th IETF Montreal July 2006 Currently Not Addressed Fast ReRoute and Segment recovery Mixture of recovery techniques (e.g., link recovery + segment recovery, end-to-end recovery + segment recovery) Maintenance (OAM, re-optimization, etc.) In depth comparison of various schemes

4. 66th IETF Montreal July 2006 Assumptions Domain level routing is pre-determined (based on configuration, policy etc.) Working and recovery LSPs follow the same domain in the same order These limitations may be relaxed in the future revisions +-----Domain#2-----+ | | | E--------------F | | | | | +-+--------------+-+ | | +-Domain#1-+-+ +---------+--+ | | | | | | | A-------B-+--+-C-------D | | | | | | | +--+---------+ +-+-Domain#4-+ | | +-+--------------+-+ | | | | | G--------------H | | | +-----Domain#3-----+

5. 66th IETF Montreal July 2006 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 of above (and plus some) elements, list 12 schemes (in broad category)

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

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

8. 66th IETF Montreal July 2006 Outstanding Issues How about domain level diversity? How about mixture of recovery techniques? Is this right time to start in depth comparison of various techniques? Is there anything else we may want to cover?

9. 66th IETF Montreal July 2006 Next Steps Specify the scope of this document more clearly Respin based on the specified scope (+ some nits) Comments are highly appreciated Aim is to ask for WG document after the next revision