A New Paradigm for Inter-Domain Traffic Engineering Adrian Farrel Juniper Networks

Slides:



Advertisements
Similar presentations
Using Network Virtualization Techniques for Scalable Routing Nick Feamster, Georgia Tech Lixin Gao, UMass Amherst Jennifer Rexford, Princeton University.
Advertisements

1 Rate and distance fairness in OBS networks Tananun Orawiwattanakul, Yusheng Ji.
MPLS and GMPLS Li Yin CS294 presentation.
Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
Multihoming and Multi-path Routing
APNOMS03 1 A Resilient Path Management for BGP/MPLS VPN Jong T. Park School of Electrical Eng. And Computer Science Kyungpook National University
CCAMP WG, IETF 80th, Prague, Czech Republic draft-gonzalezdedios-subwavelength-framework-00 Framework for GMPLS and path computation support of sub-wavelength.
RSVP-TE Extensions for SRLG Configuration of FA
1 Introducing the Specifications of the Metro Ethernet Forum.
G : DCM Signaling Mechanism Using GMPLS RSVP-TE ITU-T Workshop on IP-Optical, Chitose, Japan 7/11/2002 Dimitrios Pendarakis, Tellium, Inc. ITU-T.
MPLS VPN.
All rights reserved © 2005, Alcatel Grid services over IP Multimedia Subsystem  Antoine Pichot, Olivier Audouin, Alcatel  GridNets ’06.
Video Services over Software-Defined Networks
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v MPLS VPN Technology Introducing MPLS VPN Architecture.
S Licentiate course on Telecommunications Technology (4+1+3 cr.) Course Topic Spring 2000: Routing Algorithms in the DiffServ MPLS Networks Introduction.
Application-Based Network Operations (ABNO) IETF 88 – SDN RG
Limit for content Do not exceed Limit for content Do not exceed Limit for content Do not exceed Limit for content Do not exceed 1 Aria Networks Multi-domain.
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.
NEW OUTLOOK ON MULTI-DOMAIN AND MULTI-LAYER TRAFFIC ENGINEERING Adrian Farrel
The Impact of SDN On MPLS Networks Adrian Farrel Juniper Networks
Copyright © 2004 Juniper Networks, Inc. Proprietary and Confidentialwww.juniper.net 1 E-VPN and Data Center R. Aggarwal
An Architecture for Application-Based Network Operations Adrian Farrel - Old Dog Consulting Daniel King –
All Rights Reserved © Alcatel-Lucent 2006, ##### Scalability of IP/MPLS networks Lieven Levrau 30 th April, 2008 France Telecom, Cisco Systems, uawei Technologies,
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.
Problem Statement and Architecture for Information Exchange Between Interconnected Traffic Engineered Networks draft-farrel-interconnected-te-info-exchange-03.txt.
IPOP2009, Tokyo, Japan Old Dog Consulting Network Virtualisation for Packet Optical Networks Adrian Farrel, Old Dog Consulting Steve West, Cyan Optics.
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.
OLD DOG CONSULTING Traffic Engineering or Network Engineering? The transition to dynamic management of multi-layer networks Adrian Farrel Old Dog Consulting.
Draft-li-isdnrg-seamless-mpls-mbh-00IETF 92 SDNRG1 Inter-SDN in Seamless MPLS for Mobile Backhaul Zhenbin Li, Rober Tao Huawei Technologies IETF 92, Dallas,
1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ
Semester 4 - Chapter 3 – WAN Design Routers within WANs are connection points of a network. Routers determine the most appropriate route or path through.
Draft-li-rtgwg-cc-igp-arch-00IETF 88 RTGWG1 An Architecture of Central Controlled Interior Gateway Protocol (IGP) draft-li-rtgwg-cc-igp-arch-00 Zhenbin.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Abstraction and Control of Transport Networks (ACTN) BoF
Evolution of Path Computation Towards Generalized Resource Computation Adrian Farrel Old Dog Consulting
Multi-Protocol Label Switching University of Southern Queensland.
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
OIF NNI: The Roadmap to Non- Disruptive Control Plane Interoperability Dimitrios Pendarakis
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Connect. Communicate. Collaborate BANDWIDTH-ON-DEMAND SYSTEM CASE-STUDY BASED ON GN2 PROJECT EXPERIENCES Radosław Krzywania (speaker) PSNC Mauro Campanella.
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.
IP Routing Principles. Network-Layer Protocol Operations Each router provides network layer (routing) services X Y A B C Application Presentation Session.
June 4, 2003Carleton University & EIONGMPLS - 1 GMPLS Generalized Multiprotocol Label Switching Vijay Mahendran Sumita Ponnuchamy Christy Gnanapragasam.
Introducing a New Concept in Networking Fluid Networking S. Wood Nov Copyright 2006 Modern Systems Research.
Use Cases for High Bandwidth Query and Control of Core Networks Greg Bernstein, Grotto Networking Young Lee, Huawei draft-bernstein-alto-large-bandwidth-cases-00.txt.
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.
What do we put in the TED? Which TE links from the network should appear in the Traffic Engineering Database at a Label Switching Router? An attempt to.
1 Revision to DOE proposal Resource Optimization in Hybrid Core Networks with 100G Links Original submission: April 30, 2009 Date: May 4, 2009 PI: Malathi.
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.
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.
1 draft-ali-ccamp-te-metric-recording-02.txt CCAMP – IETF 84 – Vancouver July - August 2012 Zafar Ali Cisco Systems Clarence Filsfils  Cisco Systems Kenji.
An evolutionary approach to G-MPLS ensuring a smooth migration of legacy networks Ben Martens Alcatel USA.
Packet-Optical Integration using Virtual Topologies
Grid Optical Burst Switched Networks
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Zhenbin Li, Kai Lu Huawei Technologies IETF 98, Chicago, USA
PCE Applicability for Inter-Layer MPLS and GMPLS Traffic Engineering draft-oki-pce-inter-layer-app-00.txt Mar. 20, 2006 Eiji Oki (NTT) Jean-Louis Le.
Semester 4 - Chapter 3 – WAN Design
Requirements for Ring Protection in MPLS-TP
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
An analysis of scaling issues in MPLS-TE backbone networks
Network Virtualisation for Packet Optical Networks
Kireeti Kompella Juniper Networks
Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde
Presentation transcript:

