Extensions to PCEP for Hierarchical Path Computation Elements PCE draft-zhang-pcep-hierarchy-extensions-00 Fatai Zhang Quintin Zhao.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Page - 1 Stateful PCE Kexin Tang Xuerong Wang Yuanlin Bao ZTE Corporation draft-tang-pce-stateful-pce-01.txt.
RSVP-TE Extensions for SRLG Configuration of FA
PCEP extensions for GMPLS
Extensions to the Path Computation Element Communication Protocol (PCEP) for Point-to-Multipoint Traffic Engineering Label Switched Paths draft-ietf-pce-pcep-p2mp-extensions-05.txt.
Page - 1 Stateful PCE Kexin Tang Wang Xuerong Cao Xuping ZTE Corporation draft-tang-pce-stateful-pce-02.txt.
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.
Extensions to PCEP for Distributing Label across Domains draft-chen-pce-label-x-domains-00 Huaimo Chen Autumn Liu
Border Gateway Protocol Ankit Agarwal Dashang Trivedi Kirti Tiwari.
Announcements List Lab is still under construction Next session we will have paper discussion, assign papers,
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
OSPF To route, a router needs to do the following: Know the destination address Identify the sources it can learn from Discover possible.
TCP/IP Protocol Suite 1 Chapter 14 Upon completion you will be able to: Unicast Routing Protocols: RIP, OSPF, and BGP Distinguish between intra and interdomain.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Draft-li-mpls-global-label-framework-02IETF 90 MPLS WG1 A Framework of MPLS Global Label draft-li-mpls-global-label-framework-02 Zhenbin Li, Quintin Zhao,
PCEP extensions for the computation of route offers with price draft-carrozzo-pce-pcep-route-price-00 G. Carrozzo, G. Bernini, G. Landi {g.carrozzo, g.bernini,
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.
Forward-Search P2P/P2MP TE LSP Inter-Domain Path Computation draft-chen-pce-forward-search-p2p-path-computation draft-chen-pce-forward-search-p2mp-path.
82 nd IETF – Taipei, Taiwan, November 2011 Extensions to Path Computation Element Communication Protocol (PCEP) for Hierarchical Path Computation Elements.
Path Computation Element (PCE) Discovery using Domain Name System(DNS) draft-wu-pce-dns-pce-discovery-04 Qin Wu ) Dhruv Dhody
PCE-based Computation Procedure To Compute Shortest Constrained P2MP Inter-domain Traffic Engineering Label Switched Paths draft-zhao-pce-pcep-inter-domain-p2mp-procedures-02.txt.
PCE Traffic Engineering Database Requirements draft-dugeon-pce-ted-reqs-01.txt O. Dugeon, J. Meuric (France Telecom / Orange) R. Douville (Alcatel-Lucent)
1 IETF-81, MPLS WG, Quebec City, Canada, July, 2011 draft-ali-mpls-inter-domain-p2mp-rsvp-te-lsp-06.txt MPLS WG IETF-81 Quebec City, Canada July, 2011.
PCE-based Computation for Inter-domain P2MP LSP draft-zhao-pce-pcep-inter-domain-p2mp-procedures-00.txt Quintin Zhao, Huawei Technology David Amzallag,
Routing in the Inernet Outcomes: –What are routing protocols used for Intra-ASs Routing in the Internet? –The Working Principle of RIP and OSPF –What is.
Extensions to the Path Computation Element Communication Protocol for Enhanced Errors and Notifications draft-pouyllau-pce-enhanced-errors-03 H. Pouyllau.
Inter-AS PCE Requirements draft-bitar-zhang-interas-PCE-req-01.txt Nabil Bitar (Verizon) Dean Cheng (Cisco) Kenji Kumaki (KDDI) Raymond Zhang (BT Infonet)
66th IETF, Montreal, July 2006 PCE Working Group Meeting IETF-66, July 2006, Montreal A Backward Recursive PCE-based Computation (BRPC) procedure to compute.
Extension to the Path Computation Element Communication Protocol for Enhanced Errors and Notifications draft-pouyllau-pce-enhanced-errors-02 H. Pouyllau.
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 P2MP TE LSP Inter- Domain Path Computation draft-chen-pce-forward-search-p2mp-path Huaimo Chen
Forward-Search P2P TE LSP Inter- Domain Path Computation draft-chen-pce-forward-search-p2p-path-computation Huaimo Chen
Requirements for PCE Discovery draft-leroux-pce-discovery-reqs-00.txt Jean-Louis Le Roux (France Telecom) Paul Mabey (Qwest) Eiji Oki (NTT) Ting Wo Chung.
Extension to the Path Computation Element Communication Protocol for Enhanced Errors and Notifications draft-pouyllau-pce-enhanced-errors-01 H. Pouyllau.
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-chen-rtgwg-resource-management-yang-00IETF 94 RTGWG1 PCE-initiated IP Tunnel draft-chen-pce-pce-initiated-ip-tunnel-00 Xia Chen, Zhenbin Li(Huawei)
Support for RSVP-TE in L3VPNs Support for RSVP-TE in L3VPNs draft-kumaki-murai-ccamp-rsvp-te-l3vpn-01.txt Kenji Kumaki KDDI Corporation Tomoki Murai Furukawa.
Extensions to Path Computation Element Communication Protocol (PCEP) for Hierarchical Path Computation Elements (PCE) PCE WG, IETF 84 draft-zhang-pce-hierarchy-extensions-02.
Extensions to Path Computation Element Communication Protocol (PCEP) for Hierarchical Path Computation Elements (PCE) PCE WG, IETF 86th draft-zhang-pce-hierarchy-extensions-03.
Segment Routing Traffic Engineering
PCEP extensions for GMPLS CCAMP WG, IETF 79th, Beijing, China draft-ietf-pce-gmpls-pcep-extensions-01 Cyril Margaria Nokia Siemens Networks Oscar González.
Path Computation Element (PCE) Discovery using Domain Name System(DNS) draft-wu-pce-dns-pce-discovery-07 Qin Wu ) Dhruv Dhody
Konstantin agouros Omkar deshpande
BGP extensions for Path Computation Element (PCE) Discovery in a BGP/MPLS IP-VPN draft-kumaki-pce-bgp-disco-attribute-03.txt Kenji Kumaki KDDI R&D Labs,
PCE-based Computation Procedure for P2MP Inter-domain TE LSP draft-zhao-pce-pcep-inter-domain-p2mp-procedures-06 Quintin Zhao, Zafar.
draft-patel-raszuk-bgp-vector-routing-01
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Connections and Accesses for Hierarchical PCE
OSPF (Open Shortest Path First)
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
PCEP Extensions For Transporting Traffic Engineering (TE) Data
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Path Computation Element (PCE) Discovery using Domain Name System(DNS) draft-wu-pce-dns-pce-discovery-03 Qin Wu ) Dhruv Dhody
PCEP Extension for Native IP ietf
Guard Bands requirements for GMPLS controlled optical networks
LDP Extensions for RMR draft-esale-mpls-ldp-rmr- extensions
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.
draft-ietf-pce-pcep-mib-03 Jon Hardwick (presenting)
Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde
IETF South Korea PCEP Link-State extensions for Segment Routing draft-li-pce-pcep-ls-sr-extension-01 Zhenbin Li (Huawei) Xia Chen (Huawei) Nan.
draft-barth-pce-association-bidir-01
Computer Networks Protocols
Standard Representation Of Domain Sequence
PCEP extensions for GMPLS
Presentation transcript:

Extensions to PCEP for Hierarchical Path Computation Elements PCE draft-zhang-pcep-hierarchy-extensions-00 Fatai Zhang Quintin Zhao Oscar Gonzalez de Dios Ramon Casellas Daniel King IETF 79 - Beijing

Objective of the document This document defines the PCEP extensions for the purpose of implementing Hierarchical PCE (H-PCE) procedures described in [PCE-HIERARCHY-FWK]. Specifically, the document describes the following new PCEP extensions and procedures to support H-PCE: – Capability Discovery – Domain Connectivity Collection – Objective Functions – RP Objects – Error Handling – Endpoint localization/reachability [PCE-HIERARCHY-FWK] draft-king-pce-hierarchy-fwk-05draft-king-pce-hierarchy-fwk-05 IETF 79 - Beijing

H-PCE Refresher The parent PCE maintains a topology map. – The nodes are the child domains. – The map contains the inter-domain links. – The TE capabilities of the links are also known. The parent PCE knows the identity and location of the child PCEs responsible for the child domains. – Statically configured or dynamically discovered. Responsible child PCE’s will compute: – Source-to-edge (e.g., Domain 1) – Edge-to-edge (e.g., Domain 2) – Edge-destination (e.g., Domain 3) Domain confidentiality. – A parent PCE is aware of the topology and connections between domains, but is not aware of the contents of the domains. – Child domains are completely confidential. IETF 79 - Beijing

