TRILL with Multicast draft-hares-trill-mutlicast.00.txt Susan Hares.

Slides:



Advertisements
Similar presentations
TRILL ESADI draft-hu-trill-rbridge-esadi-00 Hongjun Zhai (ZTE) Fangwei hu (ZTE) Radia Perlman (Intel Labs) Donald Eastlake 3 rd (Huawei) July 20111TRILL.
Advertisements

Dynamic Routing Overview 1.
Nirmala Shenoy, Daryl Johnson, Bill Stackpole, Bruce Hartpence Rochester Institute of Technology 1.
Single Area Border RBridge Nickname for TRILL Multilevel draft-zhang-trill-multilevel-single-nickname-00.txt Mingui Zhang, Donald Eastlake, Radia Perlman.
5/31/05CS118/Spring051 twisted pair hub 10BaseT, 100BaseT, hub r T= Twisted pair (copper wire) r Nodes connected to a hub, 100m max distance r Hub: physical.
1 Internet Networking Spring 2004 Tutorial 7 Multicast Routing Protocols.
Internet Networking Spring 2002
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Link-State Routing Protocols Routing Protocols and Concepts – Chapter.
MULTICASTING Network Security.
© J. Liebeherr, All rights reserved 1 IP Multicasting.
Revision of the Appointed Forwarder RFC draft-eastlake-trill-rfc txt Donald E. Eastlake, 3 rd March 2015 Appointed.
Layer 2 Switch  Layer 2 Switching is hardware based.  Uses the host's Media Access Control (MAC) address.  Uses Application Specific Integrated Circuits.
1 Computer Networks IP Multicast. 2 Recall Unicast Broadcast Multicast sends to a specific group.
TCP/IP Protocol Suite 1 Chapter 14 Upon completion you will be able to: Unicast Routing Protocols: RIP, OSPF, and BGP Distinguish between intra and interdomain.
Link State Routing Protocol W.lilakiatsakun. Introduction (1) Link-state routing protocols are also known as shortest path first protocols and built around.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Link-State Routing Protocols Routing Protocols and Concepts – Chapter.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
Link-State Routing Protocols
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
TRansparent Interconnection of Lots of Links (TRILL) March 11 th 2010 David Bond University of New Hampshire: InterOperability.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
Routing and Routing Protocols Routing Protocols Overview.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
March th IETF - Prague1 TRILL Working Group From draft 03 to draft 04 Dinesh Dutt, Cisco Silvano Gai, Nuova Radia Perlman, Sun.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
Base Protocol Spec Radia Perlman
Chapter 22 Network Layer: Delivery, Forwarding, and Routing Part 5 Multicasting protocol.
1 Multilevel TRILL draft-perlman-trill-rbridge-multilevel-00.txt Radia Perlman Intel Labs March 2011.
Distance-vector Multicast Routing Protocol (DVMRP)
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
Rbridges: Transparent Routing Radia Perlman
86th IETF, Orlando, March 2013 IS-IS Support for Unidirectional Links draft-ginsberg-isis-udl-00.txt Les Ginsberg
TRILL remaining issues Radia Perlman
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #7 DVMRP.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
M. Veeraraghavan (originals by J. Liebeherr) 1 Need for Routing in Ethernet switched networks What do bridges do if some LANs are reachable only in multiple.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Chapter 21 Multicast Routing
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
March th IETF - Prague1 TRILL Working Group Changes from draft-trill-rbridge-protocol-02.txt to draft-trill-rbridge-protocol-03.txt Dinesh Dutt,
1 LAN switching and Bridges Relates to Lab Outline Interconnection devices Bridges/LAN switches vs. Routers Bridges Learning Bridges Transparent.
March 2007RBridge Extensions1 RBridge Protocol Extensions and the Inner Q-tag Location Donald Eastlake 3rd
ECE 544 Protocol Design Project 2016 Chengyao Wen Hua Deng Xiaoyu Duan.
CSE 421 Computer Networks. Network Layer 4-2 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside.
+ Dynamic Routing Protocols 2 nd semester
ECE 544 Protocol Design Project 2016 Kiran Jatty Lasya Nandamuri Varun Vinnakota.
Open Shortest Path First (OSPF)
Chapter 21 Multicast Routing
Instructor Materials Chapter 5: Dynamic Routing
Instructor & Todd Lammle
Routing Jennifer Rexford.
Routing Protocols and Concepts
Link-State Routing Protocols
THE NETWORK LAYER.
Chapter 5: Dynamic Routing
ECE 544 Protocol Design Project 2016
NT2640 Unit 9 Activity 1 Handout
Link-State Routing Protocols
Dynamic Routing and OSPF
Switch controller: Routing
Link-State Routing Protocols
Chapter 15. Connecting Devices
Ch 17 - Binding Protocol Addresses
IP Multicast COSC /5/2019.
IS-IS VPLS for Data Center Network draft-xu-l2vpn-vpls-isis-02
Bridges Neil Tang 10/10/2008 CS440 Computer Networks.
Chapter 4: outline 4.1 Overview of Network layer data plane
Presentation transcript:

