SDN Traffic Engineering with Segment Routing The Next Evolution

Slides:



Advertisements
Similar presentations
APNOMS03 1 A Resilient Path Management for BGP/MPLS VPN Jong T. Park School of Electrical Eng. And Computer Science Kyungpook National University
Advertisements

Deployment of MPLS VPN in Large ISP Networks
© 2006 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 MPLS Scale to 100k endpoints with resiliency and simplicity Clarence.
Why SDN and MPLS? Saurav Das, Ali Reza Sharafat, Guru Parulkar, Nick McKeown Clean Slate CTO Summit 9 th November, 2011.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Understanding MPLS TE Components.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
© 2010 Cisco and/or its affiliates. All rights reserved. 1 Segment Routing Clarence Filsfils – Distinguished Engineer Christian Martin –
Dynamic routing – QoS routing Other approaches to QoS routing Traffic Engineering Practical Traffic Engineering.
Traffic Engineering With Traditional IP Routing Protocols
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
MPLS and Traffic Engineering
Óscar González de Dios PCE, the magic component of Segment Routing Telefónica I+D.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
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.
Transport SDN: Key Drivers & Elements
1 © 2004 Cisco Systems, Inc. All rights reserved. Session Number Presentation_ID Cisco IP Solution Center 4.0 TRAFFIC ENGINEERING MANAGEMENT Executive.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
1Traffic Engineering © 1999, Cisco Systems, Inc. MPLS Traffic Engineering George Swallow George Swallow
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Multi-topology protection: promises and problems G. Apostolopoulos Institute of Computer Science Foundation Of Research and Technology Hellas (FORTH)
Shannon Lab 1AT&T – Research Traffic Engineering with Estimated Traffic Matrices Matthew Roughan Mikkel Thorup
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
Draft-li-mpls-network-virtualization-framework-00IETF 88 SPRING WG1 Framework of Network Virtualization Based on MPLS Global Label draft-li-mpls-network-virtualization-framework-00.
Protection and Restoration Definitions A major application for MPLS.
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
U-Turn Alternates for IP/LDP Local Protection draft-atlas-ip-local-protect-uturn-00.txt Alia Atlas Gagan Choudhury
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
1 | © 2015 Infinera Open SDN in Metro P-OTS Networks Sten Nordell CTO Metro Business Group
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
1 Protection in SONET Path layer protection scheme: operate on individual connections Line layer protection scheme: operate on the entire set of connections.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
82 nd Taipei Protection Mechanisms for LDP P2MP/MP2MP LSP draft-zhao-mpls-mldp-protections-00.txt Quintin Zhao, Emily Chen, Huawei.
Segment Routing: An Architecture build with SDN in mind and addressing the evolving network requirements Brian Meaney Cisco SP Consulting Team.
Analysis on Two Methods in Ingress Local Protection.
MOZART: Temporal Coordination of Measurement (SOSR’ 16)
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Multi Protocol Label Switching (MPLS)
Advanced Computer Networks
Konstantin agouros Omkar deshpande
SDN challenges Deployment challenges
OpenDaylight BGP Use-Cases
Presenter: Jeffrey Zhang
Author: Daniel Guija Alcaraz
Customer Presentation
Explicitly advertising the TE protocols enabled on links in OSPF
Loop protection and IPFRR
© 2002, Cisco Systems, Inc. All rights reserved.
ONOS Drake Release September 2015.
MPLS Traffic Engineering
Software Defined Networking (SDN)
LDP Extensions for RMR draft-esale-mpls-ldp-rmr- extensions
Explicitly advertising the TE protocols enabled on links in ISIS
CHAPTER 8 Network Management
Zhenbin Li, Shunwan Zhuang Huawei Technologies
Dynamic Routing and OSPF
COS 561: Advanced Computer Networks
Dynamic Management for End-to-end IP QoS
Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Aijun Wang China Telecom Nov 2017
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Backbone Traffic Engineering
COS 461: Computer Networks
SDN Controllers in the WAN
EE 122: Lecture 22 (Overlay Networks)
Achieving Resilient Routing in the Internet
IP RSVP-TE: Extensions to RSVP for P2P IP-TE LSP Tunnels Tarek Saad, Juniper Networks Vishnu Pavan Beeram, Juniper.
Presentation transcript:

SDN Traffic Engineering with Segment Routing The Next Evolution Cengiz Alaettinoglu

Traffic Engineering (TE) Minimize the worst link utilization Alleviate traffic congestion Better/longer use of equipment/port/fiber Route traffic around congested links Put traffic on non-shortest paths Copyright © 2017 Packet Design. All rights reserved.

