OSPF TE Extension for Area IDs draft-lu-ospf-area-tlv-00.txt IETF 80 - Prague, Czech Republic March 27 – April 1, 2011 Wenhu Lu.

Slides:



Advertisements
Similar presentations
Page - 1 Stateful PCE Kexin Tang Xuerong Wang Yuanlin Bao ZTE Corporation draft-tang-pce-stateful-pce-01.txt.
Advertisements

RSVP-TE extensions for dynamic hostname traversing OSPF routing areas draft-zheng-ccamp-rsvp-te-dynamic-hostname-00 Zhi Zheng,
LDP extensions for Explicit Pseudowire to transport LSP mapping draft-cao-pwe3-mpls-tp-pw-over-bidir-lsp-02.txt Mach Chen Wei Cao.
Page 1 iPOP2009, Tokyo, Japan Selecting Domain Paths in Inter-Domain MPLS-TE and GMPLS Adrian Farrel, Old Dog Consulting Daniel King, Old Dog Consulting.
OSPF WG - IETF 66 OSPF Protocol Evolution WG Re-Charter Acee Lindem/Cisco Systems.
OSPF Two-part Metrics Jeffrey Zhang Lili Wang Juniper Networks 88 th IETF, Vancouver.
OSPF TE Topology-Transparent Zone draft-chen-ospf-te-ttz-00 Huaimo Chen Renwei Li Gregory Cauchie
Requirement and protocol for WSON and non-WSON interoperability CCAMP WG, IETF 81th, Quebec City, Canada draft-shimazaki-ccamp-wson-interoperability-00.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Multiarea OSPF Scaling Networks.
Draft-ospf-non-compatible Mike Dubrovsky. The draft addresses the following problem: Problem: How to introduce non-backward compatible functionality into.
82 nd IETF – Taipei, Taiwan, November 2011 GMPLS OSPF Enhancement for Signal and Network Element Compatibility for Wavelength Switched Optical Networks.
Draft-li-ccamp-auto-mbb-te-path-00IETF 88 CCAMP1 IGP Extensions for Automatic Computation of MPLS Traffic Engineering Path Using Traffic Engineering Layers.
IETF 68 Prague: draft-dolganow-ospf-pwe3-ms-pw-ext authors: Alex Zinin (Alcatel-Lucent) Andrew Dolganow (Alcatel-Lucent) Dimitri Papadimitriou (Alcatel-Lucent)
Extensions to OSPF-TE for Inter-AS TE draft-ietf-ccamp-ospf-interas-te-extension-01.txt Mach Renhai
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
ZTE CORPORATION Extensions of BRPC and PCEP to Support Inter- AS Bidirectional LSP Path Computation draft-wang-pce-inter-as-extentions-00 Xuerong.
1 Multi Topology Routing for OSPFv3 (draft-mirtorabi-mt-ospfv3-00.txt) Sina Mirtorabi
Relayed CSPF for Multi-Area Multi-AS PCE draft-lu-relayed-cspf-00.txt IETF 79 - Beijing, China November 7-12, 2010 Wenhu Lu, Sriganesh Kini, Srikanth Narayanan.
Simplified Extension of LSP Space for IS-IS draft-ietf-isis-wg-extlsp-00.txt Les Ginsberg Stefano Previdi Mike Shand.
1 IETF-61 – Washington DC Path Computation Element (PCE) BOF-2 Status - CCAMP Co-chairs: JP Vasseur/Adrian Farrel ADs: Alex Zinin/Bill Fenner.
OSPF Extensions for ASON Routing draft-ietf-ccamp-gmpls-ason-routing-ospf-02.txt IETF67 - San Diego - Nov’06 Dimitri Papadimitriou (Alcatel)
1 Role based Auto Mesh IETF86 CCAMP Mar Orlando draft-li-ccamp-role-based-automesh-00.
MPLS WG1 Targeted mLDP Base mLDP spec didn’t consider use of LDP multipoint extensions over Targeted mLDP sessions LDP speaker must choose “upstream LSR”,
Extensions to OSPFv2 for Advertising Optional Route/Link Attributes draft-mirtorabi-ospf-tag-00.txt Sina Mirtorabi
Inter-area MPLS TE Architecture and Protocol Extensions
Cisco Confidential © 2010 Cisco and/or its affiliates. All rights reserved. 1 draft-pillay-esnault-ospf-service-distribution-00.txt Padma Pillay-Esnault.
Limit for content Do not exceed Limit for content Do not exceed Limit for content Do not exceed Limit for content Do not exceed Page 1 © The.
1 OSPF Based L1VPN Auto-Discovery ( draft-bryskin-l1vpn-ospf-auto-discovery-00.txt ) Igor Bryskin (Movaz Networks) : Lou Berger (LabN.
66th IETF, Montreal, July 2006 PCE Working Group Meeting IETF-66, July 2006, Montreal A Backward Recursive PCE-based Computation (BRPC) procedure to compute.
PCE Database Requirements draft-dugeon-pce-ted-reqs-02.txt O. Dugeon, J. Meuric (Orange) R. Douville (Alcatel-Lucent) R. Casellas (CTTC) O.D de Dios (TiD)
Forward-Search P2P TE LSP Inter- Domain Path Computation draft-chen-pce-forward-search-p2p-path-computation Huaimo Chen
Extensions to PCEP for Hierarchical Path Computation Elements PCE draft-zhang-pcep-hierarchy-extensions-00 Fatai Zhang Quintin Zhao.
OIF Liaison on Routing IETF 75 – Stockholm – Jul ‘09 L. Ong (Ciena)
66th IETF meeting, July 2006 Extensions to the OSPF Management Information Base in support of GMPLS Extensions to the OSPF Management Information Base.
The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS & GMPLS draft-ietf-pce-hierarchy-fwk-00.txt.
The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS & GMPLS draft-king-pce-hierarchy-fwk-01.txt.
Draft-psenak-ospf-segment-routing-ospf-extension-03 draft-psenak-ospf-segment-routing-ospfv3-extension-00 IETF 88, November 3-8, 2013 P. Psenak, S.Previdi,
OSPF Link Overload draft-hegde-ospf-link-overload Shraddha Hegde Hannes Gredler Pushpasis Sarkar.
Extensions to Path Computation Element Communication Protocol (PCEP) for Hierarchical Path Computation Elements (PCE) PCE WG, IETF 86th draft-zhang-pce-hierarchy-extensions-03.
60th IETF, San Diego, August 2004 OSPF MPLS Traffic Engineering capabilities draft-vasseur-ospf-te-caps-00.txt Jean-Philippe Vasseur
Konstantin agouros Omkar deshpande
Zhenbin Li, Kai Lu Huawei Technologies IETF 98, Chicago, USA
IETF 67, MPLS WG, San Diego 11/08/2006
Connections and Accesses for Hierarchical PCE
PCE Working Group Meeting IETF-67, November 2006, San Diego
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Multi Topology Routing (MTR) for OSPF
Load Sharing (pages ) Can be equal cost or unequal-cost
Advertising Encapsulation Capability Using OSPF
A Scalable Multipath Algorithm in Hierarchical MPLS Networks
OSPF Extensions for ASON Routing draft-ietf-ccamp-gmpls-ason-routing-ospf-03.txt IETF67 - Prague - Mar’07 Dimitri.
Explicitly advertising the TE protocols enabled on links in OSPF
Chapter 9: Multiarea OSPF
Explicitly advertising the TE protocols enabled on links in ISIS
Signaling RSVP-TE P2MP LSPs in an Inter-domain Environment draft-ali-mpls-inter-domain-p2mp-rsvp-te-lsp-01.txt Zafar Ali, Cisco Systems.
OSPF & ISIS Flooding Reduction
draft-ietf-ospf-lls-interface-id-01
Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde
Chapter 9: Multiarea OSPF
Routing With a Link-State Protocol
draft-barth-pce-association-bidir-01
draft-gandhi-pce-pm-07
Chapter 9: Multiarea OSPF
draft-ietf-ospf-lls-interface-id-00
Standard Representation Of Domain Sequence
ISIS Extensions for FlexE Link Advertisement
Link State(LS) Flooding Reduction
draft-ietf-ospf-te-link-attr-reuse-04
Inter-AS OAM for SR Networks IETF 105, Montreal
Presentation transcript:

OSPF TE Extension for Area IDs draft-lu-ospf-area-tlv-00.txt IETF 80 - Prague, Czech Republic March 27 – April 1, 2011 Wenhu Lu

Agenda Background The Need of TE-ABRs Area-ID TLV Applications

Background The need for inter-area LSPs BN (Border nodes) = ABR-LSRs BN1 HT BN2 BN3

Solutions Global TED – Too big, negating the purpose of having multiple areas or ASes; – violates the information hiding and confidentiality requirement and is unacceptable by ISPs Crankback – Probe a list of ABRs till a PATH is viable – But need to know ABRs – configure ? RBPC – RFC5441 – Find an optimal path – Still need to know ABRs

PCE Development RFC 5088 – OSPF Extension for PCE Discovery – In Rtr Info LSA space; – Scopes: inter-area; inter-as – For locating PCEs, NOT LSRs

RFC 3630 – OSPF TE Extension Area scope TE database; – Opaque to OSPF – No idea of TE-ABRs They are area exit LSRs Good for finding intra-area LSPs

The proposal The ABR info is easily acquirable Fig: A,B,C,D,E in backbone – A,C,D,E are ABRs West A---B---C East |\ D E South Figure 1: Sample Topology

Area ID TLV To add under RFC 3630 section 2.4 At most 1 Area ID TLV Type – Area ID TLV (TBD: 3) Len – 4xn, n is the number of exit areas – Eg: D has 1 exit area south, provided that its link to south is also TE enabled | Type | Len | Area-ID | | Area-ID (Cont) | Another Area-ID | | Another Area-ID (Cont) | | | More Area-ID | | | // // | |

Example Assume router F connects to four areas – Area 0, 1, 2, and 3 – Assume area 2 is not TE-enabled It advertise following Area-ID TLVs – To area 0: | 3| 8| | | – To area 1: | 3| 8| | | – To area 2: None – To area 3: | 3| 8| | |

Application Area ID TLVs give CSPF (PCE) knowledge of TE- ABR info. – It can automate the crankback process Replacing manual configuration – Any algorithm (BRPC) that needs exit LSRs It is backward compatible

Thank You