Application Engineered Routing: Allowing Applications to Program the Network

BRKSPG-2066

Rob Piasecki, Solutions Architect, Services, [email protected] Agenda

• AER: Industry Drivers & Overview

• AER: Architecture & Technical Concepts

. Segment Routing

. Intelligent SDN Controller

• Use Cases & Implementation

. Purpose Built Applications

. Demo

• Conclusion AER: Industry Drivers & Overview The Problem The Network is facing new challenges Cloud Services IoE

Mobility

Dynamic and changing traffic patterns UHD

Increasingly diverse applications with application-specific transport requirements Other

End-to-End control required

IPv6

EVOLVED PROGRAMMABLE NETWORK5 Networks Need to be Rethought Applications and Network interaction is key

IP APPLICATIONS Core

Edge

EVOLVED SERVICES PLATFORM

Acce ss/ Agg

IPv6

EVOLVED PROGRAMMABLE NETWORK

IP NGN Era

Designed to support a set of services Designed to support any kind of services

Static traffic patterns Dynamic traffic patterns

Manual configuration (CLI) Automation (APIs, Controllers, …)

Apps Independent of Network App & Network Interaction

6 Specific Approaches to the Problem A continuum of enhanced solutions

Hosts DC Core Agg Hosts DC Core Agg Hosts DC Core Agg

One device, single domain Many devices, single domain Many devices, across domains

IP NGN Era EPN Era

Policy-Based routing MPLS TE

. Scalable Evolution required Effective solutions with some caveats: . Stateless to address the . Little or no application / network interaction new paradigm . Scalability . Programmable . Configuration & troubleshooting complexity . States to be maintained in each network node . Ease of configuration & troubleshooting

7 Applications & Network Interaction Implications for the Network Fabric

Many applications with dynamic and changing traffic patterns

IP Networks IP Networks & Traffic Engineering

Limitations . Limited to a single network  Impediment to service domain creation . Scalability . Configuration &  Major scalability issues troubleshooting complexity . States to be maintained in  Operational challenges Shortest path with QoS Traffic-engineered tunneling each network node

IP Networks Evolution

8 The Solution Application Engineered Routing

Applications express Applications are mapped to a path defined requirements – bandwidth, Applications latency, interactive … 1 by a list of segments

SDN 3 Controller

Segment Network maintains segments only 2 Routing The controller collects data from the No application state (SW upgrade) network – topology, link states, link utilization, …

9 Application Engineered Routing Evolve MPLS with Segment Routing

Mission – Route the luggage to Berlin

Segment Routing London 1. A luggage tag is attached with the Toronto final destination Seattle Berlin 2. Luggage identified and routed to the next destination RSVP-TE New-York Madrid

Mexico RESULT: No control over the path – Luggage is routed over the shortest path TXL IP/LDP

10 Application Engineered Routing Evolve MPLS with Segment Routing

Mission – Route the luggage to Berlin via Mexico and Madrid

Segment Routing London Toronto 1. At each stop, the luggage is Seattle Berlin identified and routed to the next hop A list of all the paths has to be RSVP-TE New-York Madrid maintained

Mexico 2. A specific tag is assigned to each piece of 20000 luggage, IP/LDP i.e. Tunnel ID 20000, is created to identify the SEA MEX 20000 path Seattle-Mexico-Madrid-Berlin

MAD TXL 20000 Path can be controlled RESULT: . MEX MAD . Complexity and scalability issues

11 Application Engineered Routing Evolve MPLS with Segment Routing

Mission – Route the luggage to Berlin via Mexico and Madrid

Segment Routing London Toronto 1. A unique and global luggage tag Seattle Berlin is attached to the luggage with the list of stops to the final RSVP-TE New-York Madrid destination

Mexico MEX 2. At each stop, the luggage is simply routed to the next hop listed on the IP/LDP MAD luggage tag TXL

. Path can be controlled MAD RESULT: TXL . Simple and scalable TXL

12 Application Engineered Routing Segment Routing – Technical view