Evolution of Traffic Engineering Offline traffic engineering Optimal, but not adaptive On-device traffic engineering Adaptive, but not optimal Software defined networking Best of both worlds, yet simpler; simplicity enabled by: Segment routing Push-based telemetry SDN Traffic Engineering application Copyright © 2017 Packet Design. All rights reserved.

Offline Traffic Engineering Topology model Traffic demand matrix Optimization algorithm computes routes so that the worst link utilization is minimized Linear programming Copyright © 2017 Packet Design. All rights reserved.

Pros/Cons of Offline Traffic Engineering Very good link utilization values Network model is hard to keep accurate Traffic demand matrix is hard to compute Optimization algorithm is very slow Hours to days Can not adapt to failures Too many tunnels (N2) Some paths may be surprisingly long Copyright © 2017 Packet Design. All rights reserved.

On-Device Traffic Engineering RSVP-TE/CSPF Routers flood available bandwidth of links in IGP Each router Sets up one (or more) tunnels to other routers Monitors the utilization of these tunnels (auto-bandwidth) Triggers re-optimization when utilization changes Uses CSPF (constraint-based shortest path first) to compute the paths Signals the path and reserves bandwidth using RSVP Copyright © 2017 Packet Design. All rights reserved.

Pros/Cons of On-Device Traffic Engineering Not so good link utilization values Each router is selfish in optimization No network-wide optimization Network model is readily available Traffic demand matrix is easy with auto-bandwidth CSPF is fast Can adapt to failures Too many tunnels (N2) Some paths may be surprisingly long Flooding available bandwidth impacts IGP, particularly convergence time Race conditions after failures Long-lived FRR RSVP-TE overhead is high due to N2 tunnels Protocol and management overhead Copyright © 2017 Packet Design. All rights reserved.

Copyright © 2017 Packet Design. All rights reserved. Example Deployments Small Medium Large Routers 75 450 1,900 Links 300 2,000 8,000 Tunnels 1,600 20,500 132,000 Majority of the tunnels have very small amount of traffic No TE needed Copyright © 2017 Packet Design. All rights reserved.

Link / Tunnel Distribution Most links carry a small number of tunnels Small number of links carry a lot of tunnels Copyright © 2017 Packet Design. All rights reserved.

A Tunnel Path - Before, During and After a Link Failure 2015-12-27 12:04:05 2015-12-27 12:04:05.200490 2015-12-27 12:14:00 A wide-area link fails at 2015-12-27 12:04:05.200490 It was carrying 327 tunnels from 22 head-end routers The tunnel above fails to optimize, but why? Copyright © 2017 Packet Design. All rights reserved.

Re-Optimization after Link Failure 22 head-end routers get a signal via RSVP-TE and try to re-optimize Race to available bandwidth Each router optimizes for itself It does not know what the other 21 routers need It doesn’t even know there are other routers/tunnels interested in this bandwidth 9 tunnels fail to optimize 5 head-end routers The example tunnel is one of the unlucky ones This could have been avoided with network-wide optimization! Copyright © 2017 Packet Design. All rights reserved.

What Happens to the Traffic? Traffic now takes the IGP path (green arrows) Tunnel needed 34Mbps which is not available anywhere in the network The IGP path too does not have this bandwidth available Congestion kicks in Copyright © 2017 Packet Design. All rights reserved.

Another Tunnel is Stuck on its FRR What happens when a tunnel fails to optimize and it is FRR protected? FRR is stuck Usually no reservations are made on FRR paths Congestion will kick in Copyright © 2017 Packet Design. All rights reserved.

N2 Tunnels - Beyond Human Manageability It is not just 9 tunnels that are down 1204 down tunnels is too many for any operator to figure out the root cause If these tunnels are for traffic engineering, can we really say we are successfully doing traffic engineering? It is time for software/devops to manage the network Copyright © 2017 Packet Design. All rights reserved.

Copyright © 2017 Packet Design. All rights reserved. An SDN approach Copyright © 2017 Packet Design. All rights reserved.

Copyright © 2017 Packet Design. All rights reserved. What Do We Really Need? Real-time model Alleviate congestion, especially after a link failure Create as few tunnels as necessary Very small signaling overhead Very small IGP overhead Do not want IGP dynamics due to available bandwidth changes Network-wide optimization Simple to deploy and operate Copyright © 2017 Packet Design. All rights reserved.