TRILL with Multicast draft-hares-trill-mutlicast.00.txt Susan Hares

Why Tuned multicast Normal Multicast plans for Rbridge –Broadcast all multicast packets to all RBridges for destinations with multicast group addresses –Doesn’t scale well

Draft Describes MAC FIB table changes 3 algorithms to generate multicast distribution Knobs/Features for improved performance –Path selection weight to give 1 path –Use of Link Bundles –Negotiating of reduced flooding between Rbridges –DataBase

3 Algorithms Described in Draft Multicast distribution tree rooted at MAC source address per Destination Group Address (S,G) state Flooding rooted at an Rbridge that detected –Group MAC address sending Reduced flooding to all Rbridges that Multicast for a VLAN or group of VLANs –Use the MCDS/MPR algorithms adapted to ISIS to reduce flooding

FIB tables for multicast Destination MAC Table Destination MAC RBridge List Group MAC-1 Rbridge-x, Rbridge-y, Rbridge-z Group MAC-2 Rbridge-w, Rbridge-z... Group MAC-n Rbridge-z, Rbridge-y Source MAC Table Source MAC Rbridge MAC-1 Rbridge-x MAC-10 Rbridge-z

Lookup table for Rbridge Source MAC Destination MAC Egress Encapsulation Rbridges Group MAC Unicast MAC MAC-1 Group-MAC 1 Rbridge-x, Group-MAC-3 [none] Rbridge-y, Rbridge-z MAC-10 Group-MAC-n Rbridge-z, MAC-5 Rbridge-y [none]

Encapsulation for Rbridge Forwarding of Encapsulations Unicast Encap MAC Next Rbridge MAC-5 Rbridge-a Multicast Encap MAC Next Rbridges Group-MAC-3 Rbridge-a, Rbridge-C

Multicast FIB generation takes Input: –Rbridge topology –(S-MAC, D-GMAC) state [snooped or GMRP learned] –(*,D-G-MAC) State –IP Mapping IP (S,G) to (S-MAC,D- GMAC) IP (*,G) to (*.D-GMAC) –Rbridge link path selection weights Output –D-GMAC to Rbridge mapping –S-MAC to Rbridge mapping –FIB for Rbridge encapsulation

Basic concept Extend ISIS along the lines of MOSPF –Multicast FIB (per VLAN, AFI/SAFI) –Multicast weights on links/paths (TE and non-TE) –Multicast tree growing algorithms –Extend hellos –TLV pairs (new group multicast TLV)

S,G Multicast Tree Calculation rooted at S MAC 1. Flooding Information via Link State 2. Sorting (S,G,Rbridge) into S-[G- sets,Rbridges-set] 3. Calculating a multicast forwarding tree based in the source for S-[G- Sets,Rbridge]

TLVs for Multicast from Rbridge TLV sent from originating Rbridge TLV1: Source MAC address Source MAC Address IDentifier Count of Unicast Source MAC Addresses Source MAC 1 [Flag Add/Delete, Encrypted/None] Source MAC 2 Source MAC n [count of Group MACs associated with Source set] [MAC Group Identifier - number] TLV2: Group MAC set Count of Multicast MAC addresses Group MAC Address-1 [6 bytes][ Flag byte -Add/Delete, Encrypt/None] Group MAC Address-2... Group MAC Address -n [count of Groups of Source MAC adddresses Associted with Group] [Source MAC Identifiers]

S,G Multicast Tree Calculation to all G-Group MACs 1. Flooding Information via Link State 2. Sorting the (Group-MAC-set,Rbridge> into Rbridge-(*,G)sets that share the same Group- MAC-Sets 3. Calculating a multicast forwarding tree from each Rbridge to the Rbridge-(*,G)sets 4. Updating the forwarding table with the results

Reduced Flooding Use reduced flooding techniques –Reduce packets sent multiple times The OSPF manet work has two drafts: – OSPF with Minimum Connected Dominating Sets (MCDS) calculated and optionally sent. (draft-chandra-ospf-manet-ext) –OSPF with MPR sets calculated and always sent (draft-ogier-manet-ospf-extension-04)

Multicast TLVs |Source MAC Group ID (4 octet) | | count of Unicast MAC addr (2 octet) | | Source MAC Address 1 (6 octet) | | MAC 1 Flag (Add/Delete, Encrypt/none (1 octet) | | Source MAC Address 2 (6 octets | | MAC 2 Flag (Add/Delte, Encrypt/none) (1 octet) | | | | count sets of Group MACs (2 octets) | Group set 1 Identifier (6 octest)

Group MAC address info |Group MAC Group ID (4 octet) | | count of Group MAC addr (2 octet) | | Group MAC Address 1 (6 octet) | | MAC 1 Flag (Add/Delete, Encrypt/none (1 octet) | | Group MAC Address 2 (6 octets | | MAC 2 Flag (Add/Delte, Encrypt/none) (1 octet) | | | | count sets of Source MACs (2 octets) | Group of Source MAC set 1 Id (6 octets) Group of Source MAC set N ID (6 octets>