Path expressed in Data Plane Data the packet

MPLS IPv6 Dynamic path (segment labels) (+SR header)

Control Plane

Routing protocols with extensions SDN controller (IS-IS,OSPF, BGP)

Explicit path

Paths options

Dynamic Explicit (STP computation) (expressed in the packet)

13 Application Engineered Routing Journey Adding value at your own pace

Enable Segment Routing on EPN Platforms (Software only)

Insert ESP components – Orchestration, SDN controller

Connect with Cisco’s and third party VNFs Benefits Network Simplification

Network Resiliency

End-User Experience

Network Optimization

Service Velocity

E2E Application Control

14 Application Engineered Routing Solution Components

Network Bandwidth Low-latency Disjoint 3rd-party applications Applications calendaring path selection recovery path

Northbound RESTful APIs interfaces

3rd-party ESP WAE NSO VTS controller

Southbound Netconf/Yang BGP LS PCEP Configlets interfaces

Segment Routing (SR) across Cisco platforms

NEXUS 3rd-party platforms ASR 9K ASR 1K VNF EPN 9000 supporting SR NCS 6K … … … Physical Virtual

15 Technology Innovation Driving Business Outcomes

Lower network resources Stateless consumption Optimized CapEx Higher link Scalability utilization

Ease of configuration Ease of troubleshooting Economic Network resiliency Reduced OpEx Value Automated 50ms protection Programmability

Better End-User Increased Customer experience Lifetime Value Per application traffic steering SLAs Monetization

16 Why Cisco ?

Comprehensive portfolio for delivering an end-to- 1 end Application Engineered Routing solution

Open solution to match diverse customer needs (IETF 2 standard, APIs)

Phased approach to Application Engineered Routing 3 solution (not a rip & replace solution)

17 Architecture & Technical Concepts: Segment Routing Segment Routing

• Unified • DC + WAN + Aggregation • from server in the DC, through WAN and to the service edge

• Policy-aware • DC: disjoint planes, flow-based congestion avoidance • WAN: disjoint services, latency-sensitive traffic, scheduled bulk transfer

• Application programs the end-to-end policy • The end-to-end policy is encoded by the application as an SR segment list in the packet header

• Balance between distributed and centralized intelligence • Distributed: automated sub-30msec FRR link/node in any topology with optimum backup path • Centralized: traffic optimization for better use of the installed capacity

• Applicable to MPLS and IPv6 dataplanes

• Much simpler to operate than MPLS Classic

19 Segment Routing

• Source Routing: the source chooses a path and encodes it in the packet header as an ordered list of segments.

• Segment: an identifier for any type of instruction • Service • Context • Locator Segment = Instructions such as • IGP-based forwarding construct "go to node N using the shortest path" • BGP-based forwarding construct • Local value or Global Index

20 Segment Routing

• MPLS: an ordered list of segments is represented as a stack of labels • SR re-uses MPLS dataplane without any change

• IPv6: an ordered list of segments is represented as a routing extension header, see 4.4 of RFC2460

• IGP-based segments require minor extension to the existing link- state routing protocols (OSPF and IS-IS).

21 IGP Segments

Node segment to C Node segment to C A B C D

Adj Segment Z

M N O P

Node segment to Z

• Simple extension to let IGP install segments in the MPLS dataplane

• Excellent Scale: a node installs N+A FIB entries • N node segments and A adjacency segments

22 Node Segment FEC Z swap 16065 swap 16065 push 16065 to 16065 to 16065 pop 16065 A B C D A packet injected Z 16065 anywhere with top 16065 16065 16065 Packet to Packet to Packet to Packet to Packet to segment 16065 will Z Z Z Z Z reach Z via shortest-path

• Z advertises a global node segment 16065 with its loopback • simple ISIS sub-TLV extension • default SRGB [16000, 23999] at all nodes is a request from all lead operators for operational simplicity. The protocol and implementation allows for different SRGB at every node

• All remote nodes install in their FIB the node segment 16065 to Z

23 Node Segment

A B C D

Z

