PCE – Path Computation Element IETF 97 Hackathon

PCE Path Computation Element – an integral part of any network controller. Path Computation LSP Creation and Updation from the PCE (stateful) PCECC – PCE as Central Control Communicate with all nodes PCEP as SBI protocol Ideal for SDN Transition and introducing SDN concepts into current network using existing protocols At this Hackathon Scheduling for TE Resources LSP Control Request from PCE Participation – Satish/Dhruv (Huawei); Aijun Wang (China Telecom); Bin Young Yoon (ETRI); Jongyoon Shin (SKT) IETF 97 Hackathon, Seoul

Scheduling The ability to schedule future reservations of TE resources. Multiple options were discussed (in the WG) consensus on central control via PCE We added support for setting up an LSP at a particular time and torn down after an interval. Recurrence daily / weekly / monthly Discussion on the Data Structure for maintaining time based DB Further optimization planned Though implementation specific – some guidance could be provided in the architecture document TEAS WG draft-ietf-teas-scheduled-resources To be uploaded when the floodgates open tonight! PCE WG draft-zhuang-pce-stateful-pce-lsp-scheduling-03 IETF 97 Hackathon, Seoul

Scheduling Configuration Query Huawei Sandbox IETF 97 Hackathon, Seoul

LSP Control Request Multiple instances can be clubbed together in cluster in ONOS for scalability and redundancy. On primary PCE (instance) failure, it is up to the PCC to re-delegate to a standby PCE. But PCC do not know which is the new “master” The new master (PCE) can request control of one or more LSPs from a PCC PCE (on WG agenda) draft-raghu-pce-lsp-control-request-01 Will provide implementation section to the draft PCEs among themselves could have a suitable algorithm to decide which PCE takes control PCE Request control Also applicable when vPCE (virtual PCE) as VNFs would load balance the LSPs among themselves for scalability IETF 97 Hackathon, Seoul