© 2015 Cisco and/or its affiliates. All rights reserved. Public 1 Toerless Eckert, IJsbrand Wijnands,

Slides:



Advertisements
Similar presentations
Identifying MPLS Applications
Advertisements

Internetworking II: MPLS, Security, and Traffic Engineering
© 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.
1  Changes in IPv6 – Expanded addressing capabilities (32 to 128 bits), anycast address – A streamlined 40-byte header – Flow labeling and priority –
IP datagrams Service paradigm, IP datagrams, routing, encapsulation, fragmentation and reassembly.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Addressing the Network – IPv4 Network Fundamentals – Chapter 6.
© 2010 Cisco and/or its affiliates. All rights reserved. 1 Segment Routing Clarence Filsfils – Distinguished Engineer Christian Martin –
MPLS H/W update Brief description of the lab What it is? Why do we need it? Mechanisms and Protocols.
MPLS and Traffic Engineering
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Wolfgang EffelsbergUniversity of Mannheim1 Multicast IP Wolfgang Effelsberg University of Mannheim September 2001.
CS Summer 2003 Lecture 11. CS Summer 2003 MPLS TE Application MPLS TE application allows establishment of tunnels and forwarding of IP traffic.
Routing and Routing Protocols
COS 420 Day 17. Agenda Finished Grading Individualized Projects Very large disparity in student grading No two students had same ranking for other students.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 1 v3.0 Module 10 Routing Fundamentals and Subnets.
Óscar González de Dios PCE, the magic component of Segment Routing Telefónica I+D.
Layer-3 Routing Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Computer Networks Layering and Routing Dina Katabi
1 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 4 Advanced Internetworking Computer Networks, 5th Edition.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
Routing and Routing Protocols Routing Protocols Overview.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
CSC 600 Internetworking with TCP/IP Unit 8: IP Multicasting (Ch. 17) Dr. Cheer-Sun Yang Spring 2001.
Dynamic Routing Protocol EIGRP Enhanced Interior Gateway Routing Protocol (EIGRP) is an advanced distance vector routing protocol developed by Cisco.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
Network Architecture and Design
Central Control over Distributed Routing fibbing.net SIGCOMM Stefano Vissicchio 18th August 2015 UCLouvain Joint work with O. Tilmans (UCLouvain), L. Vanbever.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
The Network Layer.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
Routing and Routing Protocols
Network Layer4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 Routing Principles 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol.
An end-to-end usage of the IPv6 flow label
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 20 Omar Meqdadi Department of Computer Science and Software Engineering University.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 1 v3.0 Module 10 Routing Fundamentals and Subnets.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
4: Network Layer4-1 Chapter 4: Network Layer Last time: r Internet routing protocols m RIP m OSPF m IGRP m BGP r Router architectures r IPv6 Today: r IPv6.
Spring 2006CS 3321 Multicast Outline Link-state Multicast Distance-vector Multicast Protocol Independent Multicast.
Describe basic routing concepts. Routers Interconnect Networks Router is responsible for forwarding packets from network to network, from the original.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 v3.1 Module 10 Routing Fundamentals and Subnets.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 v3.1 Module 10 Routing Fundamentals and Subnets Claes Larsen, CCAI.
CHAPTER 6: STATIC ROUTING Static Routing 2 nd semester
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
1 IJsbrand Wijnands (ED) Cisco Eric Rosen (ED) Juniper Andrew DolganowAlcatel-Lucent Tony PrzygiendaEricsson Sam AldrinHuawei.
Coping with Link Failures in Centralized Control Plane Architecture Maulik Desai, Thyagarajan Nandagopal.
Assignment 1  Chapter 1:  Question 11  Question 13  Question 14  Question 33  Question 34  Chapter 2:  Question 6  Question 39  Chapter 3: 
BIER Use Case in VXLAN draft-wang-bier-vxlan-use-case-00 Linda Wang (Presenting) Sandy. Zhang & F. Hu.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Advanced Computer Networks
Kapitel 19: Routing. Kapitel 21: Routing Protocols
Optimising Streaming Systems with SDN/P4/NetFPGA
Routing BY, P.B.SHANMATHI.
draft-atlas-rtgwg-mrt-mc-arch-02
What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.
THE NETWORK LAYER.
CS 457 – Lecture 12 Routing Spring 2012.
Chapter 5 The Network Layer.
What’s “Inside” a Router?
Chapter 5: Dynamic Routing
BIER Bit Indexed Explicit Replication Traffic Engineering draft-eckert-bier-te-arch-05 draft-eckert-bier-te-frr-03 IETF BIER-WG Prague 07/2017 Toerless.
Chapter 2: Static Routing
Dynamic Routing and OSPF
BIER PIM SIGNALLING Hooman Bidgoli, Jayant Kotalwar, Andrew Dolganow (Nokia) Fengman Xu (Verizon) IJsbrand Wijnands, Mankamana Mishra (Cisco) Zhaohui.
BIER PIM Signaling Draft-hfa-bier-pim-tunneling-00 IETF 99
Draft-pfister-bier-mld-02 BIER Ingress Multicast Flow Overlay using Multicast Listener Discovery Protocols Pierre Pfister, IJsbrand.
Multicasting Unicast.
draft-venaas-bier-mtud-01
Presentation transcript:

© 2015 Cisco and/or its affiliates. All rights reserved. Public 1 Toerless Eckert, IJsbrand Wijnands,

© 2015 Cisco and/or its affiliates. All rights reserved. Public 2 BIER (quick reminder of terminology used) Multicast replication without per-tree state. BIER routers called BFR Packets with BitString in header Every bit (called BP – BitPosition) indicates a end-destination (BFR-id) BIFT – Bit Index Forwarding Table built on every BFR Every Bit Index contains IGP shortest path next-hop towards BFR-id (BFR-prefix) When packet is forwarded Bits are intelligently reset to avoid loops 256 bits == as many bits as IPv6 address header Large network ? Need more tailend receivers ? Send 10 packets each to 256 bits (bit-set-identifier in header) Replication factor 1:256 more than enough savings for all puropses.

© 2015 Cisco and/or its affiliates. All rights reserved. Public 3 This proposal is to support TE with the BIER mechanism TE: “explicit path engineering” (loose, strict route through network) Existing BIER forwarding plane can not support this Why “TE” Same (or more) use cases as eg: RSVP-TE / P2MP (but without its in-network complexity) Example : Video Contribution networks >>50% multicast load across non-ECMP alternative paths. Individual multicast flows > 1Gbps Why now ? Define BIER-TE fwd plane + arch well enough so that we are confident that: a)forwarding plane is NECESSARY and SUFFICIENT for TE with BIER b)Control plane can be worked out now or later. c)Vendors can start putting BIER Fwd plane with TE option into HW.

© 2015 Cisco and/or its affiliates. All rights reserved. Public 4 Every BP indicates an “adjacency” BIFT in each BFR ONLY populated with BPs adjacent to the BFR Example: p2p link BFR-A BFR-B Assign BP 33 BIFT on BFR-A: BP33 : “forward to BFR-B” BIFT on BFR-B: BP33 : “forward to BFR-A” BIFT on all other BFR BP 33: BFR replicates BIER-TE packet to all adjacencies with BP set in packet AND BP has non-empty adjacency in BIFT Reset BP for all adjacencies to which packet is replicated Necessary ? Not in all cases… but extremely safe action against loops Ignore (DO NOT RESET) any other BP in packet

© 2015 Cisco and/or its affiliates. All rights reserved. Public 5 All links are P2P and share BP in both directions. D and F have a ‘local’ adjacency, meaning ‘For Us’. C AB E BitMaskAdj B BitMaskAdj A C E BitMaskAdj B D E F BitMaskAdj B C BitMaskAdj C D BitMaskAdj C F [8] [7] [2] [1] [6] [3] [5] [4] D F local R R S

© 2015 Cisco and/or its affiliates. All rights reserved. Public 6 [8] [7] [2] [1] Ingres BFR sets desired BitString of packet. Every BFR creates reset Mask, ~(Adj-1 | Adj-2 | Adj-x), to reset adjacencies that are used on this BFR. BitString AND BitMask lookup to determine output Update the outgoing packet using the Reset Mask C AB D F E BitMaskAdj B [6] BitMaskAdj A C E BitMaskAdj B F E D BitMaskAdj B C BitMaskAdj C D BitMaskAdj C F & & & & & Reset Mask & [3] [5] [4] true false true false IP local

© 2015 Cisco and/or its affiliates. All rights reserved. Public 7 Control plane proposal: Central controller During network startup: Determine topology. Calculate how to assign BPs to adjacencies Installs adjacencies into BIFT of all BFR During network operations Calculate desired traffic-engineered trees for different traffic classes Get information of receivers from “multicast flow overlay” Run algorithms like CSPF, Steiner, … Result of desired traffic-engineered tree is a BitString Install BitString into BFIR (Ingres Router) Why centralized controller Popular in SDN networks Popular in TE solutions (PCE – Path Computation Engine) Allows to minimize “in-network” complexity: BIER-TE could even work without IGP in network!

© 2015 Cisco and/or its affiliates. All rights reserved. Public 8 | multicast flow | overlay [Bier-TE Controller Host] ^ ^ ^ / | \ BIER-TE control protocol | | | eg.: Netconf/Restconf/Yang v v v Src -> Rtr1 -> BFIR-----BFR-----BFER -> Rtr2 -> Rcvr | >| BIER-TE forwarding layer | | Routing underlay No IGP needed (only for routed adjacencies) Same as in BIER BIER-TE packets Different semantic of bits Centralized Control plane Responsible For “TE”

© 2015 Cisco and/or its affiliates. All rights reserved. Public 9 One BP per “link” requires more bits than “one bit per receiver”. Options in -00 to reduce #BPs required: Single BP for whole sub-topology where “flooding” is appropriate Ring, hub&spoke One BP for “connected” subtopology. BP only reset when packet replicated onto adjacency not part of subtopology. “Routed adjacency” Tunnel across uninteresting parts of topology with one bit. Routed link adjacency: interface-IP-address of a remote BFR Routed node adjacency: loopback-IP-address of a remote BFR Optimize “receive “ bits for receiver-PE (as used in in BIER)

© 2015 Cisco and/or its affiliates. All rights reserved. Public 10