M N O P 16078

• ECMP • A node segment to 16078 distributes traffic across all ECMP paths to O

24 Adjacency Segment A packet injected at A B C D node C with segment Pop Z 29003 29003 is forced M N O P through datalink CO

• C allocates a local segment 29003 and maps it to the instruction “complete the segment and forward along the interface CO”

• C advertises the adjacency segment in ISIS • simple sub-TLV extension

• C is the only node to install the adjacency segment in FIB

25 Explicit path as Segment List

• ECMP • Node segment

• Per-flow state only at head-end • not at midpoints 16072 16072 • Source Routing A B C D • the path state is in the packet header 16078 Z M N O P 16065 16065

26 Explicit path as Segment List

• ECMP 16072 • Node segment 16078 16065 • Per-flow state only at head-end Packet to Z • not at midpoints 16072 16072 • Source Routing A B C D • the path state is in the packet header 16078 Z M N O P 16065 16065

26 Explicit path as Segment List

• ECMP 16072 • Node segment 16078 16065 • Per-flow state only at head-end Packet to Z • not at midpoints 16072 16072 • Source Routing A B C D • the path state is in the packet header 16078 Z M N O P 16065 16065

26 Explicit path as Segment List

• ECMP • Node segment 16078 16065 • Per-flow state only at head-end Packet to Z • not at midpoints 16072 16072 • Source Routing A B C D • the path state is in the packet header 16078 Z M N O P 16065 16065

26 Explicit path as Segment List

• ECMP • Node segment

• Per-flow state only at head-end • not at midpoints 16072 16072 • Source Routing A B C D • the path state is in the packet header 16078 Z M N O P 16065 16065 16065 Packet to Z

26 Explicit path as Segment List

• ECMP • Node segment

• Per-flow state only at head-end • not at midpoints 16072 16072 • Source Routing A B C D • the path state is in the packet header 16078 Z M N O P 16065 16065 16065 Packet to Z

26 Explicit path as Segment List

• ECMP • Node segment

• Per-flow state only at head-end • not at midpoints 16072 16072 • Source Routing A B C D • the path state is in the packet header 16078 Z M N O P 16065

16065 Packet to Z

26 Automated 50-msec Protection for IGP Segments

• Guaranteed Link/Node FRR in any topology

• 50msec protection

• Simplicity • Entirely automated • No directed LDP session • No RSVP-TE tunnels

• Incremental deployment • Applicable to LDP primary traffic

• Optimal backup path along postconvergence path • Prevents transient congestion and suboptimal routing

33 SR-based MPLS Classic MPLS

Basic mpls transport IGP IGP + LDP

IGP/LDP synchronization N/A Problem to manage

50msec FRR IGP IGP + RSVP-TE

Extra TE states to support FRR No extra state Extra states to manage

Optimum backup path Yes (IP post-convergence) No (SDH-alike)

ECMP-capability for TE Yes No

TE state only at headend Yes No (n^2 problem at midpoint)

Seamless Interworking with classic MPLS and Yes N/A incremental deployment Engineered for SDN Yes No

34 What is Segment Routing?

IP/MPLS architecture that seeks the right balance between distributed intelligence and centralized optimization and programming. • simplifies operation (lower opex) • enables application-based service creation (new revenue) • allows for better utilization of the installed infrastructure (lower capex) An IP/MPLS architecture with wide application • (SP, OTT/Web, GET) across (WAN, Metro/Agg, DC) • MPLS and IPv6 dataplanes • SDN controller An architecture designed with SDN in mind

35 Architecture & Technical Concepts: Intelligent SDN Controller WAN Limitations Impact Traffic Optimization

Provider Constraints What’s Needed

Too Many Multivendor Manual Steps Orchestration

Unified WAN Fragmented View for Scenario View of the WAN Analysis

Network Visibility Lack of Visibility Over Time: Past, for Troubleshooting Service Providers Present, and Future WAN Lacks adopting new Automation at Scale Real-Time Agility approaches

37 WAN Automation Engine Delivering Optimization and Automation

Model-Based Control Optimization and Predictive Model Time Series Visibility and Configuration Automation

WAE + + = Cycle

Modeling Assess historical and Programmatic network Real-time traffic balancing What if/predictive analysis real-time data control Intelligent bandwidth Global optimization Find and manage hot Extensible, scheduling spots open data models Automated service Network efficiency delivery analysis

38 SDN Strategy for SPs – High-Level View

BSS Model driven, end-to-end service lifecycle and customer experience focus OSS (Fulfillment and Assurance) Service-Intent API Orchestration, Service, and Policy Implementation Data Center Seamless integration with existing and future Branch, CPE Multi-layer WAE and NFV EMS, NMS OSS/BSS environment Control WAN SDN Control SDN / APIs

CLI, Netconf, Segment Openstack, BGP PCEP Openflow Loosely-coupled and modular architecture SNMP YANG Routing vCenter using open APIs and standard protocols CPE Metro and Access WAN Data Centre

Orchestration across multiple domains and layers provides centralized policy and services across the entire network Multi-Vendor End-to-End Management and Orchestration (Physical and Virtual)

39 WAN Automation Software Suite Unified Application Framework

Offline IGP Failure Weather Inventory Coordinated Segment Bandwidth on Bandwidth Application Planning Convergence Analysis Map Maintenance Routing Demand Calendaring Latency Analyzer Optimizer Routing

Service, Network, and Analytics REST APIs

WAN Automation Engine

Analytics Optimization and Prediction Calendaring

Current Model Network Modeler New Model

Collector Network Interface Deployer

NC/YA SNMP CLI NetFlow BGP-LS NMS/EMS OSC PCEP NG …

40 WAE Includes Cisco’s Version of ODL

Unified Application Framework

Offline IGP Failure Weather Inventory Coordinated Segment Bandwidth on Bandwidth Application Planning Convergence Analysis Map Maintenance Routing Demand Calendaring Latency Analyzer Optimizer Routing

WAN Automation Engine

Cisco® Open SDN Controller

41 WAN Automation Applications

Offline IGP Failure BGP Route Weather Map Business Inventory Maintenance Network Planning Convergence Analysis Visualizer Intelligence Window ACL Analyzer Scheduler Manager

Offline Planning, Design, and Online Visualization, Analytics, and Managed Resource Inventory, Analysis Business Intelligence Security, and Maintenance

Bandwidth on Bandwidth Segment Routing Application Tunnel Tunnel Tunnel Demand Calendaring Optimizer Latency Routing Builder Splitter Balancer

Automated Tunnel Creation and Extensible Application Integration Optimized Bandwidth Placement Traffic Load Management

42 WAE Strategic Initiatives

WAE Applications Segment Routing

Built for SDN | Foundation for application-engineered routing Coordinated maintenance, bandwidth calendaring applications that will have the ability to direct network behavior

Data Centre A Data Centre B

NSO (Tail-F) WAE Integration Unified Multilayer

Global network view | Optimization across layers Traffic-aware intelligent programmability of multi-vendor networks Future: Add OTN to activation, planning, and optimization

43 Use Cases & Implementation: Purpose Built Applications TI-LFA: Automated 50-msec Protection for IGP Segments

• Guaranteed Link/Node FRR in any topology

• 50msec protection

• Simplicity • Entirely automated • No directed LDP session • No RSVP-TE tunnels

• Incremental deployment • Applicable to LDP primary traffic

• Optimal backup path along postconvergence path • Prevents transient congestion and suboptimal routing

45 WAE Design – TILFA Simulation

• How many segments in backup chain • Capacity analysis during FRR transient state

46 IPv4 MPLS Transport with FRR Any service resolving A B on IGP IPv4 Prefix SID  Internet PE1 PE2  VPNv4 M N  6PE All VPN services ride on the prefix segment to PE2  PW

• IPv4 over MPLS: the obvious way it should have been done • Just the IGP to operate • Sub50msec FRR integrated and automated

• Seamless migration • SR/LDP interworking