A New Paradigm for Inter-Domain Traffic Engineering Adrian Farrel Juniper Networks

2 Multi-Domain Traffic Engineering Traffic Engineering optimization is an end-to-end function The best path in one domain may yield a sub-optimal end-to-end path Implies… need for visibility of multi-domain TE information when computing paths …or… Some form of brokering or arbitrage

3 TE Optimization and Computation Traffic Engineering can optimise for a complex set of metrics and functions This used to be just Connectivity Metric Bandwidth Now becoming significantly more complicated SRLG Delay Optical parameters Computation is an “interesting” problem Trading different metrics Non-linear constraints

4 Problem Space - Overlay Networks Problems include Destination location Dual homing Server network TE Comprehension of server technology

5 Problem Space - Peer Networks Provision an end-to-end service across multiple domains Example: Multi-site VPN over connected Ases Problems are: Location of target domain Choice of domains to traverse Choice of points of attachment Paths within each core network VPN Site A VPN Site D VPN Site C VPN Site B Core Network X Core Network Z Core Network Y

6 UNI - The Blind Leading the Blind Interface between the client and server network Request connectivity Clearly useful: implemented and deployed Significant limitations Blind to the server network : can’t see topology or reachability Not a service request interface Many proposals to add function to the UNI Can we evolve or is this a blind alley? UNI

7 Flooding Would Be Crazy Well, it would, wouldn’t it? Flooding means… Telling the client network about all of the links and nodes in the server network A shared IGP Two IGP instances GMPLS actually supports this Networks usually under different administrations Scaling is a real concern It can get messy with multiple server networks Client network will not understand server links All those optical parameters etc. Really don’t want to try to send packets down optical links