Capability Discovery A PCE (child or parent) domain is a single domain with one or more associated PCE. It is possible for a child PCE to be responsible for multiple domains. The PCE (child or parent) domain may be an IGP area or AS. The child PCE and parent PCE relationship will be configured statically. During the PCEP session establishment procedure, the child PCE needs to verify that the parent PCE is capable of H-PCE computations. No further automated discovery is required, or desired. IETF 79 - Beijing

Domain Connectivity Collection A parent PCE can populate its topology map either from static configuration or from information received from each child PCE. There are two types of domain borders for inter-domain connectivity: – Domain border is a TE link, e.g., the inter-AS TE link which connects two ASs. – Domain border is a node, e.g., the IGP ABR which connects two IGP areas. If a child PCE needs to notify the parent PCE of its inter-domain link connectivity, the relevant information is required to be sent to the parent PCE. IETF 79 - Beijing

Objective Functions Deriving the optimal end-to-end domain path sequence is dependent on the policy applied during domain path computation. An Objective Function (OF) [RFC5541], or set of OFs, may be applied to define the policy being applied to the domain path computation. There are three new objective functions which are defined in [PCE-HIERARCHY-FWK]: – Minimize the number of boundary nodes used. – Limit the number of domains crossed. – Disallow domain re-entry. The child PCE can specify which existing, or new, objective function code(s) to use. [PCE-HIERARCHY-FWK] draft-king-pce-hierarchy-fwk-05draft-king-pce-hierarchy-fwk-05 IETF 79 - Beijing

RP Objects Domain Path Request bit – If a child PCE requests the domain sequence for a multi-domain path computation, it can set the Domain Path Request bit in the RP object carried in a request within a PCReq message. The parent PCE which receives the request will attempt to compute a domain sequence. Destination Domain Query bit – If the parent PCE wishes to get the destination domain ID it will use this bit. – Alternative: “CIDR Prefixes announcement” If the domain path computation succeeds, the parent PCE sends a PCRep message, which carries the domain sequence in the ERO to the child PCE. Domain Connectivity Information notification-type – Once the session between the child PCE and parent PCE is established, the following notification can be used to maintain topology and connectivity information. IETF 79 - Beijing

RP Objects (Continued) Inter-domain Link TLV – Each inter-domain link is identified by a combination of its advertised router ID and the link local IP address or link local unnumbered identifier. Inter-domain Node TLV – The Inter-domain Node TLV carries only the two adjacent domain ID and the router (IGP ABR) ID.  Note: a node may belong to 3 or more domains. Alternative: (D1, N), (D2, N), (D3,N)  N Belongs to D1, D2, D3 Domain-ID TLV – This TLV can be carried in a NOTIFICATION or OPEN object to indicate the domain ID of the PCE who sent the PCNtf/Open message. PCE-ID TLV – This TLV can be carried in a NOTIFICATION or OPEN object to indicate the PCE ID of the PCE who sends the PCNtf/Open message. IETF 79 - Beijing

Error Handling PCEP Error-Type 11 – A parent PCE may not be not be configured to accept H-PCE requests from a specific child PCE. IETF 79 - Beijing

Next Steps This is a 00 draft, we would gladly like feedback. All areas remain open for discussion, but especially: – Do we need adjacencies between child PCEs? – Should the child and parent PCE have persistent PCEP session? – The format of PCEP extensions, including PCE-IDs and Domain-IDs (IPv4 and IPv6). – Endpoint location: polling or announcement? – The construction of a TED at the parent PCE. – Additional error cases and procedures. Anyone else implementing? – We are aware of two early implementations. Awaiting WG recharter to include H-PCE work. IETF 79 - Beijing