47 IPv6 MPLS Transport with FRR Any service resolving A B on IGP IPv6 Prefix SID  Internet v6 PE1 PE2  VPNv6 M N

Internet/v6 rides on the Prefix segment to PE2

• IPv6: the opportunity to do it right from the start • Just the IGP to operate • Sub50msec FRR integrated and automated

48 9101 MPLS dataplane monitoring 9105 9107 9108 9104 9107 9105 B C 9108 9101 9105 9102 OAM A 9108 9105 9108

9102 N O

9104

draft-geib-spring-oam-usecase-02 Nanog57, Feb 2013

49 Disjoint TE Service

• A to Z any plane • IGP shortest-path 16065 • PrefixSID of Z (65) pkt • A to Z via blue plane • SRTE policy pushes one additional segment “Blue Anycast” (111)

• Benefits • ECMP • No hop-by-hop signalling load and delay 16111 • No midpoint state 16065 pkt

50 Latency TE Service

• Data from Tokyo to Brussels • IGP shortest-path via US, higher and cheaper capacity • PrefixSID of Brussels

• Voice from Tokyo to Brussels • SRTE policy pushes one additional segment “Russia Anycast” Node segment to Brussels • Low-latency path Node segment to Russia • Benefits • ECMP • Availability of the anycast segment against node failure Russia • No hop-by-hop signalling load and delay Brussels Brussels • No midpoint state pkt pkt

Data Voice

51 Content Producer Engineers its WAN Traffic to Egress Peers

AS1

PrefixSID(B) Payload Payload AS2 Best BGP B D and IGP ISIS/SR-based WAN Path AS4

A 9.9.9.9/32 C E TE Policy PrefixSID (C) installed by PeeringSID(E) Controller Payload PayloadAS3 Engineered Path PeeringSID(E) Payload Engineered Path

52 SR-Based MSDC

• MPLS data-plane

• BGP control-plane • No LDP, No RSVP-TE • Integrated/Automated FRR • no hop-by-hop manual configuration of static routes and their FRR behaviors

• Global label for easier operation • Same SRGB at each switch

• SRTE WAN Optimization Controller applicable to DC fabric

53 Distributed DC for Content Engineering to Local Peers AS1

PrefixSID(B) Payload Payload AS2 Best BGP B D Path BGP/SR-based DC Fabric AS4

9.9.9.9/32 C E TE Policy PrefixSID (C) installed by PeeringSID(E) Controller Payload PayloadAS3 Engineered Path PeeringSID(E) Payload Engineered Path

54 End-to-End Policy from DC, through WAN to Peer

App SR DC SR WAN BR

vPEF ToR Leaf Spine DCE LSR BR

App BR

Next segments Classify implement flow and Top Segment WAN Policy: Last segment push SR provides Cost vs Latency selects egress segment ECMP-path to Disjointness peer list selected DCI Select egress BR

55 End-to-End Policy from DC, through WAN to Peer

SR DC SR WAN BR

ToR Leaf Spine DCE LSR BR

BR

Illustrated end-to-end policy implemented by the application: • Two service hops in the DC • Low-latency path in the WAN • Engineered peering exit to Internet consumer 56 End-to-End Policy from DC, through WAN to Peer

ACI DC SR WAN BR

ToR DCE LSR BR

BR

Classify ACI policy is mapped into ACI fabric flow and segment list to implement swicthes to encode the flow-based WAN policy: selected border ACI policy Cost vs latency switch Disjointness

57 Large-Scale Aggregation ASBR SID’s are anycast ASBR SID’s are unique across the entire domain

Acces1 Core Acces2 ASBR anycast prefixes and A ASBR1A ASBR2A SID are redistributed within 70 1001 1002 each access region C 72 Access Nodes are provided a ASBR1B ASBR2B SID which is unique with B 1001 1002 respect to its attached 72 ASBR’s but not necessarily unique across the whole domain

• Only IGP/SR (no BGP) {72} leads to B within Access1 • Automated FRR including ASBR failure {72} leads to C within Access2 {1001, 72} leads to B from anywhere • SRGB (k) << # access nodes (100k) {1002, 72} leads to C from anywhere

• SDN Controller programs the segment list together with service creation

58 Use Cases & Implementation: Purpose Built Applications for WAE Coordinated Maintenance

Select Evaluate Schedule

. Network element . Impact to global network . Time changes prior to outage . ID circuits traversing . Network capacity to reroute . Time normalization node LSPs

60 Coordinated Maintenance WAN Automation Application

61 Bandwidth Calendaring

PCEP

WAN

Data Center #1 R1 R2 Data Center #2

Select Evaluate Schedule

. Source, destination . Impact and feasibility to global . Confirm calendared event . Time network for the calendared . Connect with billing system . Bandwidth . SLA event . Generate quote

62 Application-Engineered Routing Segment Routing: WAE Calculates Shortest Path and Programs Router A

Step 1 App requests 2 Gbps from A to Z WAE instantiates Step 3 the PCEP tunnel on Apps REST APls A {16066, 16068,16065}

16066 WAN Automation Engine Full A B C D Analytics Optimization and Prediction Calendaring

Current Model Network Modeler New Model 16068 Z Collector Network Interface Deployer M N O P 16065

PCEP

Shortest path ABCDZ is congested between Step 2 C and D. Path ABCOPZ is fine. WAE verifies BW availability; steers the traffic on this path.

63 Application-Engineered Routing Segment Routing: WAE Calculates Two Disjoint Paths and Programs Router A

App requests disjoint paths Step 1 between A and Z

Apps REST APls WAE programs Step 3 C two PCEP tunnels

WAN Automation Engine B D E Analytics Optimization and Prediction Calendaring

Current Model Network Modeler New Model A Z Collector Network Interface Deployer M N O

PCEP

WAE dynamically computes Two tunnels avoiding the Step 2 two disjoint paths to steer optical shared-fate links the traffic

64 Use-Case: Bandwidth Scheduling (On Demand)

RESTful APIs 3 Network conditions, content site 1 reachability fed to collector WAN Automation Engine 4 Analytics Optimization and Prediction Calendaring 2 Customer requests DC #1 – DC #2 Current Model Network Modeler New Model bandwidth ASAP

Collector Network Interface Deployer Demand admission request: 3 2 1 PCEP

WAN Congested!! WAE returns option and customer R2 4 confirms Data Center #1 R1 Data Center #2 If needed (insufficient bandwidth), 5 R3 5 R1-R3 LSP tunnel programmed using PCEP

Problem Result Provider’s customer has an on-demand need for a data After determining a best path, WAE programs an LSP center backup using PCEP

65 Use-Case: Bandwidth Calendaring

RESTful APIs 3 Network conditions reported to collector 1 consistently WAN Automation Engine 4 Analytics Optimization and Prediction Calendaring 2 Customer requests DC #1 – DC #2 Current Model Network Modeler New Model bandwidth at a future date

Collector Network Interface Deployer Demand admission request: 3 2 PCEP 1

WAN WAE returns booking R2 4 confirmation as the future date nears Data Center #1 R1 Data Center #2 On the future date, WAE places 5 R3 5 customer demand on IGP or explicit path (TE tunnel)

Problem Solution Enterprise customer uses self-service portal to request At the predetermined time, WAE places the demand on bandwidth between data centers the network (using either IGP or MPLS TE)

66 Use-Case: Tunnel Load Balancing

TE Tunnel Builder RESTful APIs Network conditions reported App 2 1 to collector, accessible to app WAN Automation Engine 3

Analytics Optimization and Prediction Calendaring App determines LSP imbalance and 2 requests WAE to recalculate LSP load- Current Model Network Modeler New Model share metrics

Collector Network Interface Deployer 3 WAE computes new PCEP load share metrics 1 4 WAE programs new load-share metrics 4 for LSPs using PCEP R1 AS Foo WAN

Problem Solution A service provider needs to efficiently use expensive The most expensive network resources are fully resources (high-cost links, perhaps transoceanic) optimized by WAE, assigning best load share metrics using PCEP

67 Use Case: Policy-Based Path Planning

TE Manager RESTful APIs 1 Network conditions reported App 2 3 to collector, accessible to app WAN Automation Engine

Analytics Optimization and Prediction Calendaring App requests disjoint LSPs from access 2 to aggregation router Current Model Network Modeler New Model

Collector Network Interface Deployer WAE computes new LSPs based on 3 current topology PCEP 1 4 4 WAE programs tunnels using PCEP

5 WAN The app and WAE work together to 5 automatically keep these paths disjoint, Access Node Aggregation despite failures or topology changes Node Problem Result A service provider needs to provision disjoint LSPs from WAE creates LSPs and ensures paths remain an access to aggregation router, even across failures disjoint

68 Demo Initial State IGP routed path

Using MPLS labels propagated via SR ISIS extensions, 0 traffic CE1-CE2 travels over LSP following IGP best path

Lo0 SID 16141 POP (PHP) IP 16042 P1 5 5 IP 100 20 5 IP IP 30 10 10 100 10 PE2 CE2 CE1 PE1 10 Lo0 10 10 Lo0 10 SID 16042 SID 16041

P2 IGP metric = RED TE metric = BLUE Lo0 SID 16142

70 Conclusion The Solution Application Engineered Routing

Applications express Applications are mapped to a path defined requirements – bandwidth, Applications latency, interactive … 1 by a list of segments

SDN 3 Controller

The network maintains segments Segment only 2 Routing The controller collects data from the (SW upgrade) network – topology, link states, link No application state utilization, …

72 Additional References & Information

• Cisco.com Page for Application Engineered Routing • http://www.cisco.com/c/en/us/solutions/service-provider/application-engineered-routing/index.html

• Segment Routing Page • http://www.segment-routing.net/

• Cisco.com Page for WAE Products and Associated Services • http://www.cisco.com/go/networkmodeling

• WAE on DevNet • https://developer.cisco.com/site/wae/

• Cisco WAN Segment Routing Demo – Realizing your WAN/MAN Orchestration Dreams • https://www.sdxcentral.com/resources/sdn-demofriday/segment-routing-cisco-demofriday/

73 Call to Action • Visit the World of Solutions for Cisco Campus – Service Provider Section • Demo: Deliver Agility with Network Optimization (WAN Automation Engine) • Demo: Deliver Agility with Network Control (Application Engineered Routing)

• Meet the Engineer • Available randomly throughout week. Reach out directly through MTE scheduling or direct via email ([email protected])

• Lunch and Learn Topics • Segment Routing Technology (LALRST-0003) – Wednesday 13:00

• DevNet Zone Related Sessions • SDN WAN Apps Developments (DevNet-1090) - Wednesday 17:00 • Applications for Cisco WAN Automation Engine (DevNet-1079) – Thursday 15:00 Call to Action • Related Breakout Sessions • Advanced – Segment Routing: Technology and Use-Cases (BRKRST-3122) – Thursday 14:30 • Segment Routing for IPv6 Networks (BRKRST-3123) – Thursday 14:30 • Network Modeling, Analytics and Practical Data Science for NGN and EPN Networks (BRKSPG-2231) – Thursday 14:30 • SDN-Enabled Carrier Ethernet Networks (BRKSPG-2062) – Thursday 9:00 • Software Innovations and Control Plane Evolution in the New SDN Transport Architectures (BRKOPT-2102) – Wednesday 11:30 • IP MPLS Network Optimization Services Lifecycle (BRKNMS-2039) – Wednesday 9:00

• Cisco Advanced Services Capabilities and Offers • Just Ask! Complete Your Online Session Evaluation

• Please complete your online session evaluations after each session. Complete 4 session evaluations & the Overall Conference Evaluation (available from Thursday) to receive your Cisco Live T-shirt.

• All surveys can be completed via the Cisco Live Mobile App or the Communication Stations Thank you