Perhaps the Client Can be in Both Networks This is a variation of the UNI model, but the UNI is inside the node It is a variation of the flooding model, but only the edge nodes are aware of the core network The edge node can make choices about the path across the server network The edge node could determine potential connectivity and advertise as potential links in the client network But… It doesn’t help planning end-to-end paths The edge node (probably a router) needs to be aware of All server technologies Complex TE parameters (such as optical constraints) All vendor-specific issues in the server network UNI 8

9 Link Aggregation Doesn’t Quite Do The Job Advantages of link aggregation Direct, any-to-any connectivity Minimize delay in provisioning Server layer as a set of logical links No worries about client connectivity Simplified client network mgmt Redundant connections Disadvantages of link aggregation Waste of transport resources Under-use of dedicated resources n 2 scaling issues (full mesh) Complexity of server layer management Edge nodes need more server layer resources (line cards, lasers, etc.) Client has no idea of physical path Cost of client services is high Protection may not be real Need for frequent advertisement updates Every time resource is used on a component path Computationally expensive to aggregate Multiple paths Multiple constraints

10 Node Aggregation Doesn’t Cut it Either Advantages of Aggregation  Very simple model  Scales well  Does not need frequent updates Disadvantages of aggregation No consideration of path properties No visibility into disjoint paths Limited cross-connect ability is hidden In particular when network is partitioned Issues with wavelength continuity There are ways to handle limited cross-connects in GMPLS advertisements, but higher layer network will not understand them

How PCE Addressed the Problem A L M K J I H G E F C B D VNT Manager PCE A PCE for each network Hides topology of one network from the other network Higher layer PCE reports absent connectivity to Virtual Network Topology Manager VNTM consults lower layer PCE and then provisions connectivity Combine this with Hierarchical PCE for a complete solution PCE 11

New Architectural Tools Abstract Link Representation of a path through the server network between a pair of server-edge nodes Includes bandwidth, switching capability, and SRLGs Advertised as a link in the abstraction network Creation of abstract links is strictly controlled by policy in the server network Policy is a commercial function It is also an aggregation function, but it is a trade-off Stable, non-varying links General purpose links, without too much detail Abstract Layer Network A network of edge nodes, edge links, and abstract links A path through this network can be advertised into a client network's TE database as a real link. 12

Architectural Overview Client Network Server Network Abstraction Network e2e client LSP (potential) Server LSP Abstract link (potential or actual) Client link 13

14 The Abstract Network Some links are physical, some abstract Not a full mesh Abstract links created by server layer according to policy Abstract layer may include physical nodes LSPs across abstract layer make links in client network VPN Site A VPN Site D VPN Site C VPN Site B Core Network X Core Network Z Core Network Y

Why Three Layers and What Role for Routing? The Abstraction Layer provides separation Protects client from knowledge of server technology Hides complexity of interconnected server networks Allows client link creation to be separated from means of connectivity Facilitates different provisioning techniques Control plane Management system SDN (“Transport SDN”) Abstraction layer is a simple network Can run its own instance of an IGP Topology export at border nodes A function of policy Could use BGP-LS Maybe direct export with GMPLS signaling (RFC 6107) 15

Simple Example C1 C4 C0 C3 C9 C2 C8 S6 C7C6 C5 S5 S4 S3S2 S1 S9 S8S7 C0 C3 C9 C2 S6 C6 S3 S1 S9 S7 C1 C4 C0 C3 C9 C2 C8 C7C6 C5 Abstraction links and LSPs Links created in client network 16

17 Conclusion This is nothing radically new It provides an over-all architecture that encompasses other models Easy to model the UNI as the interface between client and abstraction layer Extremes of full mesh aggregation can be accommodated with suitable policies Different technology layer relationships including lambda over lambda with stitching In simple networks realising the architecture may be overkill The Abstraction Layer provides a powerful tool in more complex networks Interconnected (peer) server domains Alternative server domains (especially different technologies) This approach virtualises the network Turns the network into a manageable service

18 Questions? draft-farrel-interconnected-te-info-exchange