SDN Promises a Solution Segment routing (SR) replaces RSVP Provides uncompromised functionality Simple control plane with very low overhead Push-based telemetry for traffic matrices YANG model based Frees IGP SDN controller is part of the network control plane Has real-time topology Enables manipulating paths on the devices using standard south bound protocols Traffic Engineering becomes an SDN application Optimizes paths network-wide As few tunnels as necessary Copyright © 2017 Packet Design. All rights reserved.

Copyright © 2017 Packet Design. All rights reserved. Segment Routing Segment routing simplifies IP/MPLS control plane No need to run LDP or RSVP-TE Functionality is not compromised Can forward traffic on non-shortest paths for traffic engineering Detour, bypass FRR (fast re-route), and IP LFA protection Secondary paths SLA-conforming service specific paths (e.g. L2/L3 VPNs) SDN programmability Copyright © 2017 Packet Design. All rights reserved.

TE Needs Shortest and Non-Shortest Paths; SR Can Encode Any Path B Z D C V W Y X 1 Segment (shortest IGP path) Go to Z on shortest path (node segment) A B Z D C V W Y X 3 Segments Go to C on shortest path Go to X on link 3 (adjacency segment) Go to Z on shortest path 5 Segments Go to B on shortest path Go to W on shortest path Go to Y on shortest path Go to D on shortest path Go to Z on shortest path A B Z D C V W Y X Copyright © 2017 Packet Design. All rights reserved.

Push-Based Telemetry Eases Traffic Demand Matrix Generation How much customer traffic enters the network in Hanoi and is destined for Tokyo? Demand does not change based on internal routing Traditionally, NetFlow is used for this and can still be used Push- and model-based telemetry have very promising features, including real-time traffic visibility Copyright © 2017 Packet Design. All rights reserved.

YANG Model Pushed by Ingress Routers    +--ro traffic-collector       +--ro afs          +--ro af* [af-name]             +--ro counters                +--ro prefixes                   +--ro prefix*                      +--ro ipaddr?                              string                      +--ro mask?                                string                      +--ro label?                               Tc-oper-local-label                      +--ro base-counter-statistics                      |  +--ro transmit-packets-per-second-switched?   uint64                      |  +--ro transmit-bytes-per-second-switched?     uint64                      |  +--ro count-history*                      |     +--ro event-start-timestamp?                 uint64                      |     +--ro event-end-timestamp?                   uint64                      |     +--ro transmit-number-of-packets-switched?   uint64                      |     +--ro transmit-number-of-bytes-switched?     uint64                      |     +--ro is-valid?                              boolean                      +--ro traffic-matrix-counter-statistics                      |  +--ro transmit-packets-per-second-switched?   uint64                      |     +--ro event-start-timestamp?                 uint64                      |     +--ro is-valid?                              boolean                      +--ro prefix?                              string Similar content to NetFlow for traffic matrix generation Misses port/proto level detail Pushed from the routers Few seconds to minutes Efficient transfer of data Binary encoded using ProtoBuf Copyright © 2017 Packet Design. All rights reserved.

Traffic Engineering as an SDN App. SDN application manages traffic demand Current as well as future reservations IGP does not have to signal available bandwidth Push-based telemetry or NetFlow-based matrices can be generated SDN application computes paths and allocates bandwidth Centralization yields network-wide resource optimization Creates the fewest tunnels necessary SDN application adapts to failures and repairs SDN controller provides real-time topology view No race conditions after failures and repairs Segment routing can be used for network simplification SDN controller makes this an abstraction for the application RSVP-TE can still be used where SR is not available Copyright © 2017 Packet Design. All rights reserved.

Copyright © 2017 Packet Design. All rights reserved. Reducing the N2 Tunnels Only generates tunnels for traffic going over congested links Tunnels no longer need to be configured a priori at the routers Only create them if they will have a positive impact Special case: Under normal conditions don’t generate any tunnels Under failure conditions generate enough to alleviate congestion Do not create tunnels when IGP path satisfies the constraints Easy to implement in software with a global view, but hard to do one device at a time Copyright © 2017 Packet Design. All rights reserved.

Copyright © 2017 Packet Design. All rights reserved. Illustration 1 Gbps links Two elephant flows 850Mbps west to east 500Mbps north to south Lots of mice flows Copyright © 2017 Packet Design. All rights reserved.

Copyright © 2017 Packet Design. All rights reserved. Concluding Remarks SDN simplifies running a traffic engineered network Application is the SDN revolution SDN application needs enablers from the infrastructure Controller Segment routing (or RSVP-TE when not available) Push-based telemetry NETCONF/YANG, PCEP, and other southbound protocols Copyright © 2017 Packet Design. All rights reserved.