Evolution of Path Computation Towards Generalized Resource Computation Adrian Farrel Old Dog Consulting

Slides:



Advertisements
Similar presentations
CCAMP WG, IETF 80th, Prague, Czech Republic draft-gonzalezdedios-subwavelength-framework-00 Framework for GMPLS and path computation support of sub-wavelength.
Advertisements

CURRENT APPROACH FOR NETWORK PROVISIONING Umbrella Provisioning System
Application-Based Network Operations (ABNO) IETF 88 – SDN RG
A New Paradigm for Inter-Domain Traffic Engineering Adrian Farrel Juniper Networks
NEW OUTLOOK ON MULTI-DOMAIN AND MULTI-LAYER TRAFFIC ENGINEERING Adrian Farrel
The Impact of SDN On MPLS Networks Adrian Farrel Juniper Networks
An Architecture for Application-Based Network Operations Adrian Farrel - Old Dog Consulting Daniel King –
Page th IETF – Vancouver, December 2007 PCEP Requirements and Extensions for the support of Wavelength Switched Optical Networks (WSON) Young
Research on Wavelength Switched Optical Networks for the Next 10 years ICT Session 1 of PhD Academy Xin WANG TANAKA Lab. Waseda University Oct. 05, 2011.
Grant agreement n° SDN architectures for orchestration of mobile cloud services with converged control of wireless access and optical transport network.
ITU-T Workshop “NGN and its Transport Networks“ Kobe, April 2006 International Telecommunication Union ITU-T Introduction to the Path Computation.
An evolutionary approach to G-MPLS ensuring a smooth migration of legacy networks Ben Martens Alcatel USA.
SDN and Openflow.
Towards Virtual Routers as a Service 6th GI/ITG KuVS Workshop on “Future Internet” November 22, 2010 Hannover Zdravko Bozakov.
Old Dog Consulting Multi-Segment Pseudowires: Recognising the Layer Network Adrian Farrel Old Dog Consulting.
OLD DOG CONSULTING Traffic Engineering or Network Engineering? The transition to dynamic management of multi-layer networks Adrian Farrel Old Dog Consulting.
Old Dog Consulting PCEP - A Protocol for All Uses? How and when to extend an existing protocol Adrian Farrel Old Dog Consulting
Óscar González de Dios PCE, the magic component of Segment Routing Telefónica I+D.
Transport SDN: Key Drivers & Elements
Abstraction and Control of Transport Networks (ACTN) BoF
Omniran IEEE 802 Scope of OmniRAN Date: Authors: NameAffiliationPhone Max RiegelNSN
1 Multi-Protocol Label Switching (MPLS) presented by: chitralekha tamrakar (B.S.E.) divya krit tamrakar (B.S.E.) Rashmi shrivastava(B.S.E.) prakriti.
Should I Migrate My MPLS-TE Network to GMPLS. And if so, how
Next Steps in Path Computation Element (PCE) Architectures: From Software Defined Concepts to Standards, Interoperability and Deployment CSA FP7 ICT Call.
PACE Workshop on New Uses of PCE Key Points Arising Notes from the PACE Workshop Vilanova i La Geltú 16 June 2014.
Interface to the Routing System
1 High-Level Carrier Requirements for Cross Layer Optimization Dave McDysan Verizon.
1 Using Multi-Layer Routing to Provision Services across MPLS/GMPLS Domain Boundaries Andrew G. Malis Chief Technologist, Tellabs Chairman and President,
A PRESENTATION “SEMINAR REPORT” ON “ GENERALIZED MULTIPROTOCOL LABEL SWITCHING“
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Software Defined Networks for Dynamic Datacenter and Cloud Environments.
69th IETF Chicago July 2007 An analysis of scaling issues in MPLS-TE backbone networks Seisho Yasukawa, Adrian Farrel, and Olufemi Komolafe draft-yasukawa-mpls-scaling-analysis-04.txt.
Vision of the Future Our second open discussion Clearly takes input from the earlier session Anything is possible – What might a PCE-enabled future look.
NET 324 D Networks and Communication Department Lec1 : Network Devices.
1 | © 2015 Infinera Open SDN in Metro P-OTS Networks Sten Nordell CTO Metro Business Group
Network Computing Services, Inc. Real-Time Visualization of IP Streams over Switched WANs Real-Time Visualization of IP Streams Over Switched WANs Timothy.
IETF-74, San Francisco, March 2009 PCE Working Group Meeting IETF-74, March 2009, San Francisco Online Agenda and Slides at:
Omniran IEEE 802 Scope of OmniRAN Date: Authors: NameAffiliationPhone Max RiegelNSN
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
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.
66th IETF, Montreal, July 2006 PCE Working Group Meeting IETF-66, July 2006, Montreal A Backward Recursive PCE-based Computation (BRPC) procedure to compute.
Page th IETF – Dublin, Ireland, July 2008 Performance Evaluation of PCE Architectures for Wavelength Switched Optical Networks Editors: Greg
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.
© 2013, CYAN, INC. 11 Software Defined Metro Networks TNC2013 Virtualization and Innovation Robin Massey SE Manager EMEA
Leveraging SDN for The 5G Networks: Trends, Prospects and Challenges ADVISOR: 林甫俊教授 Presenter: Jimmy DATE: 2016/3/21 1.
GMPLS UNI Best Current Practices draft-beeram-ccamp-gmpls-uni-bcp-00.txt V.Beeram, I.Bryskin, W.Doonan (ADVA Optical Networking) J.Drake, G.Grammel (Juniper.
The Role of the Path Computation Element Centralized Controller in SDN & NFV draft-zhao-teas-pce-central-controller-use-cases-00.txt draft-zhao-pce-pcep-extension-for-pce-controller-03.txt.
Next Steps in Path Computation Element (PCE) Architectures: From Software Defined Concepts to Standards, Interoperability and Deployment CSA FP7 ICT Call.
MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.
Towards more flexible networks -- backyard of IMT Takashi Egawa NEC Corporation Rapporteur, Q.14, SG13 1.
67th IETF - San Diego, CA, USA November 8, 2006 PCECP Requirements for support of Global Concurrent Optimization Y. Lee, Huawei, D. King, Aria Networks,
Software Defined Networking BY RAVI NAMBOORI. Overview  Origins of SDN.  What is SDN ?  Original Definition of SDN.  What = Why We need SDN ?  Conclusion.
SDN Traffic Engineering with Segment Routing The Next Evolution
An evolutionary approach to G-MPLS ensuring a smooth migration of legacy networks Ben Martens Alcatel USA.
University of Maryland College Park
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Adrian Farrel : Old Dog Consulting
Requirements for Ring Protection in MPLS-TP
Architecture for Scheduled Use of Resources draft-zhuang-teas-scheduled-resources-00 Yan Zhuang Qin Wu
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
SWITCHING Switched Network Circuit-Switched Network Datagram Networks
PhD candidate: Shuna Yang Department of Telematics, NTNU, Norway
به نام خدا Big Data and a New Look at Communication Networks Babak Khalaj Sharif University of Technology Department of Electrical Engineering.
Carlos J. Bernardos, Alain Mourad, Akbar Rahman
IEEE 802 Scope of OmniRAN Abstract
In-network computation
Discussion Issues on IMS-based NGN
Presentation transcript:

Evolution of Path Computation Towards Generalized Resource Computation Adrian Farrel Old Dog Consulting

History of PCE We know where PCE comes from – Simple CSPF computation of paths for MPLS-TE But RFC 4655 was not quite so limited in its definition an entity that is capable of computing a network path or route based on a network graph, and of applying computational constraints during the computation

Evolution In keeping with that definition PCE has evolved The complexity of path computation that PCE was asked to perform extended rapidly – Multiple paths (global concurrent optimization, SVEC list) – Point to multipoint – More complex constraints and objectives DiffServ, exclude route, vendor constraints Images probably copyright Nintendo or someone, but no charge is made for advertising

Taking Other Things into Account Paths and networks have all sorts of attributes and characteristics A PCE can specialise – Optical networks Wavelength continuity Limited switching capabilities Optical impairments – Multi-layer networks

Beyond a Passive Server Original implementations were passive servers – They respond to queries, but do nothing else Two additional functions wanted by operators – Tell us changes we could make to existing paths Stateful – Tell us about new LSPs we could set up “Advisory” Quickly evolves to active control of the network Still with primary function of computing paths

Paths for Different Purposes A path is a path is a path – It is just a route through a network But what travels on the path? – Packets and frames MPLS, Ethernet, Segment Routing – Optical signals TDM, ASON, WSON – Utilities Cars, trains, electricity, water, sewerage

PCE in SDN We all love shiny things – Today’s sparkle is called SDN – So we need to see where PCE fits Recall that the essence of SDN is programmatic control of the network – Centralised decision-making – Decouple control and data planes – Application-aware network usage – Smart software is in charge That sounds a lot like PCE – And see the Application-Based Network Operation (ABNO) architecture [RFC 7491]…

Active PCE with a Control Plane PCE TED Orchestrator / ABNO Controller Compute how to provide a connection – Instruct the head end to signal the connection

PCE as the SDN Controller Compute how to provide a connection – Instruct the network PCE TED Orchestrator / ABNO Controller

PCE as the SDN Orchestrator Determine what connections are needed Compute how to provide the connections – Instruct the network ABNO Controller PCE TED Applications

Placing / Enabling Resources A PCE can see what connections cannot be set up – Hence, what services cannot be delivered This is a pre-emptive path computation function So a PCE can help the operator – Enable out-of-service resources to be turned on “just in time” – Work out where to add links and nodes to support future traffic demands This makes PCE a network planning tool It can also be used to coordinate resources to build virtual networks – Network slicing – Setting up paths through server networks See Abstraction and Control of Transport Networks (ACTN) draft-ceccarelli-actn-framework – TE abstraction draft-ietf-teas-interconnected-te-info-exchange

What is a Resource? Are we clear what a network resource is? – Node (switch, router) – Link (fiber, copper, channel, virtual link, tunnel) – Buffers, bandwidth, timeslot, optical channel … resource [ree-sawrs, -sohrs, -zawrs, -zohrs, ri-sawrs, -sohrs, -zawrs, -zohrs] noun a source of supply, support, or aid, especially one that can be readily drawn upon when needed* So what about other resources? – Servers, CPU, rack space, power consumption, radio channels, mobile cells … – Can PCE make informed decisions related to these resources? *

PCE in SFC A service function chain is a path – Nodes are service functions on their specific service function nodes – Links are the tunnels between those nodes Path computation is about selecting – Which functions and in which order according to the needs of the traffic – Which service function node to use to realize the function – Which tunnels to use to link the service function nodes Additional constraints will include an understanding of – The size of the traffic flow – The bandwidth available for the various tunnels – The processing load and capabilities of the service function nodes

PCE in NFV In Network Function Virtualization the service functions are instantiated as software instances on servers in data centers (the cloud) The Service Function Chains still need to be built based on knowledge of loads and capabilities However, new service functions can be instantiated to handle current or predicted loads Who makes the decisions? – What are the predicted demands? – What new service function instantiations are needed? – Where should they be placed? These decisions are like the decisions used to create a virtual network utilising resources in a server network by building connections and presenting them as links

Generalized Resource Computation We see that there are many decisions in networking about the consumption and placement of resources These decisions are related to path computation – But they are not pure path computation issues There is a set of computation problems that select resources for use, activation, or placement in support of network services What engine performs these computations? – Is it a new server? – Is it PCE with new capabilities? – Is it new function but bundled with a PCE, and if so, what will be call it?

What Defines a PCE? Where do we go for an authoritative definition? – Perhaps RFC 4655 – Perhaps defined by the use of PCEP How do we know who is authoritative? – Perhaps the IETF But if I write some software that does generalized resource computation and I call it “OldDogCrop PCE” is it a PCE?

If We Change What a PCE Does is it Still a PCE? I really don’t want to invoke Wittgenstein, but… We can cause a lot of confusion by calling things by the wrong name – But we might be saved by the abbreviation, PCE – Provisioning Computation Element ?

Where Does that Leave Us? I have two unicorns Do I know what they are doing when I’m not watching? Do I know what they are for? Do I know their limits and capabilities? Can I teach them new tricks? Or should I invest in a griffon? Percy the PCE Unicorn Sidney the SDN Unicorn The Griffon of Pisa